./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.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_4246fb3f-80a2-46a9-b904-cac1d24107e8/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4246fb3f-80a2-46a9-b904-cac1d24107e8/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_4246fb3f-80a2-46a9-b904-cac1d24107e8/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4246fb3f-80a2-46a9-b904-cac1d24107e8/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4246fb3f-80a2-46a9-b904-cac1d24107e8/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_4246fb3f-80a2-46a9-b904-cac1d24107e8/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 c0fbd235801aa6198331442d567d46062ed57d086b0069ca7d1e131a6b5917b8 --- 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 02:28:28,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 02:28:28,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 02:28:28,376 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 02:28:28,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 02:28:28,380 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 02:28:28,383 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 02:28:28,385 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 02:28:28,387 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 02:28:28,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 02:28:28,394 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 02:28:28,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 02:28:28,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 02:28:28,399 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 02:28:28,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 02:28:28,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 02:28:28,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 02:28:28,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 02:28:28,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 02:28:28,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 02:28:28,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 02:28:28,418 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 02:28:28,419 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 02:28:28,420 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 02:28:28,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 02:28:28,430 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 02:28:28,430 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 02:28:28,432 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 02:28:28,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 02:28:28,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 02:28:28,435 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 02:28:28,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 02:28:28,437 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 02:28:28,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 02:28:28,440 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 02:28:28,441 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 02:28:28,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 02:28:28,442 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 02:28:28,442 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 02:28:28,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 02:28:28,443 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 02:28:28,444 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4246fb3f-80a2-46a9-b904-cac1d24107e8/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-22 02:28:28,486 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 02:28:28,486 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 02:28:28,487 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 02:28:28,487 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 02:28:28,488 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 02:28:28,488 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 02:28:28,489 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 02:28:28,489 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 02:28:28,489 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 02:28:28,489 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 02:28:28,490 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 02:28:28,491 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 02:28:28,491 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 02:28:28,491 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 02:28:28,491 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 02:28:28,491 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 02:28:28,492 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 02:28:28,492 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 02:28:28,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 02:28:28,493 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 02:28:28,493 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 02:28:28,493 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 02:28:28,493 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 02:28:28,494 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 02:28:28,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 02:28:28,494 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 02:28:28,495 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 02:28:28,495 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 02:28:28,495 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 02:28:28,495 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 02:28:28,496 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 02:28:28,496 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 02:28:28,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:28:28,497 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 02:28:28,497 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 02:28:28,497 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 02:28:28,497 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 02:28:28,497 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 02:28:28,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 02:28:28,498 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 02:28:28,498 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 02:28:28,498 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_4246fb3f-80a2-46a9-b904-cac1d24107e8/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_4246fb3f-80a2-46a9-b904-cac1d24107e8/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 -> c0fbd235801aa6198331442d567d46062ed57d086b0069ca7d1e131a6b5917b8 [2022-11-22 02:28:28,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 02:28:28,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 02:28:28,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 02:28:28,819 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 02:28:28,820 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 02:28:28,821 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4246fb3f-80a2-46a9-b904-cac1d24107e8/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-22 02:28:31,818 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 02:28:32,168 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 02:28:32,169 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4246fb3f-80a2-46a9-b904-cac1d24107e8/sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-22 02:28:32,188 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4246fb3f-80a2-46a9-b904-cac1d24107e8/bin/utaipan-g80aRyZoba/data/6fb360d36/0f20b9b7d0724312bc04d5e6e7cb90e0/FLAG96e3edfd9 [2022-11-22 02:28:32,203 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4246fb3f-80a2-46a9-b904-cac1d24107e8/bin/utaipan-g80aRyZoba/data/6fb360d36/0f20b9b7d0724312bc04d5e6e7cb90e0 [2022-11-22 02:28:32,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 02:28:32,207 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 02:28:32,209 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 02:28:32,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 02:28:32,213 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 02:28:32,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:28:32" (1/1) ... [2022-11-22 02:28:32,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdfd0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:32, skipping insertion in model container [2022-11-22 02:28:32,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:28:32" (1/1) ... [2022-11-22 02:28:32,222 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 02:28:32,279 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 02:28:32,477 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_4246fb3f-80a2-46a9-b904-cac1d24107e8/sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i[1035,1048] [2022-11-22 02:28:32,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:28:32,777 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 02:28:32,798 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_4246fb3f-80a2-46a9-b904-cac1d24107e8/sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i[1035,1048] [2022-11-22 02:28:32,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:28:32,925 INFO L208 MainTranslator]: Completed translation [2022-11-22 02:28:32,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:32 WrapperNode [2022-11-22 02:28:32,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 02:28:32,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 02:28:32,928 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 02:28:32,928 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 02:28:32,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:32" (1/1) ... [2022-11-22 02:28:32,975 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:32" (1/1) ... [2022-11-22 02:28:33,008 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2022-11-22 02:28:33,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 02:28:33,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 02:28:33,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 02:28:33,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 02:28:33,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:32" (1/1) ... [2022-11-22 02:28:33,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:32" (1/1) ... [2022-11-22 02:28:33,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:32" (1/1) ... [2022-11-22 02:28:33,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:32" (1/1) ... [2022-11-22 02:28:33,043 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:32" (1/1) ... [2022-11-22 02:28:33,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:32" (1/1) ... [2022-11-22 02:28:33,062 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:32" (1/1) ... [2022-11-22 02:28:33,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:32" (1/1) ... [2022-11-22 02:28:33,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 02:28:33,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 02:28:33,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 02:28:33,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 02:28:33,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:32" (1/1) ... [2022-11-22 02:28:33,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:28:33,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4246fb3f-80a2-46a9-b904-cac1d24107e8/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:28:33,120 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4246fb3f-80a2-46a9-b904-cac1d24107e8/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 02:28:33,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4246fb3f-80a2-46a9-b904-cac1d24107e8/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 02:28:33,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 02:28:33,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-22 02:28:33,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 02:28:33,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 02:28:33,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 02:28:33,170 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-22 02:28:33,170 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-22 02:28:33,170 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-22 02:28:33,170 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-22 02:28:33,170 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-22 02:28:33,171 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-22 02:28:33,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 02:28:33,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-22 02:28:33,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 02:28:33,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 02:28:33,173 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 02:28:33,308 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 02:28:33,310 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 02:28:33,766 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 02:28:33,978 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 02:28:33,978 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 02:28:33,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:28:33 BoogieIcfgContainer [2022-11-22 02:28:33,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 02:28:33,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 02:28:33,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 02:28:33,988 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 02:28:33,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:28:32" (1/3) ... [2022-11-22 02:28:33,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd28a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:28:33, skipping insertion in model container [2022-11-22 02:28:33,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:28:32" (2/3) ... [2022-11-22 02:28:33,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd28a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:28:33, skipping insertion in model container [2022-11-22 02:28:33,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:28:33" (3/3) ... [2022-11-22 02:28:33,997 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-22 02:28:34,006 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-22 02:28:34,017 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 02:28:34,018 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-22 02:28:34,018 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 02:28:34,085 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-22 02:28:34,136 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 02:28:34,159 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 115 transitions, 245 flow [2022-11-22 02:28:34,165 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 115 transitions, 245 flow [2022-11-22 02:28:34,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-11-22 02:28:34,241 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-11-22 02:28:34,244 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-22 02:28:34,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 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/108 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-11-22 02:28:34,274 INFO L119 LiptonReduction]: Number of co-enabled transitions 1968 [2022-11-22 02:28:39,383 INFO L134 LiptonReduction]: Checked pairs total: 5070 [2022-11-22 02:28:39,383 INFO L136 LiptonReduction]: Total number of compositions: 102 [2022-11-22 02:28:39,391 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2022-11-22 02:28:39,458 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 658 states, 655 states have (on average 3.26412213740458) internal successors, (2138), 657 states have internal predecessors, (2138), 0 states have call successors, (0), 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 02:28:39,476 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 02:28:39,482 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;@1d3fe1e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 02:28:39,483 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-22 02:28:39,488 INFO L276 IsEmpty]: Start isEmpty. Operand has 658 states, 655 states have (on average 3.26412213740458) internal successors, (2138), 657 states have internal predecessors, (2138), 0 states have call successors, (0), 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 02:28:39,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 02:28:39,493 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:28:39,493 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 02:28:39,494 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 02:28:39,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:28:39,499 INFO L85 PathProgramCache]: Analyzing trace with hash 493183109, now seen corresponding path program 1 times [2022-11-22 02:28:39,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:28:39,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092064066] [2022-11-22 02:28:39,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:28:39,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:28:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:28:39,960 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 02:28:39,961 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:28:39,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092064066] [2022-11-22 02:28:39,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092064066] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:28:39,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:28:39,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 02:28:39,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425917500] [2022-11-22 02:28:39,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:28:39,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:28:39,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:28:39,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:28:39,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:28:39,996 INFO L87 Difference]: Start difference. First operand has 658 states, 655 states have (on average 3.26412213740458) internal successors, (2138), 657 states have internal predecessors, (2138), 0 states have call successors, (0), 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 02:28:40,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:28:40,130 INFO L93 Difference]: Finished difference Result 554 states and 1684 transitions. [2022-11-22 02:28:40,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:28:40,133 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 02:28:40,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:28:40,157 INFO L225 Difference]: With dead ends: 554 [2022-11-22 02:28:40,159 INFO L226 Difference]: Without dead ends: 538 [2022-11-22 02:28:40,160 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 02:28:40,166 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 10 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:28:40,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:28:40,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-11-22 02:28:40,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2022-11-22 02:28:40,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 3.0614525139664805) internal successors, (1644), 537 states have internal predecessors, (1644), 0 states have call successors, (0), 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 02:28:40,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1644 transitions. [2022-11-22 02:28:40,257 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1644 transitions. Word has length 5 [2022-11-22 02:28:40,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:28:40,258 INFO L495 AbstractCegarLoop]: Abstraction has 538 states and 1644 transitions. [2022-11-22 02:28:40,258 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 02:28:40,258 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1644 transitions. [2022-11-22 02:28:40,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 02:28:40,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:28:40,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:28:40,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 02:28:40,261 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 02:28:40,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:28:40,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1636103513, now seen corresponding path program 1 times [2022-11-22 02:28:40,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:28:40,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708539187] [2022-11-22 02:28:40,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:28:40,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:28:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:28:40,594 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 02:28:40,594 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:28:40,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708539187] [2022-11-22 02:28:40,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708539187] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:28:40,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:28:40,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:28:40,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112380702] [2022-11-22 02:28:40,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:28:40,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:28:40,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:28:40,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:28:40,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:28:40,598 INFO L87 Difference]: Start difference. First operand 538 states and 1644 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:28:40,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:28:40,758 INFO L93 Difference]: Finished difference Result 618 states and 1816 transitions. [2022-11-22 02:28:40,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:28:40,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-22 02:28:40,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:28:40,762 INFO L225 Difference]: With dead ends: 618 [2022-11-22 02:28:40,762 INFO L226 Difference]: Without dead ends: 522 [2022-11-22 02:28:40,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:28:40,764 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 22 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:28:40,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:28:40,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-11-22 02:28:40,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2022-11-22 02:28:40,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 3.0403071017274472) internal successors, (1584), 521 states have internal predecessors, (1584), 0 states have call successors, (0), 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 02:28:40,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1584 transitions. [2022-11-22 02:28:40,793 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1584 transitions. Word has length 10 [2022-11-22 02:28:40,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:28:40,794 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 1584 transitions. [2022-11-22 02:28:40,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:28:40,794 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1584 transitions. [2022-11-22 02:28:40,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 02:28:40,802 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:28:40,802 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:28:40,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 02:28:40,804 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 02:28:40,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:28:40,805 INFO L85 PathProgramCache]: Analyzing trace with hash 819895588, now seen corresponding path program 1 times [2022-11-22 02:28:40,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:28:40,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234608290] [2022-11-22 02:28:40,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:28:40,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:28:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:28:41,051 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 02:28:41,051 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:28:41,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234608290] [2022-11-22 02:28:41,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234608290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:28:41,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:28:41,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:28:41,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015037212] [2022-11-22 02:28:41,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:28:41,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:28:41,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:28:41,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:28:41,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:28:41,054 INFO L87 Difference]: Start difference. First operand 522 states and 1584 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:28:41,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:28:41,217 INFO L93 Difference]: Finished difference Result 546 states and 1606 transitions. [2022-11-22 02:28:41,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:28:41,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-22 02:28:41,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:28:41,221 INFO L225 Difference]: With dead ends: 546 [2022-11-22 02:28:41,221 INFO L226 Difference]: Without dead ends: 474 [2022-11-22 02:28:41,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:28:41,222 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 30 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:28:41,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 5 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:28:41,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-11-22 02:28:41,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2022-11-22 02:28:41,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 3.0021141649048624) internal successors, (1420), 473 states have internal predecessors, (1420), 0 states have call successors, (0), 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 02:28:41,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1420 transitions. [2022-11-22 02:28:41,242 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1420 transitions. Word has length 11 [2022-11-22 02:28:41,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:28:41,243 INFO L495 AbstractCegarLoop]: Abstraction has 474 states and 1420 transitions. [2022-11-22 02:28:41,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:28:41,243 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1420 transitions. [2022-11-22 02:28:41,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 02:28:41,245 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:28:41,245 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:28:41,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 02:28:41,245 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 02:28:41,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:28:41,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1365819179, now seen corresponding path program 1 times [2022-11-22 02:28:41,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:28:41,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400066942] [2022-11-22 02:28:41,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:28:41,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:28:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:28:41,519 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 02:28:41,519 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:28:41,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400066942] [2022-11-22 02:28:41,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400066942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:28:41,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:28:41,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:28:41,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037680548] [2022-11-22 02:28:41,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:28:41,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:28:41,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:28:41,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:28:41,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:28:41,522 INFO L87 Difference]: Start difference. First operand 474 states and 1420 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 02:28:41,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:28:41,668 INFO L93 Difference]: Finished difference Result 506 states and 1468 transitions. [2022-11-22 02:28:41,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:28:41,668 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 02:28:41,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:28:41,672 INFO L225 Difference]: With dead ends: 506 [2022-11-22 02:28:41,672 INFO L226 Difference]: Without dead ends: 442 [2022-11-22 02:28:41,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:28:41,673 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 31 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:28:41,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 5 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:28:41,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-11-22 02:28:41,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2022-11-22 02:28:41,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 2.9659863945578233) internal successors, (1308), 441 states have internal predecessors, (1308), 0 states have call successors, (0), 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 02:28:41,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1308 transitions. [2022-11-22 02:28:41,711 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1308 transitions. Word has length 12 [2022-11-22 02:28:41,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:28:41,711 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 1308 transitions. [2022-11-22 02:28:41,711 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 02:28:41,711 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1308 transitions. [2022-11-22 02:28:41,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 02:28:41,712 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:28:41,713 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:28:41,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 02:28:41,713 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 02:28:41,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:28:41,714 INFO L85 PathProgramCache]: Analyzing trace with hash 608775350, now seen corresponding path program 1 times [2022-11-22 02:28:41,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:28:41,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251040145] [2022-11-22 02:28:41,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:28:41,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:28:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:28:41,902 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 02:28:41,902 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:28:41,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251040145] [2022-11-22 02:28:41,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251040145] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:28:41,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:28:41,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:28:41,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732247043] [2022-11-22 02:28:41,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:28:41,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:28:41,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:28:41,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:28:41,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:28:41,904 INFO L87 Difference]: Start difference. First operand 442 states and 1308 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:28:42,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:28:42,057 INFO L93 Difference]: Finished difference Result 628 states and 1837 transitions. [2022-11-22 02:28:42,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:28:42,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-22 02:28:42,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:28:42,059 INFO L225 Difference]: With dead ends: 628 [2022-11-22 02:28:42,060 INFO L226 Difference]: Without dead ends: 322 [2022-11-22 02:28:42,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-22 02:28:42,061 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 47 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:28:42,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:28:42,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-11-22 02:28:42,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2022-11-22 02:28:42,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 321 states have (on average 2.8753894080996885) internal successors, (923), 321 states have internal predecessors, (923), 0 states have call successors, (0), 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 02:28:42,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 923 transitions. [2022-11-22 02:28:42,073 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 923 transitions. Word has length 13 [2022-11-22 02:28:42,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:28:42,074 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 923 transitions. [2022-11-22 02:28:42,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:28:42,074 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 923 transitions. [2022-11-22 02:28:42,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 02:28:42,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:28:42,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:28:42,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 02:28:42,076 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 02:28:42,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:28:42,076 INFO L85 PathProgramCache]: Analyzing trace with hash -611597769, now seen corresponding path program 1 times [2022-11-22 02:28:42,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:28:42,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416438022] [2022-11-22 02:28:42,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:28:42,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:28:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:28:42,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 02:28:42,378 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:28:42,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416438022] [2022-11-22 02:28:42,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416438022] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:28:42,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:28:42,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:28:42,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475918586] [2022-11-22 02:28:42,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:28:42,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:28:42,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:28:42,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:28:42,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:28:42,381 INFO L87 Difference]: Start difference. First operand 322 states and 923 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:28:42,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:28:42,466 INFO L93 Difference]: Finished difference Result 228 states and 557 transitions. [2022-11-22 02:28:42,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:28:42,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-22 02:28:42,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:28:42,468 INFO L225 Difference]: With dead ends: 228 [2022-11-22 02:28:42,468 INFO L226 Difference]: Without dead ends: 228 [2022-11-22 02:28:42,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:28:42,469 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 5 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:28:42,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:28:42,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-22 02:28:42,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2022-11-22 02:28:42,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 2.4537444933920707) internal successors, (557), 227 states have internal predecessors, (557), 0 states have call successors, (0), 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 02:28:42,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 557 transitions. [2022-11-22 02:28:42,478 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 557 transitions. Word has length 14 [2022-11-22 02:28:42,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:28:42,478 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 557 transitions. [2022-11-22 02:28:42,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:28:42,479 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 557 transitions. [2022-11-22 02:28:42,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 02:28:42,480 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:28:42,480 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:28:42,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 02:28:42,480 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 02:28:42,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:28:42,481 INFO L85 PathProgramCache]: Analyzing trace with hash 247121103, now seen corresponding path program 1 times [2022-11-22 02:28:42,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:28:42,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069017114] [2022-11-22 02:28:42,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:28:42,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:28:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:28:42,706 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 02:28:42,706 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:28:42,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069017114] [2022-11-22 02:28:42,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069017114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:28:42,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:28:42,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:28:42,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570371611] [2022-11-22 02:28:42,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:28:42,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:28:42,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:28:42,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:28:42,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:28:42,709 INFO L87 Difference]: Start difference. First operand 228 states and 557 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:28:42,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:28:42,794 INFO L93 Difference]: Finished difference Result 132 states and 271 transitions. [2022-11-22 02:28:42,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:28:42,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-22 02:28:42,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:28:42,795 INFO L225 Difference]: With dead ends: 132 [2022-11-22 02:28:42,795 INFO L226 Difference]: Without dead ends: 132 [2022-11-22 02:28:42,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:28:42,796 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 27 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:28:42,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:28:42,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-22 02:28:42,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-11-22 02:28:42,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 2.068702290076336) internal successors, (271), 131 states have internal predecessors, (271), 0 states have call successors, (0), 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 02:28:42,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 271 transitions. [2022-11-22 02:28:42,801 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 271 transitions. Word has length 16 [2022-11-22 02:28:42,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:28:42,801 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 271 transitions. [2022-11-22 02:28:42,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:28:42,801 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 271 transitions. [2022-11-22 02:28:42,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 02:28:42,802 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:28:42,802 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:28:42,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 02:28:42,802 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 02:28:42,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:28:42,803 INFO L85 PathProgramCache]: Analyzing trace with hash -242799799, now seen corresponding path program 1 times [2022-11-22 02:28:42,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:28:42,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647690172] [2022-11-22 02:28:42,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:28:42,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:28:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:28:43,111 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 02:28:43,112 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:28:43,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647690172] [2022-11-22 02:28:43,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647690172] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:28:43,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:28:43,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:28:43,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213495704] [2022-11-22 02:28:43,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:28:43,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:28:43,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:28:43,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:28:43,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:28:43,117 INFO L87 Difference]: Start difference. First operand 132 states and 271 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 02:28:43,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:28:43,206 INFO L93 Difference]: Finished difference Result 98 states and 203 transitions. [2022-11-22 02:28:43,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:28:43,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-11-22 02:28:43,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:28:43,207 INFO L225 Difference]: With dead ends: 98 [2022-11-22 02:28:43,207 INFO L226 Difference]: Without dead ends: 98 [2022-11-22 02:28:43,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:28:43,208 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:28:43,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:28:43,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-22 02:28:43,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-11-22 02:28:43,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 2.0927835051546393) internal successors, (203), 97 states have internal predecessors, (203), 0 states have call successors, (0), 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 02:28:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 203 transitions. [2022-11-22 02:28:43,212 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 203 transitions. Word has length 18 [2022-11-22 02:28:43,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:28:43,212 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 203 transitions. [2022-11-22 02:28:43,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 02:28:43,212 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 203 transitions. [2022-11-22 02:28:43,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 02:28:43,213 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:28:43,213 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] [2022-11-22 02:28:43,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 02:28:43,213 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 02:28:43,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:28:43,214 INFO L85 PathProgramCache]: Analyzing trace with hash 2033317446, now seen corresponding path program 1 times [2022-11-22 02:28:43,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:28:43,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421960617] [2022-11-22 02:28:43,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:28:43,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:28:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:28:45,839 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 02:28:45,839 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:28:45,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421960617] [2022-11-22 02:28:45,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421960617] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:28:45,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:28:45,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-22 02:28:45,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378296528] [2022-11-22 02:28:45,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:28:45,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 02:28:45,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:28:45,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 02:28:45,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-22 02:28:45,841 INFO L87 Difference]: Start difference. First operand 98 states and 203 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:28:46,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:28:46,307 INFO L93 Difference]: Finished difference Result 167 states and 335 transitions. [2022-11-22 02:28:46,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 02:28:46,308 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-22 02:28:46,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:28:46,309 INFO L225 Difference]: With dead ends: 167 [2022-11-22 02:28:46,310 INFO L226 Difference]: Without dead ends: 134 [2022-11-22 02:28:46,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-11-22 02:28:46,310 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 58 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:28:46,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 7 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 02:28:46,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-22 02:28:46,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 100. [2022-11-22 02:28:46,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.0707070707070705) internal successors, (205), 99 states have internal predecessors, (205), 0 states have call successors, (0), 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 02:28:46,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 205 transitions. [2022-11-22 02:28:46,316 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 205 transitions. Word has length 21 [2022-11-22 02:28:46,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:28:46,316 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 205 transitions. [2022-11-22 02:28:46,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:28:46,316 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 205 transitions. [2022-11-22 02:28:46,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 02:28:46,317 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:28:46,317 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] [2022-11-22 02:28:46,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 02:28:46,317 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 02:28:46,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:28:46,318 INFO L85 PathProgramCache]: Analyzing trace with hash -979924946, now seen corresponding path program 2 times [2022-11-22 02:28:46,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:28:46,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473449915] [2022-11-22 02:28:46,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:28:46,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:28:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:28:47,946 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 02:28:47,947 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:28:47,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473449915] [2022-11-22 02:28:47,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473449915] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:28:47,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:28:47,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-22 02:28:47,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689500537] [2022-11-22 02:28:47,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:28:47,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-22 02:28:47,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:28:47,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-22 02:28:47,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-22 02:28:47,949 INFO L87 Difference]: Start difference. First operand 100 states and 205 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:28:48,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:28:48,374 INFO L93 Difference]: Finished difference Result 148 states and 294 transitions. [2022-11-22 02:28:48,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-22 02:28:48,375 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-22 02:28:48,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:28:48,376 INFO L225 Difference]: With dead ends: 148 [2022-11-22 02:28:48,376 INFO L226 Difference]: Without dead ends: 129 [2022-11-22 02:28:48,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-11-22 02:28:48,377 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 58 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:28:48,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 7 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:28:48,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-22 02:28:48,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 100. [2022-11-22 02:28:48,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.0707070707070705) internal successors, (205), 99 states have internal predecessors, (205), 0 states have call successors, (0), 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 02:28:48,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 205 transitions. [2022-11-22 02:28:48,382 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 205 transitions. Word has length 21 [2022-11-22 02:28:48,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:28:48,382 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 205 transitions. [2022-11-22 02:28:48,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:28:48,382 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 205 transitions. [2022-11-22 02:28:48,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-22 02:28:48,383 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:28:48,383 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] [2022-11-22 02:28:48,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 02:28:48,383 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 02:28:48,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:28:48,384 INFO L85 PathProgramCache]: Analyzing trace with hash 391177782, now seen corresponding path program 3 times [2022-11-22 02:28:48,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:28:48,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111048543] [2022-11-22 02:28:48,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:28:48,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:28:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 02:28:48,459 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-22 02:28:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 02:28:48,569 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-22 02:28:48,570 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-22 02:28:48,571 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-22 02:28:48,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-22 02:28:48,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-22 02:28:48,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-22 02:28:48,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-22 02:28:48,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-22 02:28:48,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-22 02:28:48,576 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:28:48,582 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-22 02:28:48,582 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 02:28:48,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:28:48 BasicIcfg [2022-11-22 02:28:48,639 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 02:28:48,640 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 02:28:48,640 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 02:28:48,640 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 02:28:48,641 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:28:33" (3/4) ... [2022-11-22 02:28:48,643 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-22 02:28:48,723 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4246fb3f-80a2-46a9-b904-cac1d24107e8/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 02:28:48,724 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 02:28:48,724 INFO L158 Benchmark]: Toolchain (without parser) took 16517.11ms. Allocated memory was 144.7MB in the beginning and 323.0MB in the end (delta: 178.3MB). Free memory was 102.2MB in the beginning and 257.0MB in the end (delta: -154.7MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2022-11-22 02:28:48,725 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 109.1MB. Free memory is still 78.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 02:28:48,725 INFO L158 Benchmark]: CACSL2BoogieTranslator took 717.85ms. Allocated memory is still 144.7MB. Free memory was 101.7MB in the beginning and 97.8MB in the end (delta: 3.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-22 02:28:48,725 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.92ms. Allocated memory is still 144.7MB. Free memory was 97.6MB in the beginning and 95.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-22 02:28:48,726 INFO L158 Benchmark]: Boogie Preprocessor took 58.31ms. Allocated memory is still 144.7MB. Free memory was 94.6MB in the beginning and 93.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 02:28:48,726 INFO L158 Benchmark]: RCFGBuilder took 912.92ms. Allocated memory is still 144.7MB. Free memory was 93.0MB in the beginning and 55.2MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-22 02:28:48,726 INFO L158 Benchmark]: TraceAbstraction took 14654.80ms. Allocated memory was 144.7MB in the beginning and 323.0MB in the end (delta: 178.3MB). Free memory was 54.2MB in the beginning and 268.5MB in the end (delta: -214.2MB). Peak memory consumption was 136.9MB. Max. memory is 16.1GB. [2022-11-22 02:28:48,727 INFO L158 Benchmark]: Witness Printer took 83.84ms. Allocated memory is still 323.0MB. Free memory was 268.5MB in the beginning and 257.0MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-22 02:28:48,729 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.54ms. Allocated memory is still 109.1MB. Free memory is still 78.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 717.85ms. Allocated memory is still 144.7MB. Free memory was 101.7MB in the beginning and 97.8MB in the end (delta: 3.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.92ms. Allocated memory is still 144.7MB. Free memory was 97.6MB in the beginning and 95.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.31ms. Allocated memory is still 144.7MB. Free memory was 94.6MB in the beginning and 93.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 912.92ms. Allocated memory is still 144.7MB. Free memory was 93.0MB in the beginning and 55.2MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14654.80ms. Allocated memory was 144.7MB in the beginning and 323.0MB in the end (delta: 178.3MB). Free memory was 54.2MB in the beginning and 268.5MB in the end (delta: -214.2MB). Peak memory consumption was 136.9MB. Max. memory is 16.1GB. * Witness Printer took 83.84ms. Allocated memory is still 323.0MB. Free memory was 268.5MB in the beginning and 257.0MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 123 PlacesBefore, 36 PlacesAfterwards, 115 TransitionsBefore, 27 TransitionsAfterwards, 1968 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 102 TotalNumberOfCompositions, 5070 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2721, independent: 2565, independent conditional: 0, independent unconditional: 2565, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1460, independent: 1414, independent conditional: 0, independent unconditional: 1414, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1460, independent: 1396, independent conditional: 0, independent unconditional: 1396, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 64, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 356, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 327, dependent conditional: 0, dependent unconditional: 327, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2721, independent: 1151, independent conditional: 0, independent unconditional: 1151, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 1460, unknown conditional: 0, unknown unconditional: 1460] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 121, Positive conditional cache size: 0, Positive unconditional cache size: 121, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p1_EAX = 0; [L718] 0 int __unbuffered_p1_EBX = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff1_thd0; [L732] 0 _Bool y$r_buff1_thd1; [L733] 0 _Bool y$r_buff1_thd2; [L734] 0 _Bool y$r_buff1_thd3; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1740; [L845] FCALL, FORK 0 pthread_create(&t1740, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1740, ((void *)0), P0, ((void *)0))=-2, t1740={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L846] 0 pthread_t t1741; [L847] FCALL, FORK 0 pthread_create(&t1741, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1741, ((void *)0), P1, ((void *)0))=-1, t1740={5:0}, t1741={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff1 = y$w_buff0 [L775] 2 y$w_buff0 = 1 [L776] 2 y$w_buff1_used = y$w_buff0_used [L777] 2 y$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 2 y$flush_delayed = weak$$choice2 [L789] 2 y$mem_tmp = y [L790] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L791] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L792] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L793] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L794] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L795] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L796] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L797] 2 __unbuffered_p1_EAX = y [L798] 2 y = y$flush_delayed ? y$mem_tmp : y [L799] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=62, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=62, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L848] 0 pthread_t t1742; [L849] FCALL, FORK 0 pthread_create(&t1742, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1742, ((void *)0), P2, ((void *)0))=0, t1740={5:0}, t1741={6:0}, t1742={3:0}, weak$$choice0=62, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L819] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=62, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=62, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L746] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=62, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 y$flush_delayed = weak$$choice2 [L752] 1 y$mem_tmp = y [L753] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L754] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L755] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L756] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L757] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L759] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = y [L761] 1 y = y$flush_delayed ? y$mem_tmp : y [L762] 1 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=63, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L805] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L806] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L807] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L808] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L809] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=63, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L812] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L814] 2 return 0; [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=63, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1740={5:0}, t1741={6:0}, t1742={3:0}, weak$$choice0=63, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L862] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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=63, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 19]: 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: 847]: 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: 849]: 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: 845]: 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, 141 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 14.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 318 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 318 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 959 IncrementalHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 12 mSDtfsCounter, 959 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=658occurred in iteration=0, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 63 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 131 ConstructedInterpolants, 0 QuantifiedInterpolants, 1631 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-22 02:28:48,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4246fb3f-80a2-46a9-b904-cac1d24107e8/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