./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cf1a7837 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_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX --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 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:51:10,332 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:51:10,404 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-12 00:51:10,410 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:51:10,411 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:51:10,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:51:10,439 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:51:10,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:51:10,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:51:10,442 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:51:10,442 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:51:10,443 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:51:10,444 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:51:10,444 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:51:10,445 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:51:10,445 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:51:10,446 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:51:10,447 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:51:10,447 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:51:10,448 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:51:10,449 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:51:10,450 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:51:10,450 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 00:51:10,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 00:51:10,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:51:10,452 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:51:10,453 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:51:10,453 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:51:10,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:51:10,454 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 00:51:10,455 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 00:51:10,455 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 00:51:10,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:51:10,456 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 00:51:10,457 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:51:10,457 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:51:10,458 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:51:10,458 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:51:10,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:51:10,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:51:10,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:51:10,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:51:10,461 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:51:10,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:51:10,462 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:51:10,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:51:10,463 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_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX 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 -> 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 [2023-11-12 00:51:10,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:51:10,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:51:10,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:51:10,770 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:51:10,779 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:51:10,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-11-12 00:51:13,977 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:51:14,313 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:51:14,314 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-11-12 00:51:14,342 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/data/140162bd7/211dd080603048ffa39db42603c6cab5/FLAG37a3f681c [2023-11-12 00:51:14,357 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/data/140162bd7/211dd080603048ffa39db42603c6cab5 [2023-11-12 00:51:14,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:51:14,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:51:14,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:51:14,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:51:14,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:51:14,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:51:14" (1/1) ... [2023-11-12 00:51:14,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b7222d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:14, skipping insertion in model container [2023-11-12 00:51:14,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:51:14" (1/1) ... [2023-11-12 00:51:14,435 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:51:14,875 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:51:14,895 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:51:14,973 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:51:15,009 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 00:51:15,010 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 00:51:15,018 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:51:15,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:15 WrapperNode [2023-11-12 00:51:15,019 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:51:15,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:51:15,020 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:51:15,020 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:51:15,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:15" (1/1) ... [2023-11-12 00:51:15,065 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:15" (1/1) ... [2023-11-12 00:51:15,113 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 133 [2023-11-12 00:51:15,114 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:51:15,115 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:51:15,115 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:51:15,116 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:51:15,126 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:15" (1/1) ... [2023-11-12 00:51:15,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:15" (1/1) ... [2023-11-12 00:51:15,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:15" (1/1) ... [2023-11-12 00:51:15,150 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:15" (1/1) ... [2023-11-12 00:51:15,158 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:15" (1/1) ... [2023-11-12 00:51:15,174 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:15" (1/1) ... [2023-11-12 00:51:15,176 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:15" (1/1) ... [2023-11-12 00:51:15,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:15" (1/1) ... [2023-11-12 00:51:15,182 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:51:15,193 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:51:15,193 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:51:15,193 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:51:15,194 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:15" (1/1) ... [2023-11-12 00:51:15,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:51:15,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:51:15,229 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:51:15,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:51:15,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:51:15,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 00:51:15,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:51:15,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:51:15,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:51:15,270 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 00:51:15,272 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 00:51:15,273 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 00:51:15,274 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 00:51:15,274 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-12 00:51:15,275 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-12 00:51:15,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:51:15,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 00:51:15,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:51:15,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:51:15,277 WARN L210 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 00:51:15,431 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:51:15,433 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:51:15,897 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:51:16,060 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:51:16,061 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 00:51:16,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:51:16 BoogieIcfgContainer [2023-11-12 00:51:16,063 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:51:16,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:51:16,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:51:16,070 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:51:16,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:51:14" (1/3) ... [2023-11-12 00:51:16,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5d3900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:51:16, skipping insertion in model container [2023-11-12 00:51:16,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:15" (2/3) ... [2023-11-12 00:51:16,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b5d3900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:51:16, skipping insertion in model container [2023-11-12 00:51:16,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:51:16" (3/3) ... [2023-11-12 00:51:16,073 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-11-12 00:51:16,094 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:51:16,094 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-12 00:51:16,094 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 00:51:16,158 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 00:51:16,197 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-12 00:51:16,221 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 125 transitions, 262 flow [2023-11-12 00:51:16,226 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 125 transitions, 262 flow [2023-11-12 00:51:16,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 125 transitions, 262 flow [2023-11-12 00:51:16,294 INFO L124 PetriNetUnfolderBase]: 3/122 cut-off events. [2023-11-12 00:51:16,295 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 00:51:16,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 3/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-11-12 00:51:16,304 INFO L119 LiptonReduction]: Number of co-enabled transitions 2374 [2023-11-12 00:51:21,898 INFO L134 LiptonReduction]: Checked pairs total: 5918 [2023-11-12 00:51:21,898 INFO L136 LiptonReduction]: Total number of compositions: 131 [2023-11-12 00:51:21,909 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 34 transitions, 80 flow [2023-11-12 00:51:22,020 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 876 states, 863 states have (on average 3.2885283893395134) internal successors, (2838), 875 states have internal predecessors, (2838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:22,041 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:51:22,049 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;@680c55eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:51:22,049 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-12 00:51:22,055 INFO L276 IsEmpty]: Start isEmpty. Operand has 876 states, 863 states have (on average 3.2885283893395134) internal successors, (2838), 875 states have internal predecessors, (2838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:22,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2023-11-12 00:51:22,061 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:22,062 INFO L195 NwaCegarLoop]: trace histogram [1] [2023-11-12 00:51:22,063 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 00:51:22,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:22,070 INFO L85 PathProgramCache]: Analyzing trace with hash 561, now seen corresponding path program 1 times [2023-11-12 00:51:22,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:22,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126315564] [2023-11-12 00:51:22,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:22,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:22,239 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-12 00:51:22,241 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:22,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126315564] [2023-11-12 00:51:22,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126315564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:22,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:22,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-12 00:51:22,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928408976] [2023-11-12 00:51:22,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:22,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 00:51:22,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:22,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 00:51:22,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 00:51:22,288 INFO L87 Difference]: Start difference. First operand has 876 states, 863 states have (on average 3.2885283893395134) internal successors, (2838), 875 states have internal predecessors, (2838), 0 states have call successors, (0), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:22,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:22,415 INFO L93 Difference]: Finished difference Result 818 states and 2578 transitions. [2023-11-12 00:51:22,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 00:51:22,418 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2023-11-12 00:51:22,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:22,453 INFO L225 Difference]: With dead ends: 818 [2023-11-12 00:51:22,454 INFO L226 Difference]: Without dead ends: 818 [2023-11-12 00:51:22,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 00:51:22,460 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:22,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:51:22,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2023-11-12 00:51:22,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 818. [2023-11-12 00:51:22,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 813 states have (on average 3.1709717097170973) internal successors, (2578), 817 states have internal predecessors, (2578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:22,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 2578 transitions. [2023-11-12 00:51:22,595 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 2578 transitions. Word has length 1 [2023-11-12 00:51:22,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:22,595 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 2578 transitions. [2023-11-12 00:51:22,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:22,597 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 2578 transitions. [2023-11-12 00:51:22,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 00:51:22,598 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:22,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 00:51:22,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:51:22,603 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 00:51:22,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:22,604 INFO L85 PathProgramCache]: Analyzing trace with hash 529621835, now seen corresponding path program 1 times [2023-11-12 00:51:22,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:22,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033832070] [2023-11-12 00:51:22,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:22,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:23,003 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-12 00:51:23,003 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:23,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033832070] [2023-11-12 00:51:23,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033832070] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:23,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:23,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:51:23,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334776988] [2023-11-12 00:51:23,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:23,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:51:23,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:23,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:51:23,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:51:23,007 INFO L87 Difference]: Start difference. First operand 818 states and 2578 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-12 00:51:23,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:23,107 INFO L93 Difference]: Finished difference Result 670 states and 2079 transitions. [2023-11-12 00:51:23,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:51:23,108 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-12 00:51:23,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:23,119 INFO L225 Difference]: With dead ends: 670 [2023-11-12 00:51:23,120 INFO L226 Difference]: Without dead ends: 650 [2023-11-12 00:51:23,120 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-12 00:51:23,122 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 12 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:23,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:51:23,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2023-11-12 00:51:23,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2023-11-12 00:51:23,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 648 states have (on average 3.1296296296296298) internal successors, (2028), 649 states have internal predecessors, (2028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:23,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 2028 transitions. [2023-11-12 00:51:23,151 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 2028 transitions. Word has length 5 [2023-11-12 00:51:23,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:23,152 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 2028 transitions. [2023-11-12 00:51:23,152 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-12 00:51:23,152 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 2028 transitions. [2023-11-12 00:51:23,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 00:51:23,155 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:23,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:51:23,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:51:23,155 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 00:51:23,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:23,192 INFO L85 PathProgramCache]: Analyzing trace with hash -675627934, now seen corresponding path program 1 times [2023-11-12 00:51:23,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:23,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603859920] [2023-11-12 00:51:23,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:23,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:23,835 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-12 00:51:23,836 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:23,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603859920] [2023-11-12 00:51:23,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603859920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:23,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:23,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:51:23,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482870328] [2023-11-12 00:51:23,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:23,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:51:23,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:23,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:51:23,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:51:23,839 INFO L87 Difference]: Start difference. First operand 650 states and 2028 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:23,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:23,994 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2023-11-12 00:51:23,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:51:23,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2023-11-12 00:51:23,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:24,000 INFO L225 Difference]: With dead ends: 550 [2023-11-12 00:51:24,001 INFO L226 Difference]: Without dead ends: 550 [2023-11-12 00:51:24,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:51:24,002 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 22 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:24,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 9 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:51:24,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2023-11-12 00:51:24,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2023-11-12 00:51:24,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 3.083788706739526) internal successors, (1693), 549 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:24,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1693 transitions. [2023-11-12 00:51:24,026 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1693 transitions. Word has length 10 [2023-11-12 00:51:24,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:24,028 INFO L495 AbstractCegarLoop]: Abstraction has 550 states and 1693 transitions. [2023-11-12 00:51:24,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:24,028 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1693 transitions. [2023-11-12 00:51:24,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 00:51:24,030 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:24,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:51:24,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:51:24,031 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 00:51:24,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:24,032 INFO L85 PathProgramCache]: Analyzing trace with hash -675627975, now seen corresponding path program 1 times [2023-11-12 00:51:24,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:24,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152594652] [2023-11-12 00:51:24,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:24,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:24,233 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-12 00:51:24,234 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:24,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152594652] [2023-11-12 00:51:24,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152594652] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:24,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:24,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:51:24,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991734845] [2023-11-12 00:51:24,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:24,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:51:24,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:24,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:51:24,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:51:24,237 INFO L87 Difference]: Start difference. First operand 550 states and 1693 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:24,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:24,376 INFO L93 Difference]: Finished difference Result 618 states and 1824 transitions. [2023-11-12 00:51:24,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:51:24,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2023-11-12 00:51:24,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:24,382 INFO L225 Difference]: With dead ends: 618 [2023-11-12 00:51:24,382 INFO L226 Difference]: Without dead ends: 518 [2023-11-12 00:51:24,382 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-12 00:51:24,383 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 24 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:24,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 6 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:51:24,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2023-11-12 00:51:24,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2023-11-12 00:51:24,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 517 states have (on average 3.0425531914893615) internal successors, (1573), 517 states have internal predecessors, (1573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:24,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 1573 transitions. [2023-11-12 00:51:24,425 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 1573 transitions. Word has length 10 [2023-11-12 00:51:24,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:24,425 INFO L495 AbstractCegarLoop]: Abstraction has 518 states and 1573 transitions. [2023-11-12 00:51:24,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:24,426 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 1573 transitions. [2023-11-12 00:51:24,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 00:51:24,428 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:24,429 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:51:24,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:51:24,429 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 00:51:24,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:24,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1520327781, now seen corresponding path program 1 times [2023-11-12 00:51:24,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:24,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738626043] [2023-11-12 00:51:24,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:24,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:24,591 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-12 00:51:24,591 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:24,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738626043] [2023-11-12 00:51:24,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738626043] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:24,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:24,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:51:24,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612953385] [2023-11-12 00:51:24,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:24,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:51:24,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:24,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:51:24,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:51:24,594 INFO L87 Difference]: Start difference. First operand 518 states and 1573 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:24,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:24,768 INFO L93 Difference]: Finished difference Result 722 states and 2114 transitions. [2023-11-12 00:51:24,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:51:24,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-11-12 00:51:24,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:24,772 INFO L225 Difference]: With dead ends: 722 [2023-11-12 00:51:24,772 INFO L226 Difference]: Without dead ends: 350 [2023-11-12 00:51:24,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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-12 00:51:24,773 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 48 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:24,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 8 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:51:24,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2023-11-12 00:51:24,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2023-11-12 00:51:24,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 2.8624641833810887) internal successors, (999), 349 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:24,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 999 transitions. [2023-11-12 00:51:24,789 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 999 transitions. Word has length 12 [2023-11-12 00:51:24,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:24,790 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 999 transitions. [2023-11-12 00:51:24,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:24,790 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 999 transitions. [2023-11-12 00:51:24,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-12 00:51:24,792 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:24,792 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:51:24,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 00:51:24,792 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 00:51:24,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:24,793 INFO L85 PathProgramCache]: Analyzing trace with hash -393672455, now seen corresponding path program 1 times [2023-11-12 00:51:24,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:24,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312037880] [2023-11-12 00:51:24,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:24,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:24,969 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-12 00:51:24,970 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:24,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312037880] [2023-11-12 00:51:24,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312037880] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:24,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:24,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:51:24,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046618028] [2023-11-12 00:51:24,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:24,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:51:24,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:24,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:51:24,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:51:24,972 INFO L87 Difference]: Start difference. First operand 350 states and 999 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-12 00:51:25,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:25,120 INFO L93 Difference]: Finished difference Result 374 states and 1033 transitions. [2023-11-12 00:51:25,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:51:25,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-12 00:51:25,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:25,124 INFO L225 Difference]: With dead ends: 374 [2023-11-12 00:51:25,124 INFO L226 Difference]: Without dead ends: 326 [2023-11-12 00:51:25,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-12 00:51:25,125 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 36 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:25,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 5 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:51:25,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2023-11-12 00:51:25,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2023-11-12 00:51:25,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 2.8215384615384616) internal successors, (917), 325 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:25,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 917 transitions. [2023-11-12 00:51:25,140 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 917 transitions. Word has length 13 [2023-11-12 00:51:25,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:25,141 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 917 transitions. [2023-11-12 00:51:25,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-12 00:51:25,141 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 917 transitions. [2023-11-12 00:51:25,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-12 00:51:25,142 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:25,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:51:25,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 00:51:25,143 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 00:51:25,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:25,144 INFO L85 PathProgramCache]: Analyzing trace with hash 601152256, now seen corresponding path program 1 times [2023-11-12 00:51:25,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:25,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049722245] [2023-11-12 00:51:25,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:25,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:25,327 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-12 00:51:25,327 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:25,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049722245] [2023-11-12 00:51:25,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049722245] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:25,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:25,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:51:25,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575147920] [2023-11-12 00:51:25,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:25,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:51:25,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:25,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:51:25,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:51:25,330 INFO L87 Difference]: Start difference. First operand 326 states and 917 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:25,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:25,446 INFO L93 Difference]: Finished difference Result 344 states and 941 transitions. [2023-11-12 00:51:25,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:51:25,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2023-11-12 00:51:25,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:25,449 INFO L225 Difference]: With dead ends: 344 [2023-11-12 00:51:25,449 INFO L226 Difference]: Without dead ends: 308 [2023-11-12 00:51:25,450 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-12 00:51:25,450 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 16 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:25,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 6 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:51:25,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2023-11-12 00:51:25,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2023-11-12 00:51:25,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 2.791530944625407) internal successors, (857), 307 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:25,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 857 transitions. [2023-11-12 00:51:25,464 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 857 transitions. Word has length 14 [2023-11-12 00:51:25,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:25,464 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 857 transitions. [2023-11-12 00:51:25,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:25,465 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 857 transitions. [2023-11-12 00:51:25,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-12 00:51:25,466 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:25,466 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:51:25,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 00:51:25,467 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 00:51:25,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:25,467 INFO L85 PathProgramCache]: Analyzing trace with hash -763361643, now seen corresponding path program 1 times [2023-11-12 00:51:25,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:25,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666468916] [2023-11-12 00:51:25,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:25,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:25,647 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-12 00:51:25,647 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:25,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666468916] [2023-11-12 00:51:25,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666468916] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:25,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:25,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:51:25,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248724185] [2023-11-12 00:51:25,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:25,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:51:25,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:25,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:51:25,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:51:25,650 INFO L87 Difference]: Start difference. First operand 308 states and 857 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 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-12 00:51:25,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:25,787 INFO L93 Difference]: Finished difference Result 488 states and 1358 transitions. [2023-11-12 00:51:25,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:51:25,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 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-12 00:51:25,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:25,791 INFO L225 Difference]: With dead ends: 488 [2023-11-12 00:51:25,791 INFO L226 Difference]: Without dead ends: 272 [2023-11-12 00:51:25,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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-12 00:51:25,793 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 26 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:25,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 5 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:51:25,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2023-11-12 00:51:25,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2023-11-12 00:51:25,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 2.8081180811808117) internal successors, (761), 271 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:25,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 761 transitions. [2023-11-12 00:51:25,806 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 761 transitions. Word has length 15 [2023-11-12 00:51:25,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:25,806 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 761 transitions. [2023-11-12 00:51:25,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 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-12 00:51:25,807 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 761 transitions. [2023-11-12 00:51:25,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-12 00:51:25,808 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:25,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:51:25,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 00:51:25,809 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 00:51:25,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:25,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1835797579, now seen corresponding path program 2 times [2023-11-12 00:51:25,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:25,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484252691] [2023-11-12 00:51:25,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:25,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:26,019 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-12 00:51:26,019 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:26,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484252691] [2023-11-12 00:51:26,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484252691] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:26,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:26,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:51:26,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929721234] [2023-11-12 00:51:26,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:26,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:51:26,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:26,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:51:26,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:51:26,023 INFO L87 Difference]: Start difference. First operand 272 states and 761 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-12 00:51:26,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:26,226 INFO L93 Difference]: Finished difference Result 380 states and 1058 transitions. [2023-11-12 00:51:26,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:51:26,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-12 00:51:26,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:26,229 INFO L225 Difference]: With dead ends: 380 [2023-11-12 00:51:26,229 INFO L226 Difference]: Without dead ends: 200 [2023-11-12 00:51:26,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:51:26,231 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 40 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:26,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 8 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:51:26,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-11-12 00:51:26,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2023-11-12 00:51:26,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 2.678391959798995) internal successors, (533), 199 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:26,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 533 transitions. [2023-11-12 00:51:26,243 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 533 transitions. Word has length 15 [2023-11-12 00:51:26,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:26,244 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 533 transitions. [2023-11-12 00:51:26,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-12 00:51:26,244 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 533 transitions. [2023-11-12 00:51:26,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-12 00:51:26,245 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:26,245 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:51:26,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 00:51:26,246 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 00:51:26,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:26,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1418429191, now seen corresponding path program 3 times [2023-11-12 00:51:26,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:26,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538253954] [2023-11-12 00:51:26,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:26,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:26,495 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-12 00:51:26,496 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:26,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538253954] [2023-11-12 00:51:26,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538253954] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:26,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:26,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:51:26,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809048019] [2023-11-12 00:51:26,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:26,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:51:26,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:26,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:51:26,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:51:26,499 INFO L87 Difference]: Start difference. First operand 200 states and 533 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-12 00:51:26,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:26,607 INFO L93 Difference]: Finished difference Result 192 states and 446 transitions. [2023-11-12 00:51:26,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:51:26,608 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-12 00:51:26,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:26,609 INFO L225 Difference]: With dead ends: 192 [2023-11-12 00:51:26,609 INFO L226 Difference]: Without dead ends: 148 [2023-11-12 00:51:26,610 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-12 00:51:26,610 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 24 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:26,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 8 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:51:26,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-11-12 00:51:26,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2023-11-12 00:51:26,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 2.3197278911564627) internal successors, (341), 147 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:26,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 341 transitions. [2023-11-12 00:51:26,620 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 341 transitions. Word has length 15 [2023-11-12 00:51:26,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:26,620 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 341 transitions. [2023-11-12 00:51:26,620 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-12 00:51:26,621 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 341 transitions. [2023-11-12 00:51:26,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 00:51:26,622 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:26,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:51:26,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 00:51:26,622 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 00:51:26,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:26,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1586984654, now seen corresponding path program 1 times [2023-11-12 00:51:26,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:26,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660094459] [2023-11-12 00:51:26,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:26,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:26,910 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-12 00:51:26,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:26,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660094459] [2023-11-12 00:51:26,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660094459] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:26,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:26,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:51:26,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11268717] [2023-11-12 00:51:26,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:26,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:51:26,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:26,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:51:26,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:51:26,913 INFO L87 Difference]: Start difference. First operand 148 states and 341 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:27,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:27,039 INFO L93 Difference]: Finished difference Result 114 states and 224 transitions. [2023-11-12 00:51:27,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:51:27,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2023-11-12 00:51:27,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:27,041 INFO L225 Difference]: With dead ends: 114 [2023-11-12 00:51:27,041 INFO L226 Difference]: Without dead ends: 88 [2023-11-12 00:51:27,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:51:27,042 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 29 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:27,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 7 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:51:27,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-12 00:51:27,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-11-12 00:51:27,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.896551724137931) internal successors, (165), 87 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:27,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 165 transitions. [2023-11-12 00:51:27,047 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 165 transitions. Word has length 17 [2023-11-12 00:51:27,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:27,047 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 165 transitions. [2023-11-12 00:51:27,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:27,048 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 165 transitions. [2023-11-12 00:51:27,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-12 00:51:27,049 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:27,049 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:51:27,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 00:51:27,049 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 00:51:27,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:27,050 INFO L85 PathProgramCache]: Analyzing trace with hash 241587925, now seen corresponding path program 1 times [2023-11-12 00:51:27,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:27,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525689391] [2023-11-12 00:51:27,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:27,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:27,399 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-12 00:51:27,400 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:27,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525689391] [2023-11-12 00:51:27,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525689391] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:27,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:27,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:51:27,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538092349] [2023-11-12 00:51:27,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:27,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:51:27,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:27,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:51:27,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:51:27,402 INFO L87 Difference]: Start difference. First operand 88 states and 165 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:27,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:27,526 INFO L93 Difference]: Finished difference Result 70 states and 127 transitions. [2023-11-12 00:51:27,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:51:27,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2023-11-12 00:51:27,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:27,527 INFO L225 Difference]: With dead ends: 70 [2023-11-12 00:51:27,527 INFO L226 Difference]: Without dead ends: 62 [2023-11-12 00:51:27,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:51:27,528 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 29 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:27,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 5 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:51:27,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-12 00:51:27,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-11-12 00:51:27,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.8524590163934427) internal successors, (113), 61 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:27,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 113 transitions. [2023-11-12 00:51:27,531 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 113 transitions. Word has length 19 [2023-11-12 00:51:27,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:27,532 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 113 transitions. [2023-11-12 00:51:27,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:27,532 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 113 transitions. [2023-11-12 00:51:27,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-12 00:51:27,533 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:27,533 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-12 00:51:27,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 00:51:27,533 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 00:51:27,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:27,550 INFO L85 PathProgramCache]: Analyzing trace with hash -298536724, now seen corresponding path program 1 times [2023-11-12 00:51:27,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:27,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436256495] [2023-11-12 00:51:27,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:27,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:28,572 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-12 00:51:28,573 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:28,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436256495] [2023-11-12 00:51:28,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436256495] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:28,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:28,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 00:51:28,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702943081] [2023-11-12 00:51:28,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:28,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 00:51:28,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:28,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 00:51:28,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:51:28,575 INFO L87 Difference]: Start difference. First operand 62 states and 113 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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-12 00:51:28,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:28,777 INFO L93 Difference]: Finished difference Result 77 states and 136 transitions. [2023-11-12 00:51:28,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 00:51:28,777 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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-12 00:51:28,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:28,778 INFO L225 Difference]: With dead ends: 77 [2023-11-12 00:51:28,778 INFO L226 Difference]: Without dead ends: 42 [2023-11-12 00:51:28,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-12 00:51:28,779 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 32 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:28,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 13 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:51:28,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-12 00:51:28,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-11-12 00:51:28,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:28,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 65 transitions. [2023-11-12 00:51:28,781 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 65 transitions. Word has length 21 [2023-11-12 00:51:28,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:28,781 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 65 transitions. [2023-11-12 00:51:28,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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-12 00:51:28,782 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 65 transitions. [2023-11-12 00:51:28,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-12 00:51:28,782 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:28,782 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-12 00:51:28,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 00:51:28,783 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 00:51:28,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:28,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1001247026, now seen corresponding path program 2 times [2023-11-12 00:51:28,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:28,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568164194] [2023-11-12 00:51:28,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:28,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 00:51:28,846 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 00:51:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 00:51:28,919 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-12 00:51:28,919 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 00:51:28,920 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-12 00:51:28,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-12 00:51:28,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-12 00:51:28,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-12 00:51:28,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-12 00:51:28,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-12 00:51:28,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-12 00:51:28,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-12 00:51:28,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-12 00:51:28,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-12 00:51:28,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-12 00:51:28,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-12 00:51:28,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-12 00:51:28,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 00:51:28,928 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:51:28,934 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-12 00:51:28,934 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 00:51:28,981 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 00:51:28,984 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-12 00:51:28,985 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-12 00:51:28,997 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-12 00:51:29,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:51:29 BasicIcfg [2023-11-12 00:51:29,020 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 00:51:29,021 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 00:51:29,021 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 00:51:29,021 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 00:51:29,022 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:51:16" (3/4) ... [2023-11-12 00:51:29,023 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-12 00:51:29,024 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 00:51:29,025 INFO L158 Benchmark]: Toolchain (without parser) took 14659.04ms. Allocated memory was 136.3MB in the beginning and 295.7MB in the end (delta: 159.4MB). Free memory was 90.2MB in the beginning and 146.9MB in the end (delta: -56.8MB). Peak memory consumption was 105.8MB. Max. memory is 16.1GB. [2023-11-12 00:51:29,025 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 136.3MB. Free memory is still 79.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 00:51:29,026 INFO L158 Benchmark]: CACSL2BoogieTranslator took 651.51ms. Allocated memory is still 136.3MB. Free memory was 89.8MB in the beginning and 66.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-12 00:51:29,026 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.64ms. Allocated memory is still 136.3MB. Free memory was 66.7MB in the beginning and 64.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:51:29,026 INFO L158 Benchmark]: Boogie Preprocessor took 76.56ms. Allocated memory is still 136.3MB. Free memory was 64.3MB in the beginning and 62.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:51:29,027 INFO L158 Benchmark]: RCFGBuilder took 870.88ms. Allocated memory was 136.3MB in the beginning and 203.4MB in the end (delta: 67.1MB). Free memory was 62.2MB in the beginning and 147.4MB in the end (delta: -85.2MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2023-11-12 00:51:29,027 INFO L158 Benchmark]: TraceAbstraction took 12953.99ms. Allocated memory was 203.4MB in the beginning and 295.7MB in the end (delta: 92.3MB). Free memory was 147.4MB in the beginning and 146.9MB in the end (delta: 453.1kB). Peak memory consumption was 92.6MB. Max. memory is 16.1GB. [2023-11-12 00:51:29,027 INFO L158 Benchmark]: Witness Printer took 3.57ms. Allocated memory is still 295.7MB. Free memory is still 146.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 00:51:29,029 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.33ms. Allocated memory is still 136.3MB. Free memory is still 79.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 651.51ms. Allocated memory is still 136.3MB. Free memory was 89.8MB in the beginning and 66.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.64ms. Allocated memory is still 136.3MB. Free memory was 66.7MB in the beginning and 64.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.56ms. Allocated memory is still 136.3MB. Free memory was 64.3MB in the beginning and 62.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 870.88ms. Allocated memory was 136.3MB in the beginning and 203.4MB in the end (delta: 67.1MB). Free memory was 62.2MB in the beginning and 147.4MB in the end (delta: -85.2MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12953.99ms. Allocated memory was 203.4MB in the beginning and 295.7MB in the end (delta: 92.3MB). Free memory was 147.4MB in the beginning and 146.9MB in the end (delta: 453.1kB). Peak memory consumption was 92.6MB. Max. memory is 16.1GB. * Witness Printer took 3.57ms. Allocated memory is still 295.7MB. Free memory is still 146.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~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 132 PlacesBefore, 43 PlacesAfterwards, 125 TransitionsBefore, 34 TransitionsAfterwards, 2374 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 69 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 131 TotalNumberOfCompositions, 5918 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2811, independent: 2655, independent conditional: 0, independent unconditional: 2655, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1613, independent: 1577, independent conditional: 0, independent unconditional: 1577, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1613, independent: 1561, independent conditional: 0, independent unconditional: 1561, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 295, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 263, dependent conditional: 0, dependent unconditional: 263, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2811, independent: 1078, independent conditional: 0, independent unconditional: 1078, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 1613, unknown conditional: 0, unknown unconditional: 1613] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 83, Positive conditional cache size: 0, Positive unconditional cache size: 83, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L829] 0 pthread_t t1828; [L830] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1828={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L831] 0 pthread_t t1829; [L832] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1828={5:0}, t1829={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L833] 0 pthread_t t1830; [L834] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1828={5:0}, t1829={6:0}, t1830={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_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$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_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$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L801] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_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$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L807] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_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$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 3 return 0; [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EBX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828={5:0}, t1829={6:0}, t1830={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L847] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe002_power.opt_pso.oepc_pso.opt_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 832]: 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: 830]: 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: 834]: 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 7 procedures, 150 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 12.7s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 338 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 338 mSDsluCounter, 86 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1079 IncrementalHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 37 mSDtfsCounter, 1079 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=876occurred in iteration=0, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 860 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-12 00:51:29,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX --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 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:51:31,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:51:32,002 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-11-12 00:51:32,008 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:51:32,009 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:51:32,056 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:51:32,057 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:51:32,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:51:32,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:51:32,059 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:51:32,060 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:51:32,061 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:51:32,061 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:51:32,062 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:51:32,063 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:51:32,063 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:51:32,064 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 00:51:32,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 00:51:32,065 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:51:32,066 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:51:32,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:51:32,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:51:32,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:51:32,068 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 00:51:32,068 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 00:51:32,069 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 00:51:32,069 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:51:32,070 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 00:51:32,070 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-12 00:51:32,071 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-12 00:51:32,071 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:51:32,072 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:51:32,072 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:51:32,072 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:51:32,073 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 00:51:32,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:51:32,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:51:32,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:51:32,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:51:32,074 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-11-12 00:51:32,074 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-12 00:51:32,075 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:51:32,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:51:32,075 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_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX 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 -> 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 [2023-11-12 00:51:32,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:51:32,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:51:32,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:51:32,462 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:51:32,462 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:51:32,464 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-11-12 00:51:35,788 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:51:36,175 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:51:36,180 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-11-12 00:51:36,203 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/data/5f8ab39ad/47b58e424f0e43fca0258e8690a0c8f8/FLAG16637657c [2023-11-12 00:51:36,221 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/data/5f8ab39ad/47b58e424f0e43fca0258e8690a0c8f8 [2023-11-12 00:51:36,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:51:36,231 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:51:36,233 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:51:36,234 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:51:36,239 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:51:36,240 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:51:36" (1/1) ... [2023-11-12 00:51:36,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f6393eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:36, skipping insertion in model container [2023-11-12 00:51:36,241 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:51:36" (1/1) ... [2023-11-12 00:51:36,313 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:51:36,846 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:51:36,866 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:51:36,957 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:51:37,080 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 00:51:37,080 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 00:51:37,088 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:51:37,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:37 WrapperNode [2023-11-12 00:51:37,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:51:37,093 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:51:37,093 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:51:37,093 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:51:37,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:37" (1/1) ... [2023-11-12 00:51:37,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:37" (1/1) ... [2023-11-12 00:51:37,191 INFO L138 Inliner]: procedures = 179, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 134 [2023-11-12 00:51:37,191 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:51:37,192 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:51:37,193 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:51:37,193 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:51:37,202 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:37" (1/1) ... [2023-11-12 00:51:37,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:37" (1/1) ... [2023-11-12 00:51:37,218 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:37" (1/1) ... [2023-11-12 00:51:37,219 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:37" (1/1) ... [2023-11-12 00:51:37,234 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:37" (1/1) ... [2023-11-12 00:51:37,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:37" (1/1) ... [2023-11-12 00:51:37,250 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:37" (1/1) ... [2023-11-12 00:51:37,258 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:37" (1/1) ... [2023-11-12 00:51:37,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:51:37,271 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:51:37,271 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:51:37,271 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:51:37,272 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:37" (1/1) ... [2023-11-12 00:51:37,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:51:37,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:51:37,308 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:51:37,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:51:37,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 00:51:37,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:51:37,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:51:37,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:51:37,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-12 00:51:37,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-12 00:51:37,353 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 00:51:37,353 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 00:51:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 00:51:37,354 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 00:51:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-12 00:51:37,354 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-12 00:51:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 00:51:37,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:51:37,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:51:37,356 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 00:51:37,521 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:51:37,523 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:51:38,037 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:51:38,188 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:51:38,188 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 00:51:38,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:51:38 BoogieIcfgContainer [2023-11-12 00:51:38,191 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:51:38,194 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:51:38,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:51:38,197 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:51:38,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:51:36" (1/3) ... [2023-11-12 00:51:38,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e750c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:51:38, skipping insertion in model container [2023-11-12 00:51:38,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:51:37" (2/3) ... [2023-11-12 00:51:38,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e750c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:51:38, skipping insertion in model container [2023-11-12 00:51:38,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:51:38" (3/3) ... [2023-11-12 00:51:38,201 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-11-12 00:51:38,221 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:51:38,221 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-12 00:51:38,222 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 00:51:38,285 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 00:51:38,322 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-12 00:51:38,342 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 126 transitions, 264 flow [2023-11-12 00:51:38,347 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 126 transitions, 264 flow [2023-11-12 00:51:38,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 126 transitions, 264 flow [2023-11-12 00:51:38,435 INFO L124 PetriNetUnfolderBase]: 3/123 cut-off events. [2023-11-12 00:51:38,435 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 00:51:38,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 3/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-11-12 00:51:38,444 INFO L119 LiptonReduction]: Number of co-enabled transitions 2374 [2023-11-12 00:51:48,311 INFO L134 LiptonReduction]: Checked pairs total: 5474 [2023-11-12 00:51:48,312 INFO L136 LiptonReduction]: Total number of compositions: 130 [2023-11-12 00:51:48,320 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 34 transitions, 80 flow [2023-11-12 00:51:48,435 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 876 states, 863 states have (on average 3.2885283893395134) internal successors, (2838), 875 states have internal predecessors, (2838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:48,457 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:51:48,465 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;@33068933, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:51:48,466 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-12 00:51:48,470 INFO L276 IsEmpty]: Start isEmpty. Operand has 876 states, 863 states have (on average 3.2885283893395134) internal successors, (2838), 875 states have internal predecessors, (2838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:48,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2023-11-12 00:51:48,476 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:48,476 INFO L195 NwaCegarLoop]: trace histogram [1] [2023-11-12 00:51:48,477 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 00:51:48,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:48,485 INFO L85 PathProgramCache]: Analyzing trace with hash 563, now seen corresponding path program 1 times [2023-11-12 00:51:48,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:51:48,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878687775] [2023-11-12 00:51:48,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:48,499 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-12 00:51:48,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:51:48,508 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:48,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:48,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-12 00:51:48,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:51:48,640 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-12 00:51:48,640 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:51:48,641 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:51:48,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878687775] [2023-11-12 00:51:48,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1878687775] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:48,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:48,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-12 00:51:48,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355552208] [2023-11-12 00:51:48,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:48,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 00:51:48,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:51:48,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 00:51:48,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 00:51:48,685 INFO L87 Difference]: Start difference. First operand has 876 states, 863 states have (on average 3.2885283893395134) internal successors, (2838), 875 states have internal predecessors, (2838), 0 states have call successors, (0), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:48,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:48,829 INFO L93 Difference]: Finished difference Result 818 states and 2578 transitions. [2023-11-12 00:51:48,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 00:51:48,832 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2023-11-12 00:51:48,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:48,856 INFO L225 Difference]: With dead ends: 818 [2023-11-12 00:51:48,856 INFO L226 Difference]: Without dead ends: 818 [2023-11-12 00:51:48,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 00:51:48,861 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:48,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:51:48,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2023-11-12 00:51:48,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 818. [2023-11-12 00:51:48,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 813 states have (on average 3.1709717097170973) internal successors, (2578), 817 states have internal predecessors, (2578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:48,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 2578 transitions. [2023-11-12 00:51:48,997 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 2578 transitions. Word has length 1 [2023-11-12 00:51:48,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:48,997 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 2578 transitions. [2023-11-12 00:51:48,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:48,998 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 2578 transitions. [2023-11-12 00:51:48,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 00:51:48,999 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:48,999 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 00:51:49,010 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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)] Ended with exit code 0 [2023-11-12 00:51:49,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:49,210 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 00:51:49,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:49,211 INFO L85 PathProgramCache]: Analyzing trace with hash 531522757, now seen corresponding path program 1 times [2023-11-12 00:51:49,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:51:49,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461632769] [2023-11-12 00:51:49,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:49,213 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-12 00:51:49,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:51:49,215 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:49,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:49,307 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:51:49,308 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:51:49,336 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-12 00:51:49,337 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:51:49,337 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:51:49,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461632769] [2023-11-12 00:51:49,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461632769] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:49,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:49,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:51:49,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874368433] [2023-11-12 00:51:49,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:49,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:51:49,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:51:49,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:51:49,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:51:49,343 INFO L87 Difference]: Start difference. First operand 818 states and 2578 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-12 00:51:49,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:49,470 INFO L93 Difference]: Finished difference Result 670 states and 2079 transitions. [2023-11-12 00:51:49,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:51:49,471 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-12 00:51:49,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:49,477 INFO L225 Difference]: With dead ends: 670 [2023-11-12 00:51:49,477 INFO L226 Difference]: Without dead ends: 650 [2023-11-12 00:51:49,478 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-12 00:51:49,479 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 12 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:49,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:51:49,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2023-11-12 00:51:49,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2023-11-12 00:51:49,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 648 states have (on average 3.1296296296296298) internal successors, (2028), 649 states have internal predecessors, (2028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:49,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 2028 transitions. [2023-11-12 00:51:49,512 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 2028 transitions. Word has length 5 [2023-11-12 00:51:49,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:49,513 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 2028 transitions. [2023-11-12 00:51:49,513 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-12 00:51:49,513 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 2028 transitions. [2023-11-12 00:51:49,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 00:51:49,515 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:49,515 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:51:49,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:49,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:49,731 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 00:51:49,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:49,732 INFO L85 PathProgramCache]: Analyzing trace with hash -221006205, now seen corresponding path program 1 times [2023-11-12 00:51:49,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:51:49,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1063950191] [2023-11-12 00:51:49,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:49,733 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-12 00:51:49,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:51:49,735 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:49,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:49,860 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 00:51:49,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:51:49,926 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-12 00:51:49,928 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:51:49,928 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:51:49,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1063950191] [2023-11-12 00:51:49,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1063950191] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:49,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:49,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:51:49,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092559798] [2023-11-12 00:51:49,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:49,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:51:49,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:51:49,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:51:49,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:51:49,932 INFO L87 Difference]: Start difference. First operand 650 states and 2028 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:50,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:50,147 INFO L93 Difference]: Finished difference Result 510 states and 1351 transitions. [2023-11-12 00:51:50,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:51:50,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2023-11-12 00:51:50,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:50,152 INFO L225 Difference]: With dead ends: 510 [2023-11-12 00:51:50,152 INFO L226 Difference]: Without dead ends: 410 [2023-11-12 00:51:50,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-12 00:51:50,156 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 31 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:50,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 10 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:51:50,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2023-11-12 00:51:50,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2023-11-12 00:51:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 408 states have (on average 2.6176470588235294) internal successors, (1068), 409 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1068 transitions. [2023-11-12 00:51:50,179 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1068 transitions. Word has length 10 [2023-11-12 00:51:50,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:50,180 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 1068 transitions. [2023-11-12 00:51:50,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:50,180 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1068 transitions. [2023-11-12 00:51:50,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-12 00:51:50,188 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:50,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:51:50,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:50,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:50,400 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 00:51:50,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:50,401 INFO L85 PathProgramCache]: Analyzing trace with hash -114779214, now seen corresponding path program 1 times [2023-11-12 00:51:50,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:51:50,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977262143] [2023-11-12 00:51:50,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:50,402 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-12 00:51:50,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:51:50,404 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:50,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:50,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:51:50,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:51:50,591 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-12 00:51:50,591 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:51:50,591 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:51:50,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977262143] [2023-11-12 00:51:50,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977262143] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:50,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:50,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:51:50,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764649695] [2023-11-12 00:51:50,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:50,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:51:50,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:51:50,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:51:50,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:51:50,594 INFO L87 Difference]: Start difference. First operand 410 states and 1068 transitions. Second operand has 5 states, 5 states have (on average 2.6) 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-12 00:51:50,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:50,823 INFO L93 Difference]: Finished difference Result 262 states and 599 transitions. [2023-11-12 00:51:50,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:51:50,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) 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-12 00:51:50,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:50,825 INFO L225 Difference]: With dead ends: 262 [2023-11-12 00:51:50,825 INFO L226 Difference]: Without dead ends: 210 [2023-11-12 00:51:50,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:51:50,827 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 41 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:50,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 18 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:51:50,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-11-12 00:51:50,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2023-11-12 00:51:50,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 208 states have (on average 2.25) internal successors, (468), 209 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:50,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 468 transitions. [2023-11-12 00:51:50,836 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 468 transitions. Word has length 13 [2023-11-12 00:51:50,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:50,837 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 468 transitions. [2023-11-12 00:51:50,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) 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-12 00:51:50,837 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 468 transitions. [2023-11-12 00:51:50,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 00:51:50,838 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:50,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:51:50,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:51,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:51,050 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 00:51:51,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:51,051 INFO L85 PathProgramCache]: Analyzing trace with hash 797744333, now seen corresponding path program 1 times [2023-11-12 00:51:51,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:51:51,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121637848] [2023-11-12 00:51:51,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:51,052 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-12 00:51:51,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:51:51,053 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:51,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:51,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-12 00:51:51,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:51:51,255 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-12 00:51:51,255 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:51:51,256 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:51:51,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121637848] [2023-11-12 00:51:51,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121637848] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:51,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:51,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:51:51,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912313604] [2023-11-12 00:51:51,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:51,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:51:51,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:51:51,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:51:51,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:51:51,262 INFO L87 Difference]: Start difference. First operand 210 states and 468 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:51,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:51,591 INFO L93 Difference]: Finished difference Result 167 states and 380 transitions. [2023-11-12 00:51:51,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:51:51,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2023-11-12 00:51:51,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:51,595 INFO L225 Difference]: With dead ends: 167 [2023-11-12 00:51:51,595 INFO L226 Difference]: Without dead ends: 155 [2023-11-12 00:51:51,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:51:51,596 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 37 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:51,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 30 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:51:51,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-11-12 00:51:51,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2023-11-12 00:51:51,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 153 states have (on average 2.3398692810457518) internal successors, (358), 154 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:51,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 358 transitions. [2023-11-12 00:51:51,602 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 358 transitions. Word has length 17 [2023-11-12 00:51:51,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:51,603 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 358 transitions. [2023-11-12 00:51:51,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:51,603 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 358 transitions. [2023-11-12 00:51:51,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-12 00:51:51,604 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:51,604 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-12 00:51:51,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:51,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:51,817 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 00:51:51,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:51,817 INFO L85 PathProgramCache]: Analyzing trace with hash 437520925, now seen corresponding path program 1 times [2023-11-12 00:51:51,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:51:51,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [232293501] [2023-11-12 00:51:51,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:51,818 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-12 00:51:51,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:51:51,820 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:51,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:52,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-12 00:51:52,036 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:51:52,440 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-12 00:51:52,440 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:51:52,440 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:51:52,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [232293501] [2023-11-12 00:51:52,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [232293501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:52,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:52,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:51:52,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56530926] [2023-11-12 00:51:52,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:52,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:51:52,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:51:52,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:51:52,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:51:52,442 INFO L87 Difference]: Start difference. First operand 155 states and 358 transitions. Second operand has 5 states, 4 states have (on average 5.25) 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-12 00:51:52,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:52,622 INFO L93 Difference]: Finished difference Result 154 states and 357 transitions. [2023-11-12 00:51:52,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:51:52,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) 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-12 00:51:52,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:52,624 INFO L225 Difference]: With dead ends: 154 [2023-11-12 00:51:52,624 INFO L226 Difference]: Without dead ends: 154 [2023-11-12 00:51:52,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:51:52,625 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 11 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:52,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 9 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:51:52,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-11-12 00:51:52,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2023-11-12 00:51:52,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 2.3333333333333335) internal successors, (357), 153 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:52,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 357 transitions. [2023-11-12 00:51:52,630 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 357 transitions. Word has length 21 [2023-11-12 00:51:52,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:52,630 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 357 transitions. [2023-11-12 00:51:52,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) 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-12 00:51:52,631 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 357 transitions. [2023-11-12 00:51:52,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-12 00:51:52,631 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:52,631 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-12 00:51:52,646 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:52,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:52,841 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 00:51:52,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:52,842 INFO L85 PathProgramCache]: Analyzing trace with hash 437520884, now seen corresponding path program 1 times [2023-11-12 00:51:52,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:51:52,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2066865256] [2023-11-12 00:51:52,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:52,843 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-12 00:51:52,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:51:52,844 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:52,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:52,975 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-12 00:51:52,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:51:53,036 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-12 00:51:53,037 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:51:53,037 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:51:53,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2066865256] [2023-11-12 00:51:53,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2066865256] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:53,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:53,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:51:53,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576353447] [2023-11-12 00:51:53,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:53,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:51:53,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:51:53,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:51:53,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:51:53,040 INFO L87 Difference]: Start difference. First operand 154 states and 357 transitions. Second operand has 5 states, 4 states have (on average 5.25) 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-12 00:51:53,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:53,185 INFO L93 Difference]: Finished difference Result 238 states and 540 transitions. [2023-11-12 00:51:53,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:51:53,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) 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-12 00:51:53,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:53,187 INFO L225 Difference]: With dead ends: 238 [2023-11-12 00:51:53,187 INFO L226 Difference]: Without dead ends: 124 [2023-11-12 00:51:53,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 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-12 00:51:53,188 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 11 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:53,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 6 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:51:53,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-12 00:51:53,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2023-11-12 00:51:53,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 2.2195121951219514) internal successors, (273), 123 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:53,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 273 transitions. [2023-11-12 00:51:53,194 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 273 transitions. Word has length 21 [2023-11-12 00:51:53,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:53,194 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 273 transitions. [2023-11-12 00:51:53,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) 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-12 00:51:53,195 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 273 transitions. [2023-11-12 00:51:53,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-12 00:51:53,195 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:53,195 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-12 00:51:53,221 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-12 00:51:53,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:53,409 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 00:51:53,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:53,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1698769596, now seen corresponding path program 2 times [2023-11-12 00:51:53,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:51:53,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1872556204] [2023-11-12 00:51:53,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-12 00:51:53,410 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-12 00:51:53,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:51:53,411 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:53,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:53,538 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-12 00:51:53,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:51:53,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-12 00:51:53,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:51:53,602 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-12 00:51:53,602 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:51:53,602 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:51:53,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1872556204] [2023-11-12 00:51:53,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1872556204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:53,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:53,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:51:53,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906274626] [2023-11-12 00:51:53,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:53,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:51:53,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:51:53,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:51:53,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:51:53,605 INFO L87 Difference]: Start difference. First operand 124 states and 273 transitions. Second operand has 5 states, 4 states have (on average 5.25) 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-12 00:51:53,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:53,758 INFO L93 Difference]: Finished difference Result 175 states and 380 transitions. [2023-11-12 00:51:53,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:51:53,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) 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-12 00:51:53,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:53,759 INFO L225 Difference]: With dead ends: 175 [2023-11-12 00:51:53,759 INFO L226 Difference]: Without dead ends: 98 [2023-11-12 00:51:53,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 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-12 00:51:53,760 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:53,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 5 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:51:53,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-12 00:51:53,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-11-12 00:51:53,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 2.154639175257732) internal successors, (209), 97 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:53,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 209 transitions. [2023-11-12 00:51:53,765 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 209 transitions. Word has length 21 [2023-11-12 00:51:53,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:53,765 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 209 transitions. [2023-11-12 00:51:53,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) 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-12 00:51:53,766 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 209 transitions. [2023-11-12 00:51:53,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-12 00:51:53,766 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:53,766 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-12 00:51:53,785 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:53,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:53,967 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 00:51:53,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:53,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1741953408, now seen corresponding path program 3 times [2023-11-12 00:51:53,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:51:53,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872800750] [2023-11-12 00:51:53,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 00:51:53,968 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-12 00:51:53,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:51:53,970 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:54,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:54,109 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-12 00:51:54,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:51:54,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-12 00:51:54,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:51:54,160 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-12 00:51:54,160 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:51:54,160 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:51:54,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872800750] [2023-11-12 00:51:54,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [872800750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:54,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:54,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:51:54,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624436282] [2023-11-12 00:51:54,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:54,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:51:54,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:51:54,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:51:54,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:51:54,164 INFO L87 Difference]: Start difference. First operand 98 states and 209 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-12 00:51:54,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:54,334 INFO L93 Difference]: Finished difference Result 128 states and 266 transitions. [2023-11-12 00:51:54,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:51:54,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-12 00:51:54,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:54,335 INFO L225 Difference]: With dead ends: 128 [2023-11-12 00:51:54,335 INFO L226 Difference]: Without dead ends: 62 [2023-11-12 00:51:54,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 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-12 00:51:54,336 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:54,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 8 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:51:54,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-12 00:51:54,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-11-12 00:51:54,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.8524590163934427) internal successors, (113), 61 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:54,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 113 transitions. [2023-11-12 00:51:54,340 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 113 transitions. Word has length 21 [2023-11-12 00:51:54,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:54,340 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 113 transitions. [2023-11-12 00:51:54,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-12 00:51:54,340 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 113 transitions. [2023-11-12 00:51:54,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-12 00:51:54,341 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:54,341 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-12 00:51:54,358 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-12 00:51:54,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:54,546 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 00:51:54,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:54,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1464173852, now seen corresponding path program 4 times [2023-11-12 00:51:54,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:51:54,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399084309] [2023-11-12 00:51:54,547 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-12 00:51:54,547 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-12 00:51:54,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:51:54,549 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:54,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:54,687 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-12 00:51:54,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:51:54,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-12 00:51:54,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:51:55,007 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-12 00:51:55,008 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:51:55,008 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:51:55,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399084309] [2023-11-12 00:51:55,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399084309] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:55,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:51:55,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 00:51:55,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599058080] [2023-11-12 00:51:55,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:55,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 00:51:55,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:51:55,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 00:51:55,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:51:55,011 INFO L87 Difference]: Start difference. First operand 62 states and 113 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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-12 00:51:55,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:55,283 INFO L93 Difference]: Finished difference Result 77 states and 136 transitions. [2023-11-12 00:51:55,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 00:51:55,284 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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-12 00:51:55,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:55,284 INFO L225 Difference]: With dead ends: 77 [2023-11-12 00:51:55,284 INFO L226 Difference]: Without dead ends: 42 [2023-11-12 00:51:55,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-12 00:51:55,286 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 28 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:55,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 14 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:51:55,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-12 00:51:55,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-11-12 00:51:55,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:55,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 65 transitions. [2023-11-12 00:51:55,289 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 65 transitions. Word has length 21 [2023-11-12 00:51:55,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:55,289 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 65 transitions. [2023-11-12 00:51:55,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 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-12 00:51:55,290 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 65 transitions. [2023-11-12 00:51:55,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-12 00:51:55,290 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:55,290 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-12 00:51:55,305 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:55,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:55,503 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 00:51:55,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:55,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1458511716, now seen corresponding path program 5 times [2023-11-12 00:51:55,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:51:55,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801461869] [2023-11-12 00:51:55,504 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-12 00:51:55,504 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-12 00:51:55,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:51:55,506 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:55,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:55,658 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-12 00:51:55,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-12 00:51:55,658 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 00:51:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 00:51:55,842 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2023-11-12 00:51:55,843 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 00:51:55,844 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-12 00:51:55,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-12 00:51:55,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-12 00:51:55,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-12 00:51:55,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-12 00:51:55,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-12 00:51:55,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-12 00:51:55,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-12 00:51:55,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-12 00:51:55,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-12 00:51:55,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-12 00:51:55,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-12 00:51:55,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-12 00:51:55,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:56,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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-12 00:51:56,057 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2023-11-12 00:51:56,063 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-12 00:51:56,063 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 00:51:56,124 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 00:51:56,126 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-12 00:51:56,127 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-12 00:51:56,144 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-12 00:51:56,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:51:56 BasicIcfg [2023-11-12 00:51:56,157 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 00:51:56,158 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 00:51:56,158 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 00:51:56,158 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 00:51:56,159 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:51:38" (3/4) ... [2023-11-12 00:51:56,160 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-12 00:51:56,162 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 00:51:56,162 INFO L158 Benchmark]: Toolchain (without parser) took 19931.01ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 69.4MB in the beginning and 57.2MB in the end (delta: 12.1MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2023-11-12 00:51:56,163 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 62.9MB. Free memory was 39.2MB in the beginning and 39.1MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 00:51:56,163 INFO L158 Benchmark]: CACSL2BoogieTranslator took 856.37ms. Allocated memory is still 94.4MB. Free memory was 69.2MB in the beginning and 67.1MB in the end (delta: 2.0MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2023-11-12 00:51:56,164 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.91ms. Allocated memory is still 94.4MB. Free memory was 67.1MB in the beginning and 64.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:51:56,164 INFO L158 Benchmark]: Boogie Preprocessor took 77.46ms. Allocated memory is still 94.4MB. Free memory was 64.6MB in the beginning and 62.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:51:56,165 INFO L158 Benchmark]: RCFGBuilder took 920.69ms. Allocated memory is still 94.4MB. Free memory was 62.5MB in the beginning and 55.1MB in the end (delta: 7.4MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. [2023-11-12 00:51:56,166 INFO L158 Benchmark]: TraceAbstraction took 17963.37ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 54.1MB in the beginning and 57.2MB in the end (delta: -3.2MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2023-11-12 00:51:56,166 INFO L158 Benchmark]: Witness Printer took 4.01ms. Allocated memory is still 113.2MB. Free memory is still 57.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 00:51:56,168 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.32ms. Allocated memory is still 62.9MB. Free memory was 39.2MB in the beginning and 39.1MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 856.37ms. Allocated memory is still 94.4MB. Free memory was 69.2MB in the beginning and 67.1MB in the end (delta: 2.0MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.91ms. Allocated memory is still 94.4MB. Free memory was 67.1MB in the beginning and 64.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.46ms. Allocated memory is still 94.4MB. Free memory was 64.6MB in the beginning and 62.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 920.69ms. Allocated memory is still 94.4MB. Free memory was 62.5MB in the beginning and 55.1MB in the end (delta: 7.4MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. * TraceAbstraction took 17963.37ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 54.1MB in the beginning and 57.2MB in the end (delta: -3.2MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * Witness Printer took 4.01ms. Allocated memory is still 113.2MB. Free memory is still 57.2MB. 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~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.0s, 133 PlacesBefore, 43 PlacesAfterwards, 126 TransitionsBefore, 34 TransitionsAfterwards, 2374 CoEnabledTransitionPairs, 6 FixpointIterations, 47 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 130 TotalNumberOfCompositions, 5474 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2812, independent: 2676, independent conditional: 0, independent unconditional: 2676, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1624, independent: 1588, independent conditional: 0, independent unconditional: 1588, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1624, independent: 1572, independent conditional: 0, independent unconditional: 1572, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 376, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 333, dependent conditional: 0, dependent unconditional: 333, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2812, independent: 1088, independent conditional: 0, independent unconditional: 1088, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 1624, unknown conditional: 0, unknown unconditional: 1624] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 104, Positive conditional cache size: 0, Positive unconditional cache size: 104, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L829] 0 pthread_t t1828; [L830] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1828={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L831] 0 pthread_t t1829; [L832] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1828={3:0}, t1829={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L833] 0 pthread_t t1830; [L834] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1828={3:0}, t1829={7:0}, t1830={11:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_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$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_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$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L801] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_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$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L807] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_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$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 3 return 0; [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EBX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828={3:0}, t1829={7:0}, t1830={11:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L847] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe002_power.opt_pso.oepc_pso.opt_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 832]: 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: 830]: 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: 834]: 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 7 procedures, 151 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 17.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 194 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 194 mSDsluCounter, 106 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 956 IncrementalHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 35 mSDtfsCounter, 956 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=876occurred in iteration=0, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 141 ConstructedInterpolants, 0 QuantifiedInterpolants, 1177 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1235 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-12 00:51:56,196 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_674d5085-5d74-40d0-8ef4-ce52ed4f1636/bin/utaipan-verify-NcY6lQBIFX/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