./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1a7472923aa95b61749a468b52dfc65e03dead5bf647c94f71a6e156dc586ae --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 20:35:43,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 20:35:43,457 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-23 20:35:43,465 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 20:35:43,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 20:35:43,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 20:35:43,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 20:35:43,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 20:35:43,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 20:35:43,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 20:35:43,541 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-23 20:35:43,541 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-23 20:35:43,542 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-23 20:35:43,542 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-23 20:35:43,543 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-23 20:35:43,543 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-23 20:35:43,544 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-23 20:35:43,544 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-23 20:35:43,544 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-23 20:35:43,545 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-23 20:35:43,545 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-23 20:35:43,548 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-23 20:35:43,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 20:35:43,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 20:35:43,550 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 20:35:43,551 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 20:35:43,551 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 20:35:43,551 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 20:35:43,552 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 20:35:43,552 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 20:35:43,553 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 20:35:43,554 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-23 20:35:43,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 20:35:43,554 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 20:35:43,554 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 20:35:43,555 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 20:35:43,555 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 20:35:43,555 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 20:35:43,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 20:35:43,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 20:35:43,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 20:35:43,557 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 20:35:43,557 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 20:35:43,557 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-23 20:35:43,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 20:35:43,558 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 20:35:43,558 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-23 20:35:43,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 20:35:43,559 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> e1a7472923aa95b61749a468b52dfc65e03dead5bf647c94f71a6e156dc586ae [2023-11-23 20:35:43,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 20:35:43,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 20:35:43,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 20:35:43,842 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 20:35:43,843 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 20:35:43,844 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2023-11-23 20:35:46,857 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 20:35:47,167 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 20:35:47,184 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2023-11-23 20:35:47,201 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/data/8daad0aff/52ec45ccc5864f148c18e27366e28070/FLAG671958577 [2023-11-23 20:35:47,218 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/data/8daad0aff/52ec45ccc5864f148c18e27366e28070 [2023-11-23 20:35:47,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 20:35:47,222 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 20:35:47,224 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 20:35:47,224 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 20:35:47,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 20:35:47,231 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:35:47" (1/1) ... [2023-11-23 20:35:47,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7baa6161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:47, skipping insertion in model container [2023-11-23 20:35:47,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:35:47" (1/1) ... [2023-11-23 20:35:47,296 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 20:35:47,809 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 20:35:47,826 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 20:35:47,933 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 20:35:47,985 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 20:35:47,985 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 20:35:47,994 INFO L206 MainTranslator]: Completed translation [2023-11-23 20:35:47,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:47 WrapperNode [2023-11-23 20:35:47,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 20:35:47,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 20:35:47,997 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 20:35:47,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 20:35:48,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:47" (1/1) ... [2023-11-23 20:35:48,032 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:47" (1/1) ... [2023-11-23 20:35:48,081 INFO L138 Inliner]: procedures = 175, calls = 57, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 123 [2023-11-23 20:35:48,082 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 20:35:48,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 20:35:48,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 20:35:48,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 20:35:48,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:47" (1/1) ... [2023-11-23 20:35:48,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:47" (1/1) ... [2023-11-23 20:35:48,100 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:47" (1/1) ... [2023-11-23 20:35:48,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:47" (1/1) ... [2023-11-23 20:35:48,111 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:47" (1/1) ... [2023-11-23 20:35:48,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:47" (1/1) ... [2023-11-23 20:35:48,118 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:47" (1/1) ... [2023-11-23 20:35:48,120 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:47" (1/1) ... [2023-11-23 20:35:48,125 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 20:35:48,126 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 20:35:48,127 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 20:35:48,127 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 20:35:48,128 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:47" (1/1) ... [2023-11-23 20:35:48,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 20:35:48,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:35:48,198 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 20:35:48,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 20:35:48,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 20:35:48,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 20:35:48,229 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-23 20:35:48,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 20:35:48,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 20:35:48,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 20:35:48,230 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-23 20:35:48,230 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-23 20:35:48,230 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-23 20:35:48,230 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-23 20:35:48,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 20:35:48,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-23 20:35:48,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 20:35:48,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 20:35:48,233 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 20:35:48,403 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 20:35:48,405 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 20:35:48,982 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 20:35:49,640 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 20:35:49,641 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 20:35:49,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:35:49 BoogieIcfgContainer [2023-11-23 20:35:49,643 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 20:35:49,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 20:35:49,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 20:35:49,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 20:35:49,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:35:47" (1/3) ... [2023-11-23 20:35:49,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21ce0321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:35:49, skipping insertion in model container [2023-11-23 20:35:49,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:35:47" (2/3) ... [2023-11-23 20:35:49,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21ce0321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:35:49, skipping insertion in model container [2023-11-23 20:35:49,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:35:49" (3/3) ... [2023-11-23 20:35:49,657 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.oepc-thin000_power.oepc.i [2023-11-23 20:35:49,678 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 20:35:49,679 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2023-11-23 20:35:49,679 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 20:35:49,803 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 20:35:49,846 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 68 transitions, 144 flow [2023-11-23 20:35:50,168 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6384 states, 5278 states have (on average 3.517430845017052) internal successors, (18565), 6383 states have internal predecessors, (18565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:50,194 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 20:35:50,203 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=FINITE_AUTOMATA, 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;@654aa416, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 20:35:50,203 INFO L358 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2023-11-23 20:35:50,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 6384 states, 5278 states have (on average 3.517430845017052) internal successors, (18565), 6383 states have internal predecessors, (18565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:50,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-23 20:35:50,240 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:50,240 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-23 20:35:50,241 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-23 20:35:50,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:50,250 INFO L85 PathProgramCache]: Analyzing trace with hash 22471, now seen corresponding path program 1 times [2023-11-23 20:35:50,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:50,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179698310] [2023-11-23 20:35:50,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:50,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:50,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:50,583 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:50,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179698310] [2023-11-23 20:35:50,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179698310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:50,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:50,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 20:35:50,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695321810] [2023-11-23 20:35:50,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:50,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:35:50,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:50,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:35:50,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:35:50,655 INFO L87 Difference]: Start difference. First operand has 6384 states, 5278 states have (on average 3.517430845017052) internal successors, (18565), 6383 states have internal predecessors, (18565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:50,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:50,953 INFO L93 Difference]: Finished difference Result 2374 states and 6507 transitions. [2023-11-23 20:35:50,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:35:50,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-23 20:35:50,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:50,990 INFO L225 Difference]: With dead ends: 2374 [2023-11-23 20:35:50,991 INFO L226 Difference]: Without dead ends: 2374 [2023-11-23 20:35:50,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:35:50,996 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 43 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:50,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 20 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:35:51,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2374 states. [2023-11-23 20:35:51,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2374 to 2374. [2023-11-23 20:35:51,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2374 states, 2179 states have (on average 2.9862322166131254) internal successors, (6507), 2373 states have internal predecessors, (6507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:51,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 2374 states and 6507 transitions. [2023-11-23 20:35:51,246 INFO L78 Accepts]: Start accepts. Automaton has 2374 states and 6507 transitions. Word has length 2 [2023-11-23 20:35:51,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:51,246 INFO L495 AbstractCegarLoop]: Abstraction has 2374 states and 6507 transitions. [2023-11-23 20:35:51,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:51,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 6507 transitions. [2023-11-23 20:35:51,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-23 20:35:51,248 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:51,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-23 20:35:51,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 20:35:51,248 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-23 20:35:51,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:51,249 INFO L85 PathProgramCache]: Analyzing trace with hash 22472, now seen corresponding path program 1 times [2023-11-23 20:35:51,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:51,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304851023] [2023-11-23 20:35:51,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:51,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:51,423 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:51,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304851023] [2023-11-23 20:35:51,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304851023] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:51,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:51,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 20:35:51,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517404334] [2023-11-23 20:35:51,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:51,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:35:51,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:51,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:35:51,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:35:51,427 INFO L87 Difference]: Start difference. First operand 2374 states and 6507 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:51,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:51,586 INFO L93 Difference]: Finished difference Result 2373 states and 6506 transitions. [2023-11-23 20:35:51,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:35:51,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-23 20:35:51,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:51,608 INFO L225 Difference]: With dead ends: 2373 [2023-11-23 20:35:51,608 INFO L226 Difference]: Without dead ends: 2373 [2023-11-23 20:35:51,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:35:51,610 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 42 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:51,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 21 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:35:51,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2023-11-23 20:35:51,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2373. [2023-11-23 20:35:51,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2373 states, 2179 states have (on average 2.9857732905002297) internal successors, (6506), 2372 states have internal predecessors, (6506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:51,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2373 states to 2373 states and 6506 transitions. [2023-11-23 20:35:51,764 INFO L78 Accepts]: Start accepts. Automaton has 2373 states and 6506 transitions. Word has length 2 [2023-11-23 20:35:51,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:51,765 INFO L495 AbstractCegarLoop]: Abstraction has 2373 states and 6506 transitions. [2023-11-23 20:35:51,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:51,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2373 states and 6506 transitions. [2023-11-23 20:35:51,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-23 20:35:51,766 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:51,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 20:35:51,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 20:35:51,767 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-23 20:35:51,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:51,773 INFO L85 PathProgramCache]: Analyzing trace with hash 670136415, now seen corresponding path program 1 times [2023-11-23 20:35:51,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:51,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145117019] [2023-11-23 20:35:51,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:51,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:52,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:52,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:52,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145117019] [2023-11-23 20:35:52,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145117019] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:52,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:52,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 20:35:52,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607072918] [2023-11-23 20:35:52,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:52,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 20:35:52,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:52,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 20:35:52,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 20:35:52,038 INFO L87 Difference]: Start difference. First operand 2373 states and 6506 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:52,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:52,178 INFO L93 Difference]: Finished difference Result 1468 states and 3949 transitions. [2023-11-23 20:35:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 20:35:52,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-23 20:35:52,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:52,192 INFO L225 Difference]: With dead ends: 1468 [2023-11-23 20:35:52,192 INFO L226 Difference]: Without dead ends: 1468 [2023-11-23 20:35:52,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 20:35:52,200 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 54 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:52,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 21 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:35:52,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2023-11-23 20:35:52,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1468. [2023-11-23 20:35:52,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 1409 states have (on average 2.802696948190206) internal successors, (3949), 1467 states have internal predecessors, (3949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:52,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 3949 transitions. [2023-11-23 20:35:52,281 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 3949 transitions. Word has length 5 [2023-11-23 20:35:52,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:52,282 INFO L495 AbstractCegarLoop]: Abstraction has 1468 states and 3949 transitions. [2023-11-23 20:35:52,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:52,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 3949 transitions. [2023-11-23 20:35:52,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-23 20:35:52,283 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:52,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 20:35:52,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 20:35:52,283 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-23 20:35:52,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:52,284 INFO L85 PathProgramCache]: Analyzing trace with hash 670136414, now seen corresponding path program 1 times [2023-11-23 20:35:52,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:52,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603790969] [2023-11-23 20:35:52,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:52,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:52,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:52,398 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:52,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603790969] [2023-11-23 20:35:52,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603790969] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:52,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:52,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 20:35:52,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112076707] [2023-11-23 20:35:52,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:52,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 20:35:52,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:52,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 20:35:52,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 20:35:52,400 INFO L87 Difference]: Start difference. First operand 1468 states and 3949 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:52,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:52,519 INFO L93 Difference]: Finished difference Result 1071 states and 2678 transitions. [2023-11-23 20:35:52,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 20:35:52,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-23 20:35:52,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:52,529 INFO L225 Difference]: With dead ends: 1071 [2023-11-23 20:35:52,530 INFO L226 Difference]: Without dead ends: 1043 [2023-11-23 20:35:52,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 20:35:52,531 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 67 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:52,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 31 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:35:52,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2023-11-23 20:35:52,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 959. [2023-11-23 20:35:52,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 939 states have (on average 2.617678381256656) internal successors, (2458), 958 states have internal predecessors, (2458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:52,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 2458 transitions. [2023-11-23 20:35:52,571 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 2458 transitions. Word has length 5 [2023-11-23 20:35:52,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:52,571 INFO L495 AbstractCegarLoop]: Abstraction has 959 states and 2458 transitions. [2023-11-23 20:35:52,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:52,571 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 2458 transitions. [2023-11-23 20:35:52,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-23 20:35:52,572 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:52,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 20:35:52,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 20:35:52,573 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-23 20:35:52,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:52,573 INFO L85 PathProgramCache]: Analyzing trace with hash 670135931, now seen corresponding path program 1 times [2023-11-23 20:35:52,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:52,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153120606] [2023-11-23 20:35:52,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:52,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:52,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:52,657 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:52,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153120606] [2023-11-23 20:35:52,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153120606] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:52,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:52,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 20:35:52,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896184035] [2023-11-23 20:35:52,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:52,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:35:52,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:52,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:35:52,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:35:52,660 INFO L87 Difference]: Start difference. First operand 959 states and 2458 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:52,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:52,739 INFO L93 Difference]: Finished difference Result 952 states and 2445 transitions. [2023-11-23 20:35:52,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:35:52,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-23 20:35:52,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:52,747 INFO L225 Difference]: With dead ends: 952 [2023-11-23 20:35:52,748 INFO L226 Difference]: Without dead ends: 952 [2023-11-23 20:35:52,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:35:52,749 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 27 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:52,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 24 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:35:52,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2023-11-23 20:35:52,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 952. [2023-11-23 20:35:52,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 933 states have (on average 2.620578778135048) internal successors, (2445), 951 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:52,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 2445 transitions. [2023-11-23 20:35:52,784 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 2445 transitions. Word has length 5 [2023-11-23 20:35:52,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:52,785 INFO L495 AbstractCegarLoop]: Abstraction has 952 states and 2445 transitions. [2023-11-23 20:35:52,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:52,785 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 2445 transitions. [2023-11-23 20:35:52,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-23 20:35:52,786 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:52,786 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 20:35:52,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 20:35:52,787 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-23 20:35:52,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:52,787 INFO L85 PathProgramCache]: Analyzing trace with hash 670135932, now seen corresponding path program 1 times [2023-11-23 20:35:52,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:52,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175032804] [2023-11-23 20:35:52,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:52,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:52,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:52,849 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:52,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175032804] [2023-11-23 20:35:52,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175032804] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:52,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:52,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 20:35:52,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056887373] [2023-11-23 20:35:52,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:52,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:35:52,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:52,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:35:52,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:35:52,852 INFO L87 Difference]: Start difference. First operand 952 states and 2445 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:52,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:52,933 INFO L93 Difference]: Finished difference Result 945 states and 2432 transitions. [2023-11-23 20:35:52,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:35:52,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-23 20:35:52,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:52,941 INFO L225 Difference]: With dead ends: 945 [2023-11-23 20:35:52,941 INFO L226 Difference]: Without dead ends: 945 [2023-11-23 20:35:52,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:35:52,943 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:52,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 25 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:35:52,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2023-11-23 20:35:52,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2023-11-23 20:35:52,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 927 states have (on average 2.6235167206040995) internal successors, (2432), 944 states have internal predecessors, (2432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:52,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 2432 transitions. [2023-11-23 20:35:52,979 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 2432 transitions. Word has length 5 [2023-11-23 20:35:52,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:52,979 INFO L495 AbstractCegarLoop]: Abstraction has 945 states and 2432 transitions. [2023-11-23 20:35:52,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:52,980 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 2432 transitions. [2023-11-23 20:35:52,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-23 20:35:52,981 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:52,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:52,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 20:35:52,982 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-23 20:35:52,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:52,983 INFO L85 PathProgramCache]: Analyzing trace with hash 319163681, now seen corresponding path program 1 times [2023-11-23 20:35:52,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:52,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213253309] [2023-11-23 20:35:52,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:52,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:53,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:53,090 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:53,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213253309] [2023-11-23 20:35:53,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213253309] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:53,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:53,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 20:35:53,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434353834] [2023-11-23 20:35:53,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:53,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:35:53,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:53,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:35:53,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:35:53,092 INFO L87 Difference]: Start difference. First operand 945 states and 2432 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:53,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:53,183 INFO L93 Difference]: Finished difference Result 917 states and 2352 transitions. [2023-11-23 20:35:53,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:35:53,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-23 20:35:53,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:53,191 INFO L225 Difference]: With dead ends: 917 [2023-11-23 20:35:53,192 INFO L226 Difference]: Without dead ends: 917 [2023-11-23 20:35:53,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:35:53,193 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 20 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:53,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 26 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:35:53,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2023-11-23 20:35:53,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 917. [2023-11-23 20:35:53,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 899 states have (on average 2.6162402669632927) internal successors, (2352), 916 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:53,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 2352 transitions. [2023-11-23 20:35:53,254 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 2352 transitions. Word has length 11 [2023-11-23 20:35:53,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:53,254 INFO L495 AbstractCegarLoop]: Abstraction has 917 states and 2352 transitions. [2023-11-23 20:35:53,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:53,255 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 2352 transitions. [2023-11-23 20:35:53,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-23 20:35:53,257 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:53,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:53,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 20:35:53,258 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-23 20:35:53,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:53,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1078304258, now seen corresponding path program 1 times [2023-11-23 20:35:53,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:53,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863778025] [2023-11-23 20:35:53,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:53,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:53,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:53,390 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:53,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863778025] [2023-11-23 20:35:53,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863778025] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:53,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:53,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 20:35:53,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464835838] [2023-11-23 20:35:53,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:53,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 20:35:53,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:53,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 20:35:53,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 20:35:53,393 INFO L87 Difference]: Start difference. First operand 917 states and 2352 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:53,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:53,526 INFO L93 Difference]: Finished difference Result 1006 states and 2478 transitions. [2023-11-23 20:35:53,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 20:35:53,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-23 20:35:53,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:53,535 INFO L225 Difference]: With dead ends: 1006 [2023-11-23 20:35:53,535 INFO L226 Difference]: Without dead ends: 1006 [2023-11-23 20:35:53,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 20:35:53,536 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 59 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:53,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 40 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:35:53,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2023-11-23 20:35:53,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 882. [2023-11-23 20:35:53,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 865 states have (on average 2.6115606936416187) internal successors, (2259), 881 states have internal predecessors, (2259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:53,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 2259 transitions. [2023-11-23 20:35:53,571 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 2259 transitions. Word has length 13 [2023-11-23 20:35:53,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:53,572 INFO L495 AbstractCegarLoop]: Abstraction has 882 states and 2259 transitions. [2023-11-23 20:35:53,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:53,572 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 2259 transitions. [2023-11-23 20:35:53,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-23 20:35:53,574 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:53,574 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:53,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 20:35:53,575 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-23 20:35:53,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:53,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1078304259, now seen corresponding path program 1 times [2023-11-23 20:35:53,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:53,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337411898] [2023-11-23 20:35:53,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:53,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:53,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:53,915 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:53,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337411898] [2023-11-23 20:35:53,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337411898] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:53,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:53,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 20:35:53,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624406458] [2023-11-23 20:35:53,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:53,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 20:35:53,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:53,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 20:35:53,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 20:35:53,919 INFO L87 Difference]: Start difference. First operand 882 states and 2259 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:54,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:54,028 INFO L93 Difference]: Finished difference Result 847 states and 2166 transitions. [2023-11-23 20:35:54,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 20:35:54,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-23 20:35:54,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:54,035 INFO L225 Difference]: With dead ends: 847 [2023-11-23 20:35:54,035 INFO L226 Difference]: Without dead ends: 847 [2023-11-23 20:35:54,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:35:54,038 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 60 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:54,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 29 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:35:54,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2023-11-23 20:35:54,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2023-11-23 20:35:54,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 831 states have (on average 2.6064981949458486) internal successors, (2166), 846 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:54,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 2166 transitions. [2023-11-23 20:35:54,085 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 2166 transitions. Word has length 13 [2023-11-23 20:35:54,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:54,086 INFO L495 AbstractCegarLoop]: Abstraction has 847 states and 2166 transitions. [2023-11-23 20:35:54,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:54,086 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 2166 transitions. [2023-11-23 20:35:54,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-23 20:35:54,088 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:54,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:54,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 20:35:54,090 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-23 20:35:54,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:54,091 INFO L85 PathProgramCache]: Analyzing trace with hash -632248403, now seen corresponding path program 1 times [2023-11-23 20:35:54,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:54,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935487676] [2023-11-23 20:35:54,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:54,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:54,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:54,349 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:54,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935487676] [2023-11-23 20:35:54,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935487676] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:54,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:54,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 20:35:54,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722281290] [2023-11-23 20:35:54,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:54,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 20:35:54,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:54,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 20:35:54,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:35:54,354 INFO L87 Difference]: Start difference. First operand 847 states and 2166 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:54,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:54,503 INFO L93 Difference]: Finished difference Result 738 states and 1864 transitions. [2023-11-23 20:35:54,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 20:35:54,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-23 20:35:54,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:54,510 INFO L225 Difference]: With dead ends: 738 [2023-11-23 20:35:54,510 INFO L226 Difference]: Without dead ends: 680 [2023-11-23 20:35:54,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:35:54,512 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 38 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:54,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 84 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:35:54,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2023-11-23 20:35:54,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 680. [2023-11-23 20:35:54,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 672 states have (on average 2.5461309523809526) internal successors, (1711), 679 states have internal predecessors, (1711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:54,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1711 transitions. [2023-11-23 20:35:54,537 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1711 transitions. Word has length 15 [2023-11-23 20:35:54,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:54,538 INFO L495 AbstractCegarLoop]: Abstraction has 680 states and 1711 transitions. [2023-11-23 20:35:54,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:54,538 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1711 transitions. [2023-11-23 20:35:54,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-23 20:35:54,541 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:54,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:54,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 20:35:54,541 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-23 20:35:54,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:54,542 INFO L85 PathProgramCache]: Analyzing trace with hash -632249225, now seen corresponding path program 1 times [2023-11-23 20:35:54,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:54,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888046503] [2023-11-23 20:35:54,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:54,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:54,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:54,713 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:54,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888046503] [2023-11-23 20:35:54,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888046503] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:54,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:54,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 20:35:54,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532710671] [2023-11-23 20:35:54,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:54,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 20:35:54,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:54,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 20:35:54,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 20:35:54,716 INFO L87 Difference]: Start difference. First operand 680 states and 1711 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:54,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:54,824 INFO L93 Difference]: Finished difference Result 415 states and 938 transitions. [2023-11-23 20:35:54,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 20:35:54,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-23 20:35:54,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:54,828 INFO L225 Difference]: With dead ends: 415 [2023-11-23 20:35:54,828 INFO L226 Difference]: Without dead ends: 366 [2023-11-23 20:35:54,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 20:35:54,829 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 41 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:54,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 29 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:35:54,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2023-11-23 20:35:54,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2023-11-23 20:35:54,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 361 states have (on average 2.296398891966759) internal successors, (829), 365 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:54,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 829 transitions. [2023-11-23 20:35:54,858 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 829 transitions. Word has length 15 [2023-11-23 20:35:54,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:54,859 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 829 transitions. [2023-11-23 20:35:54,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:54,860 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 829 transitions. [2023-11-23 20:35:54,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-23 20:35:54,861 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:54,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:54,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 20:35:54,863 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-23 20:35:54,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:54,864 INFO L85 PathProgramCache]: Analyzing trace with hash 794429021, now seen corresponding path program 1 times [2023-11-23 20:35:54,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:54,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155629545] [2023-11-23 20:35:54,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:54,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:55,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:55,241 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:55,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155629545] [2023-11-23 20:35:55,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155629545] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:55,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:55,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 20:35:55,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406157196] [2023-11-23 20:35:55,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:55,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 20:35:55,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:55,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 20:35:55,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 20:35:55,244 INFO L87 Difference]: Start difference. First operand 366 states and 829 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:55,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:55,339 INFO L93 Difference]: Finished difference Result 178 states and 377 transitions. [2023-11-23 20:35:55,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 20:35:55,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-23 20:35:55,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:55,341 INFO L225 Difference]: With dead ends: 178 [2023-11-23 20:35:55,341 INFO L226 Difference]: Without dead ends: 154 [2023-11-23 20:35:55,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-23 20:35:55,342 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 58 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:55,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 19 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:35:55,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-11-23 20:35:55,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2023-11-23 20:35:55,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 2.111111111111111) internal successors, (323), 153 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:55,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 323 transitions. [2023-11-23 20:35:55,349 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 323 transitions. Word has length 20 [2023-11-23 20:35:55,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:55,350 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 323 transitions. [2023-11-23 20:35:55,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:55,350 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 323 transitions. [2023-11-23 20:35:55,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 20:35:55,351 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:55,352 INFO L195 NwaCegarLoop]: 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-23 20:35:55,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 20:35:55,352 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-23 20:35:55,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:55,353 INFO L85 PathProgramCache]: Analyzing trace with hash -7524979, now seen corresponding path program 1 times [2023-11-23 20:35:55,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:55,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622387153] [2023-11-23 20:35:55,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:55,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:35:55,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:35:55,728 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:35:55,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622387153] [2023-11-23 20:35:55,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622387153] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:35:55,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:35:55,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 20:35:55,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702576802] [2023-11-23 20:35:55,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:35:55,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 20:35:55,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:35:55,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 20:35:55,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:35:55,731 INFO L87 Difference]: Start difference. First operand 154 states and 323 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:55,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:35:55,860 INFO L93 Difference]: Finished difference Result 214 states and 445 transitions. [2023-11-23 20:35:55,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 20:35:55,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-23 20:35:55,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:35:55,862 INFO L225 Difference]: With dead ends: 214 [2023-11-23 20:35:55,863 INFO L226 Difference]: Without dead ends: 124 [2023-11-23 20:35:55,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-23 20:35:55,864 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 28 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:35:55,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 47 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:35:55,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-23 20:35:55,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2023-11-23 20:35:55,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 2.016260162601626) internal successors, (248), 123 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:55,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 248 transitions. [2023-11-23 20:35:55,870 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 248 transitions. Word has length 25 [2023-11-23 20:35:55,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:35:55,870 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 248 transitions. [2023-11-23 20:35:55,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:35:55,871 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 248 transitions. [2023-11-23 20:35:55,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 20:35:55,872 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:35:55,872 INFO L195 NwaCegarLoop]: 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-23 20:35:55,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 20:35:55,873 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-23 20:35:55,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:35:55,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1722843635, now seen corresponding path program 2 times [2023-11-23 20:35:55,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:35:55,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662488410] [2023-11-23 20:35:55,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:35:55,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:35:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 20:35:55,958 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 20:35:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 20:35:56,059 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-23 20:35:56,059 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 20:35:56,060 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (57 of 58 remaining) [2023-11-23 20:35:56,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 58 remaining) [2023-11-23 20:35:56,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 58 remaining) [2023-11-23 20:35:56,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 58 remaining) [2023-11-23 20:35:56,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 58 remaining) [2023-11-23 20:35:56,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 58 remaining) [2023-11-23 20:35:56,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 58 remaining) [2023-11-23 20:35:56,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 58 remaining) [2023-11-23 20:35:56,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 58 remaining) [2023-11-23 20:35:56,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 58 remaining) [2023-11-23 20:35:56,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 58 remaining) [2023-11-23 20:35:56,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 58 remaining) [2023-11-23 20:35:56,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 58 remaining) [2023-11-23 20:35:56,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 58 remaining) [2023-11-23 20:35:56,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 58 remaining) [2023-11-23 20:35:56,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 58 remaining) [2023-11-23 20:35:56,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 58 remaining) [2023-11-23 20:35:56,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 58 remaining) [2023-11-23 20:35:56,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 58 remaining) [2023-11-23 20:35:56,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 58 remaining) [2023-11-23 20:35:56,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 58 remaining) [2023-11-23 20:35:56,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 58 remaining) [2023-11-23 20:35:56,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 58 remaining) [2023-11-23 20:35:56,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 58 remaining) [2023-11-23 20:35:56,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 58 remaining) [2023-11-23 20:35:56,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 58 remaining) [2023-11-23 20:35:56,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 58 remaining) [2023-11-23 20:35:56,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 58 remaining) [2023-11-23 20:35:56,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 58 remaining) [2023-11-23 20:35:56,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 58 remaining) [2023-11-23 20:35:56,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 58 remaining) [2023-11-23 20:35:56,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 58 remaining) [2023-11-23 20:35:56,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 58 remaining) [2023-11-23 20:35:56,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (24 of 58 remaining) [2023-11-23 20:35:56,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 58 remaining) [2023-11-23 20:35:56,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 58 remaining) [2023-11-23 20:35:56,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 58 remaining) [2023-11-23 20:35:56,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 58 remaining) [2023-11-23 20:35:56,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 58 remaining) [2023-11-23 20:35:56,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 58 remaining) [2023-11-23 20:35:56,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 58 remaining) [2023-11-23 20:35:56,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 58 remaining) [2023-11-23 20:35:56,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 58 remaining) [2023-11-23 20:35:56,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 58 remaining) [2023-11-23 20:35:56,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 58 remaining) [2023-11-23 20:35:56,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 58 remaining) [2023-11-23 20:35:56,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 58 remaining) [2023-11-23 20:35:56,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 58 remaining) [2023-11-23 20:35:56,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 58 remaining) [2023-11-23 20:35:56,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 58 remaining) [2023-11-23 20:35:56,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 58 remaining) [2023-11-23 20:35:56,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 58 remaining) [2023-11-23 20:35:56,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 58 remaining) [2023-11-23 20:35:56,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 58 remaining) [2023-11-23 20:35:56,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 58 remaining) [2023-11-23 20:35:56,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 58 remaining) [2023-11-23 20:35:56,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 58 remaining) [2023-11-23 20:35:56,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 58 remaining) [2023-11-23 20:35:56,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 20:35:56,079 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:35:56,085 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-23 20:35:56,085 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 20:35:56,167 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre22 could not be translated [2023-11-23 20:35:56,171 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre24 could not be translated [2023-11-23 20:35:56,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:35:56 BasicIcfg [2023-11-23 20:35:56,213 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 20:35:56,214 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 20:35:56,214 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 20:35:56,214 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 20:35:56,215 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:35:49" (3/4) ... [2023-11-23 20:35:56,217 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-23 20:35:56,218 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 20:35:56,219 INFO L158 Benchmark]: Toolchain (without parser) took 8996.59ms. Allocated memory was 127.9MB in the beginning and 291.5MB in the end (delta: 163.6MB). Free memory was 83.0MB in the beginning and 207.6MB in the end (delta: -124.6MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. [2023-11-23 20:35:56,219 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 127.9MB. Free memory is still 97.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 20:35:56,220 INFO L158 Benchmark]: CACSL2BoogieTranslator took 771.70ms. Allocated memory is still 127.9MB. Free memory was 83.0MB in the beginning and 59.4MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-23 20:35:56,220 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.12ms. Allocated memory is still 127.9MB. Free memory was 59.4MB in the beginning and 56.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 20:35:56,221 INFO L158 Benchmark]: Boogie Preprocessor took 43.13ms. Allocated memory is still 127.9MB. Free memory was 56.9MB in the beginning and 54.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 20:35:56,222 INFO L158 Benchmark]: RCFGBuilder took 1516.97ms. Allocated memory was 127.9MB in the beginning and 176.2MB in the end (delta: 48.2MB). Free memory was 54.7MB in the beginning and 87.1MB in the end (delta: -32.3MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. [2023-11-23 20:35:56,222 INFO L158 Benchmark]: TraceAbstraction took 6565.29ms. Allocated memory was 176.2MB in the beginning and 291.5MB in the end (delta: 115.3MB). Free memory was 86.0MB in the beginning and 207.6MB in the end (delta: -121.6MB). Peak memory consumption was 140.7MB. Max. memory is 16.1GB. [2023-11-23 20:35:56,223 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 291.5MB. Free memory is still 207.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 20:35:56,225 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.31ms. Allocated memory is still 127.9MB. Free memory is still 97.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 771.70ms. Allocated memory is still 127.9MB. Free memory was 83.0MB in the beginning and 59.4MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.12ms. Allocated memory is still 127.9MB. Free memory was 59.4MB in the beginning and 56.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.13ms. Allocated memory is still 127.9MB. Free memory was 56.9MB in the beginning and 54.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1516.97ms. Allocated memory was 127.9MB in the beginning and 176.2MB in the end (delta: 48.2MB). Free memory was 54.7MB in the beginning and 87.1MB in the end (delta: -32.3MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6565.29ms. Allocated memory was 176.2MB in the beginning and 291.5MB in the end (delta: 115.3MB). Free memory was 86.0MB in the beginning and 207.6MB in the end (delta: -121.6MB). Peak memory consumption was 140.7MB. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 291.5MB. Free memory is still 207.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre24 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1921; [L814] FCALL, FORK 0 pthread_create(&t1921, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1921={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L815] 0 pthread_t t1922; [L816] FCALL, FORK 0 pthread_create(&t1922, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1921={6:0}, t1922={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] EXPR 1 \read(y) [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L760] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L761] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L762] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L763] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L764] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L765] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L766] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L767] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L768] EXPR 1 \read(y) [L768] 1 __unbuffered_p0_EAX = y [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] EXPR 1 \read(y) [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] 1 y = y$flush_delayed ? y$mem_tmp : y [L770] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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$$choice1=1, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L773] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L778] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L785] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L788] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 \read(y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L793] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L794] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L795] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921={6:0}, t1922={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 \read(y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921={6:0}, t1922={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L829] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921={6:0}, t1922={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L18] 0 __assert_fail ("0", "safe006_power.oepc-thin000_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 814]: 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 5 procedures, 105 locations, 58 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 563 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 563 mSDsluCounter, 416 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 225 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 765 IncrementalHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 191 mSDtfsCounter, 765 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6384occurred in iteration=0, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 208 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 547 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-23 20:35:56,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1a7472923aa95b61749a468b52dfc65e03dead5bf647c94f71a6e156dc586ae --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 20:35:59,015 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 20:35:59,086 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-11-23 20:35:59,110 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 20:35:59,111 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 20:35:59,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 20:35:59,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 20:35:59,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 20:35:59,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 20:35:59,143 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 20:35:59,144 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-23 20:35:59,145 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-23 20:35:59,145 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-23 20:35:59,146 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-23 20:35:59,147 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-23 20:35:59,147 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-23 20:35:59,148 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 20:35:59,149 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 20:35:59,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 20:35:59,150 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 20:35:59,151 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 20:35:59,151 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 20:35:59,152 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 20:35:59,152 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 20:35:59,153 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 20:35:59,153 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-23 20:35:59,154 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 20:35:59,154 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 20:35:59,155 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-23 20:35:59,155 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-23 20:35:59,156 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 20:35:59,156 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 20:35:59,157 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 20:35:59,157 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 20:35:59,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 20:35:59,158 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 20:35:59,158 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 20:35:59,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 20:35:59,159 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 20:35:59,160 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 20:35:59,160 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-11-23 20:35:59,160 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-23 20:35:59,161 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 20:35:59,161 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-23 20:35:59,161 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 20:35:59,162 INFO L153 SettingsManager]: * Logic for external solver=AUFBV 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_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> e1a7472923aa95b61749a468b52dfc65e03dead5bf647c94f71a6e156dc586ae [2023-11-23 20:35:59,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 20:35:59,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 20:35:59,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 20:35:59,654 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 20:35:59,654 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 20:35:59,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2023-11-23 20:36:02,916 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 20:36:03,314 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 20:36:03,315 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2023-11-23 20:36:03,337 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/data/868055001/06b635983372445680f60bed48689dd4/FLAG091c1df70 [2023-11-23 20:36:03,353 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/data/868055001/06b635983372445680f60bed48689dd4 [2023-11-23 20:36:03,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 20:36:03,357 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 20:36:03,359 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 20:36:03,359 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 20:36:03,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 20:36:03,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:36:03" (1/1) ... [2023-11-23 20:36:03,377 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67a465f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:03, skipping insertion in model container [2023-11-23 20:36:03,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:36:03" (1/1) ... [2023-11-23 20:36:03,458 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 20:36:04,063 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 20:36:04,092 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 20:36:04,190 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 20:36:04,247 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 20:36:04,247 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 20:36:04,255 INFO L206 MainTranslator]: Completed translation [2023-11-23 20:36:04,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:04 WrapperNode [2023-11-23 20:36:04,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 20:36:04,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 20:36:04,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 20:36:04,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 20:36:04,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:04" (1/1) ... [2023-11-23 20:36:04,325 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:04" (1/1) ... [2023-11-23 20:36:04,377 INFO L138 Inliner]: procedures = 179, calls = 57, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 124 [2023-11-23 20:36:04,389 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 20:36:04,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 20:36:04,401 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 20:36:04,401 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 20:36:04,410 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:04" (1/1) ... [2023-11-23 20:36:04,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:04" (1/1) ... [2023-11-23 20:36:04,416 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:04" (1/1) ... [2023-11-23 20:36:04,416 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:04" (1/1) ... [2023-11-23 20:36:04,435 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:04" (1/1) ... [2023-11-23 20:36:04,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:04" (1/1) ... [2023-11-23 20:36:04,442 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:04" (1/1) ... [2023-11-23 20:36:04,444 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:04" (1/1) ... [2023-11-23 20:36:04,450 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 20:36:04,451 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 20:36:04,451 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 20:36:04,451 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 20:36:04,452 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:04" (1/1) ... [2023-11-23 20:36:04,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 20:36:04,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:36:04,493 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 20:36:04,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 20:36:04,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-23 20:36:04,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-23 20:36:04,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 20:36:04,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 20:36:04,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 20:36:04,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-23 20:36:04,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-23 20:36:04,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-23 20:36:04,535 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-23 20:36:04,535 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-23 20:36:04,535 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-23 20:36:04,535 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-23 20:36:04,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-23 20:36:04,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 20:36:04,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 20:36:04,538 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 20:36:04,713 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 20:36:04,716 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 20:36:05,416 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 20:36:06,158 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 20:36:06,159 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 20:36:06,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:36:06 BoogieIcfgContainer [2023-11-23 20:36:06,160 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 20:36:06,163 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 20:36:06,164 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 20:36:06,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 20:36:06,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:36:03" (1/3) ... [2023-11-23 20:36:06,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36725d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:36:06, skipping insertion in model container [2023-11-23 20:36:06,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:36:04" (2/3) ... [2023-11-23 20:36:06,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36725d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:36:06, skipping insertion in model container [2023-11-23 20:36:06,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:36:06" (3/3) ... [2023-11-23 20:36:06,173 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.oepc-thin000_power.oepc.i [2023-11-23 20:36:06,194 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 20:36:06,195 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2023-11-23 20:36:06,195 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 20:36:06,391 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 20:36:06,434 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 68 transitions, 144 flow [2023-11-23 20:36:06,798 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6384 states, 5278 states have (on average 3.517430845017052) internal successors, (18565), 6383 states have internal predecessors, (18565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:06,819 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 20:36:06,826 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=FINITE_AUTOMATA, 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;@6d58e869, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 20:36:06,827 INFO L358 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2023-11-23 20:36:06,847 INFO L276 IsEmpty]: Start isEmpty. Operand has 6384 states, 5278 states have (on average 3.517430845017052) internal successors, (18565), 6383 states have internal predecessors, (18565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:06,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-23 20:36:06,854 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:06,855 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-23 20:36:06,855 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-23 20:36:06,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:06,861 INFO L85 PathProgramCache]: Analyzing trace with hash 22535, now seen corresponding path program 1 times [2023-11-23 20:36:06,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 20:36:06,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888311240] [2023-11-23 20:36:06,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:06,879 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-23 20:36:06,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 20:36:06,884 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:06,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:07,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 20:36:07,135 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:07,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-23 20:36:07,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:07,246 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 20:36:07,246 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 20:36:07,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888311240] [2023-11-23 20:36:07,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1888311240] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:36:07,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:36:07,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 20:36:07,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82292672] [2023-11-23 20:36:07,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:36:07,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:36:07,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 20:36:07,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:36:07,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:36:07,319 INFO L87 Difference]: Start difference. First operand has 6384 states, 5278 states have (on average 3.517430845017052) internal successors, (18565), 6383 states have internal predecessors, (18565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:07,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:07,646 INFO L93 Difference]: Finished difference Result 2374 states and 6507 transitions. [2023-11-23 20:36:07,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:36:07,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-23 20:36:07,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:07,685 INFO L225 Difference]: With dead ends: 2374 [2023-11-23 20:36:07,685 INFO L226 Difference]: Without dead ends: 2374 [2023-11-23 20:36:07,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:36:07,691 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 43 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:07,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 20 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:36:07,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2374 states. [2023-11-23 20:36:07,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2374 to 2374. [2023-11-23 20:36:07,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2374 states, 2179 states have (on average 2.9862322166131254) internal successors, (6507), 2373 states have internal predecessors, (6507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 2374 states and 6507 transitions. [2023-11-23 20:36:07,877 INFO L78 Accepts]: Start accepts. Automaton has 2374 states and 6507 transitions. Word has length 2 [2023-11-23 20:36:07,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:07,877 INFO L495 AbstractCegarLoop]: Abstraction has 2374 states and 6507 transitions. [2023-11-23 20:36:07,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:07,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 6507 transitions. [2023-11-23 20:36:07,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-23 20:36:07,878 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:07,878 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-23 20:36:07,886 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:08,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:08,081 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-23 20:36:08,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:08,082 INFO L85 PathProgramCache]: Analyzing trace with hash 22536, now seen corresponding path program 1 times [2023-11-23 20:36:08,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 20:36:08,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [14522114] [2023-11-23 20:36:08,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:08,083 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-23 20:36:08,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 20:36:08,087 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:08,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:08,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 20:36:08,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:08,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 20:36:08,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:08,299 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 20:36:08,300 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 20:36:08,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [14522114] [2023-11-23 20:36:08,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [14522114] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:36:08,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:36:08,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 20:36:08,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648580057] [2023-11-23 20:36:08,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:36:08,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:36:08,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 20:36:08,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:36:08,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:36:08,304 INFO L87 Difference]: Start difference. First operand 2374 states and 6507 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:08,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:08,557 INFO L93 Difference]: Finished difference Result 2373 states and 6506 transitions. [2023-11-23 20:36:08,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:36:08,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-23 20:36:08,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:08,583 INFO L225 Difference]: With dead ends: 2373 [2023-11-23 20:36:08,583 INFO L226 Difference]: Without dead ends: 2373 [2023-11-23 20:36:08,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:36:08,585 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 42 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:08,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 21 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:36:08,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2023-11-23 20:36:08,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2373. [2023-11-23 20:36:08,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2373 states, 2179 states have (on average 2.9857732905002297) internal successors, (6506), 2372 states have internal predecessors, (6506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2373 states to 2373 states and 6506 transitions. [2023-11-23 20:36:08,704 INFO L78 Accepts]: Start accepts. Automaton has 2373 states and 6506 transitions. Word has length 2 [2023-11-23 20:36:08,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:08,705 INFO L495 AbstractCegarLoop]: Abstraction has 2373 states and 6506 transitions. [2023-11-23 20:36:08,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:08,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2373 states and 6506 transitions. [2023-11-23 20:36:08,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-23 20:36:08,706 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:08,706 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 20:36:08,717 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:08,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:08,909 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-23 20:36:08,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:08,910 INFO L85 PathProgramCache]: Analyzing trace with hash 672045024, now seen corresponding path program 1 times [2023-11-23 20:36:08,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 20:36:08,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1407401782] [2023-11-23 20:36:08,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:08,911 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-23 20:36:08,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 20:36:08,918 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:08,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:09,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-23 20:36:09,069 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:09,134 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-23 20:36:09,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2023-11-23 20:36:09,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:09,225 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 20:36:09,225 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 20:36:09,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1407401782] [2023-11-23 20:36:09,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1407401782] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:36:09,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:36:09,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 20:36:09,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619197581] [2023-11-23 20:36:09,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:36:09,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:36:09,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 20:36:09,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:36:09,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:36:09,227 INFO L87 Difference]: Start difference. First operand 2373 states and 6506 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:09,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:09,422 INFO L93 Difference]: Finished difference Result 1579 states and 4233 transitions. [2023-11-23 20:36:09,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:36:09,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-23 20:36:09,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:09,437 INFO L225 Difference]: With dead ends: 1579 [2023-11-23 20:36:09,438 INFO L226 Difference]: Without dead ends: 1579 [2023-11-23 20:36:09,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:36:09,439 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 33 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:09,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 20 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:36:09,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2023-11-23 20:36:09,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1579. [2023-11-23 20:36:09,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1579 states, 1494 states have (on average 2.8333333333333335) internal successors, (4233), 1578 states have internal predecessors, (4233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:09,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 4233 transitions. [2023-11-23 20:36:09,502 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 4233 transitions. Word has length 5 [2023-11-23 20:36:09,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:09,502 INFO L495 AbstractCegarLoop]: Abstraction has 1579 states and 4233 transitions. [2023-11-23 20:36:09,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:09,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 4233 transitions. [2023-11-23 20:36:09,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-23 20:36:09,504 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:09,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 20:36:09,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:09,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:09,707 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-23 20:36:09,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:09,708 INFO L85 PathProgramCache]: Analyzing trace with hash 672045025, now seen corresponding path program 1 times [2023-11-23 20:36:09,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 20:36:09,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513744683] [2023-11-23 20:36:09,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:09,709 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-23 20:36:09,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 20:36:09,710 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:09,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:09,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-23 20:36:09,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:09,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 20:36:09,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-23 20:36:09,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:09,930 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 20:36:09,931 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 20:36:09,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513744683] [2023-11-23 20:36:09,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [513744683] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:36:09,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:36:09,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 20:36:09,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073884863] [2023-11-23 20:36:09,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:36:09,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:36:09,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 20:36:09,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:36:09,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:36:09,934 INFO L87 Difference]: Start difference. First operand 1579 states and 4233 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:10,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:10,057 INFO L93 Difference]: Finished difference Result 900 states and 2338 transitions. [2023-11-23 20:36:10,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:36:10,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-23 20:36:10,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:10,066 INFO L225 Difference]: With dead ends: 900 [2023-11-23 20:36:10,066 INFO L226 Difference]: Without dead ends: 900 [2023-11-23 20:36:10,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:36:10,067 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:10,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 13 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:36:10,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2023-11-23 20:36:10,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 900. [2023-11-23 20:36:10,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 880 states have (on average 2.6568181818181817) internal successors, (2338), 899 states have internal predecessors, (2338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:10,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 2338 transitions. [2023-11-23 20:36:10,103 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 2338 transitions. Word has length 5 [2023-11-23 20:36:10,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:10,103 INFO L495 AbstractCegarLoop]: Abstraction has 900 states and 2338 transitions. [2023-11-23 20:36:10,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:10,104 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 2338 transitions. [2023-11-23 20:36:10,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-23 20:36:10,104 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:10,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 20:36:10,113 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:10,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:10,308 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-23 20:36:10,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:10,308 INFO L85 PathProgramCache]: Analyzing trace with hash 672044542, now seen corresponding path program 1 times [2023-11-23 20:36:10,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 20:36:10,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1556997813] [2023-11-23 20:36:10,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:10,310 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-23 20:36:10,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 20:36:10,311 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:10,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:10,435 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 20:36:10,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:10,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 20:36:10,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:10,456 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 20:36:10,456 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 20:36:10,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1556997813] [2023-11-23 20:36:10,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1556997813] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:36:10,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:36:10,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 20:36:10,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690720196] [2023-11-23 20:36:10,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:36:10,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:36:10,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 20:36:10,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:36:10,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:36:10,459 INFO L87 Difference]: Start difference. First operand 900 states and 2338 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:10,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:10,590 INFO L93 Difference]: Finished difference Result 893 states and 2325 transitions. [2023-11-23 20:36:10,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:36:10,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-23 20:36:10,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:10,598 INFO L225 Difference]: With dead ends: 893 [2023-11-23 20:36:10,598 INFO L226 Difference]: Without dead ends: 893 [2023-11-23 20:36:10,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:36:10,600 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 27 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:10,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 25 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:36:10,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2023-11-23 20:36:10,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 893. [2023-11-23 20:36:10,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 874 states have (on average 2.660183066361556) internal successors, (2325), 892 states have internal predecessors, (2325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:10,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 2325 transitions. [2023-11-23 20:36:10,638 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 2325 transitions. Word has length 5 [2023-11-23 20:36:10,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:10,639 INFO L495 AbstractCegarLoop]: Abstraction has 893 states and 2325 transitions. [2023-11-23 20:36:10,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:10,639 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 2325 transitions. [2023-11-23 20:36:10,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-23 20:36:10,640 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:10,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 20:36:10,648 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:10,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:10,844 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-23 20:36:10,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:10,846 INFO L85 PathProgramCache]: Analyzing trace with hash 672044541, now seen corresponding path program 1 times [2023-11-23 20:36:10,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 20:36:10,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635211222] [2023-11-23 20:36:10,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:10,847 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-23 20:36:10,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 20:36:10,848 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:10,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:10,981 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 20:36:10,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:10,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-23 20:36:10,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:10,994 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 20:36:10,994 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 20:36:10,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635211222] [2023-11-23 20:36:10,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635211222] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:36:10,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:36:10,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 20:36:10,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795714833] [2023-11-23 20:36:10,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:36:10,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:36:10,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 20:36:10,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:36:10,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:36:10,997 INFO L87 Difference]: Start difference. First operand 893 states and 2325 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:11,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:11,145 INFO L93 Difference]: Finished difference Result 886 states and 2312 transitions. [2023-11-23 20:36:11,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:36:11,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-23 20:36:11,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:11,154 INFO L225 Difference]: With dead ends: 886 [2023-11-23 20:36:11,154 INFO L226 Difference]: Without dead ends: 886 [2023-11-23 20:36:11,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:36:11,155 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:11,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 24 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:36:11,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2023-11-23 20:36:11,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2023-11-23 20:36:11,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 868 states have (on average 2.6635944700460827) internal successors, (2312), 885 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:11,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 2312 transitions. [2023-11-23 20:36:11,192 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 2312 transitions. Word has length 5 [2023-11-23 20:36:11,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:11,192 INFO L495 AbstractCegarLoop]: Abstraction has 886 states and 2312 transitions. [2023-11-23 20:36:11,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:11,193 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 2312 transitions. [2023-11-23 20:36:11,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-23 20:36:11,194 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:11,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:36:11,202 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:11,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:11,397 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-23 20:36:11,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:11,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1962880029, now seen corresponding path program 1 times [2023-11-23 20:36:11,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 20:36:11,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397107272] [2023-11-23 20:36:11,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:11,398 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-23 20:36:11,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 20:36:11,400 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:11,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:11,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 20:36:11,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:11,588 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 20:36:11,589 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 20:36:11,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1397107272] [2023-11-23 20:36:11,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1397107272] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:36:11,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:36:11,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 20:36:11,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524825129] [2023-11-23 20:36:11,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:36:11,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 20:36:11,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 20:36:11,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 20:36:11,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 20:36:11,591 INFO L87 Difference]: Start difference. First operand 886 states and 2312 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:11,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:11,767 INFO L93 Difference]: Finished difference Result 519 states and 1200 transitions. [2023-11-23 20:36:11,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 20:36:11,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-23 20:36:11,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:11,772 INFO L225 Difference]: With dead ends: 519 [2023-11-23 20:36:11,772 INFO L226 Difference]: Without dead ends: 470 [2023-11-23 20:36:11,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 20:36:11,773 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 41 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:11,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 32 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:36:11,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2023-11-23 20:36:11,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2023-11-23 20:36:11,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 458 states have (on average 2.3820960698689957) internal successors, (1091), 469 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:11,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1091 transitions. [2023-11-23 20:36:11,790 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1091 transitions. Word has length 11 [2023-11-23 20:36:11,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:11,791 INFO L495 AbstractCegarLoop]: Abstraction has 470 states and 1091 transitions. [2023-11-23 20:36:11,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:11,791 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1091 transitions. [2023-11-23 20:36:11,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-23 20:36:11,794 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:11,794 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:36:11,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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)] Ended with exit code 0 [2023-11-23 20:36:11,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:11,997 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-23 20:36:11,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:11,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1800488253, now seen corresponding path program 1 times [2023-11-23 20:36:11,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 20:36:11,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699791203] [2023-11-23 20:36:11,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:11,998 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-23 20:36:11,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 20:36:12,004 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:12,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:12,191 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 20:36:12,193 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:12,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:12,241 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 20:36:12,241 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 20:36:12,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [699791203] [2023-11-23 20:36:12,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [699791203] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:36:12,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:36:12,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 20:36:12,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385172325] [2023-11-23 20:36:12,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:36:12,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 20:36:12,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 20:36:12,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 20:36:12,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 20:36:12,244 INFO L87 Difference]: Start difference. First operand 470 states and 1091 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:12,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:12,441 INFO L93 Difference]: Finished difference Result 198 states and 417 transitions. [2023-11-23 20:36:12,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 20:36:12,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-23 20:36:12,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:12,444 INFO L225 Difference]: With dead ends: 198 [2023-11-23 20:36:12,444 INFO L226 Difference]: Without dead ends: 174 [2023-11-23 20:36:12,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-23 20:36:12,445 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 54 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:12,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 42 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:36:12,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-11-23 20:36:12,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2023-11-23 20:36:12,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 170 states have (on average 2.135294117647059) internal successors, (363), 173 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:12,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 363 transitions. [2023-11-23 20:36:12,453 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 363 transitions. Word has length 16 [2023-11-23 20:36:12,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:12,454 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 363 transitions. [2023-11-23 20:36:12,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:12,454 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 363 transitions. [2023-11-23 20:36:12,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-23 20:36:12,457 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:12,457 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:36:12,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:12,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:12,661 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-23 20:36:12,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:12,662 INFO L85 PathProgramCache]: Analyzing trace with hash -508057031, now seen corresponding path program 1 times [2023-11-23 20:36:12,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 20:36:12,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913935726] [2023-11-23 20:36:12,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:12,666 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-23 20:36:12,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 20:36:12,673 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:12,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:12,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 20:36:12,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:12,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:12,954 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 20:36:12,954 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 20:36:12,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913935726] [2023-11-23 20:36:12,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913935726] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:36:12,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:36:12,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 20:36:12,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726231948] [2023-11-23 20:36:12,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:36:12,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 20:36:12,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 20:36:12,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 20:36:12,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 20:36:12,958 INFO L87 Difference]: Start difference. First operand 174 states and 363 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:13,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:13,089 INFO L93 Difference]: Finished difference Result 170 states and 355 transitions. [2023-11-23 20:36:13,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 20:36:13,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-23 20:36:13,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:13,091 INFO L225 Difference]: With dead ends: 170 [2023-11-23 20:36:13,091 INFO L226 Difference]: Without dead ends: 170 [2023-11-23 20:36:13,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 20:36:13,092 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 37 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:13,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 27 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:36:13,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-11-23 20:36:13,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2023-11-23 20:36:13,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 167 states have (on average 2.125748502994012) internal successors, (355), 169 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:13,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 355 transitions. [2023-11-23 20:36:13,101 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 355 transitions. Word has length 21 [2023-11-23 20:36:13,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:13,103 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 355 transitions. [2023-11-23 20:36:13,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:13,103 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 355 transitions. [2023-11-23 20:36:13,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-23 20:36:13,105 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:13,105 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:36:13,114 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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)] Ended with exit code 0 [2023-11-23 20:36:13,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:13,309 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-23 20:36:13,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:13,310 INFO L85 PathProgramCache]: Analyzing trace with hash -508057030, now seen corresponding path program 1 times [2023-11-23 20:36:13,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 20:36:13,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223178511] [2023-11-23 20:36:13,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:13,311 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-23 20:36:13,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 20:36:13,313 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:13,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:13,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 20:36:13,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:13,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-11-23 20:36:13,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:13,712 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 20:36:13,712 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 20:36:13,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223178511] [2023-11-23 20:36:13,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1223178511] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:36:13,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:36:13,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 20:36:13,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139996656] [2023-11-23 20:36:13,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:36:13,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 20:36:13,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 20:36:13,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 20:36:13,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 20:36:13,715 INFO L87 Difference]: Start difference. First operand 170 states and 355 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:13,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:13,835 INFO L93 Difference]: Finished difference Result 166 states and 347 transitions. [2023-11-23 20:36:13,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 20:36:13,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-23 20:36:13,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:13,838 INFO L225 Difference]: With dead ends: 166 [2023-11-23 20:36:13,838 INFO L226 Difference]: Without dead ends: 166 [2023-11-23 20:36:13,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 20:36:13,839 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 32 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:13,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 21 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:36:13,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-11-23 20:36:13,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2023-11-23 20:36:13,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 164 states have (on average 2.1158536585365852) internal successors, (347), 165 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:13,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 347 transitions. [2023-11-23 20:36:13,848 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 347 transitions. Word has length 21 [2023-11-23 20:36:13,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:13,848 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 347 transitions. [2023-11-23 20:36:13,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:13,849 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 347 transitions. [2023-11-23 20:36:13,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 20:36:13,850 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:13,851 INFO L195 NwaCegarLoop]: 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-23 20:36:13,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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)] Forceful destruction successful, exit code 0 [2023-11-23 20:36:14,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:14,055 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-23 20:36:14,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:14,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1908479675, now seen corresponding path program 1 times [2023-11-23 20:36:14,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 20:36:14,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071090187] [2023-11-23 20:36:14,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:14,057 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-23 20:36:14,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 20:36:14,058 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:14,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:36:14,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-23 20:36:14,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:36:14,616 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t1921~0#1.base_47| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1922~0#1.base_43| (_ BitVec 32))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1921~0#1.base_47|) (_ bv0 1)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1921~0#1.base_47| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1922~0#1.base_43| (_ bv0 1))) (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1921~0#1.base_47| (_ bv1 1)) |v_ULTIMATE.start_main_~#t1922~0#1.base_43|)))) is different from true [2023-11-23 20:36:14,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:36:14,617 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 20:36:14,617 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 20:36:14,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071090187] [2023-11-23 20:36:14,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2071090187] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:36:14,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:36:14,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 20:36:14,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075781358] [2023-11-23 20:36:14,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:36:14,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 20:36:14,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 20:36:14,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 20:36:14,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-11-23 20:36:14,619 INFO L87 Difference]: Start difference. First operand 166 states and 347 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:14,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:36:14,755 INFO L93 Difference]: Finished difference Result 168 states and 346 transitions. [2023-11-23 20:36:14,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 20:36:14,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-23 20:36:14,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:36:14,758 INFO L225 Difference]: With dead ends: 168 [2023-11-23 20:36:14,758 INFO L226 Difference]: Without dead ends: 166 [2023-11-23 20:36:14,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-11-23 20:36:14,759 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:36:14,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 31 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 45 Unchecked, 0.1s Time] [2023-11-23 20:36:14,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-11-23 20:36:14,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2023-11-23 20:36:14,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 164 states have (on average 2.0853658536585367) internal successors, (342), 165 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:14,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 342 transitions. [2023-11-23 20:36:14,770 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 342 transitions. Word has length 25 [2023-11-23 20:36:14,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:36:14,771 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 342 transitions. [2023-11-23 20:36:14,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:36:14,771 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 342 transitions. [2023-11-23 20:36:14,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 20:36:14,772 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:36:14,772 INFO L195 NwaCegarLoop]: 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-23 20:36:14,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:14,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:14,976 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-23 20:36:14,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:36:14,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1908480497, now seen corresponding path program 1 times [2023-11-23 20:36:14,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 20:36:14,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591179015] [2023-11-23 20:36:14,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:36:14,978 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-23 20:36:14,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 20:36:14,979 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:14,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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 (13)] Waiting until timeout for monitored process [2023-11-23 20:36:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 20:36:15,235 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 20:36:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 20:36:15,471 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2023-11-23 20:36:15,471 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 20:36:15,472 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (57 of 58 remaining) [2023-11-23 20:36:15,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 58 remaining) [2023-11-23 20:36:15,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 58 remaining) [2023-11-23 20:36:15,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 58 remaining) [2023-11-23 20:36:15,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 58 remaining) [2023-11-23 20:36:15,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 58 remaining) [2023-11-23 20:36:15,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 58 remaining) [2023-11-23 20:36:15,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 58 remaining) [2023-11-23 20:36:15,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 58 remaining) [2023-11-23 20:36:15,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 58 remaining) [2023-11-23 20:36:15,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 58 remaining) [2023-11-23 20:36:15,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 58 remaining) [2023-11-23 20:36:15,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 58 remaining) [2023-11-23 20:36:15,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 58 remaining) [2023-11-23 20:36:15,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 58 remaining) [2023-11-23 20:36:15,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 58 remaining) [2023-11-23 20:36:15,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 58 remaining) [2023-11-23 20:36:15,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 58 remaining) [2023-11-23 20:36:15,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 58 remaining) [2023-11-23 20:36:15,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 58 remaining) [2023-11-23 20:36:15,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 58 remaining) [2023-11-23 20:36:15,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 58 remaining) [2023-11-23 20:36:15,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 58 remaining) [2023-11-23 20:36:15,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 58 remaining) [2023-11-23 20:36:15,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 58 remaining) [2023-11-23 20:36:15,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 58 remaining) [2023-11-23 20:36:15,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 58 remaining) [2023-11-23 20:36:15,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 58 remaining) [2023-11-23 20:36:15,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 58 remaining) [2023-11-23 20:36:15,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 58 remaining) [2023-11-23 20:36:15,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 58 remaining) [2023-11-23 20:36:15,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 58 remaining) [2023-11-23 20:36:15,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 58 remaining) [2023-11-23 20:36:15,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (24 of 58 remaining) [2023-11-23 20:36:15,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 58 remaining) [2023-11-23 20:36:15,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 58 remaining) [2023-11-23 20:36:15,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 58 remaining) [2023-11-23 20:36:15,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 58 remaining) [2023-11-23 20:36:15,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 58 remaining) [2023-11-23 20:36:15,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 58 remaining) [2023-11-23 20:36:15,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 58 remaining) [2023-11-23 20:36:15,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 58 remaining) [2023-11-23 20:36:15,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 58 remaining) [2023-11-23 20:36:15,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 58 remaining) [2023-11-23 20:36:15,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 58 remaining) [2023-11-23 20:36:15,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 58 remaining) [2023-11-23 20:36:15,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 58 remaining) [2023-11-23 20:36:15,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 58 remaining) [2023-11-23 20:36:15,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 58 remaining) [2023-11-23 20:36:15,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 58 remaining) [2023-11-23 20:36:15,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 58 remaining) [2023-11-23 20:36:15,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 58 remaining) [2023-11-23 20:36:15,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 58 remaining) [2023-11-23 20:36:15,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 58 remaining) [2023-11-23 20:36:15,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 58 remaining) [2023-11-23 20:36:15,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 58 remaining) [2023-11-23 20:36:15,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 58 remaining) [2023-11-23 20:36:15,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 58 remaining) [2023-11-23 20:36:15,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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 (13)] Forceful destruction successful, exit code 0 [2023-11-23 20:36:15,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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-23 20:36:15,692 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:36:15,698 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-23 20:36:15,699 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 20:36:15,762 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre22 could not be translated [2023-11-23 20:36:15,767 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre24 could not be translated [2023-11-23 20:36:15,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:36:15 BasicIcfg [2023-11-23 20:36:15,791 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 20:36:15,791 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 20:36:15,791 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 20:36:15,791 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 20:36:15,792 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:36:06" (3/4) ... [2023-11-23 20:36:15,793 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-23 20:36:15,795 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 20:36:15,795 INFO L158 Benchmark]: Toolchain (without parser) took 12438.43ms. Allocated memory was 79.7MB in the beginning and 270.5MB in the end (delta: 190.8MB). Free memory was 55.4MB in the beginning and 199.9MB in the end (delta: -144.5MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. [2023-11-23 20:36:15,796 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 79.7MB. Free memory is still 56.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 20:36:15,796 INFO L158 Benchmark]: CACSL2BoogieTranslator took 898.13ms. Allocated memory is still 79.7MB. Free memory was 55.1MB in the beginning and 31.1MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-23 20:36:15,796 INFO L158 Benchmark]: Boogie Procedure Inliner took 136.68ms. Allocated memory is still 79.7MB. Free memory was 31.1MB in the beginning and 57.4MB in the end (delta: -26.3MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2023-11-23 20:36:15,797 INFO L158 Benchmark]: Boogie Preprocessor took 49.55ms. Allocated memory is still 79.7MB. Free memory was 57.4MB in the beginning and 55.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 20:36:15,797 INFO L158 Benchmark]: RCFGBuilder took 1709.17ms. Allocated memory was 79.7MB in the beginning and 107.0MB in the end (delta: 27.3MB). Free memory was 55.0MB in the beginning and 51.7MB in the end (delta: 3.3MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2023-11-23 20:36:15,798 INFO L158 Benchmark]: TraceAbstraction took 9627.83ms. Allocated memory was 107.0MB in the beginning and 270.5MB in the end (delta: 163.6MB). Free memory was 50.8MB in the beginning and 199.9MB in the end (delta: -149.0MB). Peak memory consumption was 152.8MB. Max. memory is 16.1GB. [2023-11-23 20:36:15,798 INFO L158 Benchmark]: Witness Printer took 3.79ms. Allocated memory is still 270.5MB. Free memory is still 199.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 20:36:15,800 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.29ms. Allocated memory is still 79.7MB. Free memory is still 56.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 898.13ms. Allocated memory is still 79.7MB. Free memory was 55.1MB in the beginning and 31.1MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 136.68ms. Allocated memory is still 79.7MB. Free memory was 31.1MB in the beginning and 57.4MB in the end (delta: -26.3MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.55ms. Allocated memory is still 79.7MB. Free memory was 57.4MB in the beginning and 55.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1709.17ms. Allocated memory was 79.7MB in the beginning and 107.0MB in the end (delta: 27.3MB). Free memory was 55.0MB in the beginning and 51.7MB in the end (delta: 3.3MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9627.83ms. Allocated memory was 107.0MB in the beginning and 270.5MB in the end (delta: 163.6MB). Free memory was 50.8MB in the beginning and 199.9MB in the end (delta: -149.0MB). Peak memory consumption was 152.8MB. Max. memory is 16.1GB. * Witness Printer took 3.79ms. Allocated memory is still 270.5MB. Free memory is still 199.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre24 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1921; [L814] FCALL, FORK 0 pthread_create(&t1921, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1921={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L815] 0 pthread_t t1922; [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] EXPR 1 \read(y) [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L760] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L761] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L762] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L763] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L764] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L765] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L766] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L767] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L768] EXPR 1 \read(y) [L768] 1 __unbuffered_p0_EAX = y [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] EXPR 1 \read(y) [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] 1 y = y$flush_delayed ? y$mem_tmp : y [L770] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L773] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L778] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L816] FCALL, FORK 0 pthread_create(&t1922, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1921={7:0}, t1922={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L785] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L788] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 \read(y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L793] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L794] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L795] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921={7:0}, t1922={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 \read(y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921={7:0}, t1922={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L829] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921={7:0}, t1922={15:0}, weak$$choice0=0, weak$$choice1=2, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=2, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L18] 0 __assert_fail ("0", "safe006_power.oepc-thin000_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=2, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 814]: 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 5 procedures, 105 locations, 58 error locations. Started 1 CEGAR loops. OverallTime: 9.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 380 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 380 mSDsluCounter, 276 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 45 IncrementalHoareTripleChecker+Unchecked, 112 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 530 IncrementalHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 164 mSDtfsCounter, 530 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6384occurred in iteration=0, 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: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 143 NumberOfCodeBlocks, 143 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 107 ConstructedInterpolants, 1 QuantifiedInterpolants, 992 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1233 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-23 20:36:15,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_513571bf-abc5-4fb8-a4ff-a97f5802b784/bin/utaipan-verify-mE87zJ7Ire/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