./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff 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_bdb9ab1b-e429-4fb0-b132-ed8d2295bd88/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdb9ab1b-e429-4fb0-b132-ed8d2295bd88/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdb9ab1b-e429-4fb0-b132-ed8d2295bd88/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdb9ab1b-e429-4fb0-b132-ed8d2295bd88/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdb9ab1b-e429-4fb0-b132-ed8d2295bd88/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdb9ab1b-e429-4fb0-b132-ed8d2295bd88/bin/utaipan-verify-t7M7D8N6sZ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b7eb90186eb2f5804d582daa800e24f20cc36e3f07dd8983b72b6a43dcf9225 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 04:59:46,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 04:59:46,806 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdb9ab1b-e429-4fb0-b132-ed8d2295bd88/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-19 04:59:46,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 04:59:46,813 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 04:59:46,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 04:59:46,866 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 04:59:46,867 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 04:59:46,868 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 04:59:46,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 04:59:46,874 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 04:59:46,875 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 04:59:46,875 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 04:59:46,877 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 04:59:46,878 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 04:59:46,878 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 04:59:46,879 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 04:59:46,879 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 04:59:46,880 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 04:59:46,880 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 04:59:46,882 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 04:59:46,883 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 04:59:46,884 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 04:59:46,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 04:59:46,885 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 04:59:46,886 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 04:59:46,886 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 04:59:46,887 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 04:59:46,887 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 04:59:46,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 04:59:46,889 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 04:59:46,889 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 04:59:46,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 04:59:46,890 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 04:59:46,890 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 04:59:46,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 04:59:46,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:59:46,897 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 04:59:46,897 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 04:59:46,898 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 04:59:46,898 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 04:59:46,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 04:59:46,899 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 04:59:46,899 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 04:59:46,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 04:59:46,900 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_bdb9ab1b-e429-4fb0-b132-ed8d2295bd88/bin/utaipan-verify-t7M7D8N6sZ/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_bdb9ab1b-e429-4fb0-b132-ed8d2295bd88/bin/utaipan-verify-t7M7D8N6sZ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 1b7eb90186eb2f5804d582daa800e24f20cc36e3f07dd8983b72b6a43dcf9225 [2023-11-19 04:59:47,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 04:59:47,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 04:59:47,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 04:59:47,292 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 04:59:47,292 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 04:59:47,295 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdb9ab1b-e429-4fb0-b132-ed8d2295bd88/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i [2023-11-19 04:59:50,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 04:59:50,797 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 04:59:50,804 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdb9ab1b-e429-4fb0-b132-ed8d2295bd88/sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i [2023-11-19 04:59:50,822 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdb9ab1b-e429-4fb0-b132-ed8d2295bd88/bin/utaipan-verify-t7M7D8N6sZ/data/8af646607/242a548704a14d379e4400d53a451dbc/FLAG908d2e03c [2023-11-19 04:59:50,838 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdb9ab1b-e429-4fb0-b132-ed8d2295bd88/bin/utaipan-verify-t7M7D8N6sZ/data/8af646607/242a548704a14d379e4400d53a451dbc [2023-11-19 04:59:50,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 04:59:50,842 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 04:59:50,844 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 04:59:50,844 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 04:59:50,850 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 04:59:50,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:59:50" (1/1) ... [2023-11-19 04:59:50,853 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@134ef6c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:59:50, skipping insertion in model container [2023-11-19 04:59:50,853 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:59:50" (1/1) ... [2023-11-19 04:59:50,918 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 04:59:51,142 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdb9ab1b-e429-4fb0-b132-ed8d2295bd88/sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i[1009,1022] [2023-11-19 04:59:51,426 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:59:51,446 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 04:59:51,462 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdb9ab1b-e429-4fb0-b132-ed8d2295bd88/sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i[1009,1022] [2023-11-19 04:59:51,510 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:59:51,549 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 04:59:51,549 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 04:59:51,555 INFO L206 MainTranslator]: Completed translation [2023-11-19 04:59:51,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:59:51 WrapperNode [2023-11-19 04:59:51,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 04:59:51,557 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 04:59:51,557 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 04:59:51,557 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 04:59:51,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:59:51" (1/1) ... [2023-11-19 04:59:51,609 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:59:51" (1/1) ... [2023-11-19 04:59:51,638 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2023-11-19 04:59:51,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 04:59:51,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 04:59:51,640 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 04:59:51,640 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 04:59:51,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:59:51" (1/1) ... [2023-11-19 04:59:51,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:59:51" (1/1) ... [2023-11-19 04:59:51,661 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:59:51" (1/1) ... [2023-11-19 04:59:51,661 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:59:51" (1/1) ... [2023-11-19 04:59:51,687 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:59:51" (1/1) ... [2023-11-19 04:59:51,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:59:51" (1/1) ... [2023-11-19 04:59:51,694 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:59:51" (1/1) ... [2023-11-19 04:59:51,696 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:59:51" (1/1) ... [2023-11-19 04:59:51,701 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 04:59:51,704 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 04:59:51,704 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 04:59:51,704 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 04:59:51,705 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:59:51" (1/1) ... [2023-11-19 04:59:51,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:59:51,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdb9ab1b-e429-4fb0-b132-ed8d2295bd88/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:59:51,740 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdb9ab1b-e429-4fb0-b132-ed8d2295bd88/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 04:59:51,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdb9ab1b-e429-4fb0-b132-ed8d2295bd88/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 04:59:51,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 04:59:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 04:59:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 04:59:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 04:59:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 04:59:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 04:59:51,773 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 04:59:51,773 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 04:59:51,773 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 04:59:51,773 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 04:59:51,773 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 04:59:51,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 04:59:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 04:59:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 04:59:51,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 04:59:51,776 WARN L210 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 04:59:51,948 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 04:59:51,951 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 04:59:52,385 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 04:59:52,581 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 04:59:52,581 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 04:59:52,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:59:52 BoogieIcfgContainer [2023-11-19 04:59:52,589 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 04:59:52,593 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 04:59:52,593 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 04:59:52,597 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 04:59:52,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:59:50" (1/3) ... [2023-11-19 04:59:52,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2946bec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:59:52, skipping insertion in model container [2023-11-19 04:59:52,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:59:51" (2/3) ... [2023-11-19 04:59:52,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2946bec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:59:52, skipping insertion in model container [2023-11-19 04:59:52,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:59:52" (3/3) ... [2023-11-19 04:59:52,603 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.opt_pso.opt_rmo.opt.i [2023-11-19 04:59:52,614 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 04:59:52,627 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 04:59:52,628 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 04:59:52,628 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 04:59:52,697 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 04:59:52,750 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 04:59:52,777 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 117 transitions, 246 flow [2023-11-19 04:59:52,784 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 117 transitions, 246 flow [2023-11-19 04:59:52,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 246 flow [2023-11-19 04:59:52,883 INFO L124 PetriNetUnfolderBase]: 2/114 cut-off events. [2023-11-19 04:59:52,883 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 04:59:52,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-11-19 04:59:52,894 INFO L119 LiptonReduction]: Number of co-enabled transitions 2430 [2023-11-19 04:59:57,653 INFO L134 LiptonReduction]: Checked pairs total: 5627 [2023-11-19 04:59:57,654 INFO L136 LiptonReduction]: Total number of compositions: 101 [2023-11-19 04:59:57,662 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 70 flow [2023-11-19 04:59:57,816 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1032 states, 1029 states have (on average 3.3877551020408165) internal successors, (3486), 1031 states have internal predecessors, (3486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:59:57,845 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:59:57,854 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@210749a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:59:57,855 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-19 04:59:57,860 INFO L276 IsEmpty]: Start isEmpty. Operand has 1032 states, 1029 states have (on average 3.3877551020408165) internal successors, (3486), 1031 states have internal predecessors, (3486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:59:57,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-19 04:59:57,866 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:59:57,867 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 04:59:57,868 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 04:59:57,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:59:57,875 INFO L85 PathProgramCache]: Analyzing trace with hash 474092404, now seen corresponding path program 1 times [2023-11-19 04:59:57,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:59:57,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364386710] [2023-11-19 04:59:57,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:59:57,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:59:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:59:58,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:59:58,398 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:59:58,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364386710] [2023-11-19 04:59:58,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364386710] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:59:58,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:59:58,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 04:59:58,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099577143] [2023-11-19 04:59:58,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:59:58,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:59:58,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:59:58,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:59:58,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:59:58,447 INFO L87 Difference]: Start difference. First operand has 1032 states, 1029 states have (on average 3.3877551020408165) internal successors, (3486), 1031 states have internal predecessors, (3486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:59:58,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:59:58,615 INFO L93 Difference]: Finished difference Result 842 states and 2654 transitions. [2023-11-19 04:59:58,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:59:58,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-19 04:59:58,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:59:58,654 INFO L225 Difference]: With dead ends: 842 [2023-11-19 04:59:58,655 INFO L226 Difference]: Without dead ends: 812 [2023-11-19 04:59:58,656 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-19 04:59:58,661 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:59:58,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 6 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:59:58,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2023-11-19 04:59:58,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2023-11-19 04:59:58,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 811 states have (on average 3.1750924784217016) internal successors, (2575), 811 states have internal predecessors, (2575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:59:58,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2575 transitions. [2023-11-19 04:59:58,774 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2575 transitions. Word has length 5 [2023-11-19 04:59:58,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:59:58,775 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 2575 transitions. [2023-11-19 04:59:58,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:59:58,781 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2575 transitions. [2023-11-19 04:59:58,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 04:59:58,785 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:59:58,785 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:59:58,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 04:59:58,785 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 04:59:58,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:59:58,787 INFO L85 PathProgramCache]: Analyzing trace with hash -906581172, now seen corresponding path program 1 times [2023-11-19 04:59:58,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:59:58,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488329778] [2023-11-19 04:59:58,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:59:58,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:59:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:59:59,235 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-19 04:59:59,236 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:59:59,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488329778] [2023-11-19 04:59:59,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488329778] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:59:59,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:59:59,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:59:59,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178688595] [2023-11-19 04:59:59,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:59:59,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:59:59,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:59:59,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:59:59,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:59:59,240 INFO L87 Difference]: Start difference. First operand 812 states and 2575 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:59:59,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:59:59,497 INFO L93 Difference]: Finished difference Result 1464 states and 4398 transitions. [2023-11-19 04:59:59,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:59:59,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-19 04:59:59,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:59:59,509 INFO L225 Difference]: With dead ends: 1464 [2023-11-19 04:59:59,510 INFO L226 Difference]: Without dead ends: 1176 [2023-11-19 04:59:59,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:59:59,514 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 29 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:59:59,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 12 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:59:59,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2023-11-19 04:59:59,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1008. [2023-11-19 04:59:59,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 1007 states have (on average 3.1072492552135054) internal successors, (3129), 1007 states have internal predecessors, (3129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:59:59,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 3129 transitions. [2023-11-19 04:59:59,581 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 3129 transitions. Word has length 10 [2023-11-19 04:59:59,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:59:59,583 INFO L495 AbstractCegarLoop]: Abstraction has 1008 states and 3129 transitions. [2023-11-19 04:59:59,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:59:59,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 3129 transitions. [2023-11-19 04:59:59,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 04:59:59,592 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:59:59,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:59:59,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 04:59:59,597 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 04:59:59,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:59:59,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1911375773, now seen corresponding path program 1 times [2023-11-19 04:59:59,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:59:59,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104482826] [2023-11-19 04:59:59,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:59:59,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:59:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:59:59,893 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-19 04:59:59,894 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:59:59,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104482826] [2023-11-19 04:59:59,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104482826] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:59:59,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:59:59,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:59:59,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669163989] [2023-11-19 04:59:59,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:59:59,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:59:59,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:59:59,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:59:59,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:59:59,897 INFO L87 Difference]: Start difference. First operand 1008 states and 3129 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-19 05:00:00,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:00:00,156 INFO L93 Difference]: Finished difference Result 1248 states and 3681 transitions. [2023-11-19 05:00:00,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 05:00:00,158 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-19 05:00:00,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:00:00,168 INFO L225 Difference]: With dead ends: 1248 [2023-11-19 05:00:00,169 INFO L226 Difference]: Without dead ends: 1048 [2023-11-19 05:00:00,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:00:00,170 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 51 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:00:00,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 14 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:00:00,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2023-11-19 05:00:00,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 838. [2023-11-19 05:00:00,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 3.08363201911589) internal successors, (2581), 837 states have internal predecessors, (2581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:00:00,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 2581 transitions. [2023-11-19 05:00:00,215 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 2581 transitions. Word has length 11 [2023-11-19 05:00:00,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:00:00,215 INFO L495 AbstractCegarLoop]: Abstraction has 838 states and 2581 transitions. [2023-11-19 05:00:00,215 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-19 05:00:00,215 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 2581 transitions. [2023-11-19 05:00:00,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 05:00:00,217 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:00:00,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:00:00,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 05:00:00,218 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 05:00:00,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:00:00,218 INFO L85 PathProgramCache]: Analyzing trace with hash -966907072, now seen corresponding path program 1 times [2023-11-19 05:00:00,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:00:00,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811453575] [2023-11-19 05:00:00,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:00:00,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:00:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:00:00,410 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-19 05:00:00,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:00:00,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811453575] [2023-11-19 05:00:00,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811453575] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:00:00,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:00:00,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:00:00,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856658655] [2023-11-19 05:00:00,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:00:00,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:00:00,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:00:00,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:00:00,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:00:00,413 INFO L87 Difference]: Start difference. First operand 838 states and 2581 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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-19 05:00:00,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:00:00,553 INFO L93 Difference]: Finished difference Result 858 states and 2572 transitions. [2023-11-19 05:00:00,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:00:00,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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-19 05:00:00,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:00:00,561 INFO L225 Difference]: With dead ends: 858 [2023-11-19 05:00:00,561 INFO L226 Difference]: Without dead ends: 758 [2023-11-19 05:00:00,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:00:00,563 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 27 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:00:00,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 13 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:00:00,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2023-11-19 05:00:00,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 686. [2023-11-19 05:00:00,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 685 states have (on average 3.0291970802919708) internal successors, (2075), 685 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:00:00,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 2075 transitions. [2023-11-19 05:00:00,595 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 2075 transitions. Word has length 12 [2023-11-19 05:00:00,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:00:00,595 INFO L495 AbstractCegarLoop]: Abstraction has 686 states and 2075 transitions. [2023-11-19 05:00:00,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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-19 05:00:00,596 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 2075 transitions. [2023-11-19 05:00:00,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-19 05:00:00,597 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:00:00,597 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:00:00,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 05:00:00,598 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 05:00:00,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:00:00,598 INFO L85 PathProgramCache]: Analyzing trace with hash -510971905, now seen corresponding path program 1 times [2023-11-19 05:00:00,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:00:00,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108852307] [2023-11-19 05:00:00,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:00:00,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:00:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:00:00,769 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-19 05:00:00,769 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:00:00,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108852307] [2023-11-19 05:00:00,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108852307] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:00:00,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:00:00,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:00:00,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677195461] [2023-11-19 05:00:00,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:00:00,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:00:00,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:00:00,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:00:00,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:00:00,772 INFO L87 Difference]: Start difference. First operand 686 states and 2075 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-19 05:00:00,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:00:00,843 INFO L93 Difference]: Finished difference Result 462 states and 1183 transitions. [2023-11-19 05:00:00,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:00:00,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-19 05:00:00,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:00:00,847 INFO L225 Difference]: With dead ends: 462 [2023-11-19 05:00:00,847 INFO L226 Difference]: Without dead ends: 462 [2023-11-19 05:00:00,848 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-19 05:00:00,849 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:00:00,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:00:00,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2023-11-19 05:00:00,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 462. [2023-11-19 05:00:00,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 461 states have (on average 2.5661605206073754) internal successors, (1183), 461 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:00:00,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1183 transitions. [2023-11-19 05:00:00,866 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 1183 transitions. Word has length 14 [2023-11-19 05:00:00,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:00:00,867 INFO L495 AbstractCegarLoop]: Abstraction has 462 states and 1183 transitions. [2023-11-19 05:00:00,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-19 05:00:00,867 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 1183 transitions. [2023-11-19 05:00:00,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 05:00:00,868 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:00:00,868 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:00:00,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 05:00:00,869 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 05:00:00,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:00:00,869 INFO L85 PathProgramCache]: Analyzing trace with hash -761513507, now seen corresponding path program 1 times [2023-11-19 05:00:00,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:00:00,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013615025] [2023-11-19 05:00:00,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:00:00,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:00:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:00:01,058 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-19 05:00:01,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:00:01,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013615025] [2023-11-19 05:00:01,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013615025] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:00:01,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:00:01,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:00:01,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806214189] [2023-11-19 05:00:01,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:00:01,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:00:01,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:00:01,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:00:01,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:00:01,060 INFO L87 Difference]: Start difference. First operand 462 states and 1183 transitions. Second operand has 4 states, 4 states have (on average 4.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-19 05:00:01,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:00:01,164 INFO L93 Difference]: Finished difference Result 282 states and 649 transitions. [2023-11-19 05:00:01,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:00:01,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.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-19 05:00:01,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:00:01,167 INFO L225 Difference]: With dead ends: 282 [2023-11-19 05:00:01,167 INFO L226 Difference]: Without dead ends: 282 [2023-11-19 05:00:01,168 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-19 05:00:01,168 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 24 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:00:01,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 9 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:00:01,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2023-11-19 05:00:01,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 279. [2023-11-19 05:00:01,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 2.305755395683453) internal successors, (641), 278 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:00:01,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 641 transitions. [2023-11-19 05:00:01,180 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 641 transitions. Word has length 16 [2023-11-19 05:00:01,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:00:01,180 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 641 transitions. [2023-11-19 05:00:01,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.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-19 05:00:01,180 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 641 transitions. [2023-11-19 05:00:01,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 05:00:01,181 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:00:01,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:00:01,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 05:00:01,182 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 05:00:01,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:00:01,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1580910173, now seen corresponding path program 1 times [2023-11-19 05:00:01,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:00:01,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709284164] [2023-11-19 05:00:01,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:00:01,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:00:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:00:01,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:00:01,440 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:00:01,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709284164] [2023-11-19 05:00:01,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709284164] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:00:01,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:00:01,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:00:01,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294380610] [2023-11-19 05:00:01,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:00:01,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:00:01,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:00:01,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:00:01,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:00:01,446 INFO L87 Difference]: Start difference. First operand 279 states and 641 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:00:01,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:00:01,700 INFO L93 Difference]: Finished difference Result 446 states and 992 transitions. [2023-11-19 05:00:01,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 05:00:01,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-19 05:00:01,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:00:01,703 INFO L225 Difference]: With dead ends: 446 [2023-11-19 05:00:01,703 INFO L226 Difference]: Without dead ends: 377 [2023-11-19 05:00:01,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 05:00:01,704 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 41 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:00:01,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 15 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:00:01,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2023-11-19 05:00:01,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 267. [2023-11-19 05:00:01,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 2.255639097744361) internal successors, (600), 266 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:00:01,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 600 transitions. [2023-11-19 05:00:01,715 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 600 transitions. Word has length 19 [2023-11-19 05:00:01,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:00:01,716 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 600 transitions. [2023-11-19 05:00:01,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:00:01,716 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 600 transitions. [2023-11-19 05:00:01,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 05:00:01,717 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:00:01,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:00:01,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 05:00:01,718 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 05:00:01,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:00:01,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1231442213, now seen corresponding path program 2 times [2023-11-19 05:00:01,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:00:01,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214738847] [2023-11-19 05:00:01,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:00:01,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:00:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:00:01,982 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-19 05:00:01,983 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:00:01,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214738847] [2023-11-19 05:00:01,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214738847] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:00:01,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:00:01,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:00:01,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923203562] [2023-11-19 05:00:01,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:00:01,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:00:01,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:00:01,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:00:01,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:00:01,985 INFO L87 Difference]: Start difference. First operand 267 states and 600 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:00:02,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:00:02,148 INFO L93 Difference]: Finished difference Result 373 states and 812 transitions. [2023-11-19 05:00:02,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:00:02,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-19 05:00:02,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:00:02,151 INFO L225 Difference]: With dead ends: 373 [2023-11-19 05:00:02,151 INFO L226 Difference]: Without dead ends: 273 [2023-11-19 05:00:02,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:00:02,152 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 31 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:00:02,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 19 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:00:02,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-11-19 05:00:02,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 267. [2023-11-19 05:00:02,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 2.218045112781955) internal successors, (590), 266 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:00:02,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 590 transitions. [2023-11-19 05:00:02,162 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 590 transitions. Word has length 19 [2023-11-19 05:00:02,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:00:02,162 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 590 transitions. [2023-11-19 05:00:02,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:00:02,163 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 590 transitions. [2023-11-19 05:00:02,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 05:00:02,164 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:00:02,164 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:00:02,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 05:00:02,164 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 05:00:02,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:00:02,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1704942851, now seen corresponding path program 3 times [2023-11-19 05:00:02,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:00:02,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338260975] [2023-11-19 05:00:02,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:00:02,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:00:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:00:02,405 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-19 05:00:02,405 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:00:02,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338260975] [2023-11-19 05:00:02,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338260975] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:00:02,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:00:02,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:00:02,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585067108] [2023-11-19 05:00:02,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:00:02,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:00:02,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:00:02,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:00:02,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:00:02,407 INFO L87 Difference]: Start difference. First operand 267 states and 590 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:00:02,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:00:02,498 INFO L93 Difference]: Finished difference Result 221 states and 502 transitions. [2023-11-19 05:00:02,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:00:02,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-19 05:00:02,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:00:02,499 INFO L225 Difference]: With dead ends: 221 [2023-11-19 05:00:02,500 INFO L226 Difference]: Without dead ends: 105 [2023-11-19 05:00:02,500 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-19 05:00:02,501 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 30 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:00:02,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 7 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:00:02,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-19 05:00:02,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2023-11-19 05:00:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 2.0105263157894737) internal successors, (191), 95 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:00:02,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 191 transitions. [2023-11-19 05:00:02,505 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 191 transitions. Word has length 19 [2023-11-19 05:00:02,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:00:02,506 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 191 transitions. [2023-11-19 05:00:02,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:00:02,506 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 191 transitions. [2023-11-19 05:00:02,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-19 05:00:02,507 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:00:02,507 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:00:02,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 05:00:02,507 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 05:00:02,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:00:02,508 INFO L85 PathProgramCache]: Analyzing trace with hash 943742483, now seen corresponding path program 1 times [2023-11-19 05:00:02,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:00:02,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977205466] [2023-11-19 05:00:02,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:00:02,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:00:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:00:02,860 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-19 05:00:02,861 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:00:02,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977205466] [2023-11-19 05:00:02,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977205466] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:00:02,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:00:02,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:00:02,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803877627] [2023-11-19 05:00:02,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:00:02,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:00:02,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:00:02,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:00:02,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:00:02,864 INFO L87 Difference]: Start difference. First operand 96 states and 191 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:00:02,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:00:02,964 INFO L93 Difference]: Finished difference Result 150 states and 300 transitions. [2023-11-19 05:00:02,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:00:02,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2023-11-19 05:00:02,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:00:02,965 INFO L225 Difference]: With dead ends: 150 [2023-11-19 05:00:02,965 INFO L226 Difference]: Without dead ends: 74 [2023-11-19 05:00:02,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:00:02,966 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 26 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:00:02,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 8 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:00:02,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-19 05:00:02,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2023-11-19 05:00:02,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.904109589041096) internal successors, (139), 73 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:00:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 139 transitions. [2023-11-19 05:00:02,970 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 139 transitions. Word has length 23 [2023-11-19 05:00:02,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:00:02,970 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 139 transitions. [2023-11-19 05:00:02,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:00:02,970 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 139 transitions. [2023-11-19 05:00:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-19 05:00:02,971 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:00:02,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:00:02,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 05:00:02,972 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 05:00:02,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:00:02,974 INFO L85 PathProgramCache]: Analyzing trace with hash 819847061, now seen corresponding path program 2 times [2023-11-19 05:00:02,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:00:02,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990682778] [2023-11-19 05:00:02,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:00:02,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:00:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:00:03,666 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-19 05:00:03,666 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:00:03,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990682778] [2023-11-19 05:00:03,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990682778] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:00:03,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:00:03,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:00:03,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663465401] [2023-11-19 05:00:03,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:00:03,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:00:03,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:00:03,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:00:03,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:00:03,668 INFO L87 Difference]: Start difference. First operand 74 states and 139 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:00:03,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:00:03,826 INFO L93 Difference]: Finished difference Result 89 states and 162 transitions. [2023-11-19 05:00:03,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 05:00:03,826 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2023-11-19 05:00:03,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:00:03,827 INFO L225 Difference]: With dead ends: 89 [2023-11-19 05:00:03,827 INFO L226 Difference]: Without dead ends: 74 [2023-11-19 05:00:03,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-19 05:00:03,828 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 13 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:00:03,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 20 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:00:03,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-19 05:00:03,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2023-11-19 05:00:03,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.8767123287671232) internal successors, (137), 73 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:00:03,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 137 transitions. [2023-11-19 05:00:03,831 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 137 transitions. Word has length 23 [2023-11-19 05:00:03,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:00:03,832 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 137 transitions. [2023-11-19 05:00:03,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:00:03,833 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 137 transitions. [2023-11-19 05:00:03,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-19 05:00:03,833 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:00:03,833 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:00:03,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 05:00:03,834 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 05:00:03,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:00:03,835 INFO L85 PathProgramCache]: Analyzing trace with hash -110979635, now seen corresponding path program 3 times [2023-11-19 05:00:03,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:00:03,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701000201] [2023-11-19 05:00:03,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:00:03,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:00:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:00:04,970 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-19 05:00:04,970 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:00:04,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701000201] [2023-11-19 05:00:04,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701000201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:00:04,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:00:04,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 05:00:04,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600728356] [2023-11-19 05:00:04,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:00:04,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 05:00:04,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:00:04,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 05:00:04,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-19 05:00:04,972 INFO L87 Difference]: Start difference. First operand 74 states and 137 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:00:05,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:00:05,297 INFO L93 Difference]: Finished difference Result 109 states and 192 transitions. [2023-11-19 05:00:05,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 05:00:05,298 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2023-11-19 05:00:05,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:00:05,298 INFO L225 Difference]: With dead ends: 109 [2023-11-19 05:00:05,298 INFO L226 Difference]: Without dead ends: 70 [2023-11-19 05:00:05,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-11-19 05:00:05,300 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 31 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:00:05,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 23 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:00:05,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-19 05:00:05,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 58. [2023-11-19 05:00:05,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.7719298245614035) internal successors, (101), 57 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:00:05,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 101 transitions. [2023-11-19 05:00:05,303 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 101 transitions. Word has length 23 [2023-11-19 05:00:05,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:00:05,304 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 101 transitions. [2023-11-19 05:00:05,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:00:05,304 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2023-11-19 05:00:05,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-19 05:00:05,305 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:00:05,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:00:05,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 05:00:05,305 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 05:00:05,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:00:05,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1254991701, now seen corresponding path program 4 times [2023-11-19 05:00:05,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:00:05,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210727352] [2023-11-19 05:00:05,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:00:05,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:00:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 05:00:05,371 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 05:00:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 05:00:05,486 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-19 05:00:05,486 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 05:00:05,487 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-19 05:00:05,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-19 05:00:05,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-19 05:00:05,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-19 05:00:05,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-19 05:00:05,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-19 05:00:05,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 05:00:05,493 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1] [2023-11-19 05:00:05,500 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 05:00:05,500 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 05:00:05,572 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 05:00:05,574 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 05:00:05,576 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 05:00:05,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:00:05 BasicIcfg [2023-11-19 05:00:05,614 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 05:00:05,615 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 05:00:05,615 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 05:00:05,615 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 05:00:05,616 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:59:52" (3/4) ... [2023-11-19 05:00:05,617 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 05:00:05,656 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 05:00:05,657 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 05:00:05,664 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 05:00:05,757 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdb9ab1b-e429-4fb0-b132-ed8d2295bd88/bin/utaipan-verify-t7M7D8N6sZ/witness.graphml [2023-11-19 05:00:05,758 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 05:00:05,758 INFO L158 Benchmark]: Toolchain (without parser) took 14915.99ms. Allocated memory was 157.3MB in the beginning and 232.8MB in the end (delta: 75.5MB). Free memory was 122.2MB in the beginning and 116.8MB in the end (delta: 5.4MB). Peak memory consumption was 82.3MB. Max. memory is 16.1GB. [2023-11-19 05:00:05,759 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 123.7MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 05:00:05,759 INFO L158 Benchmark]: CACSL2BoogieTranslator took 712.34ms. Allocated memory is still 157.3MB. Free memory was 121.9MB in the beginning and 98.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-19 05:00:05,759 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.99ms. Allocated memory is still 157.3MB. Free memory was 98.8MB in the beginning and 96.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 05:00:05,760 INFO L158 Benchmark]: Boogie Preprocessor took 61.50ms. Allocated memory is still 157.3MB. Free memory was 96.4MB in the beginning and 94.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 05:00:05,761 INFO L158 Benchmark]: RCFGBuilder took 885.48ms. Allocated memory is still 157.3MB. Free memory was 94.3MB in the beginning and 120.4MB in the end (delta: -26.1MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. [2023-11-19 05:00:05,762 INFO L158 Benchmark]: TraceAbstraction took 13021.34ms. Allocated memory was 157.3MB in the beginning and 232.8MB in the end (delta: 75.5MB). Free memory was 119.5MB in the beginning and 127.3MB in the end (delta: -7.8MB). Peak memory consumption was 66.5MB. Max. memory is 16.1GB. [2023-11-19 05:00:05,763 INFO L158 Benchmark]: Witness Printer took 143.13ms. Allocated memory is still 232.8MB. Free memory was 127.3MB in the beginning and 116.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-19 05:00:05,767 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.30ms. Allocated memory is still 123.7MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 712.34ms. Allocated memory is still 157.3MB. Free memory was 121.9MB in the beginning and 98.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.99ms. Allocated memory is still 157.3MB. Free memory was 98.8MB in the beginning and 96.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.50ms. Allocated memory is still 157.3MB. Free memory was 96.4MB in the beginning and 94.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 885.48ms. Allocated memory is still 157.3MB. Free memory was 94.3MB in the beginning and 120.4MB in the end (delta: -26.1MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13021.34ms. Allocated memory was 157.3MB in the beginning and 232.8MB in the end (delta: 75.5MB). Free memory was 119.5MB in the beginning and 127.3MB in the end (delta: -7.8MB). Peak memory consumption was 66.5MB. Max. memory is 16.1GB. * Witness Printer took 143.13ms. Allocated memory is still 232.8MB. Free memory was 127.3MB in the beginning and 116.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9s, 125 PlacesBefore, 38 PlacesAfterwards, 117 TransitionsBefore, 29 TransitionsAfterwards, 2430 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 101 TotalNumberOfCompositions, 5627 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3111, independent: 2955, independent conditional: 0, independent unconditional: 2955, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1787, independent: 1740, independent conditional: 0, independent unconditional: 1740, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1787, independent: 1724, independent conditional: 0, independent unconditional: 1724, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 63, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 386, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 359, dependent conditional: 0, dependent unconditional: 359, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3111, independent: 1215, independent conditional: 0, independent unconditional: 1215, dependent: 109, dependent conditional: 0, dependent unconditional: 109, unknown: 1787, unknown conditional: 0, unknown unconditional: 1787] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 152, Positive conditional cache size: 0, Positive unconditional cache size: 152, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff1_thd0; [L734] 0 _Bool y$r_buff1_thd1; [L735] 0 _Bool y$r_buff1_thd2; [L736] 0 _Bool y$r_buff1_thd3; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t636; [L845] FCALL, FORK 0 pthread_create(&t636, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t636={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] [L846] 0 pthread_t t637; [L847] FCALL, FORK 0 pthread_create(&t637, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t636={5:0}, t637={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] [L848] 0 pthread_t t638; [L849] FCALL, FORK 0 pthread_create(&t638, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t636={5:0}, t637={6:0}, t638={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] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 1 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L796] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L813] 3 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L816] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L819] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L753] 1 x = 1 [L756] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] 1 y$mem_tmp = y [L763] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L764] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L765] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L766] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L767] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L768] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L769] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 __unbuffered_p0_EBX = y [L771] 1 y = y$flush_delayed ? y$mem_tmp : y [L772] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L799] 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) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 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 [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L822] 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) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 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 [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 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) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 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 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t636={5:0}, t637={6:0}, t638={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L862] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 845]: 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: 847]: 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, 147 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 12.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 322 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 322 mSDsluCounter, 152 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 91 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1143 IncrementalHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 61 mSDtfsCounter, 1143 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1032occurred in iteration=0, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 590 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 1317 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 proved your program to be incorrect! [2023-11-19 05:00:05,822 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bdb9ab1b-e429-4fb0-b132-ed8d2295bd88/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE