./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc19a3a-7ef8-45c8-a1eb-0368d88f92b2/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc19a3a-7ef8-45c8-a1eb-0368d88f92b2/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc19a3a-7ef8-45c8-a1eb-0368d88f92b2/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc19a3a-7ef8-45c8-a1eb-0368d88f92b2/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc19a3a-7ef8-45c8-a1eb-0368d88f92b2/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc19a3a-7ef8-45c8-a1eb-0368d88f92b2/bin/utaipan-g80aRyZoba --witnessprinter.witness.filename witness.graphml --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 a86612b573a63cde2c4106f45bf8b3ea66989a894eb80420a80ff8b17f8f03d1 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 00:35:31,167 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 00:35:31,169 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 00:35:31,194 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 00:35:31,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 00:35:31,200 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 00:35:31,202 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 00:35:31,206 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 00:35:31,207 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 00:35:31,213 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 00:35:31,214 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 00:35:31,216 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 00:35:31,217 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 00:35:31,222 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 00:35:31,223 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 00:35:31,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 00:35:31,227 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 00:35:31,228 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 00:35:31,229 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 00:35:31,236 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 00:35:31,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 00:35:31,239 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 00:35:31,241 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 00:35:31,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 00:35:31,251 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 00:35:31,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 00:35:31,252 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 00:35:31,253 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 00:35:31,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 00:35:31,254 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 00:35:31,255 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 00:35:31,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 00:35:31,258 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 00:35:31,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 00:35:31,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 00:35:31,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 00:35:31,262 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 00:35:31,262 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 00:35:31,262 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 00:35:31,263 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 00:35:31,264 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 00:35:31,265 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc19a3a-7ef8-45c8-a1eb-0368d88f92b2/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-22 00:35:31,302 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 00:35:31,302 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 00:35:31,302 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 00:35:31,302 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 00:35:31,311 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 00:35:31,311 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 00:35:31,312 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 00:35:31,312 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 00:35:31,312 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 00:35:31,312 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 00:35:31,312 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 00:35:31,313 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 00:35:31,313 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 00:35:31,313 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 00:35:31,313 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 00:35:31,313 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 00:35:31,314 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 00:35:31,314 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 00:35:31,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 00:35:31,315 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 00:35:31,315 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 00:35:31,315 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 00:35:31,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 00:35:31,315 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 00:35:31,316 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 00:35:31,316 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 00:35:31,316 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 00:35:31,316 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 00:35:31,316 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 00:35:31,323 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 00:35:31,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 00:35:31,323 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 00:35:31,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:35:31,324 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 00:35:31,324 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 00:35:31,324 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 00:35:31,326 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 00:35:31,326 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 00:35:31,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 00:35:31,327 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 00:35:31,327 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 00:35:31,327 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_7fc19a3a-7ef8-45c8-a1eb-0368d88f92b2/bin/utaipan-g80aRyZoba/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_7fc19a3a-7ef8-45c8-a1eb-0368d88f92b2/bin/utaipan-g80aRyZoba Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> a86612b573a63cde2c4106f45bf8b3ea66989a894eb80420a80ff8b17f8f03d1 [2022-11-22 00:35:31,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 00:35:31,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 00:35:31,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 00:35:31,628 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 00:35:31,629 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 00:35:31,630 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc19a3a-7ef8-45c8-a1eb-0368d88f92b2/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i [2022-11-22 00:35:34,786 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 00:35:35,021 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 00:35:35,022 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc19a3a-7ef8-45c8-a1eb-0368d88f92b2/sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i [2022-11-22 00:35:35,051 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc19a3a-7ef8-45c8-a1eb-0368d88f92b2/bin/utaipan-g80aRyZoba/data/842ebb786/461d23554c2c4df79670dc14a3275d03/FLAG41f53e743 [2022-11-22 00:35:35,064 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc19a3a-7ef8-45c8-a1eb-0368d88f92b2/bin/utaipan-g80aRyZoba/data/842ebb786/461d23554c2c4df79670dc14a3275d03 [2022-11-22 00:35:35,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 00:35:35,068 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 00:35:35,069 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 00:35:35,070 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 00:35:35,073 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 00:35:35,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:35:35" (1/1) ... [2022-11-22 00:35:35,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c90be0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:35:35, skipping insertion in model container [2022-11-22 00:35:35,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:35:35" (1/1) ... [2022-11-22 00:35:35,083 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 00:35:35,125 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 00:35:35,310 WARN L237 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_7fc19a3a-7ef8-45c8-a1eb-0368d88f92b2/sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i[966,979] [2022-11-22 00:35:35,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:35:35,573 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 00:35:35,587 WARN L237 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_7fc19a3a-7ef8-45c8-a1eb-0368d88f92b2/sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i[966,979] [2022-11-22 00:35:35,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:35:35,692 INFO L208 MainTranslator]: Completed translation [2022-11-22 00:35:35,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:35:35 WrapperNode [2022-11-22 00:35:35,693 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 00:35:35,695 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 00:35:35,695 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 00:35:35,695 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 00:35:35,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:35:35" (1/1) ... [2022-11-22 00:35:35,738 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:35:35" (1/1) ... [2022-11-22 00:35:35,775 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-11-22 00:35:35,775 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 00:35:35,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 00:35:35,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 00:35:35,777 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 00:35:35,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:35:35" (1/1) ... [2022-11-22 00:35:35,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:35:35" (1/1) ... [2022-11-22 00:35:35,788 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:35:35" (1/1) ... [2022-11-22 00:35:35,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:35:35" (1/1) ... [2022-11-22 00:35:35,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:35:35" (1/1) ... [2022-11-22 00:35:35,798 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:35:35" (1/1) ... [2022-11-22 00:35:35,800 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:35:35" (1/1) ... [2022-11-22 00:35:35,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:35:35" (1/1) ... [2022-11-22 00:35:35,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 00:35:35,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 00:35:35,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 00:35:35,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 00:35:35,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:35:35" (1/1) ... [2022-11-22 00:35:35,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:35:35,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc19a3a-7ef8-45c8-a1eb-0368d88f92b2/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:35:35,839 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc19a3a-7ef8-45c8-a1eb-0368d88f92b2/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 00:35:35,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc19a3a-7ef8-45c8-a1eb-0368d88f92b2/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 00:35:35,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 00:35:35,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-22 00:35:35,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 00:35:35,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 00:35:35,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 00:35:35,913 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-22 00:35:35,913 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-22 00:35:35,913 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-22 00:35:35,913 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-22 00:35:35,914 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-22 00:35:35,914 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-22 00:35:35,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 00:35:35,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-22 00:35:35,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 00:35:35,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 00:35:35,917 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 00:35:36,110 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 00:35:36,112 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 00:35:36,521 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 00:35:36,740 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 00:35:36,740 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 00:35:36,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:35:36 BoogieIcfgContainer [2022-11-22 00:35:36,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 00:35:36,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 00:35:36,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 00:35:36,749 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 00:35:36,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:35:35" (1/3) ... [2022-11-22 00:35:36,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed7c7e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:35:36, skipping insertion in model container [2022-11-22 00:35:36,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:35:35" (2/3) ... [2022-11-22 00:35:36,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed7c7e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:35:36, skipping insertion in model container [2022-11-22 00:35:36,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:35:36" (3/3) ... [2022-11-22 00:35:36,769 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_power.opt_pso.opt_rmo.opt.i [2022-11-22 00:35:36,777 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-22 00:35:36,786 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 00:35:36,786 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-22 00:35:36,786 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 00:35:36,843 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-22 00:35:36,879 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 00:35:36,894 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 116 transitions, 247 flow [2022-11-22 00:35:36,897 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 116 transitions, 247 flow [2022-11-22 00:35:36,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 247 flow [2022-11-22 00:35:36,957 INFO L130 PetriNetUnfolder]: 2/113 cut-off events. [2022-11-22 00:35:36,957 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-22 00:35:36,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-11-22 00:35:36,965 INFO L119 LiptonReduction]: Number of co-enabled transitions 2178 [2022-11-22 00:35:42,097 INFO L134 LiptonReduction]: Checked pairs total: 6319 [2022-11-22 00:35:42,098 INFO L136 LiptonReduction]: Total number of compositions: 100 [2022-11-22 00:35:42,106 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 73 flow [2022-11-22 00:35:42,194 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) [2022-11-22 00:35:42,213 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 00:35:42,219 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=LoopsAndPotentialCycles, 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;@34f24428, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 00:35:42,220 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-22 00:35:42,224 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) [2022-11-22 00:35:42,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 00:35:42,229 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:42,230 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 00:35:42,230 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-22 00:35:42,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:42,236 INFO L85 PathProgramCache]: Analyzing trace with hash 475051497, now seen corresponding path program 1 times [2022-11-22 00:35:42,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:35:42,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110393289] [2022-11-22 00:35:42,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:42,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:35:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:42,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:35:42,667 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:35:42,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110393289] [2022-11-22 00:35:42,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110393289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:42,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:35:42,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 00:35:42,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661116863] [2022-11-22 00:35:42,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:42,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:35:42,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:35:42,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:35:42,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:35:42,703 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) [2022-11-22 00:35:42,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:42,844 INFO L93 Difference]: Finished difference Result 842 states and 2654 transitions. [2022-11-22 00:35:42,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:35:42,847 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 [2022-11-22 00:35:42,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:42,879 INFO L225 Difference]: With dead ends: 842 [2022-11-22 00:35:42,879 INFO L226 Difference]: Without dead ends: 812 [2022-11-22 00:35:42,880 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 [2022-11-22 00:35:42,886 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:42,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 8 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:35:42,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-11-22 00:35:42,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2022-11-22 00:35:42,995 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) [2022-11-22 00:35:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2575 transitions. [2022-11-22 00:35:43,009 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2575 transitions. Word has length 5 [2022-11-22 00:35:43,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:43,010 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 2575 transitions. [2022-11-22 00:35:43,011 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) [2022-11-22 00:35:43,012 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2575 transitions. [2022-11-22 00:35:43,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 00:35:43,015 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:43,015 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:35:43,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 00:35:43,016 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)] === [2022-11-22 00:35:43,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:43,017 INFO L85 PathProgramCache]: Analyzing trace with hash 16529147, now seen corresponding path program 1 times [2022-11-22 00:35:43,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:35:43,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375707372] [2022-11-22 00:35:43,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:43,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:35:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:43,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:35:43,704 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:35:43,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375707372] [2022-11-22 00:35:43,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375707372] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:43,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:35:43,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:35:43,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493421867] [2022-11-22 00:35:43,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:43,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:35:43,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:35:43,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:35:43,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:35:43,708 INFO L87 Difference]: Start difference. First operand 812 states and 2575 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:44,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:44,091 INFO L93 Difference]: Finished difference Result 1107 states and 3412 transitions. [2022-11-22 00:35:44,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 00:35:44,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-22 00:35:44,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:44,099 INFO L225 Difference]: With dead ends: 1107 [2022-11-22 00:35:44,099 INFO L226 Difference]: Without dead ends: 930 [2022-11-22 00:35:44,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:35:44,100 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 48 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:44,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 17 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:35:44,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2022-11-22 00:35:44,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 822. [2022-11-22 00:35:44,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 821 states have (on average 3.1400730816077953) internal successors, (2578), 821 states have internal predecessors, (2578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:44,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 2578 transitions. [2022-11-22 00:35:44,141 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 2578 transitions. Word has length 10 [2022-11-22 00:35:44,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:44,142 INFO L495 AbstractCegarLoop]: Abstraction has 822 states and 2578 transitions. [2022-11-22 00:35:44,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:44,144 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 2578 transitions. [2022-11-22 00:35:44,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 00:35:44,153 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:44,153 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:35:44,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 00:35:44,154 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)] === [2022-11-22 00:35:44,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:44,156 INFO L85 PathProgramCache]: Analyzing trace with hash 461791197, now seen corresponding path program 1 times [2022-11-22 00:35:44,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:35:44,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622018422] [2022-11-22 00:35:44,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:44,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:35:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:44,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:35:44,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:35:44,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622018422] [2022-11-22 00:35:44,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622018422] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:44,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:35:44,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:35:44,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281332861] [2022-11-22 00:35:44,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:44,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:35:44,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:35:44,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:35:44,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:35:44,411 INFO L87 Difference]: Start difference. First operand 822 states and 2578 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:44,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:44,557 INFO L93 Difference]: Finished difference Result 882 states and 2671 transitions. [2022-11-22 00:35:44,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:35:44,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-22 00:35:44,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:44,563 INFO L225 Difference]: With dead ends: 882 [2022-11-22 00:35:44,564 INFO L226 Difference]: Without dead ends: 742 [2022-11-22 00:35:44,564 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 [2022-11-22 00:35:44,565 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 30 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:44,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 18 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:35:44,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2022-11-22 00:35:44,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 732. [2022-11-22 00:35:44,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 731 states have (on average 3.0998632010943914) internal successors, (2266), 731 states have internal predecessors, (2266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:44,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 2266 transitions. [2022-11-22 00:35:44,600 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 2266 transitions. Word has length 11 [2022-11-22 00:35:44,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:44,600 INFO L495 AbstractCegarLoop]: Abstraction has 732 states and 2266 transitions. [2022-11-22 00:35:44,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:44,601 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 2266 transitions. [2022-11-22 00:35:44,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 00:35:44,602 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:44,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:35:44,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 00:35:44,603 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)] === [2022-11-22 00:35:44,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:44,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1343072019, now seen corresponding path program 1 times [2022-11-22 00:35:44,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:35:44,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754768361] [2022-11-22 00:35:44,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:44,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:35:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:45,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:35:45,378 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:35:45,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754768361] [2022-11-22 00:35:45,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754768361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:45,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:35:45,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:35:45,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715222240] [2022-11-22 00:35:45,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:45,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:35:45,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:35:45,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:35:45,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:35:45,380 INFO L87 Difference]: Start difference. First operand 732 states and 2266 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:45,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:45,761 INFO L93 Difference]: Finished difference Result 960 states and 2912 transitions. [2022-11-22 00:35:45,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 00:35:45,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-22 00:35:45,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:45,767 INFO L225 Difference]: With dead ends: 960 [2022-11-22 00:35:45,767 INFO L226 Difference]: Without dead ends: 840 [2022-11-22 00:35:45,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:35:45,769 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 43 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:45,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 13 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:35:45,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2022-11-22 00:35:45,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 720. [2022-11-22 00:35:45,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 719 states have (on average 3.0834492350486786) internal successors, (2217), 719 states have internal predecessors, (2217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:45,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 2217 transitions. [2022-11-22 00:35:45,795 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 2217 transitions. Word has length 12 [2022-11-22 00:35:45,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:45,795 INFO L495 AbstractCegarLoop]: Abstraction has 720 states and 2217 transitions. [2022-11-22 00:35:45,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:45,796 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 2217 transitions. [2022-11-22 00:35:45,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 00:35:45,797 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:45,797 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:35:45,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 00:35:45,798 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)] === [2022-11-22 00:35:45,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:45,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1314457042, now seen corresponding path program 1 times [2022-11-22 00:35:45,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:35:45,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19965760] [2022-11-22 00:35:45,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:45,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:35:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:46,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:35:46,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:35:46,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19965760] [2022-11-22 00:35:46,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19965760] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:46,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:35:46,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:35:46,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253587540] [2022-11-22 00:35:46,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:46,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:35:46,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:35:46,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:35:46,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:35:46,325 INFO L87 Difference]: Start difference. First operand 720 states and 2217 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:46,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:46,552 INFO L93 Difference]: Finished difference Result 820 states and 2459 transitions. [2022-11-22 00:35:46,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 00:35:46,553 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-22 00:35:46,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:46,557 INFO L225 Difference]: With dead ends: 820 [2022-11-22 00:35:46,557 INFO L226 Difference]: Without dead ends: 732 [2022-11-22 00:35:46,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:35:46,558 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 48 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:46,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 26 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:35:46,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2022-11-22 00:35:46,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 728. [2022-11-22 00:35:46,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 727 states have (on average 3.0660247592847316) internal successors, (2229), 727 states have internal predecessors, (2229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:46,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 2229 transitions. [2022-11-22 00:35:46,582 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 2229 transitions. Word has length 13 [2022-11-22 00:35:46,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:46,583 INFO L495 AbstractCegarLoop]: Abstraction has 728 states and 2229 transitions. [2022-11-22 00:35:46,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:46,583 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 2229 transitions. [2022-11-22 00:35:46,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 00:35:46,585 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:46,585 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:35:46,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 00:35:46,585 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)] === [2022-11-22 00:35:46,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:46,586 INFO L85 PathProgramCache]: Analyzing trace with hash -156615501, now seen corresponding path program 1 times [2022-11-22 00:35:46,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:35:46,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702471277] [2022-11-22 00:35:46,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:46,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:35:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:47,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:35:47,090 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:35:47,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702471277] [2022-11-22 00:35:47,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702471277] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:47,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:35:47,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:35:47,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184121587] [2022-11-22 00:35:47,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:47,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:35:47,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:35:47,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:35:47,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:35:47,093 INFO L87 Difference]: Start difference. First operand 728 states and 2229 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 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) [2022-11-22 00:35:47,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:47,294 INFO L93 Difference]: Finished difference Result 764 states and 2292 transitions. [2022-11-22 00:35:47,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 00:35:47,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 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 [2022-11-22 00:35:47,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:47,298 INFO L225 Difference]: With dead ends: 764 [2022-11-22 00:35:47,299 INFO L226 Difference]: Without dead ends: 704 [2022-11-22 00:35:47,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:35:47,300 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 38 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:47,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 25 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:35:47,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-11-22 00:35:47,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 700. [2022-11-22 00:35:47,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 699 states have (on average 3.055793991416309) internal successors, (2136), 699 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:47,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 2136 transitions. [2022-11-22 00:35:47,324 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 2136 transitions. Word has length 14 [2022-11-22 00:35:47,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:47,324 INFO L495 AbstractCegarLoop]: Abstraction has 700 states and 2136 transitions. [2022-11-22 00:35:47,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 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) [2022-11-22 00:35:47,325 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 2136 transitions. [2022-11-22 00:35:47,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 00:35:47,327 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:47,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:35:47,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 00:35:47,327 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)] === [2022-11-22 00:35:47,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:47,328 INFO L85 PathProgramCache]: Analyzing trace with hash -560129906, now seen corresponding path program 1 times [2022-11-22 00:35:47,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:35:47,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948205049] [2022-11-22 00:35:47,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:47,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:35:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:47,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:35:47,929 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:35:47,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948205049] [2022-11-22 00:35:47,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948205049] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:47,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:35:47,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:35:47,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332155821] [2022-11-22 00:35:47,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:47,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:35:47,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:35:47,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:35:47,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:35:47,931 INFO L87 Difference]: Start difference. First operand 700 states and 2136 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:48,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:48,168 INFO L93 Difference]: Finished difference Result 796 states and 2409 transitions. [2022-11-22 00:35:48,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 00:35:48,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-22 00:35:48,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:48,173 INFO L225 Difference]: With dead ends: 796 [2022-11-22 00:35:48,173 INFO L226 Difference]: Without dead ends: 748 [2022-11-22 00:35:48,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:35:48,174 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:48,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 44 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:35:48,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2022-11-22 00:35:48,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 715. [2022-11-22 00:35:48,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 3.0546218487394956) internal successors, (2181), 714 states have internal predecessors, (2181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:48,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 2181 transitions. [2022-11-22 00:35:48,208 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 2181 transitions. Word has length 15 [2022-11-22 00:35:48,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:48,208 INFO L495 AbstractCegarLoop]: Abstraction has 715 states and 2181 transitions. [2022-11-22 00:35:48,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:48,208 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 2181 transitions. [2022-11-22 00:35:48,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 00:35:48,210 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:48,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:35:48,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 00:35:48,211 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)] === [2022-11-22 00:35:48,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:48,212 INFO L85 PathProgramCache]: Analyzing trace with hash -560706506, now seen corresponding path program 2 times [2022-11-22 00:35:48,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:35:48,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125254269] [2022-11-22 00:35:48,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:48,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:35:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:48,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:35:48,812 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:35:48,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125254269] [2022-11-22 00:35:48,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125254269] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:48,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:35:48,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:35:48,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106662017] [2022-11-22 00:35:48,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:48,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:35:48,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:35:48,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:35:48,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:35:48,815 INFO L87 Difference]: Start difference. First operand 715 states and 2181 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:49,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:49,031 INFO L93 Difference]: Finished difference Result 914 states and 2770 transitions. [2022-11-22 00:35:49,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 00:35:49,032 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-22 00:35:49,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:49,037 INFO L225 Difference]: With dead ends: 914 [2022-11-22 00:35:49,037 INFO L226 Difference]: Without dead ends: 862 [2022-11-22 00:35:49,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:35:49,038 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 47 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:49,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 36 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:35:49,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2022-11-22 00:35:49,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 743. [2022-11-22 00:35:49,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 742 states have (on average 3.079514824797844) internal successors, (2285), 742 states have internal predecessors, (2285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:49,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 2285 transitions. [2022-11-22 00:35:49,071 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 2285 transitions. Word has length 15 [2022-11-22 00:35:49,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:49,072 INFO L495 AbstractCegarLoop]: Abstraction has 743 states and 2285 transitions. [2022-11-22 00:35:49,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:49,072 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 2285 transitions. [2022-11-22 00:35:49,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 00:35:49,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:49,074 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:35:49,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 00:35:49,074 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)] === [2022-11-22 00:35:49,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:49,075 INFO L85 PathProgramCache]: Analyzing trace with hash -527494484, now seen corresponding path program 3 times [2022-11-22 00:35:49,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:35:49,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159040746] [2022-11-22 00:35:49,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:49,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:35:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:49,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:35:49,486 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:35:49,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159040746] [2022-11-22 00:35:49,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159040746] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:49,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:35:49,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:35:49,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052194434] [2022-11-22 00:35:49,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:49,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:35:49,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:35:49,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:35:49,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:35:49,489 INFO L87 Difference]: Start difference. First operand 743 states and 2285 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:49,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:49,736 INFO L93 Difference]: Finished difference Result 873 states and 2630 transitions. [2022-11-22 00:35:49,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 00:35:49,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-22 00:35:49,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:49,741 INFO L225 Difference]: With dead ends: 873 [2022-11-22 00:35:49,741 INFO L226 Difference]: Without dead ends: 813 [2022-11-22 00:35:49,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-11-22 00:35:49,742 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 59 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:49,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 21 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:35:49,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2022-11-22 00:35:49,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 738. [2022-11-22 00:35:49,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 3.0474898236092267) internal successors, (2246), 737 states have internal predecessors, (2246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:49,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 2246 transitions. [2022-11-22 00:35:49,771 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 2246 transitions. Word has length 15 [2022-11-22 00:35:49,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:49,771 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 2246 transitions. [2022-11-22 00:35:49,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:49,772 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 2246 transitions. [2022-11-22 00:35:49,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 00:35:49,774 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:49,774 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:35:49,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 00:35:49,775 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)] === [2022-11-22 00:35:49,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:49,775 INFO L85 PathProgramCache]: Analyzing trace with hash -508495165, now seen corresponding path program 1 times [2022-11-22 00:35:49,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:35:49,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064434791] [2022-11-22 00:35:49,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:49,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:35:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:35:50,618 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:35:50,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064434791] [2022-11-22 00:35:50,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064434791] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:50,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:35:50,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:35:50,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366427077] [2022-11-22 00:35:50,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:50,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:35:50,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:35:50,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:35:50,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:35:50,619 INFO L87 Difference]: Start difference. First operand 738 states and 2246 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:50,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:50,968 INFO L93 Difference]: Finished difference Result 866 states and 2609 transitions. [2022-11-22 00:35:50,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 00:35:50,969 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-22 00:35:50,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:50,974 INFO L225 Difference]: With dead ends: 866 [2022-11-22 00:35:50,974 INFO L226 Difference]: Without dead ends: 822 [2022-11-22 00:35:50,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-22 00:35:50,975 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 75 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:50,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 17 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:35:50,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2022-11-22 00:35:50,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 698. [2022-11-22 00:35:50,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 3.0329985652797706) internal successors, (2114), 697 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:50,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 2114 transitions. [2022-11-22 00:35:50,998 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 2114 transitions. Word has length 15 [2022-11-22 00:35:50,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:50,999 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 2114 transitions. [2022-11-22 00:35:50,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:50,999 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 2114 transitions. [2022-11-22 00:35:51,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 00:35:51,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:51,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:35:51,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 00:35:51,001 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)] === [2022-11-22 00:35:51,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:51,002 INFO L85 PathProgramCache]: Analyzing trace with hash -474779441, now seen corresponding path program 1 times [2022-11-22 00:35:51,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:35:51,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47320297] [2022-11-22 00:35:51,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:51,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:35:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:51,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:35:51,346 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:35:51,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47320297] [2022-11-22 00:35:51,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47320297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:51,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:35:51,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:35:51,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119996658] [2022-11-22 00:35:51,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:51,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:35:51,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:35:51,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:35:51,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:35:51,348 INFO L87 Difference]: Start difference. First operand 698 states and 2114 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:51,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:51,528 INFO L93 Difference]: Finished difference Result 1069 states and 3185 transitions. [2022-11-22 00:35:51,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:35:51,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-22 00:35:51,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:51,533 INFO L225 Difference]: With dead ends: 1069 [2022-11-22 00:35:51,533 INFO L226 Difference]: Without dead ends: 750 [2022-11-22 00:35:51,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:35:51,534 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 32 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:51,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 16 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:35:51,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2022-11-22 00:35:51,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 690. [2022-11-22 00:35:51,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 689 states have (on average 2.9245283018867925) internal successors, (2015), 689 states have internal predecessors, (2015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:51,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 2015 transitions. [2022-11-22 00:35:51,556 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 2015 transitions. Word has length 15 [2022-11-22 00:35:51,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:51,556 INFO L495 AbstractCegarLoop]: Abstraction has 690 states and 2015 transitions. [2022-11-22 00:35:51,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:51,556 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 2015 transitions. [2022-11-22 00:35:51,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 00:35:51,558 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:51,558 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:35:51,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-22 00:35:51,558 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)] === [2022-11-22 00:35:51,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:51,559 INFO L85 PathProgramCache]: Analyzing trace with hash 196913243, now seen corresponding path program 2 times [2022-11-22 00:35:51,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:35:51,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025212827] [2022-11-22 00:35:51,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:51,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:35:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:51,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:35:51,709 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:35:51,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025212827] [2022-11-22 00:35:51,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025212827] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:51,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:35:51,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:35:51,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780930919] [2022-11-22 00:35:51,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:51,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:35:51,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:35:51,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:35:51,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:35:51,710 INFO L87 Difference]: Start difference. First operand 690 states and 2015 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:51,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:51,816 INFO L93 Difference]: Finished difference Result 642 states and 1654 transitions. [2022-11-22 00:35:51,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:35:51,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-22 00:35:51,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:51,819 INFO L225 Difference]: With dead ends: 642 [2022-11-22 00:35:51,819 INFO L226 Difference]: Without dead ends: 474 [2022-11-22 00:35:51,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:35:51,820 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 37 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:51,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 20 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:35:51,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-11-22 00:35:51,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2022-11-22 00:35:51,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 2.5052854122621566) internal successors, (1185), 473 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1185 transitions. [2022-11-22 00:35:51,833 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1185 transitions. Word has length 15 [2022-11-22 00:35:51,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:51,833 INFO L495 AbstractCegarLoop]: Abstraction has 474 states and 1185 transitions. [2022-11-22 00:35:51,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:51,834 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1185 transitions. [2022-11-22 00:35:51,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 00:35:51,835 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:51,835 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:35:51,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-22 00:35:51,835 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)] === [2022-11-22 00:35:51,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:51,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1409720527, now seen corresponding path program 1 times [2022-11-22 00:35:51,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:35:51,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803823919] [2022-11-22 00:35:51,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:51,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:35:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:35:52,017 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:35:52,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803823919] [2022-11-22 00:35:52,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803823919] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:52,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:35:52,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:35:52,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084265878] [2022-11-22 00:35:52,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:52,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:35:52,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:35:52,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:35:52,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:35:52,021 INFO L87 Difference]: Start difference. First operand 474 states and 1185 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:52,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:52,148 INFO L93 Difference]: Finished difference Result 366 states and 838 transitions. [2022-11-22 00:35:52,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 00:35:52,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-22 00:35:52,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:52,150 INFO L225 Difference]: With dead ends: 366 [2022-11-22 00:35:52,150 INFO L226 Difference]: Without dead ends: 286 [2022-11-22 00:35:52,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:35:52,151 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 59 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:52,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 27 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:35:52,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-11-22 00:35:52,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 268. [2022-11-22 00:35:52,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 2.2322097378277155) internal successors, (596), 267 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:52,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 596 transitions. [2022-11-22 00:35:52,159 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 596 transitions. Word has length 16 [2022-11-22 00:35:52,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:52,160 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 596 transitions. [2022-11-22 00:35:52,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:52,160 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 596 transitions. [2022-11-22 00:35:52,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 00:35:52,161 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:52,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:35:52,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-22 00:35:52,161 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-22 00:35:52,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:52,162 INFO L85 PathProgramCache]: Analyzing trace with hash -832960964, now seen corresponding path program 1 times [2022-11-22 00:35:52,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:35:52,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032891293] [2022-11-22 00:35:52,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:52,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:35:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:52,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:35:52,391 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:35:52,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032891293] [2022-11-22 00:35:52,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032891293] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:52,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:35:52,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:35:52,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756221860] [2022-11-22 00:35:52,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:52,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:35:52,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:35:52,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:35:52,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:35:52,393 INFO L87 Difference]: Start difference. First operand 268 states and 596 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:52,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:52,521 INFO L93 Difference]: Finished difference Result 235 states and 529 transitions. [2022-11-22 00:35:52,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 00:35:52,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-22 00:35:52,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:52,523 INFO L225 Difference]: With dead ends: 235 [2022-11-22 00:35:52,523 INFO L226 Difference]: Without dead ends: 170 [2022-11-22 00:35:52,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:35:52,524 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 56 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:52,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 21 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:35:52,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-22 00:35:52,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 166. [2022-11-22 00:35:52,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 2.296969696969697) internal successors, (379), 165 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:52,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 379 transitions. [2022-11-22 00:35:52,530 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 379 transitions. Word has length 19 [2022-11-22 00:35:52,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:52,531 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 379 transitions. [2022-11-22 00:35:52,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:52,531 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 379 transitions. [2022-11-22 00:35:52,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-22 00:35:52,532 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:52,532 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] [2022-11-22 00:35:52,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-22 00:35:52,533 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-22 00:35:52,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:52,533 INFO L85 PathProgramCache]: Analyzing trace with hash -2033854718, now seen corresponding path program 1 times [2022-11-22 00:35:52,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:35:52,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333077362] [2022-11-22 00:35:52,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:52,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:35:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:52,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:35:52,947 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:35:52,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333077362] [2022-11-22 00:35:52,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333077362] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:52,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:35:52,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:35:52,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191718194] [2022-11-22 00:35:52,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:52,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:35:52,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:35:52,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:35:52,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:35:52,949 INFO L87 Difference]: Start difference. First operand 166 states and 379 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) [2022-11-22 00:35:53,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:53,237 INFO L93 Difference]: Finished difference Result 211 states and 472 transitions. [2022-11-22 00:35:53,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 00:35:53,238 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 [2022-11-22 00:35:53,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:53,239 INFO L225 Difference]: With dead ends: 211 [2022-11-22 00:35:53,239 INFO L226 Difference]: Without dead ends: 74 [2022-11-22 00:35:53,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:35:53,239 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 37 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:53,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 19 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:35:53,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-22 00:35:53,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-11-22 00:35:53,242 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) [2022-11-22 00:35:53,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 139 transitions. [2022-11-22 00:35:53,242 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 139 transitions. Word has length 23 [2022-11-22 00:35:53,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:53,242 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 139 transitions. [2022-11-22 00:35:53,243 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) [2022-11-22 00:35:53,243 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 139 transitions. [2022-11-22 00:35:53,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-22 00:35:53,243 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:53,243 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] [2022-11-22 00:35:53,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-22 00:35:53,244 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-22 00:35:53,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:53,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1388637514, now seen corresponding path program 2 times [2022-11-22 00:35:53,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:35:53,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630055088] [2022-11-22 00:35:53,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:53,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:35:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:35:54,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:35:54,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:35:54,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630055088] [2022-11-22 00:35:54,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630055088] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:35:54,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:35:54,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-22 00:35:54,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364592787] [2022-11-22 00:35:54,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:35:54,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-22 00:35:54,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:35:54,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-22 00:35:54,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-22 00:35:54,805 INFO L87 Difference]: Start difference. First operand 74 states and 139 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 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) [2022-11-22 00:35:55,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:35:55,221 INFO L93 Difference]: Finished difference Result 95 states and 175 transitions. [2022-11-22 00:35:55,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 00:35:55,222 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 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 [2022-11-22 00:35:55,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:35:55,222 INFO L225 Difference]: With dead ends: 95 [2022-11-22 00:35:55,222 INFO L226 Difference]: Without dead ends: 52 [2022-11-22 00:35:55,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-11-22 00:35:55,223 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 50 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:35:55,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 22 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:35:55,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-22 00:35:55,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-11-22 00:35:55,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.7058823529411764) internal successors, (87), 51 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:35:55,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 87 transitions. [2022-11-22 00:35:55,226 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 87 transitions. Word has length 23 [2022-11-22 00:35:55,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:35:55,226 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 87 transitions. [2022-11-22 00:35:55,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 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) [2022-11-22 00:35:55,226 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 87 transitions. [2022-11-22 00:35:55,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-22 00:35:55,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:35:55,227 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] [2022-11-22 00:35:55,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-22 00:35:55,227 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-22 00:35:55,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:35:55,227 INFO L85 PathProgramCache]: Analyzing trace with hash -959489930, now seen corresponding path program 3 times [2022-11-22 00:35:55,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:35:55,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071904013] [2022-11-22 00:35:55,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:35:55,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:35:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 00:35:55,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-22 00:35:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 00:35:55,364 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-22 00:35:55,365 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-22 00:35:55,366 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-22 00:35:55,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-22 00:35:55,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-22 00:35:55,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-22 00:35:55,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-22 00:35:55,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-22 00:35:55,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-22 00:35:55,372 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:35:55,378 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-22 00:35:55,378 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 00:35:55,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:35:55 BasicIcfg [2022-11-22 00:35:55,484 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 00:35:55,485 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 00:35:55,485 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 00:35:55,485 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 00:35:55,486 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:35:36" (3/4) ... [2022-11-22 00:35:55,487 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-22 00:35:55,607 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc19a3a-7ef8-45c8-a1eb-0368d88f92b2/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 00:35:55,607 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 00:35:55,608 INFO L158 Benchmark]: Toolchain (without parser) took 20539.64ms. Allocated memory was 174.1MB in the beginning and 362.8MB in the end (delta: 188.7MB). Free memory was 126.8MB in the beginning and 182.3MB in the end (delta: -55.5MB). Peak memory consumption was 135.6MB. Max. memory is 16.1GB. [2022-11-22 00:35:55,608 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 174.1MB. Free memory was 143.5MB in the beginning and 143.4MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:35:55,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 624.59ms. Allocated memory is still 174.1MB. Free memory was 126.2MB in the beginning and 103.2MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-22 00:35:55,609 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.00ms. Allocated memory is still 174.1MB. Free memory was 103.2MB in the beginning and 100.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-22 00:35:55,610 INFO L158 Benchmark]: Boogie Preprocessor took 29.08ms. Allocated memory is still 174.1MB. Free memory was 100.2MB in the beginning and 98.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:35:55,610 INFO L158 Benchmark]: RCFGBuilder took 937.24ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 98.7MB in the beginning and 174.9MB in the end (delta: -76.2MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2022-11-22 00:35:55,610 INFO L158 Benchmark]: TraceAbstraction took 18738.80ms. Allocated memory was 209.7MB in the beginning and 362.8MB in the end (delta: 153.1MB). Free memory was 174.9MB in the beginning and 193.8MB in the end (delta: -18.9MB). Peak memory consumption was 134.2MB. Max. memory is 16.1GB. [2022-11-22 00:35:55,611 INFO L158 Benchmark]: Witness Printer took 122.31ms. Allocated memory is still 362.8MB. Free memory was 193.8MB in the beginning and 182.3MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-22 00:35:55,616 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 174.1MB. Free memory was 143.5MB in the beginning and 143.4MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 624.59ms. Allocated memory is still 174.1MB. Free memory was 126.2MB in the beginning and 103.2MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.00ms. Allocated memory is still 174.1MB. Free memory was 103.2MB in the beginning and 100.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.08ms. Allocated memory is still 174.1MB. Free memory was 100.2MB in the beginning and 98.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 937.24ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 98.7MB in the beginning and 174.9MB in the end (delta: -76.2MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. * TraceAbstraction took 18738.80ms. Allocated memory was 209.7MB in the beginning and 362.8MB in the end (delta: 153.1MB). Free memory was 174.9MB in the beginning and 193.8MB in the end (delta: -18.9MB). Peak memory consumption was 134.2MB. Max. memory is 16.1GB. * Witness Printer took 122.31ms. Allocated memory is still 362.8MB. Free memory was 193.8MB in the beginning and 182.3MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 124 PlacesBefore, 38 PlacesAfterwards, 116 TransitionsBefore, 29 TransitionsAfterwards, 2178 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 100 TotalNumberOfCompositions, 6319 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2799, independent: 2607, independent conditional: 0, independent unconditional: 2607, dependent: 192, dependent conditional: 0, dependent unconditional: 192, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1522, independent: 1463, independent conditional: 0, independent unconditional: 1463, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1522, independent: 1445, independent conditional: 0, independent unconditional: 1445, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 77, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 496, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 472, dependent conditional: 0, dependent unconditional: 472, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2799, independent: 1144, independent conditional: 0, independent unconditional: 1144, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 1522, unknown conditional: 0, unknown unconditional: 1522] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 97, Positive conditional cache size: 0, Positive unconditional cache size: 97, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L823] 0 pthread_t t748; [L824] FCALL, FORK 0 pthread_create(&t748, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t748, ((void *)0), P0, ((void *)0))=-1, t748={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t749; [L826] FCALL, FORK 0 pthread_create(&t749, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t749, ((void *)0), P1, ((void *)0))=0, t748={5:0}, t749={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t750; [L828] FCALL, FORK 0 pthread_create(&t750, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t750, ((void *)0), P2, ((void *)0))=1, t748={5:0}, t749={6:0}, t750={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L792] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L795] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L798] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L801] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L802] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L803] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L804] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L805] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t748={5:0}, t749={6:0}, t750={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 x$flush_delayed = weak$$choice2 [L844] 0 x$mem_tmp = x [L845] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L846] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L847] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L848] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L849] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L851] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L853] 0 x = x$flush_delayed ? x$mem_tmp : x [L854] 0 x$flush_delayed = (_Bool)0 [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 144 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 18.5s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 709 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 709 mSDsluCounter, 350 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 224 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1763 IncrementalHoareTripleChecker+Invalid, 1889 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 126 mSDtfsCounter, 1763 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1032occurred in iteration=0, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 679 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 2578 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-22 00:35:55,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7fc19a3a-7ef8-45c8-a1eb-0368d88f92b2/bin/utaipan-g80aRyZoba/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