./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix055.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b 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_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix055.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4ebc4444460a05c0fe2d26c6269a3bce4de01cd65e247714c5237856dd0f827 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:32:59,150 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:32:59,266 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:32:59,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:32:59,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:32:59,316 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:32:59,317 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:32:59,317 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:32:59,318 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:32:59,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:32:59,325 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:32:59,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:32:59,326 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:32:59,328 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:32:59,328 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:32:59,328 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:32:59,329 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:32:59,329 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:32:59,329 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:32:59,330 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:32:59,330 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:32:59,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:32:59,331 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:32:59,332 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:32:59,332 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:32:59,334 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:32:59,335 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:32:59,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:32:59,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:32:59,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:32:59,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:32:59,338 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:32:59,338 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:32:59,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:32:59,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:32:59,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:32:59,339 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:32:59,339 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:32:59,339 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_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a4ebc4444460a05c0fe2d26c6269a3bce4de01cd65e247714c5237856dd0f827 [2023-11-06 22:32:59,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:32:59,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:32:59,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:32:59,737 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:32:59,738 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:32:59,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix055.opt.i [2023-11-06 22:33:02,879 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:33:03,268 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:33:03,269 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/sv-benchmarks/c/pthread-wmm/mix055.opt.i [2023-11-06 22:33:03,299 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/data/d0a5d1373/cb91959ca7d24b1182ec32b27119f53d/FLAG0390dade3 [2023-11-06 22:33:03,314 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/data/d0a5d1373/cb91959ca7d24b1182ec32b27119f53d [2023-11-06 22:33:03,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:33:03,318 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:33:03,320 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:33:03,320 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:33:03,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:33:03,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:33:03" (1/1) ... [2023-11-06 22:33:03,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a2fb277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:03, skipping insertion in model container [2023-11-06 22:33:03,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:33:03" (1/1) ... [2023-11-06 22:33:03,394 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:33:03,855 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:33:03,871 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:33:03,945 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:33:03,989 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:33:03,990 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:33:03,999 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:33:04,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:04 WrapperNode [2023-11-06 22:33:04,000 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:33:04,002 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:33:04,002 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:33:04,002 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:33:04,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:04" (1/1) ... [2023-11-06 22:33:04,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:04" (1/1) ... [2023-11-06 22:33:04,114 INFO L138 Inliner]: procedures = 177, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 165 [2023-11-06 22:33:04,115 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:33:04,116 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:33:04,116 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:33:04,117 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:33:04,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:04" (1/1) ... [2023-11-06 22:33:04,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:04" (1/1) ... [2023-11-06 22:33:04,136 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:04" (1/1) ... [2023-11-06 22:33:04,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:04" (1/1) ... [2023-11-06 22:33:04,153 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:04" (1/1) ... [2023-11-06 22:33:04,156 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:04" (1/1) ... [2023-11-06 22:33:04,159 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:04" (1/1) ... [2023-11-06 22:33:04,161 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:04" (1/1) ... [2023-11-06 22:33:04,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:33:04,168 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:33:04,168 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:33:04,169 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:33:04,170 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:04" (1/1) ... [2023-11-06 22:33:04,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:33:04,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:33:04,246 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:33:04,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:33:04,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:33:04,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:33:04,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:33:04,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:33:04,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:33:04,336 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:33:04,336 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:33:04,336 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:33:04,337 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:33:04,337 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:33:04,337 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:33:04,337 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 22:33:04,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 22:33:04,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:33:04,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:33:04,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:33:04,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:33:04,342 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:33:04,593 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:33:04,596 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:33:05,129 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:33:05,338 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:33:05,338 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:33:05,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:33:05 BoogieIcfgContainer [2023-11-06 22:33:05,341 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:33:05,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:33:05,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:33:05,349 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:33:05,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:33:03" (1/3) ... [2023-11-06 22:33:05,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae3356d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:33:05, skipping insertion in model container [2023-11-06 22:33:05,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:04" (2/3) ... [2023-11-06 22:33:05,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae3356d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:33:05, skipping insertion in model container [2023-11-06 22:33:05,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:33:05" (3/3) ... [2023-11-06 22:33:05,353 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055.opt.i [2023-11-06 22:33:05,375 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:33:05,376 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-06 22:33:05,376 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:33:05,443 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:33:05,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 146 transitions, 308 flow [2023-11-06 22:33:05,554 INFO L124 PetriNetUnfolderBase]: 3/142 cut-off events. [2023-11-06 22:33:05,555 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:33:05,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 3/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 107 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 103. Up to 2 conditions per place. [2023-11-06 22:33:05,561 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 146 transitions, 308 flow [2023-11-06 22:33:05,567 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 142 transitions, 296 flow [2023-11-06 22:33:05,572 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:33:05,583 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 142 transitions, 296 flow [2023-11-06 22:33:05,586 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 142 transitions, 296 flow [2023-11-06 22:33:05,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 142 transitions, 296 flow [2023-11-06 22:33:05,643 INFO L124 PetriNetUnfolderBase]: 3/142 cut-off events. [2023-11-06 22:33:05,643 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:33:05,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 3/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 103. Up to 2 conditions per place. [2023-11-06 22:33:05,648 INFO L119 LiptonReduction]: Number of co-enabled transitions 3532 [2023-11-06 22:33:12,107 INFO L134 LiptonReduction]: Checked pairs total: 8465 [2023-11-06 22:33:12,107 INFO L136 LiptonReduction]: Total number of compositions: 134 [2023-11-06 22:33:12,122 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:33:12,129 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;@12f715b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:33:12,129 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 22:33:12,131 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:33:12,131 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:33:12,132 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:33:12,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:33:12,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:33:12,133 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:33:12,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:12,138 INFO L85 PathProgramCache]: Analyzing trace with hash 616, now seen corresponding path program 1 times [2023-11-06 22:33:12,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:12,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722729755] [2023-11-06 22:33:12,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:12,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:12,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:33:12,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:12,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722729755] [2023-11-06 22:33:12,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722729755] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:12,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:12,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:33:12,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739352063] [2023-11-06 22:33:12,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:12,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:33:12,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:12,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:33:12,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:33:12,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 280 [2023-11-06 22:33:12,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 132.5) internal successors, (265), 2 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:12,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:33:12,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 280 [2023-11-06 22:33:12,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:33:13,544 INFO L124 PetriNetUnfolderBase]: 4151/5741 cut-off events. [2023-11-06 22:33:13,545 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-11-06 22:33:13,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11533 conditions, 5741 events. 4151/5741 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 29282 event pairs, 4151 based on Foata normal form. 180/5026 useless extension candidates. Maximal degree in co-relation 11521. Up to 5689 conditions per place. [2023-11-06 22:33:13,613 INFO L140 encePairwiseOnDemand]: 271/280 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-11-06 22:33:13,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2023-11-06 22:33:13,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:33:13,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:33:13,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 299 transitions. [2023-11-06 22:33:13,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5339285714285714 [2023-11-06 22:33:13,639 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 299 transitions. [2023-11-06 22:33:13,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 299 transitions. [2023-11-06 22:33:13,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:33:13,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 299 transitions. [2023-11-06 22:33:13,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:13,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:13,661 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:13,663 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 299 transitions. [2023-11-06 22:33:13,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2023-11-06 22:33:13,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:33:13,674 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-11-06 22:33:13,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-11-06 22:33:13,681 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-11-06 22:33:13,682 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-11-06 22:33:13,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 132.5) internal successors, (265), 2 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:13,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:33:13,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:13,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:33:13,683 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:33:13,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:13,686 INFO L85 PathProgramCache]: Analyzing trace with hash 257248058, now seen corresponding path program 1 times [2023-11-06 22:33:13,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:13,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581894229] [2023-11-06 22:33:13,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:13,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:14,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:33:14,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:14,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581894229] [2023-11-06 22:33:14,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581894229] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:14,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:14,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:33:14,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965862935] [2023-11-06 22:33:14,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:14,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:33:14,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:14,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:33:14,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:33:14,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 280 [2023-11-06 22:33:14,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 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-06 22:33:14,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:33:14,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 280 [2023-11-06 22:33:14,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:33:15,149 INFO L124 PetriNetUnfolderBase]: 3299/4862 cut-off events. [2023-11-06 22:33:15,149 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:33:15,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9511 conditions, 4862 events. 3299/4862 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 27670 event pairs, 743 based on Foata normal form. 0/4417 useless extension candidates. Maximal degree in co-relation 9508. Up to 3421 conditions per place. [2023-11-06 22:33:15,201 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 33 selfloop transitions, 2 changer transitions 4/43 dead transitions. [2023-11-06 22:33:15,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 172 flow [2023-11-06 22:33:15,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:33:15,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:33:15,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2023-11-06 22:33:15,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154761904761904 [2023-11-06 22:33:15,208 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2023-11-06 22:33:15,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2023-11-06 22:33:15,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:33:15,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2023-11-06 22:33:15,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:15,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:15,282 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:15,282 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 433 transitions. [2023-11-06 22:33:15,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 172 flow [2023-11-06 22:33:15,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:33:15,284 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 66 flow [2023-11-06 22:33:15,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-11-06 22:33:15,285 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-11-06 22:33:15,285 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 66 flow [2023-11-06 22:33:15,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 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-06 22:33:15,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:33:15,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:15,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:33:15,287 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:33:15,287 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:15,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1457414055, now seen corresponding path program 1 times [2023-11-06 22:33:15,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:15,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803758802] [2023-11-06 22:33:15,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:15,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:16,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:33:16,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:16,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803758802] [2023-11-06 22:33:16,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803758802] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:16,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:16,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:33:16,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354246255] [2023-11-06 22:33:16,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:16,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:33:16,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:16,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:33:16,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:33:16,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 280 [2023-11-06 22:33:16,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 66 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:16,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:33:16,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 280 [2023-11-06 22:33:16,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:33:17,338 INFO L124 PetriNetUnfolderBase]: 2075/2937 cut-off events. [2023-11-06 22:33:17,339 INFO L125 PetriNetUnfolderBase]: For 162/162 co-relation queries the response was YES. [2023-11-06 22:33:17,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6112 conditions, 2937 events. 2075/2937 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 13854 event pairs, 807 based on Foata normal form. 0/2919 useless extension candidates. Maximal degree in co-relation 6108. Up to 2763 conditions per place. [2023-11-06 22:33:17,374 INFO L140 encePairwiseOnDemand]: 275/280 looper letters, 31 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2023-11-06 22:33:17,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 39 transitions, 160 flow [2023-11-06 22:33:17,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:33:17,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:33:17,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 714 transitions. [2023-11-06 22:33:17,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2023-11-06 22:33:17,380 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 714 transitions. [2023-11-06 22:33:17,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 714 transitions. [2023-11-06 22:33:17,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:33:17,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 714 transitions. [2023-11-06 22:33:17,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:17,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:17,393 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:17,393 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 66 flow. Second operand 6 states and 714 transitions. [2023-11-06 22:33:17,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 39 transitions, 160 flow [2023-11-06 22:33:17,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 39 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:33:17,399 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 68 flow [2023-11-06 22:33:17,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2023-11-06 22:33:17,401 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-11-06 22:33:17,402 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 68 flow [2023-11-06 22:33:17,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:17,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:33:17,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:17,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:33:17,409 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:33:17,410 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:17,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1457414031, now seen corresponding path program 1 times [2023-11-06 22:33:17,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:17,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072270546] [2023-11-06 22:33:17,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:17,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:33:17,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:17,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072270546] [2023-11-06 22:33:17,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072270546] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:17,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:17,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:33:17,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859605549] [2023-11-06 22:33:17,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:17,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:33:17,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:17,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:33:17,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:33:17,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 280 [2023-11-06 22:33:17,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:17,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:33:17,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 280 [2023-11-06 22:33:17,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:33:18,596 INFO L124 PetriNetUnfolderBase]: 3033/4524 cut-off events. [2023-11-06 22:33:18,597 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2023-11-06 22:33:18,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8973 conditions, 4524 events. 3033/4524 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 25407 event pairs, 621 based on Foata normal form. 192/4703 useless extension candidates. Maximal degree in co-relation 8969. Up to 3353 conditions per place. [2023-11-06 22:33:18,648 INFO L140 encePairwiseOnDemand]: 275/280 looper letters, 37 selfloop transitions, 3 changer transitions 21/64 dead transitions. [2023-11-06 22:33:18,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 64 transitions, 278 flow [2023-11-06 22:33:18,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:33:18,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:33:18,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 698 transitions. [2023-11-06 22:33:18,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49857142857142855 [2023-11-06 22:33:18,653 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 698 transitions. [2023-11-06 22:33:18,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 698 transitions. [2023-11-06 22:33:18,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:33:18,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 698 transitions. [2023-11-06 22:33:18,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.6) internal successors, (698), 5 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:18,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:18,663 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:18,664 INFO L175 Difference]: Start difference. First operand has 41 places, 26 transitions, 68 flow. Second operand 5 states and 698 transitions. [2023-11-06 22:33:18,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 64 transitions, 278 flow [2023-11-06 22:33:18,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 64 transitions, 266 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:33:18,667 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 88 flow [2023-11-06 22:33:18,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2023-11-06 22:33:18,670 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -7 predicate places. [2023-11-06 22:33:18,670 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 88 flow [2023-11-06 22:33:18,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:18,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:33:18,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:18,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:33:18,672 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:33:18,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:18,673 INFO L85 PathProgramCache]: Analyzing trace with hash -2064820267, now seen corresponding path program 1 times [2023-11-06 22:33:18,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:18,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800860154] [2023-11-06 22:33:18,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:18,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:19,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:33:19,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:19,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800860154] [2023-11-06 22:33:19,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800860154] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:19,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:19,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:33:19,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431168801] [2023-11-06 22:33:19,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:19,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:33:19,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:19,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:33:19,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:33:19,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 280 [2023-11-06 22:33:19,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:19,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:33:19,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 280 [2023-11-06 22:33:19,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:33:20,659 INFO L124 PetriNetUnfolderBase]: 3268/4822 cut-off events. [2023-11-06 22:33:20,659 INFO L125 PetriNetUnfolderBase]: For 1754/1755 co-relation queries the response was YES. [2023-11-06 22:33:20,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11094 conditions, 4822 events. 3268/4822 cut-off events. For 1754/1755 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 26337 event pairs, 884 based on Foata normal form. 200/5017 useless extension candidates. Maximal degree in co-relation 11087. Up to 3655 conditions per place. [2023-11-06 22:33:20,709 INFO L140 encePairwiseOnDemand]: 275/280 looper letters, 33 selfloop transitions, 3 changer transitions 19/59 dead transitions. [2023-11-06 22:33:20,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 59 transitions, 280 flow [2023-11-06 22:33:20,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:33:20,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:33:20,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 700 transitions. [2023-11-06 22:33:20,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-06 22:33:20,715 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 700 transitions. [2023-11-06 22:33:20,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 700 transitions. [2023-11-06 22:33:20,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:33:20,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 700 transitions. [2023-11-06 22:33:20,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.0) internal successors, (700), 5 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:20,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:20,727 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:20,727 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 88 flow. Second operand 5 states and 700 transitions. [2023-11-06 22:33:20,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 59 transitions, 280 flow [2023-11-06 22:33:20,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 274 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:33:20,758 INFO L231 Difference]: Finished difference. Result has 47 places, 30 transitions, 110 flow [2023-11-06 22:33:20,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=47, PETRI_TRANSITIONS=30} [2023-11-06 22:33:20,759 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -4 predicate places. [2023-11-06 22:33:20,760 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 110 flow [2023-11-06 22:33:20,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:20,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:33:20,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:20,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:33:20,761 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:33:20,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:20,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1724193396, now seen corresponding path program 1 times [2023-11-06 22:33:20,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:20,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931476418] [2023-11-06 22:33:20,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:20,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:33:21,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:21,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931476418] [2023-11-06 22:33:21,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931476418] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:21,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:21,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:33:21,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572185083] [2023-11-06 22:33:21,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:21,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:33:21,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:21,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:33:21,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:33:21,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 280 [2023-11-06 22:33:21,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 30 transitions, 110 flow. Second operand has 6 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:21,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:33:21,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 280 [2023-11-06 22:33:21,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:33:22,649 INFO L124 PetriNetUnfolderBase]: 3041/4485 cut-off events. [2023-11-06 22:33:22,649 INFO L125 PetriNetUnfolderBase]: For 3147/3148 co-relation queries the response was YES. [2023-11-06 22:33:22,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11431 conditions, 4485 events. 3041/4485 cut-off events. For 3147/3148 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 23966 event pairs, 814 based on Foata normal form. 150/4630 useless extension candidates. Maximal degree in co-relation 11422. Up to 3264 conditions per place. [2023-11-06 22:33:22,705 INFO L140 encePairwiseOnDemand]: 274/280 looper letters, 41 selfloop transitions, 5 changer transitions 18/68 dead transitions. [2023-11-06 22:33:22,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 68 transitions, 353 flow [2023-11-06 22:33:22,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:33:22,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:33:22,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 819 transitions. [2023-11-06 22:33:22,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4875 [2023-11-06 22:33:22,710 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 819 transitions. [2023-11-06 22:33:22,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 819 transitions. [2023-11-06 22:33:22,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:33:22,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 819 transitions. [2023-11-06 22:33:22,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.5) internal successors, (819), 6 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:22,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:22,720 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:22,720 INFO L175 Difference]: Start difference. First operand has 47 places, 30 transitions, 110 flow. Second operand 6 states and 819 transitions. [2023-11-06 22:33:22,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 68 transitions, 353 flow [2023-11-06 22:33:22,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 68 transitions, 348 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:33:22,744 INFO L231 Difference]: Finished difference. Result has 51 places, 32 transitions, 140 flow [2023-11-06 22:33:22,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=51, PETRI_TRANSITIONS=32} [2023-11-06 22:33:22,747 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2023-11-06 22:33:22,747 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 32 transitions, 140 flow [2023-11-06 22:33:22,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:22,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:33:22,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:22,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:33:22,749 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:33:22,750 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:22,750 INFO L85 PathProgramCache]: Analyzing trace with hash 750931587, now seen corresponding path program 1 times [2023-11-06 22:33:22,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:22,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153537510] [2023-11-06 22:33:22,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:22,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:23,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:33:23,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:23,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153537510] [2023-11-06 22:33:23,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153537510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:23,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:23,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:33:23,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709025174] [2023-11-06 22:33:23,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:23,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:33:23,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:23,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:33:23,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:33:23,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 280 [2023-11-06 22:33:23,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 32 transitions, 140 flow. Second operand has 6 states, 6 states have (on average 129.5) internal successors, (777), 6 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:23,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:33:23,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 280 [2023-11-06 22:33:23,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:33:24,416 INFO L124 PetriNetUnfolderBase]: 2886/4350 cut-off events. [2023-11-06 22:33:24,417 INFO L125 PetriNetUnfolderBase]: For 5414/5415 co-relation queries the response was YES. [2023-11-06 22:33:24,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12032 conditions, 4350 events. 2886/4350 cut-off events. For 5414/5415 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 23985 event pairs, 578 based on Foata normal form. 120/4465 useless extension candidates. Maximal degree in co-relation 12021. Up to 2798 conditions per place. [2023-11-06 22:33:24,473 INFO L140 encePairwiseOnDemand]: 274/280 looper letters, 44 selfloop transitions, 6 changer transitions 21/75 dead transitions. [2023-11-06 22:33:24,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 431 flow [2023-11-06 22:33:24,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:33:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:33:24,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 957 transitions. [2023-11-06 22:33:24,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.488265306122449 [2023-11-06 22:33:24,479 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 957 transitions. [2023-11-06 22:33:24,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 957 transitions. [2023-11-06 22:33:24,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:33:24,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 957 transitions. [2023-11-06 22:33:24,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.71428571428572) internal successors, (957), 7 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:24,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:24,490 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:24,491 INFO L175 Difference]: Start difference. First operand has 51 places, 32 transitions, 140 flow. Second operand 7 states and 957 transitions. [2023-11-06 22:33:24,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 431 flow [2023-11-06 22:33:24,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 75 transitions, 416 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-11-06 22:33:24,519 INFO L231 Difference]: Finished difference. Result has 56 places, 34 transitions, 162 flow [2023-11-06 22:33:24,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=162, PETRI_PLACES=56, PETRI_TRANSITIONS=34} [2023-11-06 22:33:24,520 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2023-11-06 22:33:24,521 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 34 transitions, 162 flow [2023-11-06 22:33:24,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.5) internal successors, (777), 6 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:24,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:33:24,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:24,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:33:24,522 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:33:24,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:24,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1926876970, now seen corresponding path program 1 times [2023-11-06 22:33:24,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:24,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751595203] [2023-11-06 22:33:24,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:24,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:25,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:33:25,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:25,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751595203] [2023-11-06 22:33:25,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751595203] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:25,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:25,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:33:25,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557256312] [2023-11-06 22:33:25,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:25,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:33:25,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:25,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:33:25,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:33:25,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 280 [2023-11-06 22:33:25,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 34 transitions, 162 flow. Second operand has 7 states, 7 states have (on average 128.28571428571428) internal successors, (898), 7 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:25,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:33:25,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 280 [2023-11-06 22:33:25,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:33:26,537 INFO L124 PetriNetUnfolderBase]: 2923/4331 cut-off events. [2023-11-06 22:33:26,538 INFO L125 PetriNetUnfolderBase]: For 8459/8460 co-relation queries the response was YES. [2023-11-06 22:33:26,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13050 conditions, 4331 events. 2923/4331 cut-off events. For 8459/8460 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 23178 event pairs, 588 based on Foata normal form. 110/4436 useless extension candidates. Maximal degree in co-relation 13036. Up to 2813 conditions per place. [2023-11-06 22:33:26,589 INFO L140 encePairwiseOnDemand]: 272/280 looper letters, 48 selfloop transitions, 11 changer transitions 16/79 dead transitions. [2023-11-06 22:33:26,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 79 transitions, 479 flow [2023-11-06 22:33:26,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:33:26,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:33:26,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 951 transitions. [2023-11-06 22:33:26,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48520408163265305 [2023-11-06 22:33:26,599 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 951 transitions. [2023-11-06 22:33:26,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 951 transitions. [2023-11-06 22:33:26,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:33:26,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 951 transitions. [2023-11-06 22:33:26,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.85714285714286) internal successors, (951), 7 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:26,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:26,609 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:26,609 INFO L175 Difference]: Start difference. First operand has 56 places, 34 transitions, 162 flow. Second operand 7 states and 951 transitions. [2023-11-06 22:33:26,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 79 transitions, 479 flow [2023-11-06 22:33:26,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 79 transitions, 457 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-11-06 22:33:26,643 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 228 flow [2023-11-06 22:33:26,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=228, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2023-11-06 22:33:26,646 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2023-11-06 22:33:26,646 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 228 flow [2023-11-06 22:33:26,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.28571428571428) internal successors, (898), 7 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:26,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:33:26,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:26,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:33:26,647 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:33:26,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:26,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1763691692, now seen corresponding path program 1 times [2023-11-06 22:33:26,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:26,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936937338] [2023-11-06 22:33:26,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:26,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:27,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:33:27,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:27,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936937338] [2023-11-06 22:33:27,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936937338] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:27,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:27,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:33:27,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486727854] [2023-11-06 22:33:27,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:27,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:33:27,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:27,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:33:27,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:33:27,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 280 [2023-11-06 22:33:27,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 40 transitions, 228 flow. Second operand has 7 states, 7 states have (on average 128.28571428571428) internal successors, (898), 7 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:27,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:33:27,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 280 [2023-11-06 22:33:27,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:33:28,344 INFO L124 PetriNetUnfolderBase]: 3018/4452 cut-off events. [2023-11-06 22:33:28,344 INFO L125 PetriNetUnfolderBase]: For 11440/11441 co-relation queries the response was YES. [2023-11-06 22:33:28,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14887 conditions, 4452 events. 3018/4452 cut-off events. For 11440/11441 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 23895 event pairs, 568 based on Foata normal form. 110/4557 useless extension candidates. Maximal degree in co-relation 14870. Up to 2385 conditions per place. [2023-11-06 22:33:28,409 INFO L140 encePairwiseOnDemand]: 272/280 looper letters, 56 selfloop transitions, 14 changer transitions 16/90 dead transitions. [2023-11-06 22:33:28,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 90 transitions, 591 flow [2023-11-06 22:33:28,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:33:28,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:33:28,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1088 transitions. [2023-11-06 22:33:28,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2023-11-06 22:33:28,415 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1088 transitions. [2023-11-06 22:33:28,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1088 transitions. [2023-11-06 22:33:28,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:33:28,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1088 transitions. [2023-11-06 22:33:28,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:28,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:28,429 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:28,429 INFO L175 Difference]: Start difference. First operand has 61 places, 40 transitions, 228 flow. Second operand 8 states and 1088 transitions. [2023-11-06 22:33:28,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 90 transitions, 591 flow [2023-11-06 22:33:28,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 90 transitions, 568 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-11-06 22:33:28,517 INFO L231 Difference]: Finished difference. Result has 65 places, 42 transitions, 270 flow [2023-11-06 22:33:28,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=270, PETRI_PLACES=65, PETRI_TRANSITIONS=42} [2023-11-06 22:33:28,518 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2023-11-06 22:33:28,519 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 42 transitions, 270 flow [2023-11-06 22:33:28,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.28571428571428) internal successors, (898), 7 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:28,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:33:28,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:28,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:33:28,520 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:33:28,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:28,521 INFO L85 PathProgramCache]: Analyzing trace with hash -910091979, now seen corresponding path program 1 times [2023-11-06 22:33:28,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:28,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814774616] [2023-11-06 22:33:28,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:28,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:28,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:33:28,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:28,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814774616] [2023-11-06 22:33:28,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814774616] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:28,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:28,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:33:28,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653878800] [2023-11-06 22:33:28,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:28,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:33:28,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:28,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:33:28,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:33:28,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 280 [2023-11-06 22:33:28,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 42 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:28,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:33:28,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 280 [2023-11-06 22:33:28,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:33:29,476 INFO L124 PetriNetUnfolderBase]: 1933/2890 cut-off events. [2023-11-06 22:33:29,476 INFO L125 PetriNetUnfolderBase]: For 9921/9996 co-relation queries the response was YES. [2023-11-06 22:33:29,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10477 conditions, 2890 events. 1933/2890 cut-off events. For 9921/9996 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 14747 event pairs, 447 based on Foata normal form. 129/3010 useless extension candidates. Maximal degree in co-relation 10460. Up to 2506 conditions per place. [2023-11-06 22:33:29,526 INFO L140 encePairwiseOnDemand]: 274/280 looper letters, 55 selfloop transitions, 5 changer transitions 0/67 dead transitions. [2023-11-06 22:33:29,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 67 transitions, 539 flow [2023-11-06 22:33:29,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:33:29,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:33:29,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-11-06 22:33:29,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-06 22:33:29,530 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-11-06 22:33:29,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-11-06 22:33:29,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:33:29,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-11-06 22:33:29,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:29,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:29,537 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 280.0) internal successors, (1120), 4 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:29,537 INFO L175 Difference]: Start difference. First operand has 65 places, 42 transitions, 270 flow. Second operand 3 states and 420 transitions. [2023-11-06 22:33:29,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 67 transitions, 539 flow [2023-11-06 22:33:29,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 67 transitions, 491 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-11-06 22:33:29,578 INFO L231 Difference]: Finished difference. Result has 61 places, 46 transitions, 274 flow [2023-11-06 22:33:29,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=61, PETRI_TRANSITIONS=46} [2023-11-06 22:33:29,580 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2023-11-06 22:33:29,580 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 46 transitions, 274 flow [2023-11-06 22:33:29,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:29,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:33:29,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:29,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:33:29,582 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:33:29,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:29,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1928693126, now seen corresponding path program 1 times [2023-11-06 22:33:29,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:29,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629585517] [2023-11-06 22:33:29,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:29,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:29,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:33:29,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:29,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629585517] [2023-11-06 22:33:29,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629585517] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:29,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:29,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:33:29,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171427163] [2023-11-06 22:33:29,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:29,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:33:29,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:29,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:33:29,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:33:29,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 280 [2023-11-06 22:33:29,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 46 transitions, 274 flow. Second operand has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:29,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:33:29,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 280 [2023-11-06 22:33:29,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:33:30,338 INFO L124 PetriNetUnfolderBase]: 1040/1679 cut-off events. [2023-11-06 22:33:30,339 INFO L125 PetriNetUnfolderBase]: For 4735/4795 co-relation queries the response was YES. [2023-11-06 22:33:30,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6458 conditions, 1679 events. 1040/1679 cut-off events. For 4735/4795 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8277 event pairs, 185 based on Foata normal form. 153/1823 useless extension candidates. Maximal degree in co-relation 6441. Up to 921 conditions per place. [2023-11-06 22:33:30,366 INFO L140 encePairwiseOnDemand]: 274/280 looper letters, 74 selfloop transitions, 9 changer transitions 0/90 dead transitions. [2023-11-06 22:33:30,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 90 transitions, 694 flow [2023-11-06 22:33:30,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:33:30,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:33:30,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 561 transitions. [2023-11-06 22:33:30,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5008928571428571 [2023-11-06 22:33:30,371 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 561 transitions. [2023-11-06 22:33:30,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 561 transitions. [2023-11-06 22:33:30,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:33:30,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 561 transitions. [2023-11-06 22:33:30,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.25) internal successors, (561), 4 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:30,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:30,379 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:30,379 INFO L175 Difference]: Start difference. First operand has 61 places, 46 transitions, 274 flow. Second operand 4 states and 561 transitions. [2023-11-06 22:33:30,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 90 transitions, 694 flow [2023-11-06 22:33:30,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 90 transitions, 681 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-06 22:33:30,400 INFO L231 Difference]: Finished difference. Result has 63 places, 50 transitions, 317 flow [2023-11-06 22:33:30,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=317, PETRI_PLACES=63, PETRI_TRANSITIONS=50} [2023-11-06 22:33:30,401 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 12 predicate places. [2023-11-06 22:33:30,401 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 317 flow [2023-11-06 22:33:30,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:30,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:33:30,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:30,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:33:30,403 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:33:30,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:30,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2047747043, now seen corresponding path program 1 times [2023-11-06 22:33:30,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:30,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36024341] [2023-11-06 22:33:30,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:30,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:31,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:33:31,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:31,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36024341] [2023-11-06 22:33:31,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36024341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:31,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:31,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:33:31,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834848057] [2023-11-06 22:33:31,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:31,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:33:31,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:31,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:33:31,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:33:31,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 280 [2023-11-06 22:33:31,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 317 flow. Second operand has 6 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:31,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:33:31,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 280 [2023-11-06 22:33:31,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:33:32,909 INFO L124 PetriNetUnfolderBase]: 3401/5260 cut-off events. [2023-11-06 22:33:32,910 INFO L125 PetriNetUnfolderBase]: For 15763/15954 co-relation queries the response was YES. [2023-11-06 22:33:32,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20912 conditions, 5260 events. 3401/5260 cut-off events. For 15763/15954 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 28509 event pairs, 270 based on Foata normal form. 270/5525 useless extension candidates. Maximal degree in co-relation 20895. Up to 2418 conditions per place. [2023-11-06 22:33:32,965 INFO L140 encePairwiseOnDemand]: 268/280 looper letters, 107 selfloop transitions, 26 changer transitions 52/188 dead transitions. [2023-11-06 22:33:32,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 188 transitions, 1538 flow [2023-11-06 22:33:32,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:33:32,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:33:32,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1169 transitions. [2023-11-06 22:33:32,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4638888888888889 [2023-11-06 22:33:32,971 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1169 transitions. [2023-11-06 22:33:32,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1169 transitions. [2023-11-06 22:33:32,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:33:32,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1169 transitions. [2023-11-06 22:33:32,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 129.88888888888889) internal successors, (1169), 9 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:32,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 280.0) internal successors, (2800), 10 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:32,982 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 280.0) internal successors, (2800), 10 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:32,982 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 317 flow. Second operand 9 states and 1169 transitions. [2023-11-06 22:33:32,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 188 transitions, 1538 flow [2023-11-06 22:33:33,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 188 transitions, 1476 flow, removed 15 selfloop flow, removed 2 redundant places. [2023-11-06 22:33:33,039 INFO L231 Difference]: Finished difference. Result has 76 places, 73 transitions, 603 flow [2023-11-06 22:33:33,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=603, PETRI_PLACES=76, PETRI_TRANSITIONS=73} [2023-11-06 22:33:33,040 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 25 predicate places. [2023-11-06 22:33:33,040 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 603 flow [2023-11-06 22:33:33,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:33,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:33:33,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:33,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:33:33,042 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:33:33,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:33,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1216631675, now seen corresponding path program 1 times [2023-11-06 22:33:33,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:33,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657487787] [2023-11-06 22:33:33,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:33,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:33,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:33:33,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:33,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657487787] [2023-11-06 22:33:33,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657487787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:33,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:33,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:33:33,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056423370] [2023-11-06 22:33:33,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:33,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:33:33,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:33,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:33:33,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:33:33,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 280 [2023-11-06 22:33:33,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 603 flow. Second operand has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:33,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:33:33,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 280 [2023-11-06 22:33:33,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:33:33,762 INFO L124 PetriNetUnfolderBase]: 1611/2612 cut-off events. [2023-11-06 22:33:33,763 INFO L125 PetriNetUnfolderBase]: For 13747/14063 co-relation queries the response was YES. [2023-11-06 22:33:33,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11876 conditions, 2612 events. 1611/2612 cut-off events. For 13747/14063 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 14915 event pairs, 155 based on Foata normal form. 401/2869 useless extension candidates. Maximal degree in co-relation 11852. Up to 1055 conditions per place. [2023-11-06 22:33:33,787 INFO L140 encePairwiseOnDemand]: 274/280 looper letters, 116 selfloop transitions, 13 changer transitions 4/145 dead transitions. [2023-11-06 22:33:33,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 145 transitions, 1526 flow [2023-11-06 22:33:33,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:33:33,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:33:33,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 700 transitions. [2023-11-06 22:33:33,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-06 22:33:33,792 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 700 transitions. [2023-11-06 22:33:33,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 700 transitions. [2023-11-06 22:33:33,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:33:33,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 700 transitions. [2023-11-06 22:33:33,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.0) internal successors, (700), 5 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:33,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:33,799 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 280.0) internal successors, (1680), 6 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:33,799 INFO L175 Difference]: Start difference. First operand has 76 places, 73 transitions, 603 flow. Second operand 5 states and 700 transitions. [2023-11-06 22:33:33,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 145 transitions, 1526 flow [2023-11-06 22:33:33,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 145 transitions, 1477 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-11-06 22:33:33,842 INFO L231 Difference]: Finished difference. Result has 73 places, 72 transitions, 599 flow [2023-11-06 22:33:33,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=599, PETRI_PLACES=73, PETRI_TRANSITIONS=72} [2023-11-06 22:33:33,843 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 22 predicate places. [2023-11-06 22:33:33,843 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 72 transitions, 599 flow [2023-11-06 22:33:33,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:33,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:33:33,844 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] [2023-11-06 22:33:33,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:33:33,844 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:33:33,844 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:33,845 INFO L85 PathProgramCache]: Analyzing trace with hash -745971446, now seen corresponding path program 1 times [2023-11-06 22:33:33,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:33,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300433630] [2023-11-06 22:33:33,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:33,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:34,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:33:34,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:34,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300433630] [2023-11-06 22:33:34,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300433630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:34,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:34,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:33:34,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962706582] [2023-11-06 22:33:34,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:34,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:33:34,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:34,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:33:34,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:33:34,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 280 [2023-11-06 22:33:34,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 72 transitions, 599 flow. Second operand has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:34,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:33:34,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 280 [2023-11-06 22:33:34,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:33:35,659 INFO L124 PetriNetUnfolderBase]: 2720/4298 cut-off events. [2023-11-06 22:33:35,659 INFO L125 PetriNetUnfolderBase]: For 19424/19575 co-relation queries the response was YES. [2023-11-06 22:33:35,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20359 conditions, 4298 events. 2720/4298 cut-off events. For 19424/19575 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 23451 event pairs, 563 based on Foata normal form. 136/4419 useless extension candidates. Maximal degree in co-relation 20336. Up to 2170 conditions per place. [2023-11-06 22:33:35,702 INFO L140 encePairwiseOnDemand]: 273/280 looper letters, 90 selfloop transitions, 12 changer transitions 27/132 dead transitions. [2023-11-06 22:33:35,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 132 transitions, 1319 flow [2023-11-06 22:33:35,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:33:35,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:33:35,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 784 transitions. [2023-11-06 22:33:35,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2023-11-06 22:33:35,706 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 784 transitions. [2023-11-06 22:33:35,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 784 transitions. [2023-11-06 22:33:35,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:33:35,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 784 transitions. [2023-11-06 22:33:35,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.66666666666666) internal successors, (784), 6 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:35,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:35,714 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:35,714 INFO L175 Difference]: Start difference. First operand has 73 places, 72 transitions, 599 flow. Second operand 6 states and 784 transitions. [2023-11-06 22:33:35,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 132 transitions, 1319 flow [2023-11-06 22:33:35,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 132 transitions, 1247 flow, removed 19 selfloop flow, removed 3 redundant places. [2023-11-06 22:33:35,909 INFO L231 Difference]: Finished difference. Result has 79 places, 71 transitions, 610 flow [2023-11-06 22:33:35,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=610, PETRI_PLACES=79, PETRI_TRANSITIONS=71} [2023-11-06 22:33:35,910 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 28 predicate places. [2023-11-06 22:33:35,911 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 71 transitions, 610 flow [2023-11-06 22:33:35,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:35,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:33:35,912 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] [2023-11-06 22:33:35,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:33:35,912 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:33:35,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:35,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1736684426, now seen corresponding path program 2 times [2023-11-06 22:33:35,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:35,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526535577] [2023-11-06 22:33:35,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:35,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:36,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:33:36,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:36,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526535577] [2023-11-06 22:33:36,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526535577] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:36,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:36,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:33:36,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636004642] [2023-11-06 22:33:36,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:36,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:33:36,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:36,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:33:36,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:33:36,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 280 [2023-11-06 22:33:36,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 71 transitions, 610 flow. Second operand has 6 states, 6 states have (on average 130.16666666666666) internal successors, (781), 6 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:36,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:33:36,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 280 [2023-11-06 22:33:36,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:33:36,795 INFO L124 PetriNetUnfolderBase]: 1738/2847 cut-off events. [2023-11-06 22:33:36,796 INFO L125 PetriNetUnfolderBase]: For 14729/15102 co-relation queries the response was YES. [2023-11-06 22:33:36,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13022 conditions, 2847 events. 1738/2847 cut-off events. For 14729/15102 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 17456 event pairs, 171 based on Foata normal form. 320/3014 useless extension candidates. Maximal degree in co-relation 12995. Up to 1034 conditions per place. [2023-11-06 22:33:36,824 INFO L140 encePairwiseOnDemand]: 274/280 looper letters, 76 selfloop transitions, 17 changer transitions 45/144 dead transitions. [2023-11-06 22:33:36,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 144 transitions, 1548 flow [2023-11-06 22:33:36,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:33:36,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:33:36,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 827 transitions. [2023-11-06 22:33:36,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4922619047619048 [2023-11-06 22:33:36,829 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 827 transitions. [2023-11-06 22:33:36,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 827 transitions. [2023-11-06 22:33:36,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:33:36,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 827 transitions. [2023-11-06 22:33:36,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.83333333333334) internal successors, (827), 6 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:36,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:36,838 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 280.0) internal successors, (1960), 7 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:36,838 INFO L175 Difference]: Start difference. First operand has 79 places, 71 transitions, 610 flow. Second operand 6 states and 827 transitions. [2023-11-06 22:33:36,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 144 transitions, 1548 flow [2023-11-06 22:33:36,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 144 transitions, 1400 flow, removed 65 selfloop flow, removed 6 redundant places. [2023-11-06 22:33:36,962 INFO L231 Difference]: Finished difference. Result has 77 places, 57 transitions, 442 flow [2023-11-06 22:33:36,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=442, PETRI_PLACES=77, PETRI_TRANSITIONS=57} [2023-11-06 22:33:36,963 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 26 predicate places. [2023-11-06 22:33:36,964 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 57 transitions, 442 flow [2023-11-06 22:33:36,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.16666666666666) internal successors, (781), 6 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:36,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:33:36,965 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-06 22:33:36,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:33:36,965 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:33:36,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:36,966 INFO L85 PathProgramCache]: Analyzing trace with hash -198511349, now seen corresponding path program 1 times [2023-11-06 22:33:36,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:36,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268475136] [2023-11-06 22:33:36,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:36,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:38,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:33:38,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:38,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268475136] [2023-11-06 22:33:38,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268475136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:33:38,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:33:38,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:33:38,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562930930] [2023-11-06 22:33:38,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:33:38,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:33:38,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:33:38,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:33:38,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:33:38,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 280 [2023-11-06 22:33:38,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 57 transitions, 442 flow. Second operand has 6 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:38,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:33:38,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 280 [2023-11-06 22:33:38,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:33:38,839 INFO L124 PetriNetUnfolderBase]: 994/1656 cut-off events. [2023-11-06 22:33:38,840 INFO L125 PetriNetUnfolderBase]: For 5921/5924 co-relation queries the response was YES. [2023-11-06 22:33:38,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7570 conditions, 1656 events. 994/1656 cut-off events. For 5921/5924 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8717 event pairs, 166 based on Foata normal form. 1/1655 useless extension candidates. Maximal degree in co-relation 7547. Up to 787 conditions per place. [2023-11-06 22:33:38,852 INFO L140 encePairwiseOnDemand]: 270/280 looper letters, 50 selfloop transitions, 6 changer transitions 67/125 dead transitions. [2023-11-06 22:33:38,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 125 transitions, 1196 flow [2023-11-06 22:33:38,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:33:38,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:33:38,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 885 transitions. [2023-11-06 22:33:38,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45153061224489793 [2023-11-06 22:33:38,857 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 885 transitions. [2023-11-06 22:33:38,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 885 transitions. [2023-11-06 22:33:38,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:33:38,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 885 transitions. [2023-11-06 22:33:38,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.42857142857143) internal successors, (885), 7 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:38,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:38,867 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 280.0) internal successors, (2240), 8 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:38,867 INFO L175 Difference]: Start difference. First operand has 77 places, 57 transitions, 442 flow. Second operand 7 states and 885 transitions. [2023-11-06 22:33:38,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 125 transitions, 1196 flow [2023-11-06 22:33:38,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 125 transitions, 963 flow, removed 39 selfloop flow, removed 14 redundant places. [2023-11-06 22:33:38,912 INFO L231 Difference]: Finished difference. Result has 71 places, 44 transitions, 256 flow [2023-11-06 22:33:38,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=256, PETRI_PLACES=71, PETRI_TRANSITIONS=44} [2023-11-06 22:33:38,913 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2023-11-06 22:33:38,913 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 44 transitions, 256 flow [2023-11-06 22:33:38,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:33:38,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:33:38,915 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-06 22:33:38,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:33:38,915 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:33:38,915 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:38,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1058958777, now seen corresponding path program 2 times [2023-11-06 22:33:38,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:38,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632986586] [2023-11-06 22:33:38,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:38,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:33:38,969 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:33:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:33:39,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:33:39,061 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:33:39,062 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-06 22:33:39,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-06 22:33:39,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-06 22:33:39,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-06 22:33:39,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-06 22:33:39,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-06 22:33:39,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-06 22:33:39,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-06 22:33:39,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-06 22:33:39,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-06 22:33:39,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-06 22:33:39,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-06 22:33:39,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-06 22:33:39,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-06 22:33:39,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-06 22:33:39,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-06 22:33:39,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:33:39,068 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:39,075 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:33:39,075 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:33:39,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:33:39 BasicIcfg [2023-11-06 22:33:39,167 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:33:39,167 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:33:39,167 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:33:39,168 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:33:39,168 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:33:05" (3/4) ... [2023-11-06 22:33:39,170 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:33:39,173 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:33:39,174 INFO L158 Benchmark]: Toolchain (without parser) took 35855.56ms. Allocated memory was 121.6MB in the beginning and 1.1GB in the end (delta: 971.0MB). Free memory was 75.9MB in the beginning and 715.2MB in the end (delta: -639.4MB). Peak memory consumption was 332.8MB. Max. memory is 16.1GB. [2023-11-06 22:33:39,174 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 121.6MB. Free memory is still 91.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:33:39,175 INFO L158 Benchmark]: CACSL2BoogieTranslator took 681.13ms. Allocated memory is still 121.6MB. Free memory was 75.9MB in the beginning and 52.4MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 22:33:39,175 INFO L158 Benchmark]: Boogie Procedure Inliner took 113.60ms. Allocated memory is still 121.6MB. Free memory was 52.4MB in the beginning and 49.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:33:39,176 INFO L158 Benchmark]: Boogie Preprocessor took 51.22ms. Allocated memory is still 121.6MB. Free memory was 49.9MB in the beginning and 47.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:33:39,176 INFO L158 Benchmark]: RCFGBuilder took 1173.40ms. Allocated memory was 121.6MB in the beginning and 169.9MB in the end (delta: 48.2MB). Free memory was 47.7MB in the beginning and 106.0MB in the end (delta: -58.2MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2023-11-06 22:33:39,177 INFO L158 Benchmark]: TraceAbstraction took 33821.95ms. Allocated memory was 169.9MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 105.1MB in the beginning and 715.2MB in the end (delta: -610.2MB). Peak memory consumption was 311.4MB. Max. memory is 16.1GB. [2023-11-06 22:33:39,177 INFO L158 Benchmark]: Witness Printer took 5.79ms. Allocated memory is still 1.1GB. Free memory is still 715.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:33:39,179 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.28ms. Allocated memory is still 121.6MB. Free memory is still 91.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 681.13ms. Allocated memory is still 121.6MB. Free memory was 75.9MB in the beginning and 52.4MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 113.60ms. Allocated memory is still 121.6MB. Free memory was 52.4MB in the beginning and 49.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.22ms. Allocated memory is still 121.6MB. Free memory was 49.9MB in the beginning and 47.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1173.40ms. Allocated memory was 121.6MB in the beginning and 169.9MB in the end (delta: 48.2MB). Free memory was 47.7MB in the beginning and 106.0MB in the end (delta: -58.2MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * TraceAbstraction took 33821.95ms. Allocated memory was 169.9MB in the beginning and 1.1GB in the end (delta: 922.7MB). Free memory was 105.1MB in the beginning and 715.2MB in the end (delta: -610.2MB). Peak memory consumption was 311.4MB. Max. memory is 16.1GB. * Witness Printer took 5.79ms. Allocated memory is still 1.1GB. Free memory is still 715.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.5s, 152 PlacesBefore, 51 PlacesAfterwards, 142 TransitionsBefore, 39 TransitionsAfterwards, 3532 CoEnabledTransitionPairs, 6 FixpointIterations, 47 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 134 TotalNumberOfCompositions, 8465 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3583, independent: 3402, independent conditional: 0, independent unconditional: 3402, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1861, independent: 1826, independent conditional: 0, independent unconditional: 1826, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3583, independent: 1576, independent conditional: 0, independent unconditional: 1576, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 1861, unknown conditional: 0, unknown unconditional: 1861] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 105, Positive conditional cache size: 0, Positive unconditional cache size: 105, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1461; [L837] FCALL, FORK 0 pthread_create(&t1461, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1461, ((void *)0), P0, ((void *)0))=-3, t1461={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L838] 0 pthread_t t1462; [L839] FCALL, FORK 0 pthread_create(&t1462, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1462, ((void *)0), P1, ((void *)0))=-2, t1461={5:0}, t1462={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 0 pthread_t t1463; [L841] FCALL, FORK 0 pthread_create(&t1463, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1463, ((void *)0), P2, ((void *)0))=-1, t1461={5:0}, t1462={6:0}, t1463={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 0 pthread_t t1464; [L843] FCALL, FORK 0 pthread_create(&t1464, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1464, ((void *)0), P3, ((void *)0))=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L802] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L802] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L814] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 4 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$flush_delayed = (_Bool)0 [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix055.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - 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: 834]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 843]: 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: 837]: 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: 839]: 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, 179 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: 33.6s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 16.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 931 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 751 mSDsluCounter, 495 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 378 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2430 IncrementalHoareTripleChecker+Invalid, 2572 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 117 mSDtfsCounter, 2430 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=610occurred in iteration=14, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 275 NumberOfCodeBlocks, 275 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 233 ConstructedInterpolants, 0 QuantifiedInterpolants, 2047 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-06 22:33:39,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix055.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4ebc4444460a05c0fe2d26c6269a3bce4de01cd65e247714c5237856dd0f827 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:33:42,333 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:33:42,421 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 22:33:42,428 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:33:42,429 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:33:42,460 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:33:42,461 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:33:42,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:33:42,462 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:33:42,463 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:33:42,464 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:33:42,465 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:33:42,466 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:33:42,466 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:33:42,467 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:33:42,468 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:33:42,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:33:42,469 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:33:42,470 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:33:42,470 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:33:42,471 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:33:42,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:33:42,472 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:33:42,473 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:33:42,473 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:33:42,474 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:33:42,474 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:33:42,475 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:33:42,475 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:33:42,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:33:42,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:33:42,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:33:42,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:33:42,478 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:33:42,478 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:33:42,478 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:33:42,479 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:33:42,479 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:33:42,479 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:33:42,479 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:33:42,480 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:33:42,480 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_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a4ebc4444460a05c0fe2d26c6269a3bce4de01cd65e247714c5237856dd0f827 [2023-11-06 22:33:42,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:33:43,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:33:43,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:33:43,030 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:33:43,030 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:33:43,032 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix055.opt.i [2023-11-06 22:33:46,868 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:33:47,201 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:33:47,202 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/sv-benchmarks/c/pthread-wmm/mix055.opt.i [2023-11-06 22:33:47,232 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/data/52ae49db9/4568cb8247f54d24b3d680f4c69067a5/FLAG119ac508f [2023-11-06 22:33:47,261 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/data/52ae49db9/4568cb8247f54d24b3d680f4c69067a5 [2023-11-06 22:33:47,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:33:47,274 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:33:47,281 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:33:47,282 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:33:47,288 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:33:47,289 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:33:47" (1/1) ... [2023-11-06 22:33:47,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d2263c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:47, skipping insertion in model container [2023-11-06 22:33:47,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:33:47" (1/1) ... [2023-11-06 22:33:47,388 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:33:47,950 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:33:47,968 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:33:48,047 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:33:48,104 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:33:48,104 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:33:48,113 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:33:48,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:48 WrapperNode [2023-11-06 22:33:48,114 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:33:48,115 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:33:48,116 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:33:48,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:33:48,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:48" (1/1) ... [2023-11-06 22:33:48,168 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:48" (1/1) ... [2023-11-06 22:33:48,232 INFO L138 Inliner]: procedures = 180, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 166 [2023-11-06 22:33:48,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:33:48,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:33:48,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:33:48,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:33:48,251 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:48" (1/1) ... [2023-11-06 22:33:48,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:48" (1/1) ... [2023-11-06 22:33:48,257 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:48" (1/1) ... [2023-11-06 22:33:48,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:48" (1/1) ... [2023-11-06 22:33:48,279 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:48" (1/1) ... [2023-11-06 22:33:48,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:48" (1/1) ... [2023-11-06 22:33:48,298 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:48" (1/1) ... [2023-11-06 22:33:48,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:48" (1/1) ... [2023-11-06 22:33:48,318 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:33:48,327 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:33:48,327 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:33:48,328 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:33:48,329 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:48" (1/1) ... [2023-11-06 22:33:48,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:33:48,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:33:48,378 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:33:48,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:33:48,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:33:48,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:33:48,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:33:48,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:33:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:33:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:33:48,445 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:33:48,445 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:33:48,446 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:33:48,446 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:33:48,446 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:33:48,447 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:33:48,449 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 22:33:48,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 22:33:48,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:33:48,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:33:48,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:33:48,452 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:33:48,697 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:33:48,700 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:33:49,103 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:33:49,275 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:33:49,275 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:33:49,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:33:49 BoogieIcfgContainer [2023-11-06 22:33:49,278 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:33:49,281 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:33:49,281 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:33:49,285 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:33:49,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:33:47" (1/3) ... [2023-11-06 22:33:49,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6615e481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:33:49, skipping insertion in model container [2023-11-06 22:33:49,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:33:48" (2/3) ... [2023-11-06 22:33:49,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6615e481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:33:49, skipping insertion in model container [2023-11-06 22:33:49,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:33:49" (3/3) ... [2023-11-06 22:33:49,289 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055.opt.i [2023-11-06 22:33:49,311 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:33:49,311 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-06 22:33:49,311 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:33:49,390 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:33:49,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 147 transitions, 310 flow [2023-11-06 22:33:49,559 INFO L124 PetriNetUnfolderBase]: 3/143 cut-off events. [2023-11-06 22:33:49,560 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:33:49,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 143 events. 3/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 107 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 103. Up to 2 conditions per place. [2023-11-06 22:33:49,566 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 147 transitions, 310 flow [2023-11-06 22:33:49,572 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 143 transitions, 298 flow [2023-11-06 22:33:49,577 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:33:49,588 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 143 transitions, 298 flow [2023-11-06 22:33:49,591 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 143 transitions, 298 flow [2023-11-06 22:33:49,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 143 transitions, 298 flow [2023-11-06 22:33:49,626 INFO L124 PetriNetUnfolderBase]: 3/143 cut-off events. [2023-11-06 22:33:49,627 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:33:49,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 143 events. 3/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 103. Up to 2 conditions per place. [2023-11-06 22:33:49,632 INFO L119 LiptonReduction]: Number of co-enabled transitions 3532 [2023-11-06 22:34:02,886 INFO L134 LiptonReduction]: Checked pairs total: 9060 [2023-11-06 22:34:02,886 INFO L136 LiptonReduction]: Total number of compositions: 143 [2023-11-06 22:34:02,905 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:34:02,913 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;@1fcb05cd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:34:02,913 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 22:34:02,915 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:34:02,916 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:34:02,916 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:34:02,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:34:02,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:34:02,918 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:34:02,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:02,924 INFO L85 PathProgramCache]: Analyzing trace with hash 623, now seen corresponding path program 1 times [2023-11-06 22:34:02,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:34:02,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [63073831] [2023-11-06 22:34:02,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:02,943 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:34:02,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:34:02,952 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:34:02,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:34:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:03,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:34:03,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:34:03,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:34:03,077 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:34:03,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:34:03,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [63073831] [2023-11-06 22:34:03,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [63073831] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:03,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:03,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:34:03,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246068553] [2023-11-06 22:34:03,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:03,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:34:03,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:34:03,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:34:03,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:34:03,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 290 [2023-11-06 22:34:03,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 84 flow. Second operand has 2 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:03,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:34:03,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 290 [2023-11-06 22:34:03,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:34:04,795 INFO L124 PetriNetUnfolderBase]: 3113/4369 cut-off events. [2023-11-06 22:34:04,796 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-11-06 22:34:04,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8763 conditions, 4369 events. 3113/4369 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 22008 event pairs, 3113 based on Foata normal form. 0/3753 useless extension candidates. Maximal degree in co-relation 8751. Up to 4291 conditions per place. [2023-11-06 22:34:04,859 INFO L140 encePairwiseOnDemand]: 282/290 looper letters, 24 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2023-11-06 22:34:04,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 28 transitions, 116 flow [2023-11-06 22:34:04,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:34:04,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:34:04,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 298 transitions. [2023-11-06 22:34:04,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5137931034482759 [2023-11-06 22:34:04,892 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 298 transitions. [2023-11-06 22:34:04,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 298 transitions. [2023-11-06 22:34:04,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:34:04,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 298 transitions. [2023-11-06 22:34:04,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 149.0) internal successors, (298), 2 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:04,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:04,916 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:04,918 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 84 flow. Second operand 2 states and 298 transitions. [2023-11-06 22:34:04,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 28 transitions, 116 flow [2023-11-06 22:34:04,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 28 transitions, 112 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:34:04,927 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 64 flow [2023-11-06 22:34:04,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-11-06 22:34:04,935 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -11 predicate places. [2023-11-06 22:34:04,936 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 64 flow [2023-11-06 22:34:04,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:04,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:34:04,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:04,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:34:05,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:34:05,151 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:34:05,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:05,152 INFO L85 PathProgramCache]: Analyzing trace with hash -2056589945, now seen corresponding path program 1 times [2023-11-06 22:34:05,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:34:05,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139959162] [2023-11-06 22:34:05,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:05,153 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:34:05,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:34:05,156 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:34:05,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 22:34:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:05,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:34:05,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:34:05,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:34:05,378 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:34:05,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:34:05,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139959162] [2023-11-06 22:34:05,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1139959162] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:05,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:05,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:34:05,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86615433] [2023-11-06 22:34:05,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:05,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:34:05,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:34:05,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:34:05,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:34:05,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 290 [2023-11-06 22:34:05,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:05,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:34:05,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 290 [2023-11-06 22:34:05,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:34:06,350 INFO L124 PetriNetUnfolderBase]: 2483/3685 cut-off events. [2023-11-06 22:34:06,350 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:34:06,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7230 conditions, 3685 events. 2483/3685 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 19921 event pairs, 593 based on Foata normal form. 0/3384 useless extension candidates. Maximal degree in co-relation 7227. Up to 2539 conditions per place. [2023-11-06 22:34:06,386 INFO L140 encePairwiseOnDemand]: 287/290 looper letters, 31 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2023-11-06 22:34:06,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 156 flow [2023-11-06 22:34:06,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:34:06,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:34:06,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2023-11-06 22:34:06,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.496551724137931 [2023-11-06 22:34:06,399 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2023-11-06 22:34:06,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2023-11-06 22:34:06,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:34:06,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2023-11-06 22:34:06,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:06,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:06,410 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:06,410 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 64 flow. Second operand 3 states and 432 transitions. [2023-11-06 22:34:06,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 156 flow [2023-11-06 22:34:06,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 156 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:34:06,413 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 64 flow [2023-11-06 22:34:06,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2023-11-06 22:34:06,414 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -10 predicate places. [2023-11-06 22:34:06,414 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 64 flow [2023-11-06 22:34:06,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:06,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:34:06,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:06,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:34:06,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:34:06,640 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:34:06,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:06,641 INFO L85 PathProgramCache]: Analyzing trace with hash -697909771, now seen corresponding path program 1 times [2023-11-06 22:34:06,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:34:06,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086784303] [2023-11-06 22:34:06,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:06,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:34:06,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:34:06,645 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:34:06,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 22:34:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:06,822 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:34:06,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:34:06,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:34:06,862 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:34:06,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:34:06,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086784303] [2023-11-06 22:34:06,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1086784303] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:06,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:06,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:34:06,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079036473] [2023-11-06 22:34:06,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:06,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:34:06,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:34:06,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:34:06,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:34:06,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 290 [2023-11-06 22:34:06,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:06,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:34:06,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 290 [2023-11-06 22:34:06,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:34:07,447 INFO L124 PetriNetUnfolderBase]: 1499/2197 cut-off events. [2023-11-06 22:34:07,448 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2023-11-06 22:34:07,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4604 conditions, 2197 events. 1499/2197 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 10512 event pairs, 353 based on Foata normal form. 36/2118 useless extension candidates. Maximal degree in co-relation 4600. Up to 2001 conditions per place. [2023-11-06 22:34:07,471 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 33 selfloop transitions, 5 changer transitions 0/42 dead transitions. [2023-11-06 22:34:07,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 180 flow [2023-11-06 22:34:07,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:34:07,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:34:07,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2023-11-06 22:34:07,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4862068965517241 [2023-11-06 22:34:07,476 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2023-11-06 22:34:07,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2023-11-06 22:34:07,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:34:07,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2023-11-06 22:34:07,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:07,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:07,485 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:07,485 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 64 flow. Second operand 3 states and 423 transitions. [2023-11-06 22:34:07,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 180 flow [2023-11-06 22:34:07,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 42 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:34:07,489 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 93 flow [2023-11-06 22:34:07,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2023-11-06 22:34:07,491 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -10 predicate places. [2023-11-06 22:34:07,492 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 93 flow [2023-11-06 22:34:07,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:07,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:34:07,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:07,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:34:07,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:34:07,709 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:34:07,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:07,709 INFO L85 PathProgramCache]: Analyzing trace with hash 334737210, now seen corresponding path program 1 times [2023-11-06 22:34:07,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:34:07,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81902785] [2023-11-06 22:34:07,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:07,710 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:34:07,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:34:07,712 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:34:07,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-06 22:34:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:07,885 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:34:07,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:34:07,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:34:07,972 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:34:07,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:34:07,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81902785] [2023-11-06 22:34:07,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81902785] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:07,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:07,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:34:07,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486346945] [2023-11-06 22:34:07,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:07,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:34:07,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:34:07,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:34:07,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:34:07,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 290 [2023-11-06 22:34:08,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:08,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:34:08,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 290 [2023-11-06 22:34:08,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:34:08,474 INFO L124 PetriNetUnfolderBase]: 779/1237 cut-off events. [2023-11-06 22:34:08,475 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2023-11-06 22:34:08,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3087 conditions, 1237 events. 779/1237 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5636 event pairs, 148 based on Foata normal form. 60/1242 useless extension candidates. Maximal degree in co-relation 3082. Up to 751 conditions per place. [2023-11-06 22:34:08,491 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 43 selfloop transitions, 9 changer transitions 0/56 dead transitions. [2023-11-06 22:34:08,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 56 transitions, 267 flow [2023-11-06 22:34:08,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:34:08,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:34:08,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 565 transitions. [2023-11-06 22:34:08,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4870689655172414 [2023-11-06 22:34:08,497 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 565 transitions. [2023-11-06 22:34:08,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 565 transitions. [2023-11-06 22:34:08,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:34:08,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 565 transitions. [2023-11-06 22:34:08,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:08,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:08,507 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:08,507 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 93 flow. Second operand 4 states and 565 transitions. [2023-11-06 22:34:08,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 56 transitions, 267 flow [2023-11-06 22:34:08,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 56 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:34:08,511 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 140 flow [2023-11-06 22:34:08,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2023-11-06 22:34:08,512 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -7 predicate places. [2023-11-06 22:34:08,513 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 140 flow [2023-11-06 22:34:08,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:08,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:34:08,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:08,534 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:34:08,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:34:08,735 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:34:08,735 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:08,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1449982122, now seen corresponding path program 1 times [2023-11-06 22:34:08,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:34:08,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [861133826] [2023-11-06 22:34:08,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:08,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:34:08,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:34:08,738 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:34:08,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-06 22:34:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:08,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:34:08,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:34:09,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:34:09,021 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:34:09,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:34:09,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [861133826] [2023-11-06 22:34:09,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [861133826] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:09,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:09,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:34:09,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856242128] [2023-11-06 22:34:09,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:09,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:34:09,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:34:09,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:34:09,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:34:09,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 290 [2023-11-06 22:34:09,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:09,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:34:09,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 290 [2023-11-06 22:34:09,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:34:09,477 INFO L124 PetriNetUnfolderBase]: 483/793 cut-off events. [2023-11-06 22:34:09,477 INFO L125 PetriNetUnfolderBase]: For 588/588 co-relation queries the response was YES. [2023-11-06 22:34:09,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2323 conditions, 793 events. 483/793 cut-off events. For 588/588 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3319 event pairs, 103 based on Foata normal form. 37/812 useless extension candidates. Maximal degree in co-relation 2317. Up to 290 conditions per place. [2023-11-06 22:34:09,487 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 51 selfloop transitions, 13 changer transitions 0/68 dead transitions. [2023-11-06 22:34:09,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 68 transitions, 364 flow [2023-11-06 22:34:09,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:34:09,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:34:09,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 705 transitions. [2023-11-06 22:34:09,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4862068965517241 [2023-11-06 22:34:09,492 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 705 transitions. [2023-11-06 22:34:09,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 705 transitions. [2023-11-06 22:34:09,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:34:09,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 705 transitions. [2023-11-06 22:34:09,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.0) internal successors, (705), 5 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:09,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:09,502 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:09,502 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 140 flow. Second operand 5 states and 705 transitions. [2023-11-06 22:34:09,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 68 transitions, 364 flow [2023-11-06 22:34:09,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 68 transitions, 346 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-06 22:34:09,508 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 190 flow [2023-11-06 22:34:09,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=190, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2023-11-06 22:34:09,509 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2023-11-06 22:34:09,509 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 190 flow [2023-11-06 22:34:09,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:09,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:34:09,511 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-06 22:34:09,534 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:34:09,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:34:09,724 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:34:09,725 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:09,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1354080335, now seen corresponding path program 1 times [2023-11-06 22:34:09,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:34:09,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992994759] [2023-11-06 22:34:09,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:09,726 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:34:09,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:34:09,728 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:34:09,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-06 22:34:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:09,882 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:34:09,884 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:34:09,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:34:09,961 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:34:09,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:34:09,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992994759] [2023-11-06 22:34:09,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [992994759] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:09,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:09,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:34:09,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592607755] [2023-11-06 22:34:09,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:09,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:34:09,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:34:09,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:34:09,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:34:10,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 290 [2023-11-06 22:34:10,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:10,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:34:10,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 290 [2023-11-06 22:34:10,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:34:10,494 INFO L124 PetriNetUnfolderBase]: 443/713 cut-off events. [2023-11-06 22:34:10,494 INFO L125 PetriNetUnfolderBase]: For 694/694 co-relation queries the response was YES. [2023-11-06 22:34:10,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2185 conditions, 713 events. 443/713 cut-off events. For 694/694 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2970 event pairs, 99 based on Foata normal form. 10/715 useless extension candidates. Maximal degree in co-relation 2178. Up to 290 conditions per place. [2023-11-06 22:34:10,503 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 47 selfloop transitions, 17 changer transitions 0/68 dead transitions. [2023-11-06 22:34:10,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 68 transitions, 390 flow [2023-11-06 22:34:10,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:34:10,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:34:10,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 833 transitions. [2023-11-06 22:34:10,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.478735632183908 [2023-11-06 22:34:10,509 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 833 transitions. [2023-11-06 22:34:10,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 833 transitions. [2023-11-06 22:34:10,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:34:10,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 833 transitions. [2023-11-06 22:34:10,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.83333333333334) internal successors, (833), 6 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:10,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:10,519 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:10,519 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 190 flow. Second operand 6 states and 833 transitions. [2023-11-06 22:34:10,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 68 transitions, 390 flow [2023-11-06 22:34:10,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 68 transitions, 356 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-11-06 22:34:10,532 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 200 flow [2023-11-06 22:34:10,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=200, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-11-06 22:34:10,534 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2023-11-06 22:34:10,534 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 200 flow [2023-11-06 22:34:10,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:10,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:34:10,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:10,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:34:10,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:34:10,748 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:34:10,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:10,749 INFO L85 PathProgramCache]: Analyzing trace with hash -141512401, now seen corresponding path program 1 times [2023-11-06 22:34:10,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:34:10,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253443052] [2023-11-06 22:34:10,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:10,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:34:10,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:34:10,752 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:34:10,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-06 22:34:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:11,034 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-06 22:34:11,039 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:34:11,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:34:11,942 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:34:11,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:34:11,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253443052] [2023-11-06 22:34:11,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [253443052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:11,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:11,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:34:11,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478549276] [2023-11-06 22:34:11,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:11,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:34:11,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:34:11,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:34:11,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:34:12,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 290 [2023-11-06 22:34:12,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:12,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:34:12,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 290 [2023-11-06 22:34:12,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:34:13,016 INFO L124 PetriNetUnfolderBase]: 443/736 cut-off events. [2023-11-06 22:34:13,016 INFO L125 PetriNetUnfolderBase]: For 1162/1162 co-relation queries the response was YES. [2023-11-06 22:34:13,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2251 conditions, 736 events. 443/736 cut-off events. For 1162/1162 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3446 event pairs, 0 based on Foata normal form. 0/736 useless extension candidates. Maximal degree in co-relation 2243. Up to 558 conditions per place. [2023-11-06 22:34:13,026 INFO L140 encePairwiseOnDemand]: 285/290 looper letters, 50 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2023-11-06 22:34:13,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 58 transitions, 429 flow [2023-11-06 22:34:13,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:34:13,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:34:13,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 707 transitions. [2023-11-06 22:34:13,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40632183908045977 [2023-11-06 22:34:13,031 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 707 transitions. [2023-11-06 22:34:13,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 707 transitions. [2023-11-06 22:34:13,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:34:13,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 707 transitions. [2023-11-06 22:34:13,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.83333333333333) internal successors, (707), 6 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:13,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:13,040 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:13,040 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 200 flow. Second operand 6 states and 707 transitions. [2023-11-06 22:34:13,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 58 transitions, 429 flow [2023-11-06 22:34:13,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 354 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-11-06 22:34:13,047 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 156 flow [2023-11-06 22:34:13,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-11-06 22:34:13,049 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2023-11-06 22:34:13,049 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 156 flow [2023-11-06 22:34:13,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:13,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:34:13,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:13,081 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:34:13,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:34:13,275 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:34:13,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:13,276 INFO L85 PathProgramCache]: Analyzing trace with hash -350399884, now seen corresponding path program 1 times [2023-11-06 22:34:13,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:34:13,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42300685] [2023-11-06 22:34:13,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:13,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:34:13,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:34:13,278 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:34:13,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-06 22:34:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:13,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:34:13,460 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:34:13,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:34:13,528 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:34:13,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:34:13,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42300685] [2023-11-06 22:34:13,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42300685] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:13,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:13,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:34:13,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981146277] [2023-11-06 22:34:13,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:13,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:34:13,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:34:13,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:34:13,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:34:13,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 290 [2023-11-06 22:34:13,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:13,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:34:13,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 290 [2023-11-06 22:34:13,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:34:13,867 INFO L124 PetriNetUnfolderBase]: 632/1028 cut-off events. [2023-11-06 22:34:13,867 INFO L125 PetriNetUnfolderBase]: For 786/786 co-relation queries the response was YES. [2023-11-06 22:34:13,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2936 conditions, 1028 events. 632/1028 cut-off events. For 786/786 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4900 event pairs, 127 based on Foata normal form. 1/1025 useless extension candidates. Maximal degree in co-relation 2928. Up to 569 conditions per place. [2023-11-06 22:34:13,876 INFO L140 encePairwiseOnDemand]: 287/290 looper letters, 46 selfloop transitions, 1 changer transitions 30/80 dead transitions. [2023-11-06 22:34:13,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 80 transitions, 508 flow [2023-11-06 22:34:13,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:34:13,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:34:13,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 564 transitions. [2023-11-06 22:34:13,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4862068965517241 [2023-11-06 22:34:13,880 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 564 transitions. [2023-11-06 22:34:13,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 564 transitions. [2023-11-06 22:34:13,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:34:13,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 564 transitions. [2023-11-06 22:34:13,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:13,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:13,887 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:13,887 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 156 flow. Second operand 4 states and 564 transitions. [2023-11-06 22:34:13,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 80 transitions, 508 flow [2023-11-06 22:34:13,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 80 transitions, 496 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:34:13,904 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 156 flow [2023-11-06 22:34:13,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2023-11-06 22:34:13,905 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2023-11-06 22:34:13,905 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 156 flow [2023-11-06 22:34:13,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:13,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:34:13,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:13,919 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:34:14,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:34:14,119 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:34:14,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:14,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1681912822, now seen corresponding path program 2 times [2023-11-06 22:34:14,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:34:14,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887967474] [2023-11-06 22:34:14,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:34:14,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:34:14,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:34:14,127 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:34:14,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-06 22:34:14,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:34:14,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:34:14,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:34:14,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:34:14,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-06 22:34:14,347 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:34:14,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:34:14,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887967474] [2023-11-06 22:34:14,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [887967474] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:14,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:14,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:34:14,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425539509] [2023-11-06 22:34:14,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:14,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:34:14,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:34:14,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:34:14,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:34:14,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 290 [2023-11-06 22:34:14,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:14,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:34:14,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 290 [2023-11-06 22:34:14,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:34:14,647 INFO L124 PetriNetUnfolderBase]: 840/1371 cut-off events. [2023-11-06 22:34:14,647 INFO L125 PetriNetUnfolderBase]: For 1226/1226 co-relation queries the response was YES. [2023-11-06 22:34:14,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4042 conditions, 1371 events. 840/1371 cut-off events. For 1226/1226 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7206 event pairs, 398 based on Foata normal form. 1/1355 useless extension candidates. Maximal degree in co-relation 4032. Up to 815 conditions per place. [2023-11-06 22:34:14,656 INFO L140 encePairwiseOnDemand]: 287/290 looper letters, 44 selfloop transitions, 2 changer transitions 17/66 dead transitions. [2023-11-06 22:34:14,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 66 transitions, 411 flow [2023-11-06 22:34:14,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:34:14,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:34:14,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2023-11-06 22:34:14,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4942528735632184 [2023-11-06 22:34:14,660 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2023-11-06 22:34:14,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2023-11-06 22:34:14,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:34:14,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2023-11-06 22:34:14,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:14,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:14,666 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:14,666 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 156 flow. Second operand 3 states and 430 transitions. [2023-11-06 22:34:14,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 66 transitions, 411 flow [2023-11-06 22:34:14,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 66 transitions, 408 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:34:14,679 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 161 flow [2023-11-06 22:34:14,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2023-11-06 22:34:14,680 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2023-11-06 22:34:14,680 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 161 flow [2023-11-06 22:34:14,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:14,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:34:14,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:14,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:34:14,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:34:14,895 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:34:14,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:14,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1900871708, now seen corresponding path program 3 times [2023-11-06 22:34:14,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:34:14,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029573277] [2023-11-06 22:34:14,896 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:34:14,896 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:34:14,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:34:14,897 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:34:14,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-06 22:34:15,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 22:34:15,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:34:15,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:34:15,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:34:15,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:34:15,119 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:34:15,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:34:15,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029573277] [2023-11-06 22:34:15,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1029573277] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:15,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:15,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:34:15,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015115991] [2023-11-06 22:34:15,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:15,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:34:15,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:34:15,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:34:15,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:34:15,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 290 [2023-11-06 22:34:15,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:15,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:34:15,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 290 [2023-11-06 22:34:15,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:34:15,454 INFO L124 PetriNetUnfolderBase]: 569/979 cut-off events. [2023-11-06 22:34:15,455 INFO L125 PetriNetUnfolderBase]: For 821/822 co-relation queries the response was YES. [2023-11-06 22:34:15,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3056 conditions, 979 events. 569/979 cut-off events. For 821/822 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4662 event pairs, 100 based on Foata normal form. 1/977 useless extension candidates. Maximal degree in co-relation 3046. Up to 513 conditions per place. [2023-11-06 22:34:15,461 INFO L140 encePairwiseOnDemand]: 287/290 looper letters, 43 selfloop transitions, 1 changer transitions 29/76 dead transitions. [2023-11-06 22:34:15,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 76 transitions, 496 flow [2023-11-06 22:34:15,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:34:15,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:34:15,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 560 transitions. [2023-11-06 22:34:15,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4827586206896552 [2023-11-06 22:34:15,466 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 560 transitions. [2023-11-06 22:34:15,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 560 transitions. [2023-11-06 22:34:15,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:34:15,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 560 transitions. [2023-11-06 22:34:15,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:15,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:15,474 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:15,474 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 161 flow. Second operand 4 states and 560 transitions. [2023-11-06 22:34:15,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 76 transitions, 496 flow [2023-11-06 22:34:15,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 76 transitions, 488 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:34:15,482 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 162 flow [2023-11-06 22:34:15,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2023-11-06 22:34:15,484 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2023-11-06 22:34:15,484 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 162 flow [2023-11-06 22:34:15,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:15,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:34:15,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:15,500 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-06 22:34:15,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:34:15,699 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:34:15,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:15,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1974623764, now seen corresponding path program 4 times [2023-11-06 22:34:15,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:34:15,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630425682] [2023-11-06 22:34:15,700 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:34:15,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:34:15,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:34:15,702 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:34:15,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-06 22:34:15,957 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:34:15,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:34:15,957 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:34:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:34:16,178 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 22:34:16,178 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:34:16,179 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-06 22:34:16,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-06 22:34:16,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-06 22:34:16,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-06 22:34:16,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-06 22:34:16,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-06 22:34:16,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-06 22:34:16,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-06 22:34:16,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-06 22:34:16,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-06 22:34:16,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-06 22:34:16,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-06 22:34:16,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-06 22:34:16,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-06 22:34:16,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-06 22:34:16,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-06 22:34:16,209 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-11-06 22:34:16,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:34:16,401 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:16,407 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:34:16,407 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:34:16,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:34:16 BasicIcfg [2023-11-06 22:34:16,533 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:34:16,534 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:34:16,534 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:34:16,534 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:34:16,535 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:33:49" (3/4) ... [2023-11-06 22:34:16,537 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:34:16,539 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:34:16,540 INFO L158 Benchmark]: Toolchain (without parser) took 29265.45ms. Allocated memory was 73.4MB in the beginning and 364.9MB in the end (delta: 291.5MB). Free memory was 43.7MB in the beginning and 143.1MB in the end (delta: -99.4MB). Peak memory consumption was 191.7MB. Max. memory is 16.1GB. [2023-11-06 22:34:16,540 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 73.4MB. Free memory is still 49.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:34:16,541 INFO L158 Benchmark]: CACSL2BoogieTranslator took 833.20ms. Allocated memory is still 73.4MB. Free memory was 43.5MB in the beginning and 39.1MB in the end (delta: 4.4MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2023-11-06 22:34:16,541 INFO L158 Benchmark]: Boogie Procedure Inliner took 117.89ms. Allocated memory is still 73.4MB. Free memory was 38.8MB in the beginning and 36.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:34:16,542 INFO L158 Benchmark]: Boogie Preprocessor took 92.15ms. Allocated memory is still 73.4MB. Free memory was 36.1MB in the beginning and 34.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:34:16,542 INFO L158 Benchmark]: RCFGBuilder took 951.48ms. Allocated memory was 73.4MB in the beginning and 100.7MB in the end (delta: 27.3MB). Free memory was 34.0MB in the beginning and 64.8MB in the end (delta: -30.8MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2023-11-06 22:34:16,543 INFO L158 Benchmark]: TraceAbstraction took 27252.45ms. Allocated memory was 100.7MB in the beginning and 364.9MB in the end (delta: 264.2MB). Free memory was 64.3MB in the beginning and 144.1MB in the end (delta: -79.9MB). Peak memory consumption was 182.8MB. Max. memory is 16.1GB. [2023-11-06 22:34:16,543 INFO L158 Benchmark]: Witness Printer took 4.99ms. Allocated memory is still 364.9MB. Free memory was 144.1MB in the beginning and 143.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:34:16,546 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.39ms. Allocated memory is still 73.4MB. Free memory is still 49.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 833.20ms. Allocated memory is still 73.4MB. Free memory was 43.5MB in the beginning and 39.1MB in the end (delta: 4.4MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 117.89ms. Allocated memory is still 73.4MB. Free memory was 38.8MB in the beginning and 36.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.15ms. Allocated memory is still 73.4MB. Free memory was 36.1MB in the beginning and 34.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 951.48ms. Allocated memory was 73.4MB in the beginning and 100.7MB in the end (delta: 27.3MB). Free memory was 34.0MB in the beginning and 64.8MB in the end (delta: -30.8MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * TraceAbstraction took 27252.45ms. Allocated memory was 100.7MB in the beginning and 364.9MB in the end (delta: 264.2MB). Free memory was 64.3MB in the beginning and 144.1MB in the end (delta: -79.9MB). Peak memory consumption was 182.8MB. Max. memory is 16.1GB. * Witness Printer took 4.99ms. Allocated memory is still 364.9MB. Free memory was 144.1MB in the beginning and 143.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.3s, 153 PlacesBefore, 49 PlacesAfterwards, 143 TransitionsBefore, 36 TransitionsAfterwards, 3532 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 81 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 3 ChoiceCompositions, 143 TotalNumberOfCompositions, 9060 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3995, independent: 3784, independent conditional: 0, independent unconditional: 3784, dependent: 211, dependent conditional: 0, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1957, independent: 1909, independent conditional: 0, independent unconditional: 1909, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3995, independent: 1875, independent conditional: 0, independent unconditional: 1875, dependent: 163, dependent conditional: 0, dependent unconditional: 163, unknown: 1957, unknown conditional: 0, unknown unconditional: 1957] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 116, Positive conditional cache size: 0, Positive unconditional cache size: 116, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1461; [L837] FCALL, FORK 0 pthread_create(&t1461, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1461, ((void *)0), P0, ((void *)0))=0, t1461={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L838] 0 pthread_t t1462; [L839] FCALL, FORK 0 pthread_create(&t1462, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1462, ((void *)0), P1, ((void *)0))=1, t1461={3:0}, t1462={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 0 pthread_t t1463; [L841] FCALL, FORK 0 pthread_create(&t1463, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1463, ((void *)0), P2, ((void *)0))=2, t1461={3:0}, t1462={7:0}, t1463={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 0 pthread_t t1464; [L843] FCALL, FORK 0 pthread_create(&t1464, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1464, ((void *)0), P3, ((void *)0))=3, t1461={3:0}, t1462={7:0}, t1463={11:0}, t1464={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L802] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L802] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L763] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L778] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L814] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 4 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1461={3:0}, t1462={7:0}, t1463={11:0}, t1464={15:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$flush_delayed = (_Bool)0 [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix055.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={6:5}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - 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: 834]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 843]: 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: 837]: 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: 839]: 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, 180 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: 27.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 301 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 216 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1296 IncrementalHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 26 mSDtfsCounter, 1296 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=6, InterpolantAutomatonStates: 40, 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.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 163 ConstructedInterpolants, 0 QuantifiedInterpolants, 1400 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1470 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-06 22:34:16,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3587c56-a499-4e18-b497-b46d6276a265/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample