./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ee45e77-0b37-4964-838c-323bfb2a3b4b/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ee45e77-0b37-4964-838c-323bfb2a3b4b/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ee45e77-0b37-4964-838c-323bfb2a3b4b/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ee45e77-0b37-4964-838c-323bfb2a3b4b/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ee45e77-0b37-4964-838c-323bfb2a3b4b/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ee45e77-0b37-4964-838c-323bfb2a3b4b/bin/utaipan-eEHZpOm5b7 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a86612b573a63cde2c4106f45bf8b3ea66989a894eb80420a80ff8b17f8f03d1 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 20:25:09,316 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 20:25:09,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 20:25:09,379 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 20:25:09,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 20:25:09,385 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 20:25:09,387 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 20:25:09,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 20:25:09,395 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 20:25:09,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 20:25:09,404 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 20:25:09,406 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 20:25:09,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 20:25:09,410 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 20:25:09,413 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 20:25:09,418 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 20:25:09,421 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 20:25:09,423 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 20:25:09,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 20:25:09,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 20:25:09,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 20:25:09,433 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 20:25:09,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 20:25:09,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 20:25:09,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 20:25:09,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 20:25:09,440 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 20:25:09,441 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 20:25:09,442 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 20:25:09,443 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 20:25:09,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 20:25:09,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 20:25:09,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 20:25:09,447 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 20:25:09,448 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 20:25:09,449 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 20:25:09,450 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 20:25:09,450 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 20:25:09,450 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 20:25:09,451 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 20:25:09,452 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 20:25:09,453 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ee45e77-0b37-4964-838c-323bfb2a3b4b/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-25 20:25:09,477 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 20:25:09,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 20:25:09,478 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 20:25:09,478 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 20:25:09,479 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 20:25:09,479 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 20:25:09,479 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 20:25:09,480 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 20:25:09,480 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 20:25:09,480 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 20:25:09,480 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 20:25:09,480 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 20:25:09,481 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 20:25:09,481 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 20:25:09,481 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 20:25:09,481 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 20:25:09,482 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 20:25:09,482 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 20:25:09,483 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 20:25:09,483 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 20:25:09,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 20:25:09,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 20:25:09,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 20:25:09,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 20:25:09,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 20:25:09,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 20:25:09,484 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 20:25:09,485 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 20:25:09,485 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 20:25:09,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 20:25:09,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 20:25:09,486 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 20:25:09,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 20:25:09,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 20:25:09,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 20:25:09,486 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 20:25:09,487 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 20:25:09,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 20:25:09,487 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 20:25:09,487 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 20:25:09,488 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 20:25:09,488 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ee45e77-0b37-4964-838c-323bfb2a3b4b/bin/utaipan-eEHZpOm5b7/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_1ee45e77-0b37-4964-838c-323bfb2a3b4b/bin/utaipan-eEHZpOm5b7 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a86612b573a63cde2c4106f45bf8b3ea66989a894eb80420a80ff8b17f8f03d1 [2021-11-25 20:25:09,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 20:25:09,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 20:25:09,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 20:25:09,779 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 20:25:09,780 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 20:25:09,782 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ee45e77-0b37-4964-838c-323bfb2a3b4b/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i [2021-11-25 20:25:09,852 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ee45e77-0b37-4964-838c-323bfb2a3b4b/bin/utaipan-eEHZpOm5b7/data/99164f491/b5d1eba084c141e9963c23c435444ee3/FLAG5c33703d3 [2021-11-25 20:25:10,390 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 20:25:10,390 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ee45e77-0b37-4964-838c-323bfb2a3b4b/sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i [2021-11-25 20:25:10,420 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ee45e77-0b37-4964-838c-323bfb2a3b4b/bin/utaipan-eEHZpOm5b7/data/99164f491/b5d1eba084c141e9963c23c435444ee3/FLAG5c33703d3 [2021-11-25 20:25:10,672 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ee45e77-0b37-4964-838c-323bfb2a3b4b/bin/utaipan-eEHZpOm5b7/data/99164f491/b5d1eba084c141e9963c23c435444ee3 [2021-11-25 20:25:10,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 20:25:10,679 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 20:25:10,685 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 20:25:10,685 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 20:25:10,689 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 20:25:10,689 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:25:10" (1/1) ... [2021-11-25 20:25:10,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd88e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:25:10, skipping insertion in model container [2021-11-25 20:25:10,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:25:10" (1/1) ... [2021-11-25 20:25:10,701 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 20:25:10,756 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 20:25:10,972 WARN L230 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_1ee45e77-0b37-4964-838c-323bfb2a3b4b/sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i[966,979] [2021-11-25 20:25:11,168 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 20:25:11,183 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 20:25:11,194 WARN L230 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_1ee45e77-0b37-4964-838c-323bfb2a3b4b/sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i[966,979] [2021-11-25 20:25:11,251 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 20:25:11,291 INFO L208 MainTranslator]: Completed translation [2021-11-25 20:25:11,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:25:11 WrapperNode [2021-11-25 20:25:11,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 20:25:11,293 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 20:25:11,293 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 20:25:11,293 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 20:25:11,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:25:11" (1/1) ... [2021-11-25 20:25:11,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:25:11" (1/1) ... [2021-11-25 20:25:11,358 INFO L137 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 275 [2021-11-25 20:25:11,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 20:25:11,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 20:25:11,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 20:25:11,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 20:25:11,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:25:11" (1/1) ... [2021-11-25 20:25:11,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:25:11" (1/1) ... [2021-11-25 20:25:11,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:25:11" (1/1) ... [2021-11-25 20:25:11,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:25:11" (1/1) ... [2021-11-25 20:25:11,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:25:11" (1/1) ... [2021-11-25 20:25:11,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:25:11" (1/1) ... [2021-11-25 20:25:11,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:25:11" (1/1) ... [2021-11-25 20:25:11,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 20:25:11,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 20:25:11,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 20:25:11,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 20:25:11,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:25:11" (1/1) ... [2021-11-25 20:25:11,443 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 20:25:11,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ee45e77-0b37-4964-838c-323bfb2a3b4b/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:25:11,491 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ee45e77-0b37-4964-838c-323bfb2a3b4b/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 20:25:11,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ee45e77-0b37-4964-838c-323bfb2a3b4b/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 20:25:11,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-25 20:25:11,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-25 20:25:11,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 20:25:11,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 20:25:11,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 20:25:11,543 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-11-25 20:25:11,543 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-11-25 20:25:11,543 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-11-25 20:25:11,543 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-11-25 20:25:11,543 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-11-25 20:25:11,544 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-11-25 20:25:11,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 20:25:11,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-25 20:25:11,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 20:25:11,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 20:25:11,546 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-25 20:25:11,721 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 20:25:11,723 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 20:25:12,335 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 20:25:12,758 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 20:25:12,758 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-25 20:25:12,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:25:12 BoogieIcfgContainer [2021-11-25 20:25:12,761 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 20:25:12,763 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 20:25:12,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 20:25:12,767 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 20:25:12,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:25:10" (1/3) ... [2021-11-25 20:25:12,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32dfc7b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:25:12, skipping insertion in model container [2021-11-25 20:25:12,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:25:11" (2/3) ... [2021-11-25 20:25:12,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32dfc7b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:25:12, skipping insertion in model container [2021-11-25 20:25:12,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:25:12" (3/3) ... [2021-11-25 20:25:12,774 INFO L111 eAbstractionObserver]: Analyzing ICFG mix028_power.opt_pso.opt_rmo.opt.i [2021-11-25 20:25:12,780 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-25 20:25:12,781 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 20:25:12,781 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-25 20:25:12,782 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-25 20:25:12,839 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,840 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,840 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,841 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,841 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,841 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,842 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,842 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,842 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,843 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,843 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,844 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,844 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,844 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,845 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,846 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,846 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,846 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,847 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,847 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,847 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,847 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,848 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,848 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,849 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,849 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,849 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,850 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,850 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,850 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,850 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,850 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,851 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,851 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,851 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,851 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,852 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,852 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,852 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,853 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,853 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,853 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,853 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,854 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,854 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,854 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,854 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,855 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,855 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,855 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,855 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,856 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,856 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,856 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,856 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,856 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,857 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,857 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,858 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,858 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,858 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,859 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,859 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,859 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,859 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,860 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,860 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,860 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,860 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,861 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,861 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,862 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,862 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,865 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,865 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,866 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,866 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,867 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,868 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,868 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,868 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,869 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,875 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,875 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,875 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,876 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,880 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,881 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,881 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,881 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,882 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,882 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,882 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,882 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,883 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,883 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,884 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,884 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,884 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,885 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,885 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,885 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,885 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,886 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,886 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,886 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,887 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,887 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,887 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,887 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,888 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,888 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,888 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,888 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,889 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,889 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,889 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,891 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:25:12,891 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-25 20:25:12,948 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 20:25:12,962 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-25 20:25:12,962 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-25 20:25:12,978 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-25 20:25:12,992 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 116 transitions, 247 flow [2021-11-25 20:25:12,995 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 116 transitions, 247 flow [2021-11-25 20:25:12,997 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 247 flow [2021-11-25 20:25:13,062 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-11-25 20:25:13,063 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-25 20:25:13,070 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-11-25 20:25:13,076 INFO L116 LiptonReduction]: Number of co-enabled transitions 2178 [2021-11-25 20:25:18,106 INFO L131 LiptonReduction]: Checked pairs total: 6101 [2021-11-25 20:25:18,107 INFO L133 LiptonReduction]: Total number of compositions: 101 [2021-11-25 20:25:18,126 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 73 flow [2021-11-25 20:25:18,202 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1032 states, 1029 states have (on average 3.3877551020408165) internal successors, (3486), 1031 states have internal predecessors, (3486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:18,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 1032 states, 1029 states have (on average 3.3877551020408165) internal successors, (3486), 1031 states have internal predecessors, (3486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:18,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-25 20:25:18,213 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:25:18,214 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-25 20:25:18,215 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:25:18,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:25:18,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1077192937, now seen corresponding path program 1 times [2021-11-25 20:25:18,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:25:18,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909693155] [2021-11-25 20:25:18,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:25:18,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:25:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:25:18,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:18,562 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:25:18,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909693155] [2021-11-25 20:25:18,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909693155] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:25:18,564 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:25:18,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-25 20:25:18,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475332033] [2021-11-25 20:25:18,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:25:18,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:25:18,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:25:18,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:25:18,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:25:18,613 INFO L87 Difference]: Start difference. First operand has 1032 states, 1029 states have (on average 3.3877551020408165) internal successors, (3486), 1031 states have internal predecessors, (3486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:18,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:25:18,776 INFO L93 Difference]: Finished difference Result 842 states and 2654 transitions. [2021-11-25 20:25:18,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:25:18,780 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 [2021-11-25 20:25:18,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:25:18,817 INFO L225 Difference]: With dead ends: 842 [2021-11-25 20:25:18,817 INFO L226 Difference]: Without dead ends: 812 [2021-11-25 20:25:18,818 INFO L932 BasicCegarLoop]: 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 [2021-11-25 20:25:18,822 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:25:18,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 8 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:25:18,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2021-11-25 20:25:18,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2021-11-25 20:25:18,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 811 states have (on average 3.1750924784217016) internal successors, (2575), 811 states have internal predecessors, (2575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:18,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2575 transitions. [2021-11-25 20:25:18,942 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2575 transitions. Word has length 5 [2021-11-25 20:25:18,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:25:18,943 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 2575 transitions. [2021-11-25 20:25:18,943 INFO L471 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) [2021-11-25 20:25:18,943 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2575 transitions. [2021-11-25 20:25:18,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-25 20:25:18,945 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:25:18,945 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:25:18,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 20:25:18,946 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:25:18,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:25:18,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1946847166, now seen corresponding path program 1 times [2021-11-25 20:25:18,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:25:18,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072880507] [2021-11-25 20:25:18,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:25:18,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:25:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:25:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:19,251 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:25:19,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072880507] [2021-11-25 20:25:19,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072880507] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:25:19,251 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:25:19,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:25:19,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724052509] [2021-11-25 20:25:19,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:25:19,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 20:25:19,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:25:19,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 20:25:19,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:25:19,254 INFO L87 Difference]: Start difference. First operand 812 states and 2575 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:19,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:25:19,421 INFO L93 Difference]: Finished difference Result 938 states and 2860 transitions. [2021-11-25 20:25:19,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 20:25:19,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-25 20:25:19,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:25:19,431 INFO L225 Difference]: With dead ends: 938 [2021-11-25 20:25:19,432 INFO L226 Difference]: Without dead ends: 788 [2021-11-25 20:25:19,433 INFO L932 BasicCegarLoop]: 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 [2021-11-25 20:25:19,436 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 35 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:25:19,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 18 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:25:19,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2021-11-25 20:25:19,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2021-11-25 20:25:19,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 3.1550190597204573) internal successors, (2483), 787 states have internal predecessors, (2483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:19,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 2483 transitions. [2021-11-25 20:25:19,486 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 2483 transitions. Word has length 10 [2021-11-25 20:25:19,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:25:19,487 INFO L470 AbstractCegarLoop]: Abstraction has 788 states and 2483 transitions. [2021-11-25 20:25:19,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:19,487 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 2483 transitions. [2021-11-25 20:25:19,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-25 20:25:19,496 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:25:19,496 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:25:19,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-25 20:25:19,497 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:25:19,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:25:19,498 INFO L85 PathProgramCache]: Analyzing trace with hash 700789070, now seen corresponding path program 1 times [2021-11-25 20:25:19,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:25:19,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657978443] [2021-11-25 20:25:19,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:25:19,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:25:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:25:19,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:19,679 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:25:19,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657978443] [2021-11-25 20:25:19,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657978443] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:25:19,680 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:25:19,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 20:25:19,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684414102] [2021-11-25 20:25:19,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:25:19,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:25:19,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:25:19,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:25:19,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:25:19,684 INFO L87 Difference]: Start difference. First operand 788 states and 2483 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:19,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:25:19,856 INFO L93 Difference]: Finished difference Result 910 states and 2762 transitions. [2021-11-25 20:25:19,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 20:25:19,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-25 20:25:19,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:25:19,865 INFO L225 Difference]: With dead ends: 910 [2021-11-25 20:25:19,865 INFO L226 Difference]: Without dead ends: 772 [2021-11-25 20:25:19,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:25:19,869 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 25 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:25:19,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 16 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:25:19,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2021-11-25 20:25:19,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2021-11-25 20:25:19,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 771 states have (on average 3.1426718547341115) internal successors, (2423), 771 states have internal predecessors, (2423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:19,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 2423 transitions. [2021-11-25 20:25:19,909 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 2423 transitions. Word has length 11 [2021-11-25 20:25:19,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:25:19,909 INFO L470 AbstractCegarLoop]: Abstraction has 772 states and 2423 transitions. [2021-11-25 20:25:19,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:19,910 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 2423 transitions. [2021-11-25 20:25:19,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-25 20:25:19,911 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:25:19,912 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:25:19,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-25 20:25:19,912 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:25:19,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:25:19,913 INFO L85 PathProgramCache]: Analyzing trace with hash 635126353, now seen corresponding path program 1 times [2021-11-25 20:25:19,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:25:19,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544783516] [2021-11-25 20:25:19,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:25:19,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:25:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:25:20,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:20,080 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:25:20,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544783516] [2021-11-25 20:25:20,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544783516] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:25:20,086 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:25:20,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:25:20,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826562320] [2021-11-25 20:25:20,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:25:20,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:25:20,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:25:20,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:25:20,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:25:20,092 INFO L87 Difference]: Start difference. First operand 772 states and 2423 transitions. Second operand has 4 states, 3 states have (on average 4.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) [2021-11-25 20:25:20,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:25:20,259 INFO L93 Difference]: Finished difference Result 1282 states and 3861 transitions. [2021-11-25 20:25:20,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 20:25:20,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.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 [2021-11-25 20:25:20,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:25:20,268 INFO L225 Difference]: With dead ends: 1282 [2021-11-25 20:25:20,268 INFO L226 Difference]: Without dead ends: 892 [2021-11-25 20:25:20,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:25:20,269 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 29 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:25:20,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 20 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:25:20,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2021-11-25 20:25:20,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 742. [2021-11-25 20:25:20,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 3.02834008097166) internal successors, (2244), 741 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:20,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 2244 transitions. [2021-11-25 20:25:20,304 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 2244 transitions. Word has length 12 [2021-11-25 20:25:20,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:25:20,304 INFO L470 AbstractCegarLoop]: Abstraction has 742 states and 2244 transitions. [2021-11-25 20:25:20,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.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) [2021-11-25 20:25:20,305 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 2244 transitions. [2021-11-25 20:25:20,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-25 20:25:20,306 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:25:20,306 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:25:20,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-25 20:25:20,306 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:25:20,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:25:20,307 INFO L85 PathProgramCache]: Analyzing trace with hash 248671190, now seen corresponding path program 1 times [2021-11-25 20:25:20,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:25:20,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008696042] [2021-11-25 20:25:20,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:25:20,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:25:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:25:20,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:20,382 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:25:20,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008696042] [2021-11-25 20:25:20,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008696042] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:25:20,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:25:20,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 20:25:20,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426357372] [2021-11-25 20:25:20,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:25:20,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:25:20,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:25:20,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:25:20,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:25:20,384 INFO L87 Difference]: Start difference. First operand 742 states and 2244 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:20,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:25:20,507 INFO L93 Difference]: Finished difference Result 811 states and 2375 transitions. [2021-11-25 20:25:20,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 20:25:20,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-25 20:25:20,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:25:20,514 INFO L225 Difference]: With dead ends: 811 [2021-11-25 20:25:20,514 INFO L226 Difference]: Without dead ends: 696 [2021-11-25 20:25:20,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:25:20,516 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:25:20,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 17 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:25:20,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2021-11-25 20:25:20,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 696. [2021-11-25 20:25:20,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 695 states have (on average 2.9928057553956835) internal successors, (2080), 695 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:20,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 2080 transitions. [2021-11-25 20:25:20,545 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 2080 transitions. Word has length 12 [2021-11-25 20:25:20,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:25:20,546 INFO L470 AbstractCegarLoop]: Abstraction has 696 states and 2080 transitions. [2021-11-25 20:25:20,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:20,546 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 2080 transitions. [2021-11-25 20:25:20,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-25 20:25:20,547 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:25:20,548 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:25:20,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-25 20:25:20,548 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:25:20,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:25:20,549 INFO L85 PathProgramCache]: Analyzing trace with hash -881033712, now seen corresponding path program 1 times [2021-11-25 20:25:20,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:25:20,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885856048] [2021-11-25 20:25:20,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:25:20,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:25:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:25:20,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:20,755 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:25:20,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885856048] [2021-11-25 20:25:20,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885856048] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:25:20,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:25:20,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:25:20,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727442267] [2021-11-25 20:25:20,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:25:20,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 20:25:20,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:25:20,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 20:25:20,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-25 20:25:20,757 INFO L87 Difference]: Start difference. First operand 696 states and 2080 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:20,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:25:20,973 INFO L93 Difference]: Finished difference Result 780 states and 2258 transitions. [2021-11-25 20:25:20,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 20:25:20,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-25 20:25:20,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:25:20,981 INFO L225 Difference]: With dead ends: 780 [2021-11-25 20:25:20,981 INFO L226 Difference]: Without dead ends: 692 [2021-11-25 20:25:20,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-25 20:25:20,982 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 42 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:25:20,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 26 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 20:25:20,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2021-11-25 20:25:21,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 692. [2021-11-25 20:25:21,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 691 states have (on average 2.955137481910275) internal successors, (2042), 691 states have internal predecessors, (2042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:21,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 2042 transitions. [2021-11-25 20:25:21,012 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 2042 transitions. Word has length 13 [2021-11-25 20:25:21,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:25:21,012 INFO L470 AbstractCegarLoop]: Abstraction has 692 states and 2042 transitions. [2021-11-25 20:25:21,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:21,013 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 2042 transitions. [2021-11-25 20:25:21,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-25 20:25:21,014 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:25:21,015 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:25:21,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-25 20:25:21,015 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:25:21,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:25:21,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1856775037, now seen corresponding path program 1 times [2021-11-25 20:25:21,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:25:21,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958014804] [2021-11-25 20:25:21,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:25:21,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:25:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:25:21,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:21,119 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:25:21,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958014804] [2021-11-25 20:25:21,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958014804] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:25:21,119 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:25:21,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:25:21,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913738298] [2021-11-25 20:25:21,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:25:21,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 20:25:21,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:25:21,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 20:25:21,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:25:21,121 INFO L87 Difference]: Start difference. First operand 692 states and 2042 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 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) [2021-11-25 20:25:21,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:25:21,292 INFO L93 Difference]: Finished difference Result 762 states and 2210 transitions. [2021-11-25 20:25:21,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 20:25:21,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 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 [2021-11-25 20:25:21,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:25:21,299 INFO L225 Difference]: With dead ends: 762 [2021-11-25 20:25:21,299 INFO L226 Difference]: Without dead ends: 702 [2021-11-25 20:25:21,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-25 20:25:21,300 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 29 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:25:21,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 23 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:25:21,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2021-11-25 20:25:21,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 698. [2021-11-25 20:25:21,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 2.9540889526542324) internal successors, (2059), 697 states have internal predecessors, (2059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:21,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 2059 transitions. [2021-11-25 20:25:21,331 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 2059 transitions. Word has length 14 [2021-11-25 20:25:21,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:25:21,331 INFO L470 AbstractCegarLoop]: Abstraction has 698 states and 2059 transitions. [2021-11-25 20:25:21,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 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) [2021-11-25 20:25:21,331 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 2059 transitions. [2021-11-25 20:25:21,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-25 20:25:21,333 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:25:21,333 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:25:21,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-25 20:25:21,334 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:25:21,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:25:21,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1193831799, now seen corresponding path program 2 times [2021-11-25 20:25:21,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:25:21,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884633999] [2021-11-25 20:25:21,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:25:21,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:25:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:25:21,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:21,472 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:25:21,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884633999] [2021-11-25 20:25:21,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884633999] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:25:21,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:25:21,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:25:21,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370582785] [2021-11-25 20:25:21,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:25:21,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 20:25:21,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:25:21,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 20:25:21,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-25 20:25:21,474 INFO L87 Difference]: Start difference. First operand 698 states and 2059 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:21,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:25:21,770 INFO L93 Difference]: Finished difference Result 764 states and 2201 transitions. [2021-11-25 20:25:21,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-25 20:25:21,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-25 20:25:21,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:25:21,778 INFO L225 Difference]: With dead ends: 764 [2021-11-25 20:25:21,778 INFO L226 Difference]: Without dead ends: 698 [2021-11-25 20:25:21,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-25 20:25:21,779 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 54 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:25:21,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 30 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 20:25:21,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2021-11-25 20:25:21,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 692. [2021-11-25 20:25:21,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 691 states have (on average 2.9319826338639654) internal successors, (2026), 691 states have internal predecessors, (2026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:21,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 2026 transitions. [2021-11-25 20:25:21,813 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 2026 transitions. Word has length 14 [2021-11-25 20:25:21,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:25:21,814 INFO L470 AbstractCegarLoop]: Abstraction has 692 states and 2026 transitions. [2021-11-25 20:25:21,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:21,814 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 2026 transitions. [2021-11-25 20:25:21,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 20:25:21,816 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:25:21,816 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:25:21,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-25 20:25:21,817 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:25:21,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:25:21,817 INFO L85 PathProgramCache]: Analyzing trace with hash 981235057, now seen corresponding path program 1 times [2021-11-25 20:25:21,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:25:21,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146376062] [2021-11-25 20:25:21,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:25:21,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:25:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:25:21,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:21,896 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:25:21,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146376062] [2021-11-25 20:25:21,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146376062] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:25:21,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:25:21,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 20:25:21,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990079369] [2021-11-25 20:25:21,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:25:21,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:25:21,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:25:21,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:25:21,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:25:21,900 INFO L87 Difference]: Start difference. First operand 692 states and 2026 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:21,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:25:21,960 INFO L93 Difference]: Finished difference Result 468 states and 1168 transitions. [2021-11-25 20:25:21,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:25:21,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-25 20:25:21,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:25:21,965 INFO L225 Difference]: With dead ends: 468 [2021-11-25 20:25:21,965 INFO L226 Difference]: Without dead ends: 468 [2021-11-25 20:25:21,965 INFO L932 BasicCegarLoop]: 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 [2021-11-25 20:25:21,967 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 8 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 [2021-11-25 20:25:21,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 8 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:25:21,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-11-25 20:25:21,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2021-11-25 20:25:21,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 467 states have (on average 2.501070663811563) internal successors, (1168), 467 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:21,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 1168 transitions. [2021-11-25 20:25:21,988 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 1168 transitions. Word has length 15 [2021-11-25 20:25:21,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:25:21,988 INFO L470 AbstractCegarLoop]: Abstraction has 468 states and 1168 transitions. [2021-11-25 20:25:21,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:21,989 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 1168 transitions. [2021-11-25 20:25:21,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-25 20:25:21,990 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:25:21,990 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:25:21,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-25 20:25:21,990 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:25:21,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:25:21,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1282379873, now seen corresponding path program 1 times [2021-11-25 20:25:21,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:25:21,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036733686] [2021-11-25 20:25:21,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:25:21,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:25:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:25:22,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:22,094 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:25:22,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036733686] [2021-11-25 20:25:22,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036733686] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:25:22,094 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:25:22,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:25:22,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14092224] [2021-11-25 20:25:22,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:25:22,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:25:22,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:25:22,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:25:22,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:25:22,096 INFO L87 Difference]: Start difference. First operand 468 states and 1168 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) [2021-11-25 20:25:22,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:25:22,175 INFO L93 Difference]: Finished difference Result 272 states and 602 transitions. [2021-11-25 20:25:22,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:25:22,175 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 [2021-11-25 20:25:22,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:25:22,177 INFO L225 Difference]: With dead ends: 272 [2021-11-25 20:25:22,177 INFO L226 Difference]: Without dead ends: 272 [2021-11-25 20:25:22,178 INFO L932 BasicCegarLoop]: 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 [2021-11-25 20:25:22,178 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:25:22,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 12 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:25:22,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-11-25 20:25:22,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 264. [2021-11-25 20:25:22,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 2.23574144486692) internal successors, (588), 263 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:22,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 588 transitions. [2021-11-25 20:25:22,189 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 588 transitions. Word has length 16 [2021-11-25 20:25:22,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:25:22,190 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 588 transitions. [2021-11-25 20:25:22,191 INFO L471 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) [2021-11-25 20:25:22,191 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 588 transitions. [2021-11-25 20:25:22,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 20:25:22,192 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:25:22,192 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:25:22,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-25 20:25:22,192 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:25:22,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:25:22,193 INFO L85 PathProgramCache]: Analyzing trace with hash -232169724, now seen corresponding path program 1 times [2021-11-25 20:25:22,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:25:22,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871390404] [2021-11-25 20:25:22,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:25:22,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:25:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:25:22,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:22,335 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:25:22,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871390404] [2021-11-25 20:25:22,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871390404] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:25:22,336 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:25:22,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:25:22,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267600306] [2021-11-25 20:25:22,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:25:22,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 20:25:22,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:25:22,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 20:25:22,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:25:22,338 INFO L87 Difference]: Start difference. First operand 264 states and 588 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:22,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:25:22,426 INFO L93 Difference]: Finished difference Result 216 states and 494 transitions. [2021-11-25 20:25:22,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 20:25:22,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-25 20:25:22,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:25:22,428 INFO L225 Difference]: With dead ends: 216 [2021-11-25 20:25:22,428 INFO L226 Difference]: Without dead ends: 166 [2021-11-25 20:25:22,428 INFO L932 BasicCegarLoop]: 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 [2021-11-25 20:25:22,429 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 43 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:25:22,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 11 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:25:22,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-11-25 20:25:22,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2021-11-25 20:25:22,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 2.296969696969697) internal successors, (379), 165 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:22,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 379 transitions. [2021-11-25 20:25:22,438 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 379 transitions. Word has length 19 [2021-11-25 20:25:22,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:25:22,440 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 379 transitions. [2021-11-25 20:25:22,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:22,441 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 379 transitions. [2021-11-25 20:25:22,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 20:25:22,442 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:25:22,442 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:25:22,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-25 20:25:22,442 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:25:22,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:25:22,443 INFO L85 PathProgramCache]: Analyzing trace with hash 116000800, now seen corresponding path program 1 times [2021-11-25 20:25:22,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:25:22,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382907689] [2021-11-25 20:25:22,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:25:22,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:25:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:25:22,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:22,536 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:25:22,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382907689] [2021-11-25 20:25:22,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382907689] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:25:22,537 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:25:22,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:25:22,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015251378] [2021-11-25 20:25:22,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:25:22,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 20:25:22,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:25:22,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 20:25:22,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:25:22,539 INFO L87 Difference]: Start difference. First operand 166 states and 379 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:22,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:25:22,663 INFO L93 Difference]: Finished difference Result 205 states and 457 transitions. [2021-11-25 20:25:22,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 20:25:22,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 20:25:22,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:25:22,665 INFO L225 Difference]: With dead ends: 205 [2021-11-25 20:25:22,665 INFO L226 Difference]: Without dead ends: 74 [2021-11-25 20:25:22,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-25 20:25:22,666 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 27 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:25:22,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 21 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:25:22,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-11-25 20:25:22,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-11-25 20:25:22,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.904109589041096) internal successors, (139), 73 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:22,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 139 transitions. [2021-11-25 20:25:22,669 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 139 transitions. Word has length 23 [2021-11-25 20:25:22,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:25:22,670 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 139 transitions. [2021-11-25 20:25:22,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:22,670 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 139 transitions. [2021-11-25 20:25:22,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 20:25:22,670 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:25:22,671 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:25:22,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-25 20:25:22,671 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:25:22,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:25:22,671 INFO L85 PathProgramCache]: Analyzing trace with hash 395728090, now seen corresponding path program 2 times [2021-11-25 20:25:22,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:25:22,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671753781] [2021-11-25 20:25:22,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:25:22,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:25:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:25:22,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:22,938 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:25:22,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671753781] [2021-11-25 20:25:22,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671753781] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:25:22,939 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:25:22,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-25 20:25:22,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029173781] [2021-11-25 20:25:22,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:25:22,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-25 20:25:22,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:25:22,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-25 20:25:22,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-25 20:25:22,941 INFO L87 Difference]: Start difference. First operand 74 states and 139 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:23,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:25:23,111 INFO L93 Difference]: Finished difference Result 101 states and 188 transitions. [2021-11-25 20:25:23,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 20:25:23,112 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 20:25:23,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:25:23,113 INFO L225 Difference]: With dead ends: 101 [2021-11-25 20:25:23,113 INFO L226 Difference]: Without dead ends: 78 [2021-11-25 20:25:23,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-25 20:25:23,114 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 23 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:25:23,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 18 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:25:23,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-11-25 20:25:23,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2021-11-25 20:25:23,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.7692307692307692) internal successors, (115), 65 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:23,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 115 transitions. [2021-11-25 20:25:23,117 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 115 transitions. Word has length 23 [2021-11-25 20:25:23,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:25:23,118 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 115 transitions. [2021-11-25 20:25:23,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:23,118 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 115 transitions. [2021-11-25 20:25:23,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 20:25:23,119 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:25:23,119 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:25:23,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-25 20:25:23,119 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:25:23,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:25:23,119 INFO L85 PathProgramCache]: Analyzing trace with hash 804003088, now seen corresponding path program 3 times [2021-11-25 20:25:23,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:25:23,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115270165] [2021-11-25 20:25:23,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:25:23,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:25:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:25:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:25:23,493 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:25:23,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115270165] [2021-11-25 20:25:23,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115270165] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:25:23,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:25:23,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-25 20:25:23,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695089168] [2021-11-25 20:25:23,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:25:23,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-25 20:25:23,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:25:23,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-25 20:25:23,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-25 20:25:23,494 INFO L87 Difference]: Start difference. First operand 66 states and 115 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:23,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:25:23,765 INFO L93 Difference]: Finished difference Result 87 states and 151 transitions. [2021-11-25 20:25:23,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 20:25:23,766 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 20:25:23,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:25:23,766 INFO L225 Difference]: With dead ends: 87 [2021-11-25 20:25:23,766 INFO L226 Difference]: Without dead ends: 52 [2021-11-25 20:25:23,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-11-25 20:25:23,767 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 51 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:25:23,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 23 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 20:25:23,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-11-25 20:25:23,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-11-25 20:25:23,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.7058823529411764) internal successors, (87), 51 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:23,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 87 transitions. [2021-11-25 20:25:23,769 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 87 transitions. Word has length 23 [2021-11-25 20:25:23,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:25:23,770 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 87 transitions. [2021-11-25 20:25:23,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:25:23,770 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 87 transitions. [2021-11-25 20:25:23,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 20:25:23,770 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:25:23,771 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:25:23,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-25 20:25:23,771 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-25 20:25:23,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:25:23,771 INFO L85 PathProgramCache]: Analyzing trace with hash 524200758, now seen corresponding path program 4 times [2021-11-25 20:25:23,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:25:23,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089474110] [2021-11-25 20:25:23,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:25:23,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:25:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-25 20:25:23,831 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-25 20:25:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-25 20:25:24,017 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-25 20:25:24,018 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-25 20:25:24,019 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-11-25 20:25:24,020 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-11-25 20:25:24,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2021-11-25 20:25:24,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2021-11-25 20:25:24,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2021-11-25 20:25:24,021 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-11-25 20:25:24,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-25 20:25:24,025 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:25:24,030 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-11-25 20:25:24,031 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-25 20:25:24,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:25:24 BasicIcfg [2021-11-25 20:25:24,168 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-25 20:25:24,169 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-25 20:25:24,169 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-25 20:25:24,169 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-25 20:25:24,170 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:25:12" (3/4) ... [2021-11-25 20:25:24,171 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-25 20:25:24,308 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ee45e77-0b37-4964-838c-323bfb2a3b4b/bin/utaipan-eEHZpOm5b7/witness.graphml [2021-11-25 20:25:24,308 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-25 20:25:24,311 INFO L158 Benchmark]: Toolchain (without parser) took 13629.87ms. Allocated memory was 102.8MB in the beginning and 213.9MB in the end (delta: 111.1MB). Free memory was 62.0MB in the beginning and 152.5MB in the end (delta: -90.5MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2021-11-25 20:25:24,311 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 102.8MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 20:25:24,312 INFO L158 Benchmark]: CACSL2BoogieTranslator took 607.67ms. Allocated memory is still 102.8MB. Free memory was 61.7MB in the beginning and 65.7MB in the end (delta: -4.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-25 20:25:24,313 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.09ms. Allocated memory is still 102.8MB. Free memory was 65.7MB in the beginning and 62.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-25 20:25:24,313 INFO L158 Benchmark]: Boogie Preprocessor took 43.89ms. Allocated memory is still 102.8MB. Free memory was 62.7MB in the beginning and 60.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-25 20:25:24,314 INFO L158 Benchmark]: RCFGBuilder took 1357.09ms. Allocated memory was 102.8MB in the beginning and 138.4MB in the end (delta: 35.7MB). Free memory was 60.6MB in the beginning and 103.3MB in the end (delta: -42.7MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2021-11-25 20:25:24,314 INFO L158 Benchmark]: TraceAbstraction took 11405.09ms. Allocated memory was 138.4MB in the beginning and 213.9MB in the end (delta: 75.5MB). Free memory was 102.5MB in the beginning and 167.1MB in the end (delta: -64.6MB). Peak memory consumption was 124.3MB. Max. memory is 16.1GB. [2021-11-25 20:25:24,315 INFO L158 Benchmark]: Witness Printer took 139.19ms. Allocated memory is still 213.9MB. Free memory was 167.1MB in the beginning and 152.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-25 20:25:24,321 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.33ms. Allocated memory is still 102.8MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 607.67ms. Allocated memory is still 102.8MB. Free memory was 61.7MB in the beginning and 65.7MB in the end (delta: -4.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.09ms. Allocated memory is still 102.8MB. Free memory was 65.7MB in the beginning and 62.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.89ms. Allocated memory is still 102.8MB. Free memory was 62.7MB in the beginning and 60.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1357.09ms. Allocated memory was 102.8MB in the beginning and 138.4MB in the end (delta: 35.7MB). Free memory was 60.6MB in the beginning and 103.3MB in the end (delta: -42.7MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. * TraceAbstraction took 11405.09ms. Allocated memory was 138.4MB in the beginning and 213.9MB in the end (delta: 75.5MB). Free memory was 102.5MB in the beginning and 167.1MB in the end (delta: -64.6MB). Peak memory consumption was 124.3MB. Max. memory is 16.1GB. * Witness Printer took 139.19ms. Allocated memory is still 213.9MB. Free memory was 167.1MB in the beginning and 152.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 124 PlacesBefore, 38 PlacesAfterwards, 116 TransitionsBefore, 29 TransitionsAfterwards, 2178 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 101 TotalNumberOfCompositions, 6101 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3147, positive: 2961, positive conditional: 0, positive unconditional: 2961, negative: 186, negative conditional: 0, negative unconditional: 186, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1541, positive: 1491, positive conditional: 0, positive unconditional: 1491, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1541, positive: 1473, positive conditional: 0, positive unconditional: 1473, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 68, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 478, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 446, negative conditional: 0, negative unconditional: 446, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3147, positive: 1470, positive conditional: 0, positive unconditional: 1470, negative: 136, negative conditional: 0, negative unconditional: 136, unknown: 1541, unknown conditional: 0, unknown unconditional: 1541] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 151, Positive conditional cache size: 0, Positive unconditional cache size: 151, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L823] 0 pthread_t t748; [L824] FCALL, FORK 0 pthread_create(&t748, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t748, ((void *)0), P0, ((void *)0))=-2, t748={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L825] 0 pthread_t t749; [L826] FCALL, FORK 0 pthread_create(&t749, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t749, ((void *)0), P1, ((void *)0))=-1, t748={5:0}, t749={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L827] 0 pthread_t t750; [L828] FCALL, FORK 0 pthread_create(&t750, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t750, ((void *)0), P2, ((void *)0))=0, t748={5:0}, t749={6:0}, t750={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L792] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L795] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L798] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L801] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L801] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L802] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L802] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L803] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L803] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L804] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L804] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L805] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L805] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L746] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L835] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L836] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L837] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L838] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 x$flush_delayed = weak$$choice2 [L844] 0 x$mem_tmp = x [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L845] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L846] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L846] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L847] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L847] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L848] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L848] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L849] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L850] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L851] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L853] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L853] 0 x = x$flush_delayed ? x$mem_tmp : x [L854] 0 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t748={5:0}, t749={6:0}, t750={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 144 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 439 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 439 mSDsluCounter, 251 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 756 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1251 IncrementalHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 88 mSDtfsCounter, 1251 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1032occurred in iteration=0, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 180 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 233 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 196 ConstructedInterpolants, 0 QuantifiedInterpolants, 1672 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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! [2021-11-25 20:25:24,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ee45e77-0b37-4964-838c-323bfb2a3b4b/bin/utaipan-eEHZpOm5b7/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