./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/bin/utaipan-verify-FOvIYxoinp/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/bin/utaipan-verify-FOvIYxoinp/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/bin/utaipan-verify-FOvIYxoinp/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/bin/utaipan-verify-FOvIYxoinp/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/bin/utaipan-verify-FOvIYxoinp/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/bin/utaipan-verify-FOvIYxoinp --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 20:33:36,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 20:33:36,689 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/bin/utaipan-verify-FOvIYxoinp/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-06 20:33:36,695 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 20:33:36,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 20:33:36,720 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 20:33:36,721 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 20:33:36,721 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 20:33:36,722 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 20:33:36,723 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 20:33:36,724 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-06 20:33:36,724 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-06 20:33:36,725 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-06 20:33:36,726 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-06 20:33:36,726 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-06 20:33:36,727 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-06 20:33:36,727 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-06 20:33:36,728 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-06 20:33:36,729 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-06 20:33:36,729 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-06 20:33:36,730 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-06 20:33:36,731 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-06 20:33:36,732 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 20:33:36,732 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 20:33:36,733 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 20:33:36,733 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 20:33:36,734 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 20:33:36,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 20:33:36,735 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 20:33:36,736 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 20:33:36,736 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 20:33:36,736 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 20:33:36,737 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 20:33:36,737 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 20:33:36,737 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 20:33:36,738 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 20:33:36,738 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 20:33:36,738 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 20:33:36,739 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 20:33:36,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:33:36,740 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 20:33:36,740 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 20:33:36,740 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-06 20:33:36,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 20:33:36,741 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-06 20:33:36,742 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 20:33:36,742 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_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/bin/utaipan-verify-FOvIYxoinp/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_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/bin/utaipan-verify-FOvIYxoinp Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 [2023-11-06 20:33:37,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 20:33:37,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 20:33:37,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 20:33:37,089 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 20:33:37,091 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 20:33:37,092 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/bin/utaipan-verify-FOvIYxoinp/../../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-06 20:33:40,155 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 20:33:40,589 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 20:33:40,590 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-06 20:33:40,610 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/bin/utaipan-verify-FOvIYxoinp/data/e2e73d9b4/d7ad6ae8e78842189cf6feb376181ebb/FLAG09e3fcee7 [2023-11-06 20:33:40,627 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/bin/utaipan-verify-FOvIYxoinp/data/e2e73d9b4/d7ad6ae8e78842189cf6feb376181ebb [2023-11-06 20:33:40,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 20:33:40,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 20:33:40,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 20:33:40,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 20:33:40,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 20:33:40,639 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:33:40" (1/1) ... [2023-11-06 20:33:40,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@504a9186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:33:40, skipping insertion in model container [2023-11-06 20:33:40,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:33:40" (1/1) ... [2023-11-06 20:33:40,703 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 20:33:41,199 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:33:41,215 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 20:33:41,318 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:33:41,369 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 20:33:41,369 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 20:33:41,377 INFO L206 MainTranslator]: Completed translation [2023-11-06 20:33:41,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:33:41 WrapperNode [2023-11-06 20:33:41,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 20:33:41,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 20:33:41,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 20:33:41,379 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 20:33:41,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:33:41" (1/1) ... [2023-11-06 20:33:41,424 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:33:41" (1/1) ... [2023-11-06 20:33:41,478 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2023-11-06 20:33:41,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 20:33:41,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 20:33:41,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 20:33:41,480 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 20:33:41,490 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:33:41" (1/1) ... [2023-11-06 20:33:41,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:33:41" (1/1) ... [2023-11-06 20:33:41,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:33:41" (1/1) ... [2023-11-06 20:33:41,515 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:33:41" (1/1) ... [2023-11-06 20:33:41,524 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:33:41" (1/1) ... [2023-11-06 20:33:41,533 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:33:41" (1/1) ... [2023-11-06 20:33:41,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:33:41" (1/1) ... [2023-11-06 20:33:41,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:33:41" (1/1) ... [2023-11-06 20:33:41,542 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 20:33:41,543 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 20:33:41,543 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 20:33:41,543 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 20:33:41,549 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:33:41" (1/1) ... [2023-11-06 20:33:41,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:33:41,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:33:41,584 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 20:33:41,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 20:33:41,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 20:33:41,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 20:33:41,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 20:33:41,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 20:33:41,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 20:33:41,665 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 20:33:41,667 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 20:33:41,667 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 20:33:41,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 20:33:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 20:33:41,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 20:33:41,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 20:33:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 20:33:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 20:33:41,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 20:33:41,671 WARN L210 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 20:33:41,847 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 20:33:41,849 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 20:33:42,289 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 20:33:42,487 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 20:33:42,488 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 20:33:42,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:33:42 BoogieIcfgContainer [2023-11-06 20:33:42,492 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 20:33:42,497 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 20:33:42,498 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 20:33:42,501 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 20:33:42,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:33:40" (1/3) ... [2023-11-06 20:33:42,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@830ba3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:33:42, skipping insertion in model container [2023-11-06 20:33:42,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:33:41" (2/3) ... [2023-11-06 20:33:42,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@830ba3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:33:42, skipping insertion in model container [2023-11-06 20:33:42,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:33:42" (3/3) ... [2023-11-06 20:33:42,507 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-06 20:33:42,557 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 20:33:42,557 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-06 20:33:42,558 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 20:33:42,632 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 20:33:42,679 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-06 20:33:42,699 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 124 transitions, 260 flow [2023-11-06 20:33:42,704 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 124 transitions, 260 flow [2023-11-06 20:33:42,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 124 transitions, 260 flow [2023-11-06 20:33:42,800 INFO L124 PetriNetUnfolderBase]: 3/121 cut-off events. [2023-11-06 20:33:42,800 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 20:33:42,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 3/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-11-06 20:33:42,812 INFO L119 LiptonReduction]: Number of co-enabled transitions 2356 [2023-11-06 20:33:49,396 INFO L134 LiptonReduction]: Checked pairs total: 6463 [2023-11-06 20:33:49,396 INFO L136 LiptonReduction]: Total number of compositions: 124 [2023-11-06 20:33:49,407 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 34 transitions, 80 flow [2023-11-06 20:33:49,503 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 860 states, 849 states have (on average 3.2909305064782095) internal successors, (2794), 859 states have internal predecessors, (2794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:49,524 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 20:33:49,530 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;@756d276c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-06 20:33:49,530 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-06 20:33:49,534 INFO L276 IsEmpty]: Start isEmpty. Operand has 860 states, 849 states have (on average 3.2909305064782095) internal successors, (2794), 859 states have internal predecessors, (2794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:49,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2023-11-06 20:33:49,538 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:33:49,539 INFO L195 NwaCegarLoop]: trace histogram [1] [2023-11-06 20:33:49,539 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 20:33:49,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:33:49,543 INFO L85 PathProgramCache]: Analyzing trace with hash 550, now seen corresponding path program 1 times [2023-11-06 20:33:49,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:33:49,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801055805] [2023-11-06 20:33:49,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:33:49,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:33:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:33:49,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:33:49,692 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:33:49,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801055805] [2023-11-06 20:33:49,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801055805] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:33:49,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:33:49,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 20:33:49,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659442312] [2023-11-06 20:33:49,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:33:49,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 20:33:49,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:33:49,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 20:33:49,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 20:33:49,742 INFO L87 Difference]: Start difference. First operand has 860 states, 849 states have (on average 3.2909305064782095) internal successors, (2794), 859 states have internal predecessors, (2794), 0 states have call successors, (0), 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-06 20:33:49,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:33:49,880 INFO L93 Difference]: Finished difference Result 810 states and 2556 transitions. [2023-11-06 20:33:49,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 20:33:49,883 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-06 20:33:49,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:33:49,922 INFO L225 Difference]: With dead ends: 810 [2023-11-06 20:33:49,922 INFO L226 Difference]: Without dead ends: 810 [2023-11-06 20:33:49,923 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-06 20:33:49,927 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:33:49,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:33:49,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2023-11-06 20:33:50,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 810. [2023-11-06 20:33:50,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 805 states have (on average 3.1751552795031057) internal successors, (2556), 809 states have internal predecessors, (2556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:50,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 2556 transitions. [2023-11-06 20:33:50,066 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 2556 transitions. Word has length 1 [2023-11-06 20:33:50,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:33:50,066 INFO L495 AbstractCegarLoop]: Abstraction has 810 states and 2556 transitions. [2023-11-06 20:33:50,067 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-06 20:33:50,067 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 2556 transitions. [2023-11-06 20:33:50,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-06 20:33:50,068 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:33:50,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:33:50,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 20:33:50,069 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 20:33:50,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:33:50,070 INFO L85 PathProgramCache]: Analyzing trace with hash 837391373, now seen corresponding path program 1 times [2023-11-06 20:33:50,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:33:50,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890826054] [2023-11-06 20:33:50,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:33:50,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:33:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:33: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-06 20:33:50,591 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:33:50,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890826054] [2023-11-06 20:33:50,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890826054] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:33:50,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:33:50,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 20:33:50,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893307325] [2023-11-06 20:33:50,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:33:50,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:33:50,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:33:50,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:33:50,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:33:50,596 INFO L87 Difference]: Start difference. First operand 810 states and 2556 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:50,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:33:50,684 INFO L93 Difference]: Finished difference Result 670 states and 2079 transitions. [2023-11-06 20:33:50,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:33:50,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2023-11-06 20:33:50,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:33:50,691 INFO L225 Difference]: With dead ends: 670 [2023-11-06 20:33:50,691 INFO L226 Difference]: Without dead ends: 650 [2023-11-06 20:33:50,692 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-06 20:33:50,693 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:33:50,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:33:50,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2023-11-06 20:33:50,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2023-11-06 20:33:50,720 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-06 20:33:50,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 2028 transitions. [2023-11-06 20:33:50,725 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 2028 transitions. Word has length 7 [2023-11-06 20:33:50,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:33:50,726 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 2028 transitions. [2023-11-06 20:33:50,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:50,728 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 2028 transitions. [2023-11-06 20:33:50,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 20:33:50,730 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:33:50,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:33:50,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 20:33:50,731 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 20:33:50,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:33:50,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1574307407, now seen corresponding path program 1 times [2023-11-06 20:33:50,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:33:50,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035249888] [2023-11-06 20:33:50,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:33:50,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:33:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:33:51,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:33:51,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:33:51,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035249888] [2023-11-06 20:33:51,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035249888] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:33:51,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:33:51,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 20:33:51,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353776185] [2023-11-06 20:33:51,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:33:51,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:33:51,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:33:51,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:33:51,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:33:51,104 INFO L87 Difference]: Start difference. First operand 650 states and 2028 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:51,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:33:51,192 INFO L93 Difference]: Finished difference Result 640 states and 1990 transitions. [2023-11-06 20:33:51,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:33:51,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2023-11-06 20:33:51,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:33:51,200 INFO L225 Difference]: With dead ends: 640 [2023-11-06 20:33:51,200 INFO L226 Difference]: Without dead ends: 640 [2023-11-06 20:33:51,201 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-06 20:33:51,205 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:33:51,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:33:51,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2023-11-06 20:33:51,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2023-11-06 20:33:51,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 638 states have (on average 3.1191222570532915) internal successors, (1990), 639 states have internal predecessors, (1990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:51,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1990 transitions. [2023-11-06 20:33:51,237 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1990 transitions. Word has length 9 [2023-11-06 20:33:51,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:33:51,237 INFO L495 AbstractCegarLoop]: Abstraction has 640 states and 1990 transitions. [2023-11-06 20:33:51,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:51,238 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1990 transitions. [2023-11-06 20:33:51,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 20:33:51,241 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:33:51,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:33:51,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 20:33:51,242 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 20:33:51,243 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:33:51,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1558889914, now seen corresponding path program 1 times [2023-11-06 20:33:51,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:33:51,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454787671] [2023-11-06 20:33:51,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:33:51,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:33:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:33:51,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:33:51,986 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:33:51,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454787671] [2023-11-06 20:33:51,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454787671] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:33:51,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:33:51,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 20:33:51,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129025791] [2023-11-06 20:33:51,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:33:51,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 20:33:51,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:33:51,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 20:33:51,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 20:33:51,995 INFO L87 Difference]: Start difference. First operand 640 states and 1990 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-06 20:33:52,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:33:52,188 INFO L93 Difference]: Finished difference Result 540 states and 1655 transitions. [2023-11-06 20:33:52,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 20:33:52,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-06 20:33:52,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:33:52,193 INFO L225 Difference]: With dead ends: 540 [2023-11-06 20:33:52,193 INFO L226 Difference]: Without dead ends: 440 [2023-11-06 20:33:52,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 20:33:52,194 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 33 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:33:52,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 36 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:33:52,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2023-11-06 20:33:52,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2023-11-06 20:33:52,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 3.0068337129840548) internal successors, (1320), 439 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:52,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions. [2023-11-06 20:33:52,213 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 10 [2023-11-06 20:33:52,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:33:52,214 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions. [2023-11-06 20:33:52,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-06 20:33:52,214 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions. [2023-11-06 20:33:52,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 20:33:52,216 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:33:52,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:33:52,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 20:33:52,217 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 20:33:52,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:33:52,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1558888308, now seen corresponding path program 1 times [2023-11-06 20:33:52,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:33:52,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902754017] [2023-11-06 20:33:52,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:33:52,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:33:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:33:52,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:33:52,621 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:33:52,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902754017] [2023-11-06 20:33:52,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902754017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:33:52,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:33:52,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 20:33:52,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071716029] [2023-11-06 20:33:52,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:33:52,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:33:52,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:33:52,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:33:52,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:33:52,625 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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-06 20:33:52,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:33:52,696 INFO L93 Difference]: Finished difference Result 434 states and 1298 transitions. [2023-11-06 20:33:52,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:33:52,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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-06 20:33:52,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:33:52,701 INFO L225 Difference]: With dead ends: 434 [2023-11-06 20:33:52,701 INFO L226 Difference]: Without dead ends: 434 [2023-11-06 20:33:52,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:33:52,703 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 3 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:33:52,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 5 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:33:52,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2023-11-06 20:33:52,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2023-11-06 20:33:52,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 2.9976905311778292) internal successors, (1298), 433 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:52,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1298 transitions. [2023-11-06 20:33:52,722 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1298 transitions. Word has length 10 [2023-11-06 20:33:52,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:33:52,722 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 1298 transitions. [2023-11-06 20:33:52,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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-06 20:33:52,723 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1298 transitions. [2023-11-06 20:33:52,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 20:33:52,725 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:33:52,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:33:52,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 20:33:52,725 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 20:33:52,726 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:33:52,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1018147744, now seen corresponding path program 1 times [2023-11-06 20:33:52,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:33:52,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096935572] [2023-11-06 20:33:52,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:33:52,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:33:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:33:53,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:33:53,397 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:33:53,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096935572] [2023-11-06 20:33:53,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096935572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:33:53,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:33:53,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 20:33:53,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351850616] [2023-11-06 20:33:53,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:33:53,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 20:33:53,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:33:53,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 20:33:53,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 20:33:53,401 INFO L87 Difference]: Start difference. First operand 434 states and 1298 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:53,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:33:53,539 INFO L93 Difference]: Finished difference Result 470 states and 1409 transitions. [2023-11-06 20:33:53,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 20:33:53,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-06 20:33:53,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:33:53,544 INFO L225 Difference]: With dead ends: 470 [2023-11-06 20:33:53,544 INFO L226 Difference]: Without dead ends: 470 [2023-11-06 20:33:53,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 20:33:53,546 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:33:53,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 12 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:33:53,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2023-11-06 20:33:53,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2023-11-06 20:33:53,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 3.0042643923240937) internal successors, (1409), 469 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:53,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1409 transitions. [2023-11-06 20:33:53,570 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1409 transitions. Word has length 11 [2023-11-06 20:33:53,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:33:53,571 INFO L495 AbstractCegarLoop]: Abstraction has 470 states and 1409 transitions. [2023-11-06 20:33:53,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:53,571 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1409 transitions. [2023-11-06 20:33:53,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 20:33:53,574 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:33:53,574 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:33:53,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 20:33:53,575 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 20:33:53,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:33:53,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1080881824, now seen corresponding path program 2 times [2023-11-06 20:33:53,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:33:53,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145516845] [2023-11-06 20:33:53,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:33:53,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:33:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:33:54,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:33:54,046 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:33:54,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145516845] [2023-11-06 20:33:54,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145516845] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:33:54,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:33:54,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 20:33:54,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135221993] [2023-11-06 20:33:54,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:33:54,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 20:33:54,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:33:54,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 20:33:54,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 20:33:54,049 INFO L87 Difference]: Start difference. First operand 470 states and 1409 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:54,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:33:54,170 INFO L93 Difference]: Finished difference Result 458 states and 1365 transitions. [2023-11-06 20:33:54,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 20:33:54,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-06 20:33:54,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:33:54,176 INFO L225 Difference]: With dead ends: 458 [2023-11-06 20:33:54,176 INFO L226 Difference]: Without dead ends: 458 [2023-11-06 20:33:54,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 20:33:54,177 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:33:54,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 11 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:33:54,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2023-11-06 20:33:54,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2023-11-06 20:33:54,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 2.9868708971553612) internal successors, (1365), 457 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:54,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1365 transitions. [2023-11-06 20:33:54,199 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1365 transitions. Word has length 11 [2023-11-06 20:33:54,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:33:54,200 INFO L495 AbstractCegarLoop]: Abstraction has 458 states and 1365 transitions. [2023-11-06 20:33:54,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:54,200 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1365 transitions. [2023-11-06 20:33:54,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 20:33:54,201 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:33:54,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:33:54,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 20:33:54,202 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 20:33:54,203 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:33:54,203 INFO L85 PathProgramCache]: Analyzing trace with hash -852404892, now seen corresponding path program 1 times [2023-11-06 20:33:54,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:33:54,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089852632] [2023-11-06 20:33:54,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:33:54,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:33:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:33:54,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:33:54,943 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:33:54,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089852632] [2023-11-06 20:33:54,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089852632] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:33:54,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:33:54,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 20:33:54,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938801141] [2023-11-06 20:33:54,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:33:54,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 20:33:54,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:33:54,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 20:33:54,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 20:33:54,945 INFO L87 Difference]: Start difference. First operand 458 states and 1365 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-06 20:33:55,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:33:55,071 INFO L93 Difference]: Finished difference Result 658 states and 1882 transitions. [2023-11-06 20:33:55,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 20:33:55,072 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-06 20:33:55,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:33:55,078 INFO L225 Difference]: With dead ends: 658 [2023-11-06 20:33:55,078 INFO L226 Difference]: Without dead ends: 634 [2023-11-06 20:33:55,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 20:33:55,080 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:33:55,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 4 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:33:55,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2023-11-06 20:33:55,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 538. [2023-11-06 20:33:55,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 2.908752327746741) internal successors, (1562), 537 states have internal predecessors, (1562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:55,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1562 transitions. [2023-11-06 20:33:55,105 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1562 transitions. Word has length 12 [2023-11-06 20:33:55,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:33:55,105 INFO L495 AbstractCegarLoop]: Abstraction has 538 states and 1562 transitions. [2023-11-06 20:33:55,106 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-06 20:33:55,106 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1562 transitions. [2023-11-06 20:33:55,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 20:33:55,107 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:33:55,107 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:33:55,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 20:33:55,108 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 20:33:55,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:33:55,109 INFO L85 PathProgramCache]: Analyzing trace with hash -852020461, now seen corresponding path program 1 times [2023-11-06 20:33:55,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:33:55,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012783455] [2023-11-06 20:33:55,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:33:55,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:33:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:33:55,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:33:55,508 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:33:55,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012783455] [2023-11-06 20:33:55,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012783455] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:33:55,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:33:55,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 20:33:55,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901983457] [2023-11-06 20:33:55,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:33:55,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 20:33:55,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:33:55,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 20:33:55,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 20:33:55,512 INFO L87 Difference]: Start difference. First operand 538 states and 1562 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-06 20:33:55,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:33:55,645 INFO L93 Difference]: Finished difference Result 534 states and 1547 transitions. [2023-11-06 20:33:55,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 20:33:55,646 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-06 20:33:55,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:33:55,652 INFO L225 Difference]: With dead ends: 534 [2023-11-06 20:33:55,652 INFO L226 Difference]: Without dead ends: 534 [2023-11-06 20:33:55,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-06 20:33:55,654 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 21 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:33:55,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 10 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:33:55,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2023-11-06 20:33:55,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 530. [2023-11-06 20:33:55,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 529 states have (on average 2.90359168241966) internal successors, (1536), 529 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:55,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1536 transitions. [2023-11-06 20:33:55,685 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1536 transitions. Word has length 12 [2023-11-06 20:33:55,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:33:55,685 INFO L495 AbstractCegarLoop]: Abstraction has 530 states and 1536 transitions. [2023-11-06 20:33:55,689 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-06 20:33:55,690 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1536 transitions. [2023-11-06 20:33:55,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 20:33:55,692 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:33:55,692 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:33:55,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 20:33:55,693 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 20:33:55,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:33:55,693 INFO L85 PathProgramCache]: Analyzing trace with hash -857246143, now seen corresponding path program 1 times [2023-11-06 20:33:55,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:33:55,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970806924] [2023-11-06 20:33:55,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:33:55,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:33:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:33:55,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:33:55,883 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:33:55,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970806924] [2023-11-06 20:33:55,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970806924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:33:55,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:33:55,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 20:33:55,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493338125] [2023-11-06 20:33:55,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:33:55,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:33:55,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:33:55,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:33:55,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:33:55,886 INFO L87 Difference]: Start difference. First operand 530 states and 1536 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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-06 20:33:55,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:33:55,945 INFO L93 Difference]: Finished difference Result 381 states and 948 transitions. [2023-11-06 20:33:55,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:33:55,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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-06 20:33:55,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:33:55,949 INFO L225 Difference]: With dead ends: 381 [2023-11-06 20:33:55,950 INFO L226 Difference]: Without dead ends: 381 [2023-11-06 20:33:55,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:33:55,951 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:33:55,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 6 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:33:55,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2023-11-06 20:33:55,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 379. [2023-11-06 20:33:55,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 2.492063492063492) internal successors, (942), 378 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 942 transitions. [2023-11-06 20:33:55,973 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 942 transitions. Word has length 13 [2023-11-06 20:33:55,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:33:55,973 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 942 transitions. [2023-11-06 20:33:55,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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-06 20:33:55,974 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 942 transitions. [2023-11-06 20:33:55,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-06 20:33:55,975 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:33:55,975 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:33:55,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 20:33:55,976 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 20:33:55,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:33:55,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1365053325, now seen corresponding path program 1 times [2023-11-06 20:33:55,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:33:55,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504066566] [2023-11-06 20:33:55,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:33:55,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:33:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:33:56,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:33:56,150 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:33:56,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504066566] [2023-11-06 20:33:56,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504066566] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:33:56,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:33:56,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 20:33:56,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996763086] [2023-11-06 20:33:56,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:33:56,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 20:33:56,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:33:56,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 20:33:56,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 20:33:56,152 INFO L87 Difference]: Start difference. First operand 379 states and 942 transitions. Second operand has 4 states, 4 states have (on average 3.5) 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-06 20:33:56,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:33:56,238 INFO L93 Difference]: Finished difference Result 239 states and 528 transitions. [2023-11-06 20:33:56,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 20:33:56,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) 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-06 20:33:56,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:33:56,241 INFO L225 Difference]: With dead ends: 239 [2023-11-06 20:33:56,241 INFO L226 Difference]: Without dead ends: 239 [2023-11-06 20:33:56,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 20:33:56,242 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 22 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:33:56,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 9 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:33:56,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-11-06 20:33:56,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 229. [2023-11-06 20:33:56,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 2.2017543859649122) internal successors, (502), 228 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:56,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 502 transitions. [2023-11-06 20:33:56,252 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 502 transitions. Word has length 14 [2023-11-06 20:33:56,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:33:56,252 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 502 transitions. [2023-11-06 20:33:56,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) 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-06 20:33:56,253 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 502 transitions. [2023-11-06 20:33:56,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 20:33:56,254 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:33:56,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:33:56,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 20:33:56,255 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 20:33:56,255 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:33:56,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1300729372, now seen corresponding path program 1 times [2023-11-06 20:33:56,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:33:56,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197630192] [2023-11-06 20:33:56,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:33:56,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:33:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:33:56,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:33:56,465 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:33:56,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197630192] [2023-11-06 20:33:56,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197630192] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:33:56,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:33:56,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 20:33:56,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171175327] [2023-11-06 20:33:56,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:33:56,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 20:33:56,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:33:56,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 20:33:56,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 20:33:56,468 INFO L87 Difference]: Start difference. First operand 229 states and 502 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:56,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:33:56,571 INFO L93 Difference]: Finished difference Result 319 states and 676 transitions. [2023-11-06 20:33:56,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 20:33:56,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-06 20:33:56,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:33:56,574 INFO L225 Difference]: With dead ends: 319 [2023-11-06 20:33:56,574 INFO L226 Difference]: Without dead ends: 204 [2023-11-06 20:33:56,574 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-06 20:33:56,575 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 22 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 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.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:33:56,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 10 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:33:56,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-11-06 20:33:56,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2023-11-06 20:33:56,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 2.075) internal successors, (415), 200 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:56,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 415 transitions. [2023-11-06 20:33:56,597 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 415 transitions. Word has length 16 [2023-11-06 20:33:56,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:33:56,598 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 415 transitions. [2023-11-06 20:33:56,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:56,598 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 415 transitions. [2023-11-06 20:33:56,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 20:33:56,599 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:33:56,599 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:33:56,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 20:33:56,600 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 20:33:56,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:33:56,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1483457346, now seen corresponding path program 2 times [2023-11-06 20:33:56,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:33:56,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114078293] [2023-11-06 20:33:56,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:33:56,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:33:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:33:56,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:33:56,767 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:33:56,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114078293] [2023-11-06 20:33:56,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114078293] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:33:56,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:33:56,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 20:33:56,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551161620] [2023-11-06 20:33:56,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:33:56,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:33:56,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:33:56,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:33:56,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:33:56,770 INFO L87 Difference]: Start difference. First operand 201 states and 415 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:56,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:33:56,840 INFO L93 Difference]: Finished difference Result 282 states and 568 transitions. [2023-11-06 20:33:56,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:33:56,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-06 20:33:56,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:33:56,843 INFO L225 Difference]: With dead ends: 282 [2023-11-06 20:33:56,843 INFO L226 Difference]: Without dead ends: 182 [2023-11-06 20:33:56,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:33:56,844 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:33:56,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 6 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:33:56,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-11-06 20:33:56,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 174. [2023-11-06 20:33:56,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 1.9595375722543353) internal successors, (339), 173 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:56,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 339 transitions. [2023-11-06 20:33:56,851 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 339 transitions. Word has length 16 [2023-11-06 20:33:56,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:33:56,851 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 339 transitions. [2023-11-06 20:33:56,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:56,852 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 339 transitions. [2023-11-06 20:33:56,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-06 20:33:56,853 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:33:56,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:33:56,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 20:33:56,853 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 20:33:56,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:33:56,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1341714620, now seen corresponding path program 1 times [2023-11-06 20:33:56,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:33:56,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393563513] [2023-11-06 20:33:56,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:33:56,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:33:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:33:57,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:33:57,721 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:33:57,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393563513] [2023-11-06 20:33:57,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393563513] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:33:57,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:33:57,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 20:33:57,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934682329] [2023-11-06 20:33:57,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:33:57,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 20:33:57,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:33:57,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 20:33:57,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 20:33:57,724 INFO L87 Difference]: Start difference. First operand 174 states and 339 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-06 20:33:57,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:33:57,863 INFO L93 Difference]: Finished difference Result 207 states and 389 transitions. [2023-11-06 20:33:57,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 20:33:57,864 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-06 20:33:57,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:33:57,865 INFO L225 Difference]: With dead ends: 207 [2023-11-06 20:33:57,865 INFO L226 Difference]: Without dead ends: 111 [2023-11-06 20:33:57,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 20:33:57,866 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 32 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:33:57,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 13 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:33:57,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-06 20:33:57,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2023-11-06 20:33:57,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.794392523364486) internal successors, (192), 107 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:57,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 192 transitions. [2023-11-06 20:33:57,871 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 192 transitions. Word has length 17 [2023-11-06 20:33:57,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:33:57,872 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 192 transitions. [2023-11-06 20:33:57,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-06 20:33:57,872 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 192 transitions. [2023-11-06 20:33:57,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-06 20:33:57,873 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:33:57,873 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:33:57,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 20:33:57,874 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 20:33:57,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:33:57,874 INFO L85 PathProgramCache]: Analyzing trace with hash -729462879, now seen corresponding path program 1 times [2023-11-06 20:33:57,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:33:57,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341467540] [2023-11-06 20:33:57,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:33:57,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:33:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:33:58,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:33:58,051 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:33:58,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341467540] [2023-11-06 20:33:58,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341467540] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:33:58,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:33:58,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 20:33:58,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645337477] [2023-11-06 20:33:58,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:33:58,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 20:33:58,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:33:58,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 20:33:58,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 20:33:58,053 INFO L87 Difference]: Start difference. First operand 108 states and 192 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-06 20:33:58,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:33:58,124 INFO L93 Difference]: Finished difference Result 83 states and 146 transitions. [2023-11-06 20:33:58,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 20:33:58,125 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-06 20:33:58,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:33:58,125 INFO L225 Difference]: With dead ends: 83 [2023-11-06 20:33:58,125 INFO L226 Difference]: Without dead ends: 35 [2023-11-06 20:33:58,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 20:33:58,126 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:33:58,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 6 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:33:58,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-06 20:33:58,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-11-06 20:33:58,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 34 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:33:58,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2023-11-06 20:33:58,129 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 17 [2023-11-06 20:33:58,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:33:58,129 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2023-11-06 20:33:58,129 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-06 20:33:58,129 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2023-11-06 20:33:58,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-06 20:33:58,130 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:33:58,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:33:58,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 20:33:58,130 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 20:33:58,130 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:33:58,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1828126371, now seen corresponding path program 1 times [2023-11-06 20:33:58,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:33:58,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749537710] [2023-11-06 20:33:58,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:33:58,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:33:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 20:33:58,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 20:33:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 20:33:58,294 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-06 20:33:58,296 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 20:33:58,298 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-06 20:33:58,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-06 20:33:58,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-06 20:33:58,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-06 20:33:58,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-06 20:33:58,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-06 20:33:58,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-06 20:33:58,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-06 20:33:58,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-06 20:33:58,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-06 20:33:58,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-06 20:33:58,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-06 20:33:58,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-06 20:33:58,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 20:33:58,306 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:33:58,312 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 20:33:58,312 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 20:33:58,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 08:33:58 BasicIcfg [2023-11-06 20:33:58,402 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 20:33:58,403 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 20:33:58,403 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 20:33:58,403 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 20:33:58,404 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:33:42" (3/4) ... [2023-11-06 20:33:58,406 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 20:33:58,407 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 20:33:58,408 INFO L158 Benchmark]: Toolchain (without parser) took 17776.09ms. Allocated memory was 165.7MB in the beginning and 308.3MB in the end (delta: 142.6MB). Free memory was 126.4MB in the beginning and 221.6MB in the end (delta: -95.2MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. [2023-11-06 20:33:58,408 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 165.7MB. Free memory is still 137.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 20:33:58,408 INFO L158 Benchmark]: CACSL2BoogieTranslator took 744.80ms. Allocated memory is still 165.7MB. Free memory was 126.4MB in the beginning and 103.3MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 20:33:58,409 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.86ms. Allocated memory is still 165.7MB. Free memory was 103.3MB in the beginning and 100.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 20:33:58,409 INFO L158 Benchmark]: Boogie Preprocessor took 62.68ms. Allocated memory is still 165.7MB. Free memory was 100.7MB in the beginning and 98.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 20:33:58,409 INFO L158 Benchmark]: RCFGBuilder took 949.99ms. Allocated memory is still 165.7MB. Free memory was 98.6MB in the beginning and 63.0MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2023-11-06 20:33:58,410 INFO L158 Benchmark]: TraceAbstraction took 15905.43ms. Allocated memory was 165.7MB in the beginning and 308.3MB in the end (delta: 142.6MB). Free memory was 62.4MB in the beginning and 221.6MB in the end (delta: -159.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 20:33:58,410 INFO L158 Benchmark]: Witness Printer took 4.00ms. Allocated memory is still 308.3MB. Free memory is still 221.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 20:33:58,412 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 165.7MB. Free memory is still 137.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 744.80ms. Allocated memory is still 165.7MB. Free memory was 126.4MB in the beginning and 103.3MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.86ms. Allocated memory is still 165.7MB. Free memory was 103.3MB in the beginning and 100.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.68ms. Allocated memory is still 165.7MB. Free memory was 100.7MB in the beginning and 98.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 949.99ms. Allocated memory is still 165.7MB. Free memory was 98.6MB in the beginning and 63.0MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 15905.43ms. Allocated memory was 165.7MB in the beginning and 308.3MB in the end (delta: 142.6MB). Free memory was 62.4MB in the beginning and 221.6MB in the end (delta: -159.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.00ms. Allocated memory is still 308.3MB. Free memory is still 221.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7s, 131 PlacesBefore, 43 PlacesAfterwards, 124 TransitionsBefore, 34 TransitionsAfterwards, 2356 CoEnabledTransitionPairs, 8 FixpointIterations, 45 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 124 TotalNumberOfCompositions, 6463 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2995, independent: 2803, independent conditional: 0, independent unconditional: 2803, dependent: 192, dependent conditional: 0, dependent unconditional: 192, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1635, independent: 1580, independent conditional: 0, independent unconditional: 1580, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1635, independent: 1526, independent conditional: 0, independent unconditional: 1526, dependent: 109, dependent conditional: 0, dependent unconditional: 109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 109, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 600, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 519, dependent conditional: 0, dependent unconditional: 519, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2995, independent: 1223, independent conditional: 0, independent unconditional: 1223, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 1635, unknown conditional: 0, unknown unconditional: 1635] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1492; [L814] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1492, ((void *)0), P0, ((void *)0))=-1, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L815] 0 pthread_t t1493; [L816] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1493, ((void *)0), P1, ((void *)0))=0, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L817] 0 pthread_t t1494; [L818] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1494, ((void *)0), P2, ((void *)0))=1, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L780] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L780] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L741] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L756] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L759] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=2, __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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={53:54}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 818]: 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, 149 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 15.6s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 275 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 275 mSDsluCounter, 142 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 814 IncrementalHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 63 mSDtfsCounter, 814 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=860occurred in iteration=0, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 126 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 196 NumberOfCodeBlocks, 196 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 1216 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 20:33:58,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/bin/utaipan-verify-FOvIYxoinp/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_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/bin/utaipan-verify-FOvIYxoinp/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/bin/utaipan-verify-FOvIYxoinp/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/bin/utaipan-verify-FOvIYxoinp/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/bin/utaipan-verify-FOvIYxoinp/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/bin/utaipan-verify-FOvIYxoinp/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/bin/utaipan-verify-FOvIYxoinp --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 20:34:01,099 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 20:34:01,233 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/bin/utaipan-verify-FOvIYxoinp/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-11-06 20:34:01,242 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 20:34:01,242 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 20:34:01,295 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 20:34:01,296 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 20:34:01,296 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 20:34:01,297 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 20:34:01,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 20:34:01,303 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-06 20:34:01,304 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-06 20:34:01,304 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-06 20:34:01,306 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-06 20:34:01,307 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-06 20:34:01,307 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-06 20:34:01,308 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 20:34:01,308 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 20:34:01,309 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 20:34:01,310 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 20:34:01,311 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 20:34:01,311 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 20:34:01,312 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 20:34:01,312 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 20:34:01,313 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 20:34:01,313 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 20:34:01,314 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 20:34:01,314 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 20:34:01,315 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 20:34:01,315 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 20:34:01,317 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 20:34:01,317 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 20:34:01,318 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 20:34:01,318 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 20:34:01,319 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 20:34:01,319 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 20:34:01,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:34:01,320 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 20:34:01,321 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 20:34:01,321 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-11-06 20:34:01,321 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 20:34:01,322 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-06 20:34:01,322 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 20:34:01,322 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_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/bin/utaipan-verify-FOvIYxoinp/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_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/bin/utaipan-verify-FOvIYxoinp Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> 0a03a5fc32da65217c1f578a6fea0c2c0e07a09fd6b8159429f8d1aa4c1c45a8 [2023-11-06 20:34:01,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 20:34:01,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 20:34:01,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 20:34:01,810 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 20:34:01,810 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 20:34:01,812 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/bin/utaipan-verify-FOvIYxoinp/../../sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-06 20:34:05,088 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 20:34:05,487 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 20:34:05,488 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/sv-benchmarks/c/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-06 20:34:05,509 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/bin/utaipan-verify-FOvIYxoinp/data/520f51902/7b745317021c4b4c84430cb7d7273c49/FLAGefc009c22 [2023-11-06 20:34:05,527 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca6281d0-4ec8-4f84-ab97-3dfa7aede2fc/bin/utaipan-verify-FOvIYxoinp/data/520f51902/7b745317021c4b4c84430cb7d7273c49 [2023-11-06 20:34:05,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 20:34:05,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 20:34:05,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 20:34:05,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 20:34:05,545 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 20:34:05,546 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:34:05" (1/1) ... [2023-11-06 20:34:05,547 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7baab2bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:34:05, skipping insertion in model container [2023-11-06 20:34:05,548 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:34:05" (1/1) ... [2023-11-06 20:34:05,627 INFO L177 MainTranslator]: Built tables and reachable declarations