./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df59ea5-9dfd-4e6d-bf85-317c249fa9d1/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df59ea5-9dfd-4e6d-bf85-317c249fa9d1/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df59ea5-9dfd-4e6d-bf85-317c249fa9d1/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df59ea5-9dfd-4e6d-bf85-317c249fa9d1/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df59ea5-9dfd-4e6d-bf85-317c249fa9d1/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df59ea5-9dfd-4e6d-bf85-317c249fa9d1/bin/utaipan-UUZaoUuFF8 --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 bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 01:41:49,214 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:41:49,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:41:49,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:41:49,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:41:49,273 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:41:49,275 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:41:49,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:41:49,281 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:41:49,282 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:41:49,283 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:41:49,285 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:41:49,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:41:49,287 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:41:49,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:41:49,291 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:41:49,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:41:49,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:41:49,296 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:41:49,302 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:41:49,311 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:41:49,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:41:49,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:41:49,322 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:41:49,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:41:49,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:41:49,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:41:49,333 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:41:49,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:41:49,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:41:49,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:41:49,338 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:41:49,339 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:41:49,341 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:41:49,343 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:41:49,343 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:41:49,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:41:49,345 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:41:49,345 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:41:49,346 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:41:49,347 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:41:49,348 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df59ea5-9dfd-4e6d-bf85-317c249fa9d1/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 01:41:49,403 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:41:49,403 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:41:49,405 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:41:49,405 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:41:49,405 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:41:49,405 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:41:49,406 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 01:41:49,406 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:41:49,406 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:41:49,406 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 01:41:49,408 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 01:41:49,408 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:41:49,408 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 01:41:49,408 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 01:41:49,409 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 01:41:49,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:41:49,410 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:41:49,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 01:41:49,410 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:41:49,411 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:41:49,411 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 01:41:49,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:41:49,411 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 01:41:49,411 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:41:49,412 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:41:49,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 01:41:49,412 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:41:49,412 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 01:41:49,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:41:49,414 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:41:49,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:41:49,415 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:41:49,416 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:41:49,416 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 01:41:49,416 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 01:41:49,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 01:41:49,417 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 01:41:49,417 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:41:49,417 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:41:49,417 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_5df59ea5-9dfd-4e6d-bf85-317c249fa9d1/bin/utaipan-UUZaoUuFF8/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_5df59ea5-9dfd-4e6d-bf85-317c249fa9d1/bin/utaipan-UUZaoUuFF8 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 -> bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 [2021-11-07 01:41:49,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:41:49,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:41:49,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:41:49,731 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:41:49,732 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:41:49,733 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df59ea5-9dfd-4e6d-bf85-317c249fa9d1/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2021-11-07 01:41:49,794 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df59ea5-9dfd-4e6d-bf85-317c249fa9d1/bin/utaipan-UUZaoUuFF8/data/374ab9861/c507b711f0464bb8b1cc6b7f34ac6e3e/FLAGd90b1235f [2021-11-07 01:41:50,396 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:41:50,398 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df59ea5-9dfd-4e6d-bf85-317c249fa9d1/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2021-11-07 01:41:50,426 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df59ea5-9dfd-4e6d-bf85-317c249fa9d1/bin/utaipan-UUZaoUuFF8/data/374ab9861/c507b711f0464bb8b1cc6b7f34ac6e3e/FLAGd90b1235f [2021-11-07 01:41:50,647 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df59ea5-9dfd-4e6d-bf85-317c249fa9d1/bin/utaipan-UUZaoUuFF8/data/374ab9861/c507b711f0464bb8b1cc6b7f34ac6e3e [2021-11-07 01:41:50,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:41:50,655 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:41:50,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:41:50,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:41:50,663 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:41:50,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:41:50" (1/1) ... [2021-11-07 01:41:50,666 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f51ecf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:50, skipping insertion in model container [2021-11-07 01:41:50,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:41:50" (1/1) ... [2021-11-07 01:41:50,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:41:50,728 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:41:50,915 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_5df59ea5-9dfd-4e6d-bf85-317c249fa9d1/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2021-11-07 01:41:51,223 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:41:51,234 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 01:41:51,261 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_5df59ea5-9dfd-4e6d-bf85-317c249fa9d1/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2021-11-07 01:41:51,337 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:41:51,395 INFO L208 MainTranslator]: Completed translation [2021-11-07 01:41:51,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:51 WrapperNode [2021-11-07 01:41:51,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:41:51,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 01:41:51,398 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 01:41:51,398 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 01:41:51,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:51" (1/1) ... [2021-11-07 01:41:51,445 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:51" (1/1) ... [2021-11-07 01:41:51,492 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 01:41:51,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 01:41:51,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 01:41:51,497 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 01:41:51,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:51" (1/1) ... [2021-11-07 01:41:51,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:51" (1/1) ... [2021-11-07 01:41:51,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:51" (1/1) ... [2021-11-07 01:41:51,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:51" (1/1) ... [2021-11-07 01:41:51,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:51" (1/1) ... [2021-11-07 01:41:51,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:51" (1/1) ... [2021-11-07 01:41:51,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:51" (1/1) ... [2021-11-07 01:41:51,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 01:41:51,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 01:41:51,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 01:41:51,554 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 01:41:51,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:51" (1/1) ... [2021-11-07 01:41:51,577 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:41:51,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df59ea5-9dfd-4e6d-bf85-317c249fa9d1/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:41:51,600 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df59ea5-9dfd-4e6d-bf85-317c249fa9d1/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 01:41:51,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df59ea5-9dfd-4e6d-bf85-317c249fa9d1/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 01:41:51,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-07 01:41:51,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-07 01:41:51,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 01:41:51,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 01:41:51,646 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-11-07 01:41:51,647 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-11-07 01:41:51,647 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-11-07 01:41:51,648 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-11-07 01:41:51,648 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-11-07 01:41:51,648 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-11-07 01:41:51,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 01:41:51,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-07 01:41:51,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 01:41:51,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 01:41:51,650 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-07 01:41:53,597 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 01:41:53,598 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-11-07 01:41:53,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:41:53 BoogieIcfgContainer [2021-11-07 01:41:53,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 01:41:53,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 01:41:53,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 01:41:53,606 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 01:41:53,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:41:50" (1/3) ... [2021-11-07 01:41:53,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5458ae31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:41:53, skipping insertion in model container [2021-11-07 01:41:53,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:41:51" (2/3) ... [2021-11-07 01:41:53,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5458ae31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:41:53, skipping insertion in model container [2021-11-07 01:41:53,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:41:53" (3/3) ... [2021-11-07 01:41:53,613 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2021-11-07 01:41:53,619 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-07 01:41:53,619 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 01:41:53,619 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-07 01:41:53,619 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-07 01:41:53,685 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,686 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,686 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,686 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,686 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,687 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,687 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,687 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,687 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,687 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,688 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,689 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,689 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,689 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,689 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,689 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,690 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,690 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,690 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,690 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,690 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,690 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,690 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,692 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,692 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,693 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,693 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,693 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,693 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,693 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,694 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,694 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,694 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,694 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,695 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,695 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,695 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,695 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,695 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,695 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,695 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,696 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,696 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,696 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,696 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,696 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,696 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,697 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,697 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,697 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,697 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,697 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,698 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,698 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,698 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,698 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,698 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,699 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,699 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,699 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,699 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,699 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,700 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,700 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,700 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,700 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,700 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,700 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,701 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,701 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,701 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,701 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,701 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,701 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,701 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,702 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,702 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,702 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,702 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,702 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,703 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,703 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,704 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,704 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,704 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,705 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,708 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,708 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,708 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,708 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,708 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,709 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,709 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,709 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,709 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,709 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,711 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,711 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,712 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,712 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,712 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,712 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,712 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,712 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,713 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,713 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,714 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,715 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,715 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,715 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,715 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,715 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,715 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,716 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,716 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,716 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,716 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,716 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-07 01:41:53,717 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-07 01:41:53,763 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 01:41:53,769 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-07 01:41:53,770 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-11-07 01:41:53,784 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-07 01:41:53,796 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 225 flow [2021-11-07 01:41:53,799 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 225 flow [2021-11-07 01:41:53,801 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 225 flow [2021-11-07 01:41:53,844 INFO L129 PetriNetUnfolder]: 2/102 cut-off events. [2021-11-07 01:41:53,844 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-11-07 01:41:53,848 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2021-11-07 01:41:53,852 INFO L116 LiptonReduction]: Number of co-enabled transitions 1876 [2021-11-07 01:42:11,745 INFO L131 LiptonReduction]: Checked pairs total: 5130 [2021-11-07 01:42:11,745 INFO L133 LiptonReduction]: Total number of compositions: 91 [2021-11-07 01:42:11,754 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2021-11-07 01:42:11,813 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 724 states, 721 states have (on average 3.116504854368932) internal successors, (2247), 723 states have internal predecessors, (2247), 0 states have call successors, (0), 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-07 01:42:11,820 INFO L276 IsEmpty]: Start isEmpty. Operand has 724 states, 721 states have (on average 3.116504854368932) internal successors, (2247), 723 states have internal predecessors, (2247), 0 states have call successors, (0), 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-07 01:42:11,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-11-07 01:42:11,825 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:42:11,825 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-11-07 01:42:11,826 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-07 01:42:11,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:42:11,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1084459, now seen corresponding path program 1 times [2021-11-07 01:42:11,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:42:11,842 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405502321] [2021-11-07 01:42:11,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:42:11,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:42:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:42:12,060 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-07 01:42:12,061 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:42:12,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405502321] [2021-11-07 01:42:12,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405502321] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:42:12,062 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:42:12,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-07 01:42:12,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614211399] [2021-11-07 01:42:12,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:42:12,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:42:12,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:42:12,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:42:12,090 INFO L87 Difference]: Start difference. First operand has 724 states, 721 states have (on average 3.116504854368932) internal successors, (2247), 723 states have internal predecessors, (2247), 0 states have call successors, (0), 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 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-07 01:42:12,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:42:12,237 INFO L93 Difference]: Finished difference Result 587 states and 1790 transitions. [2021-11-07 01:42:12,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:42:12,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2021-11-07 01:42:12,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:42:12,267 INFO L225 Difference]: With dead ends: 587 [2021-11-07 01:42:12,268 INFO L226 Difference]: Without dead ends: 562 [2021-11-07 01:42:12,268 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-07 01:42:12,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2021-11-07 01:42:12,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2021-11-07 01:42:12,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 561 states have (on average 3.0748663101604277) internal successors, (1725), 561 states have internal predecessors, (1725), 0 states have call successors, (0), 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-07 01:42:12,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2021-11-07 01:42:12,373 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 3 [2021-11-07 01:42:12,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:42:12,374 INFO L470 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2021-11-07 01:42:12,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-07 01:42:12,374 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2021-11-07 01:42:12,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 01:42:12,376 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:42:12,378 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:42:12,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 01:42:12,380 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-07 01:42:12,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:42:12,381 INFO L85 PathProgramCache]: Analyzing trace with hash -542242882, now seen corresponding path program 1 times [2021-11-07 01:42:12,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:42:12,382 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686408311] [2021-11-07 01:42:12,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:42:12,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:42:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:42:12,676 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-07 01:42:12,677 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:42:12,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686408311] [2021-11-07 01:42:12,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686408311] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:42:12,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:42:12,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-07 01:42:12,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021239694] [2021-11-07 01:42:12,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:42:12,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:42:12,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:42:12,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:42:12,682 INFO L87 Difference]: Start difference. First operand 562 states and 1725 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-07 01:42:12,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:42:12,703 INFO L93 Difference]: Finished difference Result 552 states and 1687 transitions. [2021-11-07 01:42:12,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:42:12,704 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-07 01:42:12,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:42:12,714 INFO L225 Difference]: With dead ends: 552 [2021-11-07 01:42:12,715 INFO L226 Difference]: Without dead ends: 552 [2021-11-07 01:42:12,715 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-07 01:42:12,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2021-11-07 01:42:12,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2021-11-07 01:42:12,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 551 states have (on average 3.061705989110708) internal successors, (1687), 551 states have internal predecessors, (1687), 0 states have call successors, (0), 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-07 01:42:12,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1687 transitions. [2021-11-07 01:42:12,772 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1687 transitions. Word has length 9 [2021-11-07 01:42:12,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:42:12,773 INFO L470 AbstractCegarLoop]: Abstraction has 552 states and 1687 transitions. [2021-11-07 01:42:12,773 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-07 01:42:12,773 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1687 transitions. [2021-11-07 01:42:12,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 01:42:12,784 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:42:12,784 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:42:12,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 01:42:12,785 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-07 01:42:12,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:42:12,787 INFO L85 PathProgramCache]: Analyzing trace with hash -505538032, now seen corresponding path program 1 times [2021-11-07 01:42:12,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:42:12,788 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877725448] [2021-11-07 01:42:12,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:42:12,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:42:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:42:12,980 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-07 01:42:12,980 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:42:12,981 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877725448] [2021-11-07 01:42:12,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877725448] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:42:12,981 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:42:12,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-07 01:42:12,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907810072] [2021-11-07 01:42:12,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:42:12,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:42:12,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:42:12,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:42:12,983 INFO L87 Difference]: Start difference. First operand 552 states and 1687 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-07 01:42:12,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:42:12,998 INFO L93 Difference]: Finished difference Result 544 states and 1657 transitions. [2021-11-07 01:42:12,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:42:12,999 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-07 01:42:12,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:42:13,004 INFO L225 Difference]: With dead ends: 544 [2021-11-07 01:42:13,005 INFO L226 Difference]: Without dead ends: 544 [2021-11-07 01:42:13,005 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-07 01:42:13,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2021-11-07 01:42:13,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2021-11-07 01:42:13,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 3.0515653775322282) internal successors, (1657), 543 states have internal predecessors, (1657), 0 states have call successors, (0), 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-07 01:42:13,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1657 transitions. [2021-11-07 01:42:13,030 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1657 transitions. Word has length 10 [2021-11-07 01:42:13,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:42:13,030 INFO L470 AbstractCegarLoop]: Abstraction has 544 states and 1657 transitions. [2021-11-07 01:42:13,031 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-07 01:42:13,031 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1657 transitions. [2021-11-07 01:42:13,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 01:42:13,033 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:42:13,033 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:42:13,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 01:42:13,034 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-07 01:42:13,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:42:13,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1506737750, now seen corresponding path program 1 times [2021-11-07 01:42:13,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:42:13,035 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109972221] [2021-11-07 01:42:13,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:42:13,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:42:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:42:13,273 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-07 01:42:13,274 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:42:13,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109972221] [2021-11-07 01:42:13,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109972221] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:42:13,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:42:13,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 01:42:13,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555228323] [2021-11-07 01:42:13,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:42:13,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:42:13,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:42:13,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:42:13,278 INFO L87 Difference]: Start difference. First operand 544 states and 1657 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:42:13,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:42:13,325 INFO L93 Difference]: Finished difference Result 541 states and 1645 transitions. [2021-11-07 01:42:13,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:42:13,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-07 01:42:13,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:42:13,331 INFO L225 Difference]: With dead ends: 541 [2021-11-07 01:42:13,332 INFO L226 Difference]: Without dead ends: 541 [2021-11-07 01:42:13,332 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-07 01:42:13,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2021-11-07 01:42:13,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2021-11-07 01:42:13,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 540 states have (on average 3.0462962962962963) internal successors, (1645), 540 states have internal predecessors, (1645), 0 states have call successors, (0), 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-07 01:42:13,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 1645 transitions. [2021-11-07 01:42:13,356 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 1645 transitions. Word has length 11 [2021-11-07 01:42:13,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:42:13,357 INFO L470 AbstractCegarLoop]: Abstraction has 541 states and 1645 transitions. [2021-11-07 01:42:13,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:42:13,357 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 1645 transitions. [2021-11-07 01:42:13,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 01:42:13,359 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:42:13,359 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:42:13,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 01:42:13,360 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-07 01:42:13,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:42:13,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1526754130, now seen corresponding path program 1 times [2021-11-07 01:42:13,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:42:13,361 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523195739] [2021-11-07 01:42:13,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:42:13,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:42:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:42:13,471 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-07 01:42:13,471 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:42:13,471 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523195739] [2021-11-07 01:42:13,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523195739] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:42:13,472 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:42:13,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 01:42:13,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867674136] [2021-11-07 01:42:13,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:42:13,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:42:13,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:42:13,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:42:13,474 INFO L87 Difference]: Start difference. First operand 541 states and 1645 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:42:13,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:42:13,497 INFO L93 Difference]: Finished difference Result 790 states and 2306 transitions. [2021-11-07 01:42:13,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:42:13,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-07 01:42:13,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:42:13,535 INFO L225 Difference]: With dead ends: 790 [2021-11-07 01:42:13,535 INFO L226 Difference]: Without dead ends: 586 [2021-11-07 01:42:13,536 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:42:13,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2021-11-07 01:42:13,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 529. [2021-11-07 01:42:13,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 2.909090909090909) internal successors, (1536), 528 states have internal predecessors, (1536), 0 states have call successors, (0), 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-07 01:42:13,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1536 transitions. [2021-11-07 01:42:13,563 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1536 transitions. Word has length 12 [2021-11-07 01:42:13,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:42:13,567 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 1536 transitions. [2021-11-07 01:42:13,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:42:13,568 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1536 transitions. [2021-11-07 01:42:13,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 01:42:13,569 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:42:13,570 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:42:13,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 01:42:13,570 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-07 01:42:13,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:42:13,572 INFO L85 PathProgramCache]: Analyzing trace with hash -954281166, now seen corresponding path program 1 times [2021-11-07 01:42:13,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:42:13,574 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528260068] [2021-11-07 01:42:13,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:42:13,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:42:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:42:13,858 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-07 01:42:13,859 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:42:13,859 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528260068] [2021-11-07 01:42:13,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528260068] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:42:13,860 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:42:13,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:42:13,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137239865] [2021-11-07 01:42:13,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:42:13,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:42:13,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:42:13,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:42:13,862 INFO L87 Difference]: Start difference. First operand 529 states and 1536 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-07 01:42:13,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:42:13,932 INFO L93 Difference]: Finished difference Result 559 states and 1628 transitions. [2021-11-07 01:42:13,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:42:13,934 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-07 01:42:13,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:42:13,939 INFO L225 Difference]: With dead ends: 559 [2021-11-07 01:42:13,940 INFO L226 Difference]: Without dead ends: 559 [2021-11-07 01:42:13,940 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:42:13,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2021-11-07 01:42:13,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2021-11-07 01:42:13,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 2.917562724014337) internal successors, (1628), 558 states have internal predecessors, (1628), 0 states have call successors, (0), 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-07 01:42:13,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1628 transitions. [2021-11-07 01:42:13,966 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 1628 transitions. Word has length 12 [2021-11-07 01:42:13,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:42:13,967 INFO L470 AbstractCegarLoop]: Abstraction has 559 states and 1628 transitions. [2021-11-07 01:42:13,967 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-07 01:42:13,967 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1628 transitions. [2021-11-07 01:42:13,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 01:42:13,969 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:42:13,969 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:42:13,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 01:42:13,970 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-07 01:42:13,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:42:13,970 INFO L85 PathProgramCache]: Analyzing trace with hash -538235342, now seen corresponding path program 1 times [2021-11-07 01:42:13,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:42:13,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601316653] [2021-11-07 01:42:13,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:42:13,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:42:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:42:14,072 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-07 01:42:14,073 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:42:14,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601316653] [2021-11-07 01:42:14,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601316653] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:42:14,074 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:42:14,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:42:14,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464703217] [2021-11-07 01:42:14,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:42:14,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:42:14,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:42:14,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:42:14,076 INFO L87 Difference]: Start difference. First operand 559 states and 1628 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-07 01:42:14,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:42:14,157 INFO L93 Difference]: Finished difference Result 565 states and 1644 transitions. [2021-11-07 01:42:14,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:42:14,158 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-07 01:42:14,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:42:14,164 INFO L225 Difference]: With dead ends: 565 [2021-11-07 01:42:14,164 INFO L226 Difference]: Without dead ends: 565 [2021-11-07 01:42:14,164 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:42:14,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2021-11-07 01:42:14,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 563. [2021-11-07 01:42:14,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 562 states have (on average 2.916370106761566) internal successors, (1639), 562 states have internal predecessors, (1639), 0 states have call successors, (0), 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-07 01:42:14,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 1639 transitions. [2021-11-07 01:42:14,191 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 1639 transitions. Word has length 12 [2021-11-07 01:42:14,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:42:14,191 INFO L470 AbstractCegarLoop]: Abstraction has 563 states and 1639 transitions. [2021-11-07 01:42:14,191 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-07 01:42:14,192 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 1639 transitions. [2021-11-07 01:42:14,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 01:42:14,193 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:42:14,193 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:42:14,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 01:42:14,194 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-07 01:42:14,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:42:14,194 INFO L85 PathProgramCache]: Analyzing trace with hash -535770408, now seen corresponding path program 2 times [2021-11-07 01:42:14,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:42:14,195 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105785292] [2021-11-07 01:42:14,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:42:14,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:42:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:42:14,350 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-07 01:42:14,350 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:42:14,350 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105785292] [2021-11-07 01:42:14,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105785292] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:42:14,351 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:42:14,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:42:14,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963293817] [2021-11-07 01:42:14,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:42:14,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:42:14,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:42:14,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:42:14,353 INFO L87 Difference]: Start difference. First operand 563 states and 1639 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-07 01:42:14,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:42:14,436 INFO L93 Difference]: Finished difference Result 569 states and 1633 transitions. [2021-11-07 01:42:14,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:42:14,437 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-07 01:42:14,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:42:14,443 INFO L225 Difference]: With dead ends: 569 [2021-11-07 01:42:14,443 INFO L226 Difference]: Without dead ends: 569 [2021-11-07 01:42:14,443 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:42:14,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2021-11-07 01:42:14,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2021-11-07 01:42:14,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 2.875) internal successors, (1633), 568 states have internal predecessors, (1633), 0 states have call successors, (0), 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-07 01:42:14,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 1633 transitions. [2021-11-07 01:42:14,466 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 1633 transitions. Word has length 12 [2021-11-07 01:42:14,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:42:14,467 INFO L470 AbstractCegarLoop]: Abstraction has 569 states and 1633 transitions. [2021-11-07 01:42:14,467 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-07 01:42:14,467 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 1633 transitions. [2021-11-07 01:42:14,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 01:42:14,469 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:42:14,469 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:42:14,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 01:42:14,470 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-07 01:42:14,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:42:14,470 INFO L85 PathProgramCache]: Analyzing trace with hash 527017203, now seen corresponding path program 1 times [2021-11-07 01:42:14,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:42:14,471 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315838361] [2021-11-07 01:42:14,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:42:14,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:42:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:42:14,545 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-07 01:42:14,545 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:42:14,545 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315838361] [2021-11-07 01:42:14,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315838361] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:42:14,546 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:42:14,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 01:42:14,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130685660] [2021-11-07 01:42:14,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:42:14,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:42:14,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:42:14,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:42:14,548 INFO L87 Difference]: Start difference. First operand 569 states and 1633 transitions. Second operand has 3 states, 2 states have (on average 6.5) 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-07 01:42:14,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:42:14,565 INFO L93 Difference]: Finished difference Result 805 states and 2232 transitions. [2021-11-07 01:42:14,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:42:14,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) 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-07 01:42:14,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:42:14,571 INFO L225 Difference]: With dead ends: 805 [2021-11-07 01:42:14,571 INFO L226 Difference]: Without dead ends: 605 [2021-11-07 01:42:14,572 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:42:14,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2021-11-07 01:42:14,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 557. [2021-11-07 01:42:14,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 556 states have (on average 2.741007194244604) internal successors, (1524), 556 states have internal predecessors, (1524), 0 states have call successors, (0), 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-07 01:42:14,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1524 transitions. [2021-11-07 01:42:14,618 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 1524 transitions. Word has length 13 [2021-11-07 01:42:14,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:42:14,618 INFO L470 AbstractCegarLoop]: Abstraction has 557 states and 1524 transitions. [2021-11-07 01:42:14,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) 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-07 01:42:14,619 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 1524 transitions. [2021-11-07 01:42:14,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 01:42:14,620 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:42:14,620 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:42:14,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 01:42:14,621 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-07 01:42:14,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:42:14,621 INFO L85 PathProgramCache]: Analyzing trace with hash 493419050, now seen corresponding path program 1 times [2021-11-07 01:42:14,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:42:14,624 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119434713] [2021-11-07 01:42:14,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:42:14,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:42:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:42:14,840 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-07 01:42:14,840 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:42:14,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119434713] [2021-11-07 01:42:14,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119434713] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:42:14,841 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:42:14,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:42:14,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719368420] [2021-11-07 01:42:14,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:42:14,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:42:14,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:42:14,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:42:14,843 INFO L87 Difference]: Start difference. First operand 557 states and 1524 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:42:14,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:42:14,958 INFO L93 Difference]: Finished difference Result 573 states and 1561 transitions. [2021-11-07 01:42:14,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:42:14,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-07 01:42:14,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:42:14,964 INFO L225 Difference]: With dead ends: 573 [2021-11-07 01:42:14,965 INFO L226 Difference]: Without dead ends: 573 [2021-11-07 01:42:14,965 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:42:14,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2021-11-07 01:42:14,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 558. [2021-11-07 01:42:14,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 557 states have (on average 2.725314183123878) internal successors, (1518), 557 states have internal predecessors, (1518), 0 states have call successors, (0), 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-07 01:42:14,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1518 transitions. [2021-11-07 01:42:14,987 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 1518 transitions. Word has length 13 [2021-11-07 01:42:14,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:42:14,988 INFO L470 AbstractCegarLoop]: Abstraction has 558 states and 1518 transitions. [2021-11-07 01:42:14,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:42:14,988 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1518 transitions. [2021-11-07 01:42:14,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 01:42:14,990 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:42:14,990 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:42:14,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 01:42:14,990 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-07 01:42:14,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:42:14,991 INFO L85 PathProgramCache]: Analyzing trace with hash 492138037, now seen corresponding path program 1 times [2021-11-07 01:42:14,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:42:14,991 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885114639] [2021-11-07 01:42:14,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:42:14,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:42:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:42:15,276 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-07 01:42:15,277 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:42:15,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885114639] [2021-11-07 01:42:15,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885114639] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:42:15,277 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:42:15,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:42:15,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772412460] [2021-11-07 01:42:15,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:42:15,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:42:15,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:42:15,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:42:15,279 INFO L87 Difference]: Start difference. First operand 558 states and 1518 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:42:15,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:42:15,393 INFO L93 Difference]: Finished difference Result 548 states and 1485 transitions. [2021-11-07 01:42:15,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:42:15,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-07 01:42:15,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:42:15,398 INFO L225 Difference]: With dead ends: 548 [2021-11-07 01:42:15,399 INFO L226 Difference]: Without dead ends: 548 [2021-11-07 01:42:15,399 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:42:15,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2021-11-07 01:42:15,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 546. [2021-11-07 01:42:15,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 2.7155963302752295) internal successors, (1480), 545 states have internal predecessors, (1480), 0 states have call successors, (0), 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-07 01:42:15,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1480 transitions. [2021-11-07 01:42:15,421 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1480 transitions. Word has length 13 [2021-11-07 01:42:15,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:42:15,422 INFO L470 AbstractCegarLoop]: Abstraction has 546 states and 1480 transitions. [2021-11-07 01:42:15,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:42:15,422 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1480 transitions. [2021-11-07 01:42:15,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 01:42:15,423 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:42:15,424 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:42:15,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 01:42:15,424 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-07 01:42:15,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:42:15,425 INFO L85 PathProgramCache]: Analyzing trace with hash 494573180, now seen corresponding path program 2 times [2021-11-07 01:42:15,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:42:15,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860482537] [2021-11-07 01:42:15,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:42:15,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:42:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:42:15,584 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-07 01:42:15,584 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:42:15,584 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860482537] [2021-11-07 01:42:15,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860482537] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:42:15,585 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:42:15,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:42:15,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454474927] [2021-11-07 01:42:15,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:42:15,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:42:15,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:42:15,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:42:15,587 INFO L87 Difference]: Start difference. First operand 546 states and 1480 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:42:15,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:42:15,694 INFO L93 Difference]: Finished difference Result 570 states and 1542 transitions. [2021-11-07 01:42:15,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:42:15,695 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-07 01:42:15,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:42:15,700 INFO L225 Difference]: With dead ends: 570 [2021-11-07 01:42:15,700 INFO L226 Difference]: Without dead ends: 570 [2021-11-07 01:42:15,700 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:42:15,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2021-11-07 01:42:15,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 543. [2021-11-07 01:42:15,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 542 states have (on average 2.715867158671587) internal successors, (1472), 542 states have internal predecessors, (1472), 0 states have call successors, (0), 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-07 01:42:15,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 1472 transitions. [2021-11-07 01:42:15,723 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 1472 transitions. Word has length 13 [2021-11-07 01:42:15,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:42:15,724 INFO L470 AbstractCegarLoop]: Abstraction has 543 states and 1472 transitions. [2021-11-07 01:42:15,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:42:15,724 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 1472 transitions. [2021-11-07 01:42:15,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 01:42:15,726 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:42:15,726 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:42:15,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 01:42:15,727 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-07 01:42:15,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:42:15,727 INFO L85 PathProgramCache]: Analyzing trace with hash 570984770, now seen corresponding path program 3 times [2021-11-07 01:42:15,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:42:15,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417266675] [2021-11-07 01:42:15,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:42:15,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:42:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:42:15,920 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-07 01:42:15,920 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:42:15,921 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417266675] [2021-11-07 01:42:15,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417266675] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:42:15,921 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:42:15,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:42:15,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780296186] [2021-11-07 01:42:15,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:42:15,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:42:15,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:42:15,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:42:15,923 INFO L87 Difference]: Start difference. First operand 543 states and 1472 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:42:16,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:42:16,059 INFO L93 Difference]: Finished difference Result 635 states and 1690 transitions. [2021-11-07 01:42:16,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:42:16,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-07 01:42:16,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:42:16,065 INFO L225 Difference]: With dead ends: 635 [2021-11-07 01:42:16,065 INFO L226 Difference]: Without dead ends: 599 [2021-11-07 01:42:16,066 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-11-07 01:42:16,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-11-07 01:42:16,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 557. [2021-11-07 01:42:16,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 556 states have (on average 2.6744604316546763) internal successors, (1487), 556 states have internal predecessors, (1487), 0 states have call successors, (0), 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-07 01:42:16,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1487 transitions. [2021-11-07 01:42:16,091 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 1487 transitions. Word has length 13 [2021-11-07 01:42:16,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:42:16,091 INFO L470 AbstractCegarLoop]: Abstraction has 557 states and 1487 transitions. [2021-11-07 01:42:16,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:42:16,092 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 1487 transitions. [2021-11-07 01:42:16,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 01:42:16,093 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:42:16,093 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:42:16,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 01:42:16,094 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-07 01:42:16,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:42:16,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1011677201, now seen corresponding path program 1 times [2021-11-07 01:42:16,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:42:16,095 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887089123] [2021-11-07 01:42:16,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:42:16,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:42:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:42:16,175 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-07 01:42:16,175 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:42:16,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887089123] [2021-11-07 01:42:16,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887089123] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:42:16,176 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:42:16,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:42:16,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636103062] [2021-11-07 01:42:16,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:42:16,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:42:16,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:42:16,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:42:16,178 INFO L87 Difference]: Start difference. First operand 557 states and 1487 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-07 01:42:16,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:42:16,205 INFO L93 Difference]: Finished difference Result 535 states and 1252 transitions. [2021-11-07 01:42:16,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:42:16,206 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-07 01:42:16,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:42:16,209 INFO L225 Difference]: With dead ends: 535 [2021-11-07 01:42:16,209 INFO L226 Difference]: Without dead ends: 390 [2021-11-07 01:42:16,210 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-07 01:42:16,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-11-07 01:42:16,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2021-11-07 01:42:16,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 2.2802056555269923) internal successors, (887), 389 states have internal predecessors, (887), 0 states have call successors, (0), 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-07 01:42:16,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 887 transitions. [2021-11-07 01:42:16,224 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 887 transitions. Word has length 14 [2021-11-07 01:42:16,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:42:16,225 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 887 transitions. [2021-11-07 01:42:16,225 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-07 01:42:16,225 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 887 transitions. [2021-11-07 01:42:16,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 01:42:16,226 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:42:16,227 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:42:16,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 01:42:16,227 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-07 01:42:16,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:42:16,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1243408195, now seen corresponding path program 1 times [2021-11-07 01:42:16,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:42:16,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210092215] [2021-11-07 01:42:16,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:42:16,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:42:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:42:16,306 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-07 01:42:16,307 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:42:16,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210092215] [2021-11-07 01:42:16,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210092215] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:42:16,307 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:42:16,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:42:16,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063064890] [2021-11-07 01:42:16,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:42:16,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:42:16,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:42:16,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:42:16,309 INFO L87 Difference]: Start difference. First operand 390 states and 887 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-07 01:42:16,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:42:16,339 INFO L93 Difference]: Finished difference Result 318 states and 665 transitions. [2021-11-07 01:42:16,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:42:16,340 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-07 01:42:16,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:42:16,342 INFO L225 Difference]: With dead ends: 318 [2021-11-07 01:42:16,342 INFO L226 Difference]: Without dead ends: 241 [2021-11-07 01:42:16,342 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-07 01:42:16,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-11-07 01:42:16,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 215. [2021-11-07 01:42:16,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 2.0700934579439254) internal successors, (443), 214 states have internal predecessors, (443), 0 states have call successors, (0), 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-07 01:42:16,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 443 transitions. [2021-11-07 01:42:16,350 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 443 transitions. Word has length 15 [2021-11-07 01:42:16,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:42:16,351 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 443 transitions. [2021-11-07 01:42:16,351 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-07 01:42:16,351 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 443 transitions. [2021-11-07 01:42:16,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:42:16,352 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:42:16,352 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-07 01:42:16,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 01:42:16,353 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-07 01:42:16,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:42:16,353 INFO L85 PathProgramCache]: Analyzing trace with hash 130417411, now seen corresponding path program 1 times [2021-11-07 01:42:16,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:42:16,354 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017293657] [2021-11-07 01:42:16,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:42:16,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:42:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:42:16,592 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-07 01:42:16,593 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:42:16,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017293657] [2021-11-07 01:42:16,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017293657] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:42:16,594 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:42:16,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:42:16,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731643559] [2021-11-07 01:42:16,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 01:42:16,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:42:16,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 01:42:16,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:42:16,596 INFO L87 Difference]: Start difference. First operand 215 states and 443 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 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-07 01:42:16,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:42:16,677 INFO L93 Difference]: Finished difference Result 276 states and 543 transitions. [2021-11-07 01:42:16,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:42:16,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 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-07 01:42:16,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:42:16,680 INFO L225 Difference]: With dead ends: 276 [2021-11-07 01:42:16,680 INFO L226 Difference]: Without dead ends: 208 [2021-11-07 01:42:16,681 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:42:16,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-11-07 01:42:16,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 205. [2021-11-07 01:42:16,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.9852941176470589) internal successors, (405), 204 states have internal predecessors, (405), 0 states have call successors, (0), 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-07 01:42:16,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 405 transitions. [2021-11-07 01:42:16,689 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 405 transitions. Word has length 18 [2021-11-07 01:42:16,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:42:16,690 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 405 transitions. [2021-11-07 01:42:16,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 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-07 01:42:16,690 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 405 transitions. [2021-11-07 01:42:16,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:42:16,691 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:42:16,691 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-07 01:42:16,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-07 01:42:16,692 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-07 01:42:16,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:42:16,692 INFO L85 PathProgramCache]: Analyzing trace with hash -930717610, now seen corresponding path program 1 times [2021-11-07 01:42:16,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:42:16,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422369534] [2021-11-07 01:42:16,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:42:16,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:42:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:42:16,864 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-07 01:42:16,865 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:42:16,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422369534] [2021-11-07 01:42:16,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422369534] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:42:16,865 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:42:16,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:42:16,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95073216] [2021-11-07 01:42:16,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:42:16,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:42:16,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:42:16,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:42:16,867 INFO L87 Difference]: Start difference. First operand 205 states and 405 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-07 01:42:16,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:42:16,902 INFO L93 Difference]: Finished difference Result 184 states and 364 transitions. [2021-11-07 01:42:16,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 01:42:16,902 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-07 01:42:16,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:42:16,903 INFO L225 Difference]: With dead ends: 184 [2021-11-07 01:42:16,903 INFO L226 Difference]: Without dead ends: 98 [2021-11-07 01:42:16,903 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-07 01:42:16,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-11-07 01:42:16,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 86. [2021-11-07 01:42:16,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.9411764705882353) internal successors, (165), 85 states have internal predecessors, (165), 0 states have call successors, (0), 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-07 01:42:16,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 165 transitions. [2021-11-07 01:42:16,906 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 165 transitions. Word has length 18 [2021-11-07 01:42:16,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:42:16,906 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 165 transitions. [2021-11-07 01:42:16,907 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-07 01:42:16,907 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 165 transitions. [2021-11-07 01:42:16,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 01:42:16,908 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:42:16,908 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] [2021-11-07 01:42:16,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-07 01:42:16,908 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-07 01:42:16,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:42:16,909 INFO L85 PathProgramCache]: Analyzing trace with hash 35734280, now seen corresponding path program 1 times [2021-11-07 01:42:16,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:42:16,909 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171527080] [2021-11-07 01:42:16,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:42:16,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:42:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:42:17,341 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-07 01:42:17,341 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:42:17,341 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171527080] [2021-11-07 01:42:17,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171527080] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:42:17,342 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:42:17,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-07 01:42:17,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868567187] [2021-11-07 01:42:17,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 01:42:17,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:42:17,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 01:42:17,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-07 01:42:17,343 INFO L87 Difference]: Start difference. First operand 86 states and 165 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:42:17,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:42:17,528 INFO L93 Difference]: Finished difference Result 106 states and 200 transitions. [2021-11-07 01:42:17,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 01:42:17,529 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-07 01:42:17,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:42:17,530 INFO L225 Difference]: With dead ends: 106 [2021-11-07 01:42:17,530 INFO L226 Difference]: Without dead ends: 62 [2021-11-07 01:42:17,530 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-11-07 01:42:17,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-11-07 01:42:17,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-11-07 01:42:17,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.7868852459016393) internal successors, (109), 61 states have internal predecessors, (109), 0 states have call successors, (0), 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-07 01:42:17,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 109 transitions. [2021-11-07 01:42:17,533 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 109 transitions. Word has length 21 [2021-11-07 01:42:17,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:42:17,534 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 109 transitions. [2021-11-07 01:42:17,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:42:17,534 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 109 transitions. [2021-11-07 01:42:17,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 01:42:17,535 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:42:17,535 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] [2021-11-07 01:42:17,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-07 01:42:17,535 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-11-07 01:42:17,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:42:17,536 INFO L85 PathProgramCache]: Analyzing trace with hash 136823560, now seen corresponding path program 2 times [2021-11-07 01:42:17,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:42:17,536 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955008184] [2021-11-07 01:42:17,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:42:17,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:42:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:42:17,603 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 01:42:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:42:17,743 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-07 01:42:17,743 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 01:42:17,745 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:42:17,747 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:42:17,747 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-11-07 01:42:17,747 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-11-07 01:42:17,747 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-11-07 01:42:17,748 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:42:17,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-07 01:42:17,750 INFO L731 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:42:17,755 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-11-07 01:42:17,755 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 01:42:17,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:42:17 BasicIcfg [2021-11-07 01:42:17,881 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 01:42:17,881 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 01:42:17,881 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 01:42:17,882 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 01:42:17,882 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:41:53" (3/4) ... [2021-11-07 01:42:17,884 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-07 01:42:18,049 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df59ea5-9dfd-4e6d-bf85-317c249fa9d1/bin/utaipan-UUZaoUuFF8/witness.graphml [2021-11-07 01:42:18,049 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 01:42:18,051 INFO L168 Benchmark]: Toolchain (without parser) took 27395.03 ms. Allocated memory was 94.4 MB in the beginning and 287.3 MB in the end (delta: 192.9 MB). Free memory was 55.5 MB in the beginning and 241.6 MB in the end (delta: -186.2 MB). Peak memory consumption was 135.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:42:18,051 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 94.4 MB. Free memory is still 73.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:42:18,052 INFO L168 Benchmark]: CACSL2BoogieTranslator took 738.26 ms. Allocated memory is still 94.4 MB. Free memory was 55.3 MB in the beginning and 55.8 MB in the end (delta: -553.8 kB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-07 01:42:18,053 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.25 ms. Allocated memory is still 94.4 MB. Free memory was 55.6 MB in the beginning and 52.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-07 01:42:18,053 INFO L168 Benchmark]: Boogie Preprocessor took 57.39 ms. Allocated memory is still 94.4 MB. Free memory was 52.7 MB in the beginning and 50.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:42:18,053 INFO L168 Benchmark]: RCFGBuilder took 2046.90 ms. Allocated memory was 94.4 MB in the beginning and 119.5 MB in the end (delta: 25.2 MB). Free memory was 50.6 MB in the beginning and 46.8 MB in the end (delta: 3.8 MB). Peak memory consumption was 33.4 MB. Max. memory is 16.1 GB. [2021-11-07 01:42:18,054 INFO L168 Benchmark]: TraceAbstraction took 24278.31 ms. Allocated memory was 119.5 MB in the beginning and 239.1 MB in the end (delta: 119.5 MB). Free memory was 46.8 MB in the beginning and 74.2 MB in the end (delta: -27.4 MB). Peak memory consumption was 92.2 MB. Max. memory is 16.1 GB. [2021-11-07 01:42:18,055 INFO L168 Benchmark]: Witness Printer took 168.31 ms. Allocated memory was 239.1 MB in the beginning and 287.3 MB in the end (delta: 48.2 MB). Free memory was 74.2 MB in the beginning and 241.6 MB in the end (delta: -167.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 16.1 GB. [2021-11-07 01:42:18,057 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.25 ms. Allocated memory is still 94.4 MB. Free memory is still 73.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 738.26 ms. Allocated memory is still 94.4 MB. Free memory was 55.3 MB in the beginning and 55.8 MB in the end (delta: -553.8 kB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 97.25 ms. Allocated memory is still 94.4 MB. Free memory was 55.6 MB in the beginning and 52.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 57.39 ms. Allocated memory is still 94.4 MB. Free memory was 52.7 MB in the beginning and 50.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2046.90 ms. Allocated memory was 94.4 MB in the beginning and 119.5 MB in the end (delta: 25.2 MB). Free memory was 50.6 MB in the beginning and 46.8 MB in the end (delta: 3.8 MB). Peak memory consumption was 33.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 24278.31 ms. Allocated memory was 119.5 MB in the beginning and 239.1 MB in the end (delta: 119.5 MB). Free memory was 46.8 MB in the beginning and 74.2 MB in the end (delta: -27.4 MB). Peak memory consumption was 92.2 MB. Max. memory is 16.1 GB. * Witness Printer took 168.31 ms. Allocated memory was 239.1 MB in the beginning and 287.3 MB in the end (delta: 48.2 MB). Free memory was 74.2 MB in the beginning and 241.6 MB in the end (delta: -167.5 MB). Peak memory consumption was 9.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.9s, 113 PlacesBefore, 36 PlacesAfterwards, 105 TransitionsBefore, 26 TransitionsAfterwards, 1876 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 91 TotalNumberOfCompositions, 5130 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2364, positive: 2186, positive conditional: 0, positive unconditional: 2186, negative: 178, negative conditional: 0, negative unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1376, positive: 1306, positive conditional: 0, positive unconditional: 1306, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1376, positive: 1290, positive conditional: 0, positive unconditional: 1290, negative: 86, negative conditional: 0, negative unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 86, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 844, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 814, negative conditional: 0, negative unconditional: 814, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2364, positive: 880, positive conditional: 0, positive unconditional: 880, negative: 108, negative conditional: 0, negative unconditional: 108, unknown: 1376, unknown conditional: 0, unknown unconditional: 1376] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 118, Positive conditional cache size: 0, Positive unconditional cache size: 118, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - 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; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L816] 0 pthread_t t2489; [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2490; [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2491; [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L754] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 821]: 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: 817]: 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: 819]: 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, 132 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 23.9s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 18.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 418 SDtfs, 399 SDslu, 662 SDs, 0 SdLazy, 447 SolverSat, 125 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=724occurred in iteration=0, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 234 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 253 NumberOfCodeBlocks, 253 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 2654 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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-07 01:42:18,113 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5df59ea5-9dfd-4e6d-bf85-317c249fa9d1/bin/utaipan-UUZaoUuFF8/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