./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 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0923062-27a6-4252-9ce9-0e6dc768ce8e/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0923062-27a6-4252-9ce9-0e6dc768ce8e/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0923062-27a6-4252-9ce9-0e6dc768ce8e/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0923062-27a6-4252-9ce9-0e6dc768ce8e/bin/utaipan-aC7eJsxGYH/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_b0923062-27a6-4252-9ce9-0e6dc768ce8e/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0923062-27a6-4252-9ce9-0e6dc768ce8e/bin/utaipan-aC7eJsxGYH --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.1-dev-9ad7fb2 [2021-11-03 03:55:20,123 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 03:55:20,126 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 03:55:20,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 03:55:20,162 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 03:55:20,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 03:55:20,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 03:55:20,168 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 03:55:20,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 03:55:20,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 03:55:20,173 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 03:55:20,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 03:55:20,175 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 03:55:20,177 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 03:55:20,178 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 03:55:20,180 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 03:55:20,181 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 03:55:20,182 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 03:55:20,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 03:55:20,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 03:55:20,190 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 03:55:20,196 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 03:55:20,197 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 03:55:20,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 03:55:20,203 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 03:55:20,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 03:55:20,204 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 03:55:20,205 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 03:55:20,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 03:55:20,207 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 03:55:20,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 03:55:20,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 03:55:20,217 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 03:55:20,218 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 03:55:20,220 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 03:55:20,221 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 03:55:20,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 03:55:20,222 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 03:55:20,222 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 03:55:20,224 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 03:55:20,224 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 03:55:20,225 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0923062-27a6-4252-9ce9-0e6dc768ce8e/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-03 03:55:20,272 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 03:55:20,280 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 03:55:20,282 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 03:55:20,282 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 03:55:20,282 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 03:55:20,282 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 03:55:20,283 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-03 03:55:20,283 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 03:55:20,289 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 03:55:20,290 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-03 03:55:20,291 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-03 03:55:20,291 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 03:55:20,291 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-03 03:55:20,291 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-03 03:55:20,292 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-03 03:55:20,293 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 03:55:20,293 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 03:55:20,293 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 03:55:20,293 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 03:55:20,293 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 03:55:20,294 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 03:55:20,294 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 03:55:20,294 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 03:55:20,294 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 03:55:20,294 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 03:55:20,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 03:55:20,295 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 03:55:20,295 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 03:55:20,295 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 03:55:20,297 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 03:55:20,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 03:55:20,298 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 03:55:20,298 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 03:55:20,298 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 03:55:20,298 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-03 03:55:20,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 03:55:20,299 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 03:55:20,299 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 03:55:20,300 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 03:55:20,300 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_b0923062-27a6-4252-9ce9-0e6dc768ce8e/bin/utaipan-aC7eJsxGYH/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_b0923062-27a6-4252-9ce9-0e6dc768ce8e/bin/utaipan-aC7eJsxGYH 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-03 03:55:20,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 03:55:20,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 03:55:20,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 03:55:20,619 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 03:55:20,620 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 03:55:20,621 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0923062-27a6-4252-9ce9-0e6dc768ce8e/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i [2021-11-03 03:55:20,716 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0923062-27a6-4252-9ce9-0e6dc768ce8e/bin/utaipan-aC7eJsxGYH/data/95177dd4d/d52d320a16e044a89800a6b413623e72/FLAGdda05aaad [2021-11-03 03:55:21,417 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 03:55:21,419 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0923062-27a6-4252-9ce9-0e6dc768ce8e/sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i [2021-11-03 03:55:21,444 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0923062-27a6-4252-9ce9-0e6dc768ce8e/bin/utaipan-aC7eJsxGYH/data/95177dd4d/d52d320a16e044a89800a6b413623e72/FLAGdda05aaad [2021-11-03 03:55:21,649 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0923062-27a6-4252-9ce9-0e6dc768ce8e/bin/utaipan-aC7eJsxGYH/data/95177dd4d/d52d320a16e044a89800a6b413623e72 [2021-11-03 03:55:21,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 03:55:21,653 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 03:55:21,655 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 03:55:21,655 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 03:55:21,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 03:55:21,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:55:21" (1/1) ... [2021-11-03 03:55:21,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9293622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:21, skipping insertion in model container [2021-11-03 03:55:21,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:55:21" (1/1) ... [2021-11-03 03:55:21,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 03:55:21,708 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 03:55:21,896 WARN L228 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_b0923062-27a6-4252-9ce9-0e6dc768ce8e/sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i[966,979] [2021-11-03 03:55:22,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 03:55:22,119 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 03:55:22,130 WARN L228 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_b0923062-27a6-4252-9ce9-0e6dc768ce8e/sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i[966,979] [2021-11-03 03:55:22,178 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 03:55:22,222 INFO L208 MainTranslator]: Completed translation [2021-11-03 03:55:22,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:22 WrapperNode [2021-11-03 03:55:22,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 03:55:22,224 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 03:55:22,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 03:55:22,225 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 03:55:22,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:22" (1/1) ... [2021-11-03 03:55:22,251 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:22" (1/1) ... [2021-11-03 03:55:22,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 03:55:22,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 03:55:22,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 03:55:22,286 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 03:55:22,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:22" (1/1) ... [2021-11-03 03:55:22,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:22" (1/1) ... [2021-11-03 03:55:22,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:22" (1/1) ... [2021-11-03 03:55:22,300 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:22" (1/1) ... [2021-11-03 03:55:22,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:22" (1/1) ... [2021-11-03 03:55:22,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:22" (1/1) ... [2021-11-03 03:55:22,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:22" (1/1) ... [2021-11-03 03:55:22,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 03:55:22,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 03:55:22,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 03:55:22,337 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 03:55:22,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:22" (1/1) ... [2021-11-03 03:55:22,346 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 03:55:22,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0923062-27a6-4252-9ce9-0e6dc768ce8e/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 03:55:22,396 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0923062-27a6-4252-9ce9-0e6dc768ce8e/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 03:55:22,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0923062-27a6-4252-9ce9-0e6dc768ce8e/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 03:55:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-03 03:55:22,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-03 03:55:22,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 03:55:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 03:55:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-11-03 03:55:22,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-11-03 03:55:22,451 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-11-03 03:55:22,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-11-03 03:55:22,451 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-11-03 03:55:22,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-11-03 03:55:22,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 03:55:22,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-03 03:55:22,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 03:55:22,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 03:55:22,476 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-03 03:55:24,644 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 03:55:24,645 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-11-03 03:55:24,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:55:24 BoogieIcfgContainer [2021-11-03 03:55:24,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 03:55:24,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 03:55:24,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 03:55:24,656 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 03:55:24,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:55:21" (1/3) ... [2021-11-03 03:55:24,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d7c94e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:55:24, skipping insertion in model container [2021-11-03 03:55:24,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:55:22" (2/3) ... [2021-11-03 03:55:24,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d7c94e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:55:24, skipping insertion in model container [2021-11-03 03:55:24,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:55:24" (3/3) ... [2021-11-03 03:55:24,660 INFO L111 eAbstractionObserver]: Analyzing ICFG mix028_power.opt_pso.opt_rmo.opt.i [2021-11-03 03:55:24,666 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-03 03:55:24,667 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 03:55:24,667 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-03 03:55:24,667 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-03 03:55:24,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,717 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,718 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,719 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,719 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,719 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,720 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,721 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,722 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,723 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,724 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,727 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,728 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,728 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,728 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,729 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,729 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,729 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,729 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,730 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,730 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,730 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,736 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,736 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,737 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,737 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,748 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,748 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,754 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,763 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,766 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,769 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,769 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,770 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,770 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,770 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,770 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,770 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,771 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,772 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,773 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,773 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,773 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,774 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,775 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,776 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-03 03:55:24,778 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-03 03:55:24,839 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 03:55:24,855 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-03 03:55:24,858 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-03 03:55:24,889 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-03 03:55:24,904 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 108 transitions, 231 flow [2021-11-03 03:55:24,906 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 108 transitions, 231 flow [2021-11-03 03:55:24,908 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2021-11-03 03:55:24,951 INFO L129 PetriNetUnfolder]: 2/105 cut-off events. [2021-11-03 03:55:24,952 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-03 03:55:24,955 INFO L84 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 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/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2021-11-03 03:55:24,959 INFO L116 LiptonReduction]: Number of co-enabled transitions 1948 [2021-11-03 03:55:41,976 INFO L131 LiptonReduction]: Checked pairs total: 5572 [2021-11-03 03:55:41,976 INFO L133 LiptonReduction]: Total number of compositions: 94 [2021-11-03 03:55:41,988 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 27 transitions, 69 flow [2021-11-03 03:55:42,073 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 852 states, 849 states have (on average 3.1590106007067136) internal successors, (2682), 851 states have internal predecessors, (2682), 0 states have call successors, (0), 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-03 03:55:42,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 852 states, 849 states have (on average 3.1590106007067136) internal successors, (2682), 851 states have internal predecessors, (2682), 0 states have call successors, (0), 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-03 03:55:42,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-03 03:55:42,083 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:55:42,084 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-03 03:55:42,085 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-03 03:55:42,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:55:42,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1051627760, now seen corresponding path program 1 times [2021-11-03 03:55:42,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:55:42,104 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341062278] [2021-11-03 03:55:42,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:55:42,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:55:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:55:42,482 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-03 03:55:42,482 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:55:42,484 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341062278] [2021-11-03 03:55:42,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341062278] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:55:42,485 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:55:42,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-03 03:55:42,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48097937] [2021-11-03 03:55:42,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 03:55:42,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:55:42,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 03:55:42,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 03:55:42,520 INFO L87 Difference]: Start difference. First operand has 852 states, 849 states have (on average 3.1590106007067136) internal successors, (2682), 851 states have internal predecessors, (2682), 0 states have call successors, (0), 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-03 03:55:42,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:55:42,642 INFO L93 Difference]: Finished difference Result 692 states and 2139 transitions. [2021-11-03 03:55:42,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 03:55:42,644 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-03 03:55:42,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:55:42,675 INFO L225 Difference]: With dead ends: 692 [2021-11-03 03:55:42,676 INFO L226 Difference]: Without dead ends: 662 [2021-11-03 03:55:42,677 INFO L786 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-03 03:55:42,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2021-11-03 03:55:42,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2021-11-03 03:55:42,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 3.1164901664145233) internal successors, (2060), 661 states have internal predecessors, (2060), 0 states have call successors, (0), 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-03 03:55:42,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 2060 transitions. [2021-11-03 03:55:42,807 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 2060 transitions. Word has length 5 [2021-11-03 03:55:42,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:55:42,807 INFO L470 AbstractCegarLoop]: Abstraction has 662 states and 2060 transitions. [2021-11-03 03:55:42,808 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-03 03:55:42,808 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 2060 transitions. [2021-11-03 03:55:42,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-03 03:55:42,810 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:55:42,811 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:55:42,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 03:55:42,811 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-03 03:55:42,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:55:42,812 INFO L85 PathProgramCache]: Analyzing trace with hash 923508134, now seen corresponding path program 1 times [2021-11-03 03:55:42,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:55:42,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659769730] [2021-11-03 03:55:42,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:55:42,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:55:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:55:43,029 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-03 03:55:43,029 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:55:43,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659769730] [2021-11-03 03:55:43,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659769730] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:55:43,030 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:55:43,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-03 03:55:43,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374745020] [2021-11-03 03:55:43,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 03:55:43,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:55:43,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 03:55:43,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 03:55:43,034 INFO L87 Difference]: Start difference. First operand 662 states and 2060 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:55:43,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:55:43,055 INFO L93 Difference]: Finished difference Result 652 states and 2022 transitions. [2021-11-03 03:55:43,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 03:55:43,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-03 03:55:43,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:55:43,063 INFO L225 Difference]: With dead ends: 652 [2021-11-03 03:55:43,063 INFO L226 Difference]: Without dead ends: 652 [2021-11-03 03:55:43,065 INFO L786 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-03 03:55:43,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2021-11-03 03:55:43,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2021-11-03 03:55:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 651 states have (on average 3.1059907834101383) internal successors, (2022), 651 states have internal predecessors, (2022), 0 states have call successors, (0), 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-03 03:55:43,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 2022 transitions. [2021-11-03 03:55:43,096 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 2022 transitions. Word has length 9 [2021-11-03 03:55:43,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:55:43,097 INFO L470 AbstractCegarLoop]: Abstraction has 652 states and 2022 transitions. [2021-11-03 03:55:43,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:55:43,097 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 2022 transitions. [2021-11-03 03:55:43,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-03 03:55:43,102 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:55:43,102 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:55:43,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 03:55:43,104 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-03 03:55:43,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:55:43,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1437504674, now seen corresponding path program 1 times [2021-11-03 03:55:43,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:55:43,105 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578538620] [2021-11-03 03:55:43,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:55:43,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:55:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:55:43,262 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-03 03:55:43,263 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:55:43,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578538620] [2021-11-03 03:55:43,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578538620] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:55:43,264 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:55:43,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-03 03:55:43,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221046141] [2021-11-03 03:55:43,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 03:55:43,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:55:43,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 03:55:43,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 03:55:43,271 INFO L87 Difference]: Start difference. First operand 652 states and 2022 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:55:43,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:55:43,290 INFO L93 Difference]: Finished difference Result 612 states and 1880 transitions. [2021-11-03 03:55:43,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 03:55:43,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-03 03:55:43,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:55:43,298 INFO L225 Difference]: With dead ends: 612 [2021-11-03 03:55:43,299 INFO L226 Difference]: Without dead ends: 612 [2021-11-03 03:55:43,299 INFO L786 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-03 03:55:43,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2021-11-03 03:55:43,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2021-11-03 03:55:43,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 611 states have (on average 3.076923076923077) internal successors, (1880), 611 states have internal predecessors, (1880), 0 states have call successors, (0), 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-03 03:55:43,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1880 transitions. [2021-11-03 03:55:43,330 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1880 transitions. Word has length 10 [2021-11-03 03:55:43,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:55:43,330 INFO L470 AbstractCegarLoop]: Abstraction has 612 states and 1880 transitions. [2021-11-03 03:55:43,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:55:43,331 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1880 transitions. [2021-11-03 03:55:43,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-03 03:55:43,338 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:55:43,338 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:55:43,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-03 03:55:43,339 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-03 03:55:43,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:55:43,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1612973844, now seen corresponding path program 1 times [2021-11-03 03:55:43,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:55:43,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932563939] [2021-11-03 03:55:43,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:55:43,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:55:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:55:43,585 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-03 03:55:43,585 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:55:43,586 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932563939] [2021-11-03 03:55:43,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932563939] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:55:43,587 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:55:43,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-03 03:55:43,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614494946] [2021-11-03 03:55:43,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 03:55:43,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:55:43,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 03:55:43,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 03:55:43,590 INFO L87 Difference]: Start difference. First operand 612 states and 1880 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-03 03:55:43,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:55:43,633 INFO L93 Difference]: Finished difference Result 604 states and 1850 transitions. [2021-11-03 03:55:43,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 03:55:43,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-03 03:55:43,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:55:43,641 INFO L225 Difference]: With dead ends: 604 [2021-11-03 03:55:43,641 INFO L226 Difference]: Without dead ends: 604 [2021-11-03 03:55:43,642 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 03:55:43,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2021-11-03 03:55:43,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2021-11-03 03:55:43,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 603 states have (on average 3.067993366500829) internal successors, (1850), 603 states have internal predecessors, (1850), 0 states have call successors, (0), 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-03 03:55:43,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1850 transitions. [2021-11-03 03:55:43,673 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1850 transitions. Word has length 11 [2021-11-03 03:55:43,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:55:43,674 INFO L470 AbstractCegarLoop]: Abstraction has 604 states and 1850 transitions. [2021-11-03 03:55:43,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-03 03:55:43,674 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1850 transitions. [2021-11-03 03:55:43,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-03 03:55:43,677 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:55:43,677 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:55:43,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-03 03:55:43,677 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-03 03:55:43,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:55:43,679 INFO L85 PathProgramCache]: Analyzing trace with hash 2018031889, now seen corresponding path program 1 times [2021-11-03 03:55:43,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:55:43,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906637418] [2021-11-03 03:55:43,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:55:43,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:55:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:55:43,834 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-03 03:55:43,834 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:55:43,834 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906637418] [2021-11-03 03:55:43,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906637418] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:55:43,835 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:55:43,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 03:55:43,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181737282] [2021-11-03 03:55:43,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 03:55:43,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:55:43,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 03:55:43,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:55:43,837 INFO L87 Difference]: Start difference. First operand 604 states and 1850 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:55:43,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:55:43,919 INFO L93 Difference]: Finished difference Result 620 states and 1894 transitions. [2021-11-03 03:55:43,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 03:55:43,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-03 03:55:43,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:55:43,926 INFO L225 Difference]: With dead ends: 620 [2021-11-03 03:55:43,927 INFO L226 Difference]: Without dead ends: 620 [2021-11-03 03:55:43,927 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-03 03:55:43,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2021-11-03 03:55:43,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2021-11-03 03:55:43,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 3.0597738287560583) internal successors, (1894), 619 states have internal predecessors, (1894), 0 states have call successors, (0), 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-03 03:55:43,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 1894 transitions. [2021-11-03 03:55:43,953 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 1894 transitions. Word has length 12 [2021-11-03 03:55:43,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:55:43,954 INFO L470 AbstractCegarLoop]: Abstraction has 620 states and 1894 transitions. [2021-11-03 03:55:43,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:55:43,954 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 1894 transitions. [2021-11-03 03:55:43,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 03:55:43,956 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:55:43,956 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:55:43,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-03 03:55:43,956 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-03 03:55:43,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:55:43,957 INFO L85 PathProgramCache]: Analyzing trace with hash 415318159, now seen corresponding path program 1 times [2021-11-03 03:55:43,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:55:43,957 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370918840] [2021-11-03 03:55:43,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:55:43,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:55:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:55:44,023 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-03 03:55:44,024 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:55:44,024 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370918840] [2021-11-03 03:55:44,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370918840] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:55:44,024 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:55:44,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 03:55:44,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877121076] [2021-11-03 03:55:44,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:55:44,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:55:44,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:55:44,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:55:44,026 INFO L87 Difference]: Start difference. First operand 620 states and 1894 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-03 03:55:44,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:55:44,081 INFO L93 Difference]: Finished difference Result 630 states and 1925 transitions. [2021-11-03 03:55:44,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 03:55:44,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-03 03:55:44,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:55:44,088 INFO L225 Difference]: With dead ends: 630 [2021-11-03 03:55:44,088 INFO L226 Difference]: Without dead ends: 630 [2021-11-03 03:55:44,089 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-03 03:55:44,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2021-11-03 03:55:44,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 626. [2021-11-03 03:55:44,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 625 states have (on average 3.0576) internal successors, (1911), 625 states have internal predecessors, (1911), 0 states have call successors, (0), 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-03 03:55:44,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 1911 transitions. [2021-11-03 03:55:44,114 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 1911 transitions. Word has length 13 [2021-11-03 03:55:44,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:55:44,115 INFO L470 AbstractCegarLoop]: Abstraction has 626 states and 1911 transitions. [2021-11-03 03:55:44,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-03 03:55:44,115 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 1911 transitions. [2021-11-03 03:55:44,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 03:55:44,117 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:55:44,117 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:55:44,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-03 03:55:44,117 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-03 03:55:44,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:55:44,118 INFO L85 PathProgramCache]: Analyzing trace with hash 332765779, now seen corresponding path program 2 times [2021-11-03 03:55:44,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:55:44,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408376536] [2021-11-03 03:55:44,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:55:44,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:55:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:55:44,207 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-03 03:55:44,207 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:55:44,208 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408376536] [2021-11-03 03:55:44,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408376536] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:55:44,208 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:55:44,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 03:55:44,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756789289] [2021-11-03 03:55:44,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 03:55:44,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:55:44,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 03:55:44,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:55:44,210 INFO L87 Difference]: Start difference. First operand 626 states and 1911 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:55:44,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:55:44,278 INFO L93 Difference]: Finished difference Result 618 states and 1884 transitions. [2021-11-03 03:55:44,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 03:55:44,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-03 03:55:44,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:55:44,285 INFO L225 Difference]: With dead ends: 618 [2021-11-03 03:55:44,285 INFO L226 Difference]: Without dead ends: 618 [2021-11-03 03:55:44,286 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-03 03:55:44,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2021-11-03 03:55:44,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 608. [2021-11-03 03:55:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 607 states have (on average 3.0527182866556837) internal successors, (1853), 607 states have internal predecessors, (1853), 0 states have call successors, (0), 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-03 03:55:44,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 1853 transitions. [2021-11-03 03:55:44,311 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 1853 transitions. Word has length 13 [2021-11-03 03:55:44,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:55:44,311 INFO L470 AbstractCegarLoop]: Abstraction has 608 states and 1853 transitions. [2021-11-03 03:55:44,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:55:44,312 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 1853 transitions. [2021-11-03 03:55:44,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-03 03:55:44,314 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:55:44,314 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:55:44,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-03 03:55:44,314 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-03 03:55:44,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:55:44,315 INFO L85 PathProgramCache]: Analyzing trace with hash 14612816, now seen corresponding path program 1 times [2021-11-03 03:55:44,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:55:44,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021695236] [2021-11-03 03:55:44,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:55:44,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:55:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:55:44,469 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-03 03:55:44,469 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:55:44,469 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021695236] [2021-11-03 03:55:44,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021695236] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:55:44,469 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:55:44,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 03:55:44,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43830859] [2021-11-03 03:55:44,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:55:44,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:55:44,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:55:44,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:55:44,470 INFO L87 Difference]: Start difference. First operand 608 states and 1853 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:55:44,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:55:44,517 INFO L93 Difference]: Finished difference Result 570 states and 1538 transitions. [2021-11-03 03:55:44,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 03:55:44,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-03 03:55:44,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:55:44,521 INFO L225 Difference]: With dead ends: 570 [2021-11-03 03:55:44,522 INFO L226 Difference]: Without dead ends: 412 [2021-11-03 03:55:44,522 INFO L786 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-03 03:55:44,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2021-11-03 03:55:44,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2021-11-03 03:55:44,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 2.6009732360097324) internal successors, (1069), 411 states have internal predecessors, (1069), 0 states have call successors, (0), 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-03 03:55:44,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1069 transitions. [2021-11-03 03:55:44,538 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 1069 transitions. Word has length 14 [2021-11-03 03:55:44,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:55:44,539 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 1069 transitions. [2021-11-03 03:55:44,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:55:44,539 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1069 transitions. [2021-11-03 03:55:44,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-03 03:55:44,540 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:55:44,541 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:55:44,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-03 03:55:44,541 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-03 03:55:44,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:55:44,542 INFO L85 PathProgramCache]: Analyzing trace with hash -377375334, now seen corresponding path program 1 times [2021-11-03 03:55:44,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:55:44,545 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680580518] [2021-11-03 03:55:44,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:55:44,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:55:44,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:55:44,675 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-03 03:55:44,676 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:55:44,676 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680580518] [2021-11-03 03:55:44,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680580518] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:55:44,676 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:55:44,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 03:55:44,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997374432] [2021-11-03 03:55:44,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 03:55:44,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:55:44,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 03:55:44,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:55:44,680 INFO L87 Difference]: Start difference. First operand 412 states and 1069 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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-03 03:55:44,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:55:44,717 INFO L93 Difference]: Finished difference Result 333 states and 803 transitions. [2021-11-03 03:55:44,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 03:55:44,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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-03 03:55:44,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:55:44,720 INFO L225 Difference]: With dead ends: 333 [2021-11-03 03:55:44,720 INFO L226 Difference]: Without dead ends: 259 [2021-11-03 03:55:44,720 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-03 03:55:44,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-11-03 03:55:44,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 251. [2021-11-03 03:55:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 2.36) internal successors, (590), 250 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:55:44,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 590 transitions. [2021-11-03 03:55:44,729 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 590 transitions. Word has length 15 [2021-11-03 03:55:44,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:55:44,730 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 590 transitions. [2021-11-03 03:55:44,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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-03 03:55:44,730 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 590 transitions. [2021-11-03 03:55:44,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-03 03:55:44,731 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:55:44,731 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:55:44,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-03 03:55:44,732 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-03 03:55:44,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:55:44,732 INFO L85 PathProgramCache]: Analyzing trace with hash -816786392, now seen corresponding path program 1 times [2021-11-03 03:55:44,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:55:44,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507545433] [2021-11-03 03:55:44,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:55:44,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:55:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:55:44,845 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-03 03:55:44,846 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:55:44,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507545433] [2021-11-03 03:55:44,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507545433] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:55:44,846 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:55:44,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 03:55:44,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939007031] [2021-11-03 03:55:44,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 03:55:44,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:55:44,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 03:55:44,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-03 03:55:44,849 INFO L87 Difference]: Start difference. First operand 251 states and 590 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:55:44,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:55:44,890 INFO L93 Difference]: Finished difference Result 229 states and 544 transitions. [2021-11-03 03:55:44,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 03:55:44,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-03 03:55:44,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:55:44,893 INFO L225 Difference]: With dead ends: 229 [2021-11-03 03:55:44,893 INFO L226 Difference]: Without dead ends: 215 [2021-11-03 03:55:44,893 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-11-03 03:55:44,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-11-03 03:55:44,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2021-11-03 03:55:44,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 2.4205607476635516) internal successors, (518), 214 states have internal predecessors, (518), 0 states have call successors, (0), 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-03 03:55:44,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 518 transitions. [2021-11-03 03:55:44,901 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 518 transitions. Word has length 18 [2021-11-03 03:55:44,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:55:44,902 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 518 transitions. [2021-11-03 03:55:44,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:55:44,902 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 518 transitions. [2021-11-03 03:55:44,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-03 03:55:44,903 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:55:44,904 INFO L513 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] [2021-11-03 03:55:44,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-03 03:55:44,904 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-03 03:55:44,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:55:44,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1443826134, now seen corresponding path program 1 times [2021-11-03 03:55:44,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:55:44,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983950397] [2021-11-03 03:55:44,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:55:44,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:55:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:55:45,188 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-03 03:55:45,189 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:55:45,189 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983950397] [2021-11-03 03:55:45,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983950397] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:55:45,189 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:55:45,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-03 03:55:45,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456844059] [2021-11-03 03:55:45,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 03:55:45,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:55:45,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 03:55:45,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-03 03:55:45,191 INFO L87 Difference]: Start difference. First operand 215 states and 518 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 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-03 03:55:45,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:55:45,325 INFO L93 Difference]: Finished difference Result 271 states and 631 transitions. [2021-11-03 03:55:45,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 03:55:45,326 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-11-03 03:55:45,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:55:45,328 INFO L225 Difference]: With dead ends: 271 [2021-11-03 03:55:45,328 INFO L226 Difference]: Without dead ends: 249 [2021-11-03 03:55:45,328 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-11-03 03:55:45,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-11-03 03:55:45,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 207. [2021-11-03 03:55:45,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 2.3980582524271843) internal successors, (494), 206 states have internal predecessors, (494), 0 states have call successors, (0), 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-03 03:55:45,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 494 transitions. [2021-11-03 03:55:45,338 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 494 transitions. Word has length 22 [2021-11-03 03:55:45,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:55:45,338 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 494 transitions. [2021-11-03 03:55:45,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 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-03 03:55:45,338 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 494 transitions. [2021-11-03 03:55:45,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-03 03:55:45,339 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:55:45,340 INFO L513 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] [2021-11-03 03:55:45,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-03 03:55:45,340 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-03 03:55:45,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:55:45,341 INFO L85 PathProgramCache]: Analyzing trace with hash -2041763114, now seen corresponding path program 2 times [2021-11-03 03:55:45,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:55:45,341 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214104766] [2021-11-03 03:55:45,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:55:45,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:55:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:55:45,705 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-03 03:55:45,705 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:55:45,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214104766] [2021-11-03 03:55:45,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214104766] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:55:45,705 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:55:45,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-03 03:55:45,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708424185] [2021-11-03 03:55:45,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 03:55:45,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:55:45,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 03:55:45,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-03 03:55:45,707 INFO L87 Difference]: Start difference. First operand 207 states and 494 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 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-03 03:55:45,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:55:45,916 INFO L93 Difference]: Finished difference Result 263 states and 607 transitions. [2021-11-03 03:55:45,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 03:55:45,917 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-11-03 03:55:45,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:55:45,918 INFO L225 Difference]: With dead ends: 263 [2021-11-03 03:55:45,919 INFO L226 Difference]: Without dead ends: 189 [2021-11-03 03:55:45,919 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-11-03 03:55:45,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-11-03 03:55:45,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 183. [2021-11-03 03:55:45,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 2.340659340659341) internal successors, (426), 182 states have internal predecessors, (426), 0 states have call successors, (0), 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-03 03:55:45,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 426 transitions. [2021-11-03 03:55:45,926 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 426 transitions. Word has length 22 [2021-11-03 03:55:45,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:55:45,926 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 426 transitions. [2021-11-03 03:55:45,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 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-03 03:55:45,927 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 426 transitions. [2021-11-03 03:55:45,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-03 03:55:45,927 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:55:45,928 INFO L513 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] [2021-11-03 03:55:45,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-03 03:55:45,928 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-03 03:55:45,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:55:45,929 INFO L85 PathProgramCache]: Analyzing trace with hash 2093394226, now seen corresponding path program 3 times [2021-11-03 03:55:45,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:55:45,929 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113691906] [2021-11-03 03:55:45,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:55:45,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:55:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 03:55:45,978 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-03 03:55:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 03:55:46,080 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-03 03:55:46,081 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-03 03:55:46,082 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 03:55:46,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 03:55:46,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-11-03 03:55:46,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-11-03 03:55:46,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-11-03 03:55:46,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 03:55:46,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-03 03:55:46,087 INFO L731 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:55:46,092 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-11-03 03:55:46,092 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-03 03:55:46,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 03:55:46 BasicIcfg [2021-11-03 03:55:46,208 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-03 03:55:46,209 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-03 03:55:46,209 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-03 03:55:46,209 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-03 03:55:46,210 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:55:24" (3/4) ... [2021-11-03 03:55:46,212 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-03 03:55:46,334 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0923062-27a6-4252-9ce9-0e6dc768ce8e/bin/utaipan-aC7eJsxGYH/witness.graphml [2021-11-03 03:55:46,334 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-03 03:55:46,336 INFO L168 Benchmark]: Toolchain (without parser) took 24681.71 ms. Allocated memory was 88.1 MB in the beginning and 209.7 MB in the end (delta: 121.6 MB). Free memory was 62.8 MB in the beginning and 78.2 MB in the end (delta: -15.3 MB). Peak memory consumption was 106.3 MB. Max. memory is 16.1 GB. [2021-11-03 03:55:46,336 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 88.1 MB. Free memory is still 61.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 03:55:46,337 INFO L168 Benchmark]: CACSL2BoogieTranslator took 568.91 ms. Allocated memory is still 88.1 MB. Free memory was 62.5 MB in the beginning and 50.8 MB in the end (delta: 11.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-11-03 03:55:46,339 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.77 ms. Allocated memory is still 88.1 MB. Free memory was 50.7 MB in the beginning and 47.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-03 03:55:46,339 INFO L168 Benchmark]: Boogie Preprocessor took 50.58 ms. Allocated memory is still 88.1 MB. Free memory was 47.8 MB in the beginning and 45.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 03:55:46,340 INFO L168 Benchmark]: RCFGBuilder took 2311.37 ms. Allocated memory was 88.1 MB in the beginning and 111.1 MB in the end (delta: 23.1 MB). Free memory was 45.5 MB in the beginning and 60.3 MB in the end (delta: -14.8 MB). Peak memory consumption was 30.6 MB. Max. memory is 16.1 GB. [2021-11-03 03:55:46,340 INFO L168 Benchmark]: TraceAbstraction took 21555.92 ms. Allocated memory was 111.1 MB in the beginning and 209.7 MB in the end (delta: 98.6 MB). Free memory was 59.7 MB in the beginning and 92.8 MB in the end (delta: -33.1 MB). Peak memory consumption was 66.5 MB. Max. memory is 16.1 GB. [2021-11-03 03:55:46,340 INFO L168 Benchmark]: Witness Printer took 125.77 ms. Allocated memory is still 209.7 MB. Free memory was 92.8 MB in the beginning and 78.2 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-11-03 03:55:46,343 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.30 ms. Allocated memory is still 88.1 MB. Free memory is still 61.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 568.91 ms. Allocated memory is still 88.1 MB. Free memory was 62.5 MB in the beginning and 50.8 MB in the end (delta: 11.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 60.77 ms. Allocated memory is still 88.1 MB. Free memory was 50.7 MB in the beginning and 47.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 50.58 ms. Allocated memory is still 88.1 MB. Free memory was 47.8 MB in the beginning and 45.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2311.37 ms. Allocated memory was 88.1 MB in the beginning and 111.1 MB in the end (delta: 23.1 MB). Free memory was 45.5 MB in the beginning and 60.3 MB in the end (delta: -14.8 MB). Peak memory consumption was 30.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 21555.92 ms. Allocated memory was 111.1 MB in the beginning and 209.7 MB in the end (delta: 98.6 MB). Free memory was 59.7 MB in the beginning and 92.8 MB in the end (delta: -33.1 MB). Peak memory consumption was 66.5 MB. Max. memory is 16.1 GB. * Witness Printer took 125.77 ms. Allocated memory is still 209.7 MB. Free memory was 92.8 MB in the beginning and 78.2 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.0s, 116 PlacesBefore, 37 PlacesAfterwards, 108 TransitionsBefore, 27 TransitionsAfterwards, 1948 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 94 TotalNumberOfCompositions, 5572 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2915, positive: 2721, positive conditional: 0, positive unconditional: 2721, negative: 194, negative conditional: 0, negative unconditional: 194, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1494, positive: 1422, positive conditional: 0, positive unconditional: 1422, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1494, positive: 1396, positive conditional: 0, positive unconditional: 1396, negative: 98, negative conditional: 0, negative unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 98, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1007, positive: 83, positive conditional: 0, positive unconditional: 83, negative: 924, negative conditional: 0, negative unconditional: 924, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2915, positive: 1299, positive conditional: 0, positive unconditional: 1299, negative: 122, negative conditional: 0, negative unconditional: 122, unknown: 1494, unknown conditional: 0, unknown unconditional: 1494] , Statistics on independence cache: Total cache size (in pairs): 163, Positive cache size: 131, Positive conditional cache size: 0, Positive unconditional cache size: 131, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32 - 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, 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, 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 [L18] COND FALSE 2 !(!expression) [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}, 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}, 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, 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 [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L743] 1 z = 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L746] 1 x = 1 VAL [\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] [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; [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; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [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] EXPR 0 !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] 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] EXPR 0 !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] 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] EXPR 0 !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] 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] EXPR 0 !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] 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] EXPR 0 !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] 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] EXPR 0 !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] 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 [L18] COND TRUE 0 !expression [L18] 0 reach_error() 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, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 136 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 21.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 17.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 303 SDtfs, 402 SDslu, 463 SDs, 0 SdLazy, 252 SolverSat, 99 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=852occurred in iteration=0, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 70 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 1333 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-03 03:55:46,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0923062-27a6-4252-9ce9-0e6dc768ce8e/bin/utaipan-aC7eJsxGYH/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