./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2173db9a2274c43e93688b39a8ab5256e9054c31e7330b4f58c34c545dbb4480 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 19:04:11,362 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 19:04:11,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 19:04:11,411 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 19:04:11,412 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 19:04:11,413 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 19:04:11,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 19:04:11,417 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 19:04:11,419 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 19:04:11,420 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 19:04:11,422 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 19:04:11,423 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 19:04:11,424 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 19:04:11,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 19:04:11,427 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 19:04:11,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 19:04:11,429 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 19:04:11,430 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 19:04:11,433 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 19:04:11,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 19:04:11,441 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 19:04:11,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 19:04:11,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 19:04:11,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 19:04:11,451 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 19:04:11,460 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 19:04:11,460 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 19:04:11,461 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 19:04:11,462 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 19:04:11,463 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 19:04:11,463 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 19:04:11,464 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 19:04:11,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 19:04:11,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 19:04:11,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 19:04:11,467 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 19:04:11,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 19:04:11,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 19:04:11,468 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 19:04:11,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 19:04:11,470 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 19:04:11,471 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-25 19:04:11,515 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 19:04:11,518 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 19:04:11,519 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 19:04:11,519 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 19:04:11,520 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 19:04:11,520 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 19:04:11,520 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 19:04:11,521 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 19:04:11,521 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 19:04:11,521 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 19:04:11,522 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 19:04:11,522 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 19:04:11,523 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 19:04:11,523 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 19:04:11,523 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 19:04:11,523 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 19:04:11,524 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 19:04:11,524 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 19:04:11,525 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 19:04:11,525 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 19:04:11,525 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 19:04:11,525 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 19:04:11,526 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 19:04:11,526 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 19:04:11,526 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 19:04:11,526 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 19:04:11,528 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 19:04:11,528 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 19:04:11,528 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 19:04:11,528 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 19:04:11,529 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 19:04:11,529 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 19:04:11,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 19:04:11,530 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 19:04:11,530 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 19:04:11,530 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 19:04:11,530 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 19:04:11,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 19:04:11,531 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 19:04:11,531 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 19:04:11,531 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 19:04:11,532 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_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2173db9a2274c43e93688b39a8ab5256e9054c31e7330b4f58c34c545dbb4480 [2021-11-25 19:04:11,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 19:04:11,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 19:04:11,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 19:04:11,816 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 19:04:11,817 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 19:04:11,818 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2021-11-25 19:04:11,906 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/data/c58c9df81/5ab2bca7ecdb4bf7af96d12f71534679/FLAGbf14768d1 [2021-11-25 19:04:12,369 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 19:04:12,370 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2021-11-25 19:04:12,382 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/data/c58c9df81/5ab2bca7ecdb4bf7af96d12f71534679/FLAGbf14768d1 [2021-11-25 19:04:12,744 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/data/c58c9df81/5ab2bca7ecdb4bf7af96d12f71534679 [2021-11-25 19:04:12,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 19:04:12,748 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 19:04:12,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 19:04:12,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 19:04:12,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 19:04:12,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:04:12" (1/1) ... [2021-11-25 19:04:12,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4883761 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:04:12, skipping insertion in model container [2021-11-25 19:04:12,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:04:12" (1/1) ... [2021-11-25 19:04:12,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 19:04:12,785 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 19:04:12,992 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c[2987,3000] [2021-11-25 19:04:12,999 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:04:13,007 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 19:04:13,030 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c[2987,3000] [2021-11-25 19:04:13,033 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:04:13,049 INFO L208 MainTranslator]: Completed translation [2021-11-25 19:04:13,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:04:13 WrapperNode [2021-11-25 19:04:13,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 19:04:13,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 19:04:13,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 19:04:13,051 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 19:04:13,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:04:13" (1/1) ... [2021-11-25 19:04:13,067 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:04:13" (1/1) ... [2021-11-25 19:04:13,092 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 200 [2021-11-25 19:04:13,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 19:04:13,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 19:04:13,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 19:04:13,094 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 19:04:13,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:04:13" (1/1) ... [2021-11-25 19:04:13,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:04:13" (1/1) ... [2021-11-25 19:04:13,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:04:13" (1/1) ... [2021-11-25 19:04:13,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:04:13" (1/1) ... [2021-11-25 19:04:13,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:04:13" (1/1) ... [2021-11-25 19:04:13,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:04:13" (1/1) ... [2021-11-25 19:04:13,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:04:13" (1/1) ... [2021-11-25 19:04:13,149 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 19:04:13,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 19:04:13,150 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 19:04:13,150 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 19:04:13,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:04:13" (1/1) ... [2021-11-25 19:04:13,168 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 19:04:13,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:04:13,197 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 19:04:13,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 19:04:13,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 19:04:13,249 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-11-25 19:04:13,250 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-11-25 19:04:13,250 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-11-25 19:04:13,250 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-11-25 19:04:13,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 19:04:13,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 19:04:13,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-25 19:04:13,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-25 19:04:13,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-25 19:04:13,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-25 19:04:13,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 19:04:13,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 19:04:13,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-25 19:04:13,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 19:04:13,254 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-25 19:04:13,366 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 19:04:13,367 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 19:04:13,661 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 19:04:13,850 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 19:04:13,850 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-25 19:04:13,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:04:13 BoogieIcfgContainer [2021-11-25 19:04:13,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 19:04:13,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 19:04:13,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 19:04:13,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 19:04:13,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 07:04:12" (1/3) ... [2021-11-25 19:04:13,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3439672a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 07:04:13, skipping insertion in model container [2021-11-25 19:04:13,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:04:13" (2/3) ... [2021-11-25 19:04:13,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3439672a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 07:04:13, skipping insertion in model container [2021-11-25 19:04:13,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:04:13" (3/3) ... [2021-11-25 19:04:13,862 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2021-11-25 19:04:13,867 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-25 19:04:13,867 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 19:04:13,867 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-25 19:04:13,868 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-25 19:04:13,942 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,943 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,943 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,944 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,944 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,944 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,945 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,945 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,945 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,946 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,946 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,947 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,947 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,948 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,949 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,950 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,950 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,950 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,951 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,951 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,952 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,952 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,953 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,953 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,953 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,954 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,954 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,954 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,955 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,956 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,961 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,961 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,964 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,964 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,964 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,965 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,965 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,971 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,971 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,972 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,972 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,972 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,972 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,973 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,973 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,973 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,976 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,976 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,977 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,977 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,977 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,978 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,978 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,978 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,978 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 19:04:13,987 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-11-25 19:04:14,050 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 19:04:14,070 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-25 19:04:14,073 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-11-25 19:04:14,092 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-25 19:04:14,105 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 178 transitions, 372 flow [2021-11-25 19:04:14,108 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 178 transitions, 372 flow [2021-11-25 19:04:14,110 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 172 places, 178 transitions, 372 flow [2021-11-25 19:04:14,276 INFO L129 PetriNetUnfolder]: 13/176 cut-off events. [2021-11-25 19:04:14,278 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-11-25 19:04:14,283 INFO L84 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 176 events. 13/176 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 83 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 141. Up to 2 conditions per place. [2021-11-25 19:04:14,289 INFO L116 LiptonReduction]: Number of co-enabled transitions 500 [2021-11-25 19:04:20,637 INFO L131 LiptonReduction]: Checked pairs total: 800 [2021-11-25 19:04:20,637 INFO L133 LiptonReduction]: Total number of compositions: 180 [2021-11-25 19:04:20,645 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 22 transitions, 60 flow [2021-11-25 19:04:20,655 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 36 states, 35 states have (on average 2.2) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:04:20,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 35 states have (on average 2.2) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:04:20,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-25 19:04:20,664 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:04:20,665 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:04:20,666 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:04:20,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:04:20,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1757789940, now seen corresponding path program 1 times [2021-11-25 19:04:20,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:04:20,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474317644] [2021-11-25 19:04:20,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:04:20,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:04:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:04:20,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:04:20,993 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:04:20,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474317644] [2021-11-25 19:04:20,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474317644] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:04:20,994 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:04:20,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-25 19:04:20,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571269320] [2021-11-25 19:04:20,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:04:21,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:04:21,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:04:21,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:04:21,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:04:21,030 INFO L87 Difference]: Start difference. First operand has 36 states, 35 states have (on average 2.2) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 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 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:04:21,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:04:21,101 INFO L93 Difference]: Finished difference Result 67 states and 147 transitions. [2021-11-25 19:04:21,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:04:21,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-25 19:04:21,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:04:21,118 INFO L225 Difference]: With dead ends: 67 [2021-11-25 19:04:21,118 INFO L226 Difference]: Without dead ends: 62 [2021-11-25 19:04:21,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:04:21,125 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 4 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:04:21,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 0 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 19:04:21,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-11-25 19:04:21,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2021-11-25 19:04:21,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 2.2127659574468086) internal successors, (104), 47 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:04:21,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 104 transitions. [2021-11-25 19:04:21,165 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 104 transitions. Word has length 13 [2021-11-25 19:04:21,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:04:21,165 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 104 transitions. [2021-11-25 19:04:21,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:04:21,166 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 104 transitions. [2021-11-25 19:04:21,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 19:04:21,167 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:04:21,167 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:04:21,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 19:04:21,167 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:04:21,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:04:21,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1622612603, now seen corresponding path program 1 times [2021-11-25 19:04:21,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:04:21,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144191089] [2021-11-25 19:04:21,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:04:21,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:04:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:04:21,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:04:21,266 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:04:21,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144191089] [2021-11-25 19:04:21,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144191089] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:04:21,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:04:21,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:04:21,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031626423] [2021-11-25 19:04:21,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:04:21,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:04:21,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:04:21,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:04:21,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:04:21,277 INFO L87 Difference]: Start difference. First operand 48 states and 104 transitions. Second operand has 4 states, 4 states have (on average 3.75) 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-25 19:04:21,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:04:21,363 INFO L93 Difference]: Finished difference Result 68 states and 134 transitions. [2021-11-25 19:04:21,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:04:21,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) 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-25 19:04:21,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:04:21,367 INFO L225 Difference]: With dead ends: 68 [2021-11-25 19:04:21,368 INFO L226 Difference]: Without dead ends: 49 [2021-11-25 19:04:21,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:04:21,371 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:04:21,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:04:21,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-11-25 19:04:21,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2021-11-25 19:04:21,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 2.1875) internal successors, (105), 48 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:04:21,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 105 transitions. [2021-11-25 19:04:21,393 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 105 transitions. Word has length 15 [2021-11-25 19:04:21,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:04:21,394 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 105 transitions. [2021-11-25 19:04:21,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) 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-25 19:04:21,394 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 105 transitions. [2021-11-25 19:04:21,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-25 19:04:21,396 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:04:21,397 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:04:21,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-25 19:04:21,397 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:04:21,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:04:21,399 INFO L85 PathProgramCache]: Analyzing trace with hash 214757420, now seen corresponding path program 1 times [2021-11-25 19:04:21,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:04:21,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380385818] [2021-11-25 19:04:21,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:04:21,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:04:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:04:21,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:04:21,557 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:04:21,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380385818] [2021-11-25 19:04:21,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380385818] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:04:21,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904170212] [2021-11-25 19:04:21,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:04:21,558 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:04:21,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:04:21,560 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:04:21,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-25 19:04:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:04:21,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-25 19:04:21,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:04:21,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:04:21,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:04:21,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:04:21,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904170212] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:04:21,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1664467407] [2021-11-25 19:04:21,952 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 19:04:21,958 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:04:21,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2021-11-25 19:04:21,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234667368] [2021-11-25 19:04:21,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:04:21,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-25 19:04:21,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:04:21,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-25 19:04:21,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-25 19:04:21,962 INFO L87 Difference]: Start difference. First operand 49 states and 105 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:04:22,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:04:22,130 INFO L93 Difference]: Finished difference Result 93 states and 192 transitions. [2021-11-25 19:04:22,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 19:04:22,131 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-25 19:04:22,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:04:22,136 INFO L225 Difference]: With dead ends: 93 [2021-11-25 19:04:22,137 INFO L226 Difference]: Without dead ends: 93 [2021-11-25 19:04:22,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-25 19:04:22,140 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:04:22,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:04:22,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-11-25 19:04:22,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 53. [2021-11-25 19:04:22,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 2.3076923076923075) internal successors, (120), 52 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:04:22,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 120 transitions. [2021-11-25 19:04:22,162 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 120 transitions. Word has length 16 [2021-11-25 19:04:22,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:04:22,163 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 120 transitions. [2021-11-25 19:04:22,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:04:22,164 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 120 transitions. [2021-11-25 19:04:22,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-25 19:04:22,165 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:04:22,165 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:04:22,201 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-25 19:04:22,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-11-25 19:04:22,381 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:04:22,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:04:22,381 INFO L85 PathProgramCache]: Analyzing trace with hash -682686950, now seen corresponding path program 1 times [2021-11-25 19:04:22,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:04:22,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95643628] [2021-11-25 19:04:22,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:04:22,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:04:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:04:22,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:04:22,478 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:04:22,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95643628] [2021-11-25 19:04:22,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95643628] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:04:22,479 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:04:22,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 19:04:22,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073822578] [2021-11-25 19:04:22,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:04:22,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:04:22,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:04:22,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:04:22,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:04:22,482 INFO L87 Difference]: Start difference. First operand 53 states and 120 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:04:22,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:04:22,557 INFO L93 Difference]: Finished difference Result 65 states and 137 transitions. [2021-11-25 19:04:22,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:04:22,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-25 19:04:22,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:04:22,558 INFO L225 Difference]: With dead ends: 65 [2021-11-25 19:04:22,558 INFO L226 Difference]: Without dead ends: 57 [2021-11-25 19:04:22,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:04:22,559 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:04:22,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:04:22,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-11-25 19:04:22,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2021-11-25 19:04:22,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:04:22,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 111 transitions. [2021-11-25 19:04:22,565 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 111 transitions. Word has length 16 [2021-11-25 19:04:22,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:04:22,565 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 111 transitions. [2021-11-25 19:04:22,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:04:22,565 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 111 transitions. [2021-11-25 19:04:22,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-25 19:04:22,566 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:04:22,566 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:04:22,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-25 19:04:22,566 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:04:22,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:04:22,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1996469860, now seen corresponding path program 2 times [2021-11-25 19:04:22,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:04:22,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086585045] [2021-11-25 19:04:22,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:04:22,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:04:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:04:22,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:04:22,696 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:04:22,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086585045] [2021-11-25 19:04:22,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086585045] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:04:22,697 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:04:22,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 19:04:22,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887397337] [2021-11-25 19:04:22,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:04:22,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:04:22,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:04:22,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:04:22,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:04:22,698 INFO L87 Difference]: Start difference. First operand 51 states and 111 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:04:22,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:04:22,789 INFO L93 Difference]: Finished difference Result 69 states and 155 transitions. [2021-11-25 19:04:22,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 19:04:22,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-25 19:04:22,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:04:22,791 INFO L225 Difference]: With dead ends: 69 [2021-11-25 19:04:22,791 INFO L226 Difference]: Without dead ends: 69 [2021-11-25 19:04:22,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:04:22,792 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:04:22,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:04:22,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-11-25 19:04:22,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 55. [2021-11-25 19:04:22,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 2.240740740740741) internal successors, (121), 54 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:04:22,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 121 transitions. [2021-11-25 19:04:22,799 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 121 transitions. Word has length 16 [2021-11-25 19:04:22,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:04:22,800 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 121 transitions. [2021-11-25 19:04:22,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:04:22,801 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 121 transitions. [2021-11-25 19:04:22,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 19:04:22,802 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:04:22,802 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:04:22,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-25 19:04:22,813 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:04:22,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:04:22,814 INFO L85 PathProgramCache]: Analyzing trace with hash -2032363639, now seen corresponding path program 1 times [2021-11-25 19:04:22,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:04:22,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675718542] [2021-11-25 19:04:22,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:04:22,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:04:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:04:22,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 19:04:22,897 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:04:22,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675718542] [2021-11-25 19:04:22,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675718542] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:04:22,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:04:22,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 19:04:22,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13377764] [2021-11-25 19:04:22,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:04:22,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:04:22,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:04:22,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:04:22,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:04:22,899 INFO L87 Difference]: Start difference. First operand 55 states and 121 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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-25 19:04:22,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:04:22,961 INFO L93 Difference]: Finished difference Result 67 states and 137 transitions. [2021-11-25 19:04:22,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 19:04:22,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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-25 19:04:22,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:04:22,963 INFO L225 Difference]: With dead ends: 67 [2021-11-25 19:04:22,963 INFO L226 Difference]: Without dead ends: 56 [2021-11-25 19:04:22,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:04:22,964 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:04:22,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:04:22,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-11-25 19:04:22,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-11-25 19:04:22,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 2.2181818181818183) internal successors, (122), 55 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:04:22,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 122 transitions. [2021-11-25 19:04:22,971 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 122 transitions. Word has length 18 [2021-11-25 19:04:22,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:04:22,971 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 122 transitions. [2021-11-25 19:04:22,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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-25 19:04:22,972 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 122 transitions. [2021-11-25 19:04:22,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 19:04:22,973 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:04:22,973 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:04:22,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-25 19:04:22,973 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:04:22,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:04:22,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1996244730, now seen corresponding path program 1 times [2021-11-25 19:04:22,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:04:22,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106339298] [2021-11-25 19:04:22,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:04:22,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:04:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:04:23,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 19:04:23,081 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:04:23,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106339298] [2021-11-25 19:04:23,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106339298] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:04:23,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:04:23,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 19:04:23,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665815409] [2021-11-25 19:04:23,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:04:23,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:04:23,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:04:23,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:04:23,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:04:23,083 INFO L87 Difference]: Start difference. First operand 56 states and 122 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:04:23,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:04:23,117 INFO L93 Difference]: Finished difference Result 46 states and 96 transitions. [2021-11-25 19:04:23,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:04:23,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-25 19:04:23,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:04:23,118 INFO L225 Difference]: With dead ends: 46 [2021-11-25 19:04:23,119 INFO L226 Difference]: Without dead ends: 46 [2021-11-25 19:04:23,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:04:23,120 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:04:23,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 0 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 19:04:23,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-11-25 19:04:23,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2021-11-25 19:04:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 45 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:04:23,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 96 transitions. [2021-11-25 19:04:23,126 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 96 transitions. Word has length 19 [2021-11-25 19:04:23,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:04:23,126 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 96 transitions. [2021-11-25 19:04:23,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:04:23,126 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 96 transitions. [2021-11-25 19:04:23,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 19:04:23,127 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:04:23,128 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:04:23,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-25 19:04:23,128 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:04:23,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:04:23,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1382228070, now seen corresponding path program 2 times [2021-11-25 19:04:23,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:04:23,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647628617] [2021-11-25 19:04:23,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:04:23,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:04:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:04:24,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:04:24,443 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:04:24,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647628617] [2021-11-25 19:04:24,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647628617] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:04:24,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98876244] [2021-11-25 19:04:24,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:04:24,443 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:04:24,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:04:24,449 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:04:24,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-25 19:04:24,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 19:04:24,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:04:24,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 54 conjunts are in the unsatisfiable core [2021-11-25 19:04:24,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:04:24,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 19:04:24,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 19:04:25,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:04:25,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-11-25 19:04:25,410 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:04:25,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 38 [2021-11-25 19:04:25,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:04:25,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:04:26,155 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_176 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_176))) (let ((.cse3 (select .cse2 ~q1~0.base))) (or (let ((.cse1 (select .cse3 (+ ~q1~0.offset (* c_~q1_front~0 4)))) (.cse0 (+ 1 (select (select .cse2 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))))) (and (or (< .cse0 c_~N~0) (< .cse1 c_~N~0)) (or (< (+ .cse1 1) c_~N~0) (<= .cse0 c_~N~0)))) (not (= c_~j~0 (select .cse3 (+ (* c_~q1_back~0 4) ~q1~0.offset)))))))) is different from false [2021-11-25 19:04:26,897 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:04:26,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 181 treesize of output 121 [2021-11-25 19:04:26,953 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:04:26,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 556 treesize of output 600 [2021-11-25 19:04:26,996 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:04:26,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 468 treesize of output 432 [2021-11-25 19:04:27,066 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:04:27,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 408 treesize of output 456 [2021-11-25 19:04:51,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:04:51,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98876244] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:04:51,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1012337797] [2021-11-25 19:04:51,558 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 19:04:51,560 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:04:51,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 33 [2021-11-25 19:04:51,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920506077] [2021-11-25 19:04:51,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:04:51,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-11-25 19:04:51,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:04:51,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-11-25 19:04:51,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1001, Unknown=1, NotChecked=64, Total=1190 [2021-11-25 19:04:51,562 INFO L87 Difference]: Start difference. First operand 46 states and 96 transitions. Second operand has 35 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 34 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:04:55,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:04:55,765 INFO L93 Difference]: Finished difference Result 206 states and 451 transitions. [2021-11-25 19:04:55,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-11-25 19:04:55,766 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 34 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-25 19:04:55,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:04:55,768 INFO L225 Difference]: With dead ends: 206 [2021-11-25 19:04:55,768 INFO L226 Difference]: Without dead ends: 191 [2021-11-25 19:04:55,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 17 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1392 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=746, Invalid=4929, Unknown=29, NotChecked=148, Total=5852 [2021-11-25 19:04:55,772 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 188 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 439 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:04:55,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 0 Invalid, 1493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 960 Invalid, 0 Unknown, 439 Unchecked, 0.8s Time] [2021-11-25 19:04:55,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-11-25 19:04:55,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 86. [2021-11-25 19:04:55,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 2.1294117647058823) internal successors, (181), 85 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:04:55,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 181 transitions. [2021-11-25 19:04:55,782 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 181 transitions. Word has length 19 [2021-11-25 19:04:55,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:04:55,782 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 181 transitions. [2021-11-25 19:04:55,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 34 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:04:55,783 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 181 transitions. [2021-11-25 19:04:55,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 19:04:55,784 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:04:55,784 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:04:55,818 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-25 19:04:56,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-11-25 19:04:56,013 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:04:56,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:04:56,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1049760510, now seen corresponding path program 3 times [2021-11-25 19:04:56,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:04:56,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076464269] [2021-11-25 19:04:56,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:04:56,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:04:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:04:57,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:04:57,215 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:04:57,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076464269] [2021-11-25 19:04:57,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076464269] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:04:57,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616446367] [2021-11-25 19:04:57,216 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:04:57,216 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:04:57,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:04:57,217 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:04:57,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-25 19:04:57,305 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:04:57,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:04:57,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 65 conjunts are in the unsatisfiable core [2021-11-25 19:04:57,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:04:57,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:04:57,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:04:57,346 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 19:04:57,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2021-11-25 19:04:57,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-25 19:04:57,471 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:04:57,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-25 19:04:57,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 19:04:57,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 19:04:57,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:04:57,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:04:58,098 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:04:58,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 35 [2021-11-25 19:04:58,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:04:58,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:05:00,173 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:05:00,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 471 treesize of output 292 [2021-11-25 19:05:00,321 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:05:00,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 21604 treesize of output 20054 [2021-11-25 19:05:00,809 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:05:00,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 19887 treesize of output 18964 [2021-11-25 19:05:01,126 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:05:01,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 18879 treesize of output 15660 [2021-11-25 19:05:01,410 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:05:01,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 15615 treesize of output 13684 [2021-11-25 19:05:01,650 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:05:01,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 13599 treesize of output 13116 [2021-11-25 19:05:01,945 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:05:01,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 13071 treesize of output 12764 [2021-11-25 19:05:02,226 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:05:02,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 12679 treesize of output 12568 [2021-11-25 19:05:02,429 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-25 19:05:02,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1194324024] [2021-11-25 19:05:02,430 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 19:05:02,431 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-25 19:05:02,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2021-11-25 19:05:02,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180630761] [2021-11-25 19:05:02,431 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-25 19:05:02,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:05:02,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:05:02,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:05:02,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1072, Unknown=4, NotChecked=0, Total=1190 [2021-11-25 19:05:02,433 INFO L87 Difference]: Start difference. First operand 86 states and 181 transitions. Second operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:05:03,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:05:03,639 INFO L93 Difference]: Finished difference Result 145 states and 295 transitions. [2021-11-25 19:05:03,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-25 19:05:03,641 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-25 19:05:03,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:05:03,643 INFO L225 Difference]: With dead ends: 145 [2021-11-25 19:05:03,643 INFO L226 Difference]: Without dead ends: 140 [2021-11-25 19:05:03,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=228, Invalid=1748, Unknown=4, NotChecked=0, Total=1980 [2021-11-25 19:05:03,645 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 81 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 19:05:03,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 0 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 19:05:03,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-11-25 19:05:03,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 92. [2021-11-25 19:05:03,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 2.1648351648351647) internal successors, (197), 91 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:05:03,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 197 transitions. [2021-11-25 19:05:03,653 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 197 transitions. Word has length 19 [2021-11-25 19:05:03,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:05:03,653 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 197 transitions. [2021-11-25 19:05:03,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:05:03,653 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 197 transitions. [2021-11-25 19:05:03,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 19:05:03,655 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:05:03,655 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:05:03,689 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-25 19:05:03,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:05:03,869 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:05:03,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:05:03,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1523889850, now seen corresponding path program 4 times [2021-11-25 19:05:03,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:05:03,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280005563] [2021-11-25 19:05:03,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:05:03,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:05:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:05:04,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:05:04,905 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:05:04,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280005563] [2021-11-25 19:05:04,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280005563] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:05:04,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199644155] [2021-11-25 19:05:04,905 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:05:04,905 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:05:04,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:05:04,910 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:05:04,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-25 19:05:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:05:05,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 65 conjunts are in the unsatisfiable core [2021-11-25 19:05:05,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:05:05,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:05:05,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:05:05,034 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 19:05:05,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2021-11-25 19:05:05,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-25 19:05:05,212 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:05:05,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-25 19:05:05,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-25 19:05:05,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 19:05:05,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:05:05,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-11-25 19:05:06,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 20 [2021-11-25 19:05:06,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:05:06,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:05:09,412 INFO L354 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2021-11-25 19:05:09,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 325 treesize of output 151 [2021-11-25 19:05:09,511 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:05:09,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 832 treesize of output 914 [2021-11-25 19:05:09,589 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:05:09,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 714 treesize of output 744 [2021-11-25 19:05:09,671 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:05:09,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 630 treesize of output 558 [2021-11-25 19:06:11,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:06:11,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199644155] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:06:11,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1799620061] [2021-11-25 19:06:11,875 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 19:06:11,875 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:06:11,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 34 [2021-11-25 19:06:11,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131890378] [2021-11-25 19:06:11,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:06:11,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-11-25 19:06:11,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:06:11,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-25 19:06:11,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1126, Unknown=2, NotChecked=0, Total=1260 [2021-11-25 19:06:11,877 INFO L87 Difference]: Start difference. First operand 92 states and 197 transitions. Second operand has 36 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 35 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:13,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:06:13,324 INFO L93 Difference]: Finished difference Result 188 states and 395 transitions. [2021-11-25 19:06:13,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-25 19:06:13,324 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 35 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-25 19:06:13,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:06:13,326 INFO L225 Difference]: With dead ends: 188 [2021-11-25 19:06:13,326 INFO L226 Difference]: Without dead ends: 178 [2021-11-25 19:06:13,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=263, Invalid=2087, Unknown=2, NotChecked=0, Total=2352 [2021-11-25 19:06:13,328 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 341 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:06:13,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 399 Invalid, 0 Unknown, 341 Unchecked, 0.4s Time] [2021-11-25 19:06:13,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-11-25 19:06:13,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 127. [2021-11-25 19:06:13,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 2.142857142857143) internal successors, (270), 126 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:13,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 270 transitions. [2021-11-25 19:06:13,336 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 270 transitions. Word has length 19 [2021-11-25 19:06:13,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:06:13,336 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 270 transitions. [2021-11-25 19:06:13,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 35 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:13,337 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 270 transitions. [2021-11-25 19:06:13,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 19:06:13,338 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:06:13,338 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:06:13,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-25 19:06:13,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-25 19:06:13,564 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:06:13,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:06:13,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1647645892, now seen corresponding path program 5 times [2021-11-25 19:06:13,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:06:13,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96831891] [2021-11-25 19:06:13,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:06:13,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:06:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:06:14,472 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:06:14,472 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:06:14,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96831891] [2021-11-25 19:06:14,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96831891] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:06:14,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674084056] [2021-11-25 19:06:14,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:06:14,473 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:06:14,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:06:14,473 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:06:14,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-25 19:06:14,571 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 19:06:14,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:06:14,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 61 conjunts are in the unsatisfiable core [2021-11-25 19:06:14,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:06:14,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 19:06:14,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 19:06:15,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:06:15,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-11-25 19:06:15,276 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:06:15,279 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:06:15,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 28 [2021-11-25 19:06:15,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:06:15,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:06:16,363 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:06:16,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 181 treesize of output 121 [2021-11-25 19:06:16,406 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:06:16,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 638 treesize of output 674 [2021-11-25 19:06:16,434 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:06:16,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 542 treesize of output 494 [2021-11-25 19:06:16,479 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:06:16,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 470 treesize of output 512 [2021-11-25 19:06:40,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:06:40,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674084056] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:06:40,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1621983897] [2021-11-25 19:06:40,183 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 19:06:40,183 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:06:40,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2021-11-25 19:06:40,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354437960] [2021-11-25 19:06:40,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:06:40,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-25 19:06:40,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:06:40,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-25 19:06:40,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1189, Unknown=1, NotChecked=0, Total=1332 [2021-11-25 19:06:40,186 INFO L87 Difference]: Start difference. First operand 127 states and 270 transitions. Second operand has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:43,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:06:43,835 INFO L93 Difference]: Finished difference Result 335 states and 703 transitions. [2021-11-25 19:06:43,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-11-25 19:06:43,836 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-25 19:06:43,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:06:43,839 INFO L225 Difference]: With dead ends: 335 [2021-11-25 19:06:43,839 INFO L226 Difference]: Without dead ends: 317 [2021-11-25 19:06:43,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=736, Invalid=4233, Unknown=1, NotChecked=0, Total=4970 [2021-11-25 19:06:43,841 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 249 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 433 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:06:43,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 0 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 518 Invalid, 0 Unknown, 433 Unchecked, 0.5s Time] [2021-11-25 19:06:43,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-11-25 19:06:43,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 151. [2021-11-25 19:06:43,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 2.0933333333333333) internal successors, (314), 150 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:43,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 314 transitions. [2021-11-25 19:06:43,851 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 314 transitions. Word has length 19 [2021-11-25 19:06:43,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:06:43,851 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 314 transitions. [2021-11-25 19:06:43,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:43,852 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 314 transitions. [2021-11-25 19:06:43,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 19:06:43,853 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:06:43,853 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:06:43,890 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-25 19:06:44,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:06:44,069 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:06:44,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:06:44,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1315178332, now seen corresponding path program 6 times [2021-11-25 19:06:44,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:06:44,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338283000] [2021-11-25 19:06:44,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:06:44,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:06:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:06:44,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:06:44,841 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:06:44,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338283000] [2021-11-25 19:06:44,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338283000] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:06:44,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170601790] [2021-11-25 19:06:44,841 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:06:44,841 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:06:44,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:06:44,843 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:06:44,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-25 19:06:44,922 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:06:44,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:06:44,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 70 conjunts are in the unsatisfiable core [2021-11-25 19:06:44,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:06:44,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:06:44,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:06:44,947 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 19:06:44,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2021-11-25 19:06:45,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-25 19:06:45,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:06:45,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:06:45,062 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:06:45,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2021-11-25 19:06:45,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-25 19:06:45,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 19:06:45,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:06:45,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:06:45,560 INFO L354 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2021-11-25 19:06:45,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 20 [2021-11-25 19:06:45,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:06:45,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:06:50,772 INFO L354 Elim1Store]: treesize reduction 54, result has 61.2 percent of original size [2021-11-25 19:06:50,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 823 treesize of output 332 [2021-11-25 19:06:50,961 INFO L354 Elim1Store]: treesize reduction 101, result has 62.3 percent of original size [2021-11-25 19:06:50,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 3046 treesize of output 2716 [2021-11-25 19:06:51,174 INFO L354 Elim1Store]: treesize reduction 101, result has 62.3 percent of original size [2021-11-25 19:06:51,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 4146 treesize of output 4008 [2021-11-25 19:06:51,349 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:06:51,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3623 treesize of output 3504 [2021-11-25 19:06:51,443 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:06:51,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3407 treesize of output 3168 [2021-11-25 19:06:51,545 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:06:51,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3119 treesize of output 2640 [2021-11-25 19:06:51,671 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:06:51,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2591 treesize of output 2328 [2021-11-25 19:06:51,758 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-25 19:06:51,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1627946508] [2021-11-25 19:06:51,758 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 19:06:51,759 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-25 19:06:51,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2021-11-25 19:06:51,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676819576] [2021-11-25 19:06:51,760 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-25 19:06:51,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:06:51,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:06:51,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:06:51,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1061, Unknown=7, NotChecked=0, Total=1190 [2021-11-25 19:06:51,761 INFO L87 Difference]: Start difference. First operand 151 states and 314 transitions. Second operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:52,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:06:52,393 INFO L93 Difference]: Finished difference Result 183 states and 384 transitions. [2021-11-25 19:06:52,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-25 19:06:52,394 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-25 19:06:52,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:06:52,395 INFO L225 Difference]: With dead ends: 183 [2021-11-25 19:06:52,395 INFO L226 Difference]: Without dead ends: 178 [2021-11-25 19:06:52,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=186, Invalid=1447, Unknown=7, NotChecked=0, Total=1640 [2021-11-25 19:06:52,397 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 64 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:06:52,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 0 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 19:06:52,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-11-25 19:06:52,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 151. [2021-11-25 19:06:52,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 2.0933333333333333) internal successors, (314), 150 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:52,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 314 transitions. [2021-11-25 19:06:52,404 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 314 transitions. Word has length 19 [2021-11-25 19:06:52,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:06:52,404 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 314 transitions. [2021-11-25 19:06:52,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:06:52,405 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 314 transitions. [2021-11-25 19:06:52,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 19:06:52,405 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:06:52,406 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:06:52,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-25 19:06:52,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-25 19:06:52,623 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:06:52,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:06:52,623 INFO L85 PathProgramCache]: Analyzing trace with hash -610633872, now seen corresponding path program 7 times [2021-11-25 19:06:52,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:06:52,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884281255] [2021-11-25 19:06:52,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:06:52,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:06:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:06:53,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:06:53,464 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:06:53,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884281255] [2021-11-25 19:06:53,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884281255] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:06:53,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867031672] [2021-11-25 19:06:53,465 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:06:53,468 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:06:53,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:06:53,469 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:06:53,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-25 19:06:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:06:53,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 61 conjunts are in the unsatisfiable core [2021-11-25 19:06:53,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:06:53,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 19:06:53,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 19:06:53,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 19:06:54,240 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:06:54,244 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:06:54,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 28 [2021-11-25 19:06:54,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:06:54,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:06:55,357 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:06:55,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 124 [2021-11-25 19:06:55,398 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:06:55,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 678 treesize of output 714 [2021-11-25 19:06:55,441 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:06:55,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 606 treesize of output 648 [2021-11-25 19:06:55,486 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:06:55,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 552 treesize of output 540 [2021-11-25 19:07:47,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:07:47,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867031672] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:07:47,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [798220825] [2021-11-25 19:07:47,302 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 19:07:47,302 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:07:47,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2021-11-25 19:07:47,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122422523] [2021-11-25 19:07:47,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:07:47,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-25 19:07:47,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:07:47,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-25 19:07:47,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1174, Unknown=2, NotChecked=0, Total=1332 [2021-11-25 19:07:47,304 INFO L87 Difference]: Start difference. First operand 151 states and 314 transitions. Second operand has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:07:50,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:07:50,744 INFO L93 Difference]: Finished difference Result 278 states and 568 transitions. [2021-11-25 19:07:50,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-25 19:07:50,746 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-25 19:07:50,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:07:50,748 INFO L225 Difference]: With dead ends: 278 [2021-11-25 19:07:50,748 INFO L226 Difference]: Without dead ends: 268 [2021-11-25 19:07:50,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=686, Invalid=4281, Unknown=3, NotChecked=0, Total=4970 [2021-11-25 19:07:50,750 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 150 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 480 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:07:50,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 0 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 798 Invalid, 0 Unknown, 480 Unchecked, 0.6s Time] [2021-11-25 19:07:50,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-11-25 19:07:50,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 165. [2021-11-25 19:07:50,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 2.042682926829268) internal successors, (335), 164 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:07:50,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 335 transitions. [2021-11-25 19:07:50,759 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 335 transitions. Word has length 19 [2021-11-25 19:07:50,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:07:50,759 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 335 transitions. [2021-11-25 19:07:50,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:07:50,760 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 335 transitions. [2021-11-25 19:07:50,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 19:07:50,760 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:07:50,761 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:07:50,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-25 19:07:50,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-25 19:07:50,979 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:07:50,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:07:50,980 INFO L85 PathProgramCache]: Analyzing trace with hash -691678478, now seen corresponding path program 8 times [2021-11-25 19:07:50,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:07:50,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166149796] [2021-11-25 19:07:50,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:07:50,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:07:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:07:51,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:07:51,737 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:07:51,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166149796] [2021-11-25 19:07:51,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166149796] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:07:51,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009319687] [2021-11-25 19:07:51,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:07:51,741 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:07:51,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:07:51,742 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:07:51,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-25 19:07:51,851 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 19:07:51,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:07:51,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 61 conjunts are in the unsatisfiable core [2021-11-25 19:07:51,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:07:51,906 INFO L354 Elim1Store]: treesize reduction 37, result has 32.7 percent of original size [2021-11-25 19:07:51,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 23 [2021-11-25 19:07:51,997 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:07:51,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-25 19:07:52,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-25 19:07:52,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 19:07:52,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 19:07:52,347 INFO L354 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2021-11-25 19:07:52,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 17 [2021-11-25 19:07:52,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:07:52,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:07:52,922 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:07:52,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 114 [2021-11-25 19:07:52,987 INFO L354 Elim1Store]: treesize reduction 12, result has 89.0 percent of original size [2021-11-25 19:07:52,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1936 treesize of output 1752 [2021-11-25 19:07:53,033 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:07:53,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1656 treesize of output 1332 [2021-11-25 19:07:53,085 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:07:53,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1236 treesize of output 1122 [2021-11-25 19:08:25,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:08:25,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009319687] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:08:25,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1333942442] [2021-11-25 19:08:25,645 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 19:08:25,645 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:08:25,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 29 [2021-11-25 19:08:25,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719176202] [2021-11-25 19:08:25,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:08:25,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-25 19:08:25,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:08:25,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-25 19:08:25,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=793, Unknown=4, NotChecked=0, Total=930 [2021-11-25 19:08:25,647 INFO L87 Difference]: Start difference. First operand 165 states and 335 transitions. Second operand has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:08:27,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:08:27,178 INFO L93 Difference]: Finished difference Result 249 states and 536 transitions. [2021-11-25 19:08:27,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-25 19:08:27,179 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-25 19:08:27,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:08:27,181 INFO L225 Difference]: With dead ends: 249 [2021-11-25 19:08:27,181 INFO L226 Difference]: Without dead ends: 239 [2021-11-25 19:08:27,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=349, Invalid=1999, Unknown=4, NotChecked=0, Total=2352 [2021-11-25 19:08:27,183 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 109 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 169 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:08:27,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 0 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 577 Invalid, 0 Unknown, 169 Unchecked, 0.5s Time] [2021-11-25 19:08:27,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-11-25 19:08:27,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 176. [2021-11-25 19:08:27,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 2.08) internal successors, (364), 175 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:08:27,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 364 transitions. [2021-11-25 19:08:27,193 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 364 transitions. Word has length 19 [2021-11-25 19:08:27,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:08:27,194 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 364 transitions. [2021-11-25 19:08:27,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:08:27,195 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 364 transitions. [2021-11-25 19:08:27,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 19:08:27,196 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:08:27,196 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:08:27,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-25 19:08:27,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:08:27,421 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:08:27,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:08:27,421 INFO L85 PathProgramCache]: Analyzing trace with hash 889896648, now seen corresponding path program 9 times [2021-11-25 19:08:27,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:08:27,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44323838] [2021-11-25 19:08:27,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:08:27,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:08:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:08:28,192 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:08:28,193 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:08:28,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44323838] [2021-11-25 19:08:28,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44323838] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:08:28,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591060295] [2021-11-25 19:08:28,193 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:08:28,194 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:08:28,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:08:28,194 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:08:28,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-25 19:08:28,289 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:08:28,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:08:28,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 70 conjunts are in the unsatisfiable core [2021-11-25 19:08:28,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:08:28,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:28,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:08:28,322 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 19:08:28,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2021-11-25 19:08:28,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-25 19:08:28,501 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:08:28,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-25 19:08:28,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-25 19:08:28,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 19:08:28,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 19:08:29,104 INFO L354 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2021-11-25 19:08:29,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 23 [2021-11-25 19:08:29,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:08:29,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:08:31,190 INFO L354 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2021-11-25 19:08:31,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 328 treesize of output 154 [2021-11-25 19:08:31,261 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:08:31,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 708 treesize of output 806 [2021-11-25 19:08:31,320 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:08:31,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 606 treesize of output 594 [2021-11-25 19:08:31,376 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:08:31,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 498 treesize of output 540 [2021-11-25 19:08:35,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:08:35,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591060295] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:08:35,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1215542377] [2021-11-25 19:08:35,876 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 19:08:35,878 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:08:35,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2021-11-25 19:08:35,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245660011] [2021-11-25 19:08:35,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:08:35,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-25 19:08:35,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:08:35,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-25 19:08:35,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1125, Unknown=2, NotChecked=0, Total=1332 [2021-11-25 19:08:35,882 INFO L87 Difference]: Start difference. First operand 176 states and 364 transitions. Second operand has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:08:38,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:08:38,838 INFO L93 Difference]: Finished difference Result 309 states and 658 transitions. [2021-11-25 19:08:38,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-11-25 19:08:38,839 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-25 19:08:38,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:08:38,841 INFO L225 Difference]: With dead ends: 309 [2021-11-25 19:08:38,841 INFO L226 Difference]: Without dead ends: 299 [2021-11-25 19:08:38,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 951 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=710, Invalid=3844, Unknown=2, NotChecked=0, Total=4556 [2021-11-25 19:08:38,843 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 136 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 500 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:08:38,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 0 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 566 Invalid, 0 Unknown, 500 Unchecked, 0.5s Time] [2021-11-25 19:08:38,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-11-25 19:08:38,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 188. [2021-11-25 19:08:38,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 2.090909090909091) internal successors, (391), 187 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:08:38,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 391 transitions. [2021-11-25 19:08:38,852 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 391 transitions. Word has length 19 [2021-11-25 19:08:38,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:08:38,853 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 391 transitions. [2021-11-25 19:08:38,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:08:38,853 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 391 transitions. [2021-11-25 19:08:38,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 19:08:38,854 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:08:38,854 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:08:38,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-25 19:08:39,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-25 19:08:39,078 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:08:39,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:08:39,078 INFO L85 PathProgramCache]: Analyzing trace with hash 557429088, now seen corresponding path program 10 times [2021-11-25 19:08:39,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:08:39,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790808448] [2021-11-25 19:08:39,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:08:39,078 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:08:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:08:40,335 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:08:40,335 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:08:40,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790808448] [2021-11-25 19:08:40,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790808448] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:08:40,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114482913] [2021-11-25 19:08:40,335 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:08:40,335 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:08:40,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:08:40,337 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:08:40,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-25 19:08:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:08:40,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 63 conjunts are in the unsatisfiable core [2021-11-25 19:08:40,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:08:40,461 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-11-25 19:08:40,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2021-11-25 19:08:40,583 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-25 19:08:40,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 19:08:40,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-25 19:08:40,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 19:08:40,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 19:08:41,031 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:08:41,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2021-11-25 19:08:41,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:08:41,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:08:42,132 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:08:42,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 124 [2021-11-25 19:08:42,170 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:08:42,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 678 treesize of output 714 [2021-11-25 19:08:42,213 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:08:42,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 606 treesize of output 648 [2021-11-25 19:08:42,259 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:08:42,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 552 treesize of output 540 [2021-11-25 19:09:24,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:09:24,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114482913] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:09:24,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2036937387] [2021-11-25 19:09:24,314 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 19:09:24,328 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:09:24,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 34 [2021-11-25 19:09:24,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724250062] [2021-11-25 19:09:24,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:09:24,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-11-25 19:09:24,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:09:24,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-25 19:09:24,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1114, Unknown=4, NotChecked=0, Total=1260 [2021-11-25 19:09:24,331 INFO L87 Difference]: Start difference. First operand 188 states and 391 transitions. Second operand has 36 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 35 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:09:30,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:09:30,764 INFO L93 Difference]: Finished difference Result 284 states and 636 transitions. [2021-11-25 19:09:30,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-25 19:09:30,764 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 35 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-25 19:09:30,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:09:30,767 INFO L225 Difference]: With dead ends: 284 [2021-11-25 19:09:30,767 INFO L226 Difference]: Without dead ends: 272 [2021-11-25 19:09:30,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 887 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=650, Invalid=4037, Unknown=5, NotChecked=0, Total=4692 [2021-11-25 19:09:30,769 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 175 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 367 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 19:09:30,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 0 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 661 Invalid, 0 Unknown, 367 Unchecked, 0.7s Time] [2021-11-25 19:09:30,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-11-25 19:09:30,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 204. [2021-11-25 19:09:30,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 2.1822660098522166) internal successors, (443), 203 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-25 19:09:30,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 443 transitions. [2021-11-25 19:09:30,779 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 443 transitions. Word has length 19 [2021-11-25 19:09:30,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:09:30,779 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 443 transitions. [2021-11-25 19:09:30,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 35 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:09:30,780 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 443 transitions. [2021-11-25 19:09:30,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 19:09:30,781 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:09:30,781 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:09:30,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-25 19:09:31,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-25 19:09:31,005 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:09:31,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:09:31,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1746392594, now seen corresponding path program 11 times [2021-11-25 19:09:31,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:09:31,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142455082] [2021-11-25 19:09:31,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:09:31,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:09:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:09:31,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:09:31,914 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:09:31,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142455082] [2021-11-25 19:09:31,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142455082] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:09:31,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741887025] [2021-11-25 19:09:31,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:09:31,915 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:09:31,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:09:31,915 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:09:31,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-25 19:09:32,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 19:09:32,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:09:32,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-25 19:09:32,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:09:32,369 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:09:32,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2021-11-25 19:09:32,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:09:32,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:09:32,874 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:09:32,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 138 [2021-11-25 19:09:33,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:09:33,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741887025] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:09:33,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1160391619] [2021-11-25 19:09:33,213 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 19:09:33,213 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:09:33,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 31 [2021-11-25 19:09:33,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997680007] [2021-11-25 19:09:33,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:09:33,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-25 19:09:33,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:09:33,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-25 19:09:33,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2021-11-25 19:09:33,216 INFO L87 Difference]: Start difference. First operand 204 states and 443 transitions. Second operand has 33 states, 32 states have (on average 1.65625) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:09:35,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:09:35,431 INFO L93 Difference]: Finished difference Result 311 states and 693 transitions. [2021-11-25 19:09:35,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-11-25 19:09:35,432 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.65625) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-25 19:09:35,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:09:35,434 INFO L225 Difference]: With dead ends: 311 [2021-11-25 19:09:35,434 INFO L226 Difference]: Without dead ends: 301 [2021-11-25 19:09:35,436 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=425, Invalid=3235, Unknown=0, NotChecked=0, Total=3660 [2021-11-25 19:09:35,436 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 150 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 257 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:09:35,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 0 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 787 Invalid, 0 Unknown, 257 Unchecked, 0.5s Time] [2021-11-25 19:09:35,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-11-25 19:09:35,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 224. [2021-11-25 19:09:35,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 2.2376681614349776) internal successors, (499), 223 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:09:35,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 499 transitions. [2021-11-25 19:09:35,446 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 499 transitions. Word has length 19 [2021-11-25 19:09:35,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:09:35,447 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 499 transitions. [2021-11-25 19:09:35,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.65625) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:09:35,447 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 499 transitions. [2021-11-25 19:09:35,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 19:09:35,448 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:09:35,448 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:09:35,478 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-11-25 19:09:35,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:09:35,665 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:09:35,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:09:35,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1644680354, now seen corresponding path program 12 times [2021-11-25 19:09:35,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:09:35,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781998973] [2021-11-25 19:09:35,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:09:35,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:09:35,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:09:36,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:09:36,594 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:09:36,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781998973] [2021-11-25 19:09:36,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781998973] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:09:36,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278133788] [2021-11-25 19:09:36,594 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:09:36,594 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:09:36,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:09:36,595 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:09:36,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-25 19:09:36,699 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:09:36,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:09:36,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 69 conjunts are in the unsatisfiable core [2021-11-25 19:09:36,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:09:36,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:36,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:36,744 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 19:09:36,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2021-11-25 19:09:36,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-25 19:09:36,902 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:09:36,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-25 19:09:36,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 19:09:37,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 19:09:37,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 19:09:37,529 INFO L354 Elim1Store]: treesize reduction 50, result has 5.7 percent of original size [2021-11-25 19:09:37,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 20 [2021-11-25 19:09:37,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:09:37,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:09:39,104 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:09:39,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 153 [2021-11-25 19:09:39,162 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:09:39,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 28588 treesize of output 26676 [2021-11-25 19:09:39,318 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:09:39,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 26580 treesize of output 25224 [2021-11-25 19:09:39,485 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:09:39,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 25140 treesize of output 22344 [2021-11-25 19:09:39,679 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:09:39,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 22260 treesize of output 16584 [2021-11-25 19:09:39,833 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-25 19:09:39,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1397643886] [2021-11-25 19:09:39,833 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 19:09:39,834 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-25 19:09:39,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2021-11-25 19:09:39,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403661173] [2021-11-25 19:09:39,834 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-25 19:09:39,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-25 19:09:39,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:09:39,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-25 19:09:39,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=952, Unknown=2, NotChecked=0, Total=1122 [2021-11-25 19:09:39,835 INFO L87 Difference]: Start difference. First operand 224 states and 499 transitions. Second operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:09:40,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:09:40,621 INFO L93 Difference]: Finished difference Result 250 states and 550 transitions. [2021-11-25 19:09:40,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-25 19:09:40,622 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-25 19:09:40,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:09:40,625 INFO L225 Difference]: With dead ends: 250 [2021-11-25 19:09:40,625 INFO L226 Difference]: Without dead ends: 246 [2021-11-25 19:09:40,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=207, Invalid=1197, Unknown=2, NotChecked=0, Total=1406 [2021-11-25 19:09:40,631 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:09:40,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 19:09:40,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-11-25 19:09:40,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 228. [2021-11-25 19:09:40,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 2.2290748898678414) internal successors, (506), 227 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:09:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 506 transitions. [2021-11-25 19:09:40,643 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 506 transitions. Word has length 19 [2021-11-25 19:09:40,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:09:40,644 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 506 transitions. [2021-11-25 19:09:40,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:09:40,644 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 506 transitions. [2021-11-25 19:09:40,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 19:09:40,646 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:09:40,646 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:09:40,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-25 19:09:40,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-25 19:09:40,873 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:09:40,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:09:40,874 INFO L85 PathProgramCache]: Analyzing trace with hash 608724170, now seen corresponding path program 13 times [2021-11-25 19:09:40,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:09:40,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493070939] [2021-11-25 19:09:40,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:09:40,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:09:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:09:41,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:09:41,978 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:09:41,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493070939] [2021-11-25 19:09:41,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493070939] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:09:41,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382784881] [2021-11-25 19:09:41,979 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:09:41,979 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:09:41,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:09:41,980 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:09:41,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-25 19:09:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:09:42,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 68 conjunts are in the unsatisfiable core [2021-11-25 19:09:42,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:09:42,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:42,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:09:42,123 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-25 19:09:42,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2021-11-25 19:09:42,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-25 19:09:42,301 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:09:42,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-25 19:09:42,373 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 19:09:42,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 19:09:42,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 19:09:42,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 20 [2021-11-25 19:09:43,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:09:43,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:09:44,248 INFO L354 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2021-11-25 19:09:44,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 298 treesize of output 140 [2021-11-25 19:09:44,315 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:09:44,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 902 treesize of output 972 [2021-11-25 19:09:44,366 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:09:44,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 792 treesize of output 756 [2021-11-25 19:09:44,427 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:09:44,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 672 treesize of output 696 [2021-11-25 19:10:12,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:10:12,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382784881] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:10:12,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [206353048] [2021-11-25 19:10:12,744 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 19:10:12,745 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:10:12,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 34 [2021-11-25 19:10:12,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907679274] [2021-11-25 19:10:12,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:10:12,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-11-25 19:10:12,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:10:12,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-25 19:10:12,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1099, Unknown=3, NotChecked=0, Total=1260 [2021-11-25 19:10:12,747 INFO L87 Difference]: Start difference. First operand 228 states and 506 transitions. Second operand has 36 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 35 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:10:18,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:10:18,482 INFO L93 Difference]: Finished difference Result 476 states and 1071 transitions. [2021-11-25 19:10:18,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-11-25 19:10:18,483 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 35 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-25 19:10:18,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:10:18,486 INFO L225 Difference]: With dead ends: 476 [2021-11-25 19:10:18,486 INFO L226 Difference]: Without dead ends: 451 [2021-11-25 19:10:18,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=744, Invalid=5259, Unknown=3, NotChecked=0, Total=6006 [2021-11-25 19:10:18,489 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 215 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 799 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:10:18,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 0 Invalid, 2182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1286 Invalid, 0 Unknown, 799 Unchecked, 1.0s Time] [2021-11-25 19:10:18,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2021-11-25 19:10:18,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 263. [2021-11-25 19:10:18,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 2.3893129770992365) internal successors, (626), 262 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:10:18,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 626 transitions. [2021-11-25 19:10:18,501 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 626 transitions. Word has length 19 [2021-11-25 19:10:18,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:10:18,501 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 626 transitions. [2021-11-25 19:10:18,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 35 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:10:18,501 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 626 transitions. [2021-11-25 19:10:18,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 19:10:18,503 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:10:18,503 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:10:18,530 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-25 19:10:18,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:10:18,715 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:10:18,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:10:18,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1979139520, now seen corresponding path program 14 times [2021-11-25 19:10:18,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:10:18,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914911121] [2021-11-25 19:10:18,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:10:18,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:10:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:10:19,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:10:19,482 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:10:19,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914911121] [2021-11-25 19:10:19,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914911121] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:10:19,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752197884] [2021-11-25 19:10:19,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:10:19,483 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:10:19,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:10:19,483 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:10:19,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-25 19:10:19,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 19:10:19,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:10:19,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 55 conjunts are in the unsatisfiable core [2021-11-25 19:10:19,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:10:20,178 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:10:20,180 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-25 19:10:20,181 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 20 [2021-11-25 19:10:20,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:10:20,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:10:20,650 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:10:20,650 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 138 [2021-11-25 19:10:21,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:10:21,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752197884] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:10:21,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1928816505] [2021-11-25 19:10:21,299 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 19:10:21,299 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:10:21,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 33 [2021-11-25 19:10:21,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559502461] [2021-11-25 19:10:21,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:10:21,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-11-25 19:10:21,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:10:21,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-11-25 19:10:21,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1036, Unknown=0, NotChecked=0, Total=1190 [2021-11-25 19:10:21,301 INFO L87 Difference]: Start difference. First operand 263 states and 626 transitions. Second operand has 35 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 34 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:10:23,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:10:23,715 INFO L93 Difference]: Finished difference Result 311 states and 714 transitions. [2021-11-25 19:10:23,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-25 19:10:23,715 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 34 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-25 19:10:23,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:10:23,717 INFO L225 Difference]: With dead ends: 311 [2021-11-25 19:10:23,717 INFO L226 Difference]: Without dead ends: 302 [2021-11-25 19:10:23,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=514, Invalid=2908, Unknown=0, NotChecked=0, Total=3422 [2021-11-25 19:10:23,719 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 164 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:10:23,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 0 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 572 Invalid, 0 Unknown, 150 Unchecked, 0.4s Time] [2021-11-25 19:10:23,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-11-25 19:10:23,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 264. [2021-11-25 19:10:23,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 2.3916349809885933) internal successors, (629), 263 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:10:23,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 629 transitions. [2021-11-25 19:10:23,731 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 629 transitions. Word has length 19 [2021-11-25 19:10:23,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:10:23,731 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 629 transitions. [2021-11-25 19:10:23,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 34 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:10:23,732 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 629 transitions. [2021-11-25 19:10:23,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 19:10:23,733 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:10:23,734 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:10:23,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-25 19:10:23,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:10:23,952 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:10:23,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:10:23,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1075216467, now seen corresponding path program 15 times [2021-11-25 19:10:23,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:10:23,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820268833] [2021-11-25 19:10:23,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:10:23,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:10:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:10:24,929 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:10:24,929 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:10:24,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820268833] [2021-11-25 19:10:24,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820268833] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:10:24,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717061522] [2021-11-25 19:10:24,929 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:10:24,930 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:10:24,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:10:24,930 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:10:24,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-25 19:10:25,027 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:10:25,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:10:25,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 48 conjunts are in the unsatisfiable core [2021-11-25 19:10:25,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:10:25,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:10:25,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:10:25,511 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:10:25,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 38 [2021-11-25 19:10:25,600 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:10:25,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:10:26,009 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:10:26,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 240 treesize of output 276 [2021-11-25 19:10:26,033 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:10:26,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 164 [2021-11-25 19:10:27,727 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 19:10:27,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717061522] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:10:27,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [91410923] [2021-11-25 19:10:27,728 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 19:10:27,728 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:10:27,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 33 [2021-11-25 19:10:27,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787948649] [2021-11-25 19:10:27,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:10:27,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-11-25 19:10:27,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:10:27,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-11-25 19:10:27,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1076, Unknown=1, NotChecked=0, Total=1190 [2021-11-25 19:10:27,730 INFO L87 Difference]: Start difference. First operand 264 states and 629 transitions. Second operand has 35 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 34 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:10:35,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:10:35,097 INFO L93 Difference]: Finished difference Result 585 states and 1394 transitions. [2021-11-25 19:10:35,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-11-25 19:10:35,098 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 34 states have internal predecessors, (55), 0 states have call successors, (0), 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 20 [2021-11-25 19:10:35,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:10:35,101 INFO L225 Difference]: With dead ends: 585 [2021-11-25 19:10:35,102 INFO L226 Difference]: Without dead ends: 565 [2021-11-25 19:10:35,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1507 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=944, Invalid=5489, Unknown=47, NotChecked=0, Total=6480 [2021-11-25 19:10:35,103 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 465 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 679 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:10:35,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [465 Valid, 0 Invalid, 2247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1262 Invalid, 0 Unknown, 679 Unchecked, 1.1s Time] [2021-11-25 19:10:35,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2021-11-25 19:10:35,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 275. [2021-11-25 19:10:35,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 2.408759124087591) internal successors, (660), 274 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:10:35,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 660 transitions. [2021-11-25 19:10:35,116 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 660 transitions. Word has length 20 [2021-11-25 19:10:35,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:10:35,116 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 660 transitions. [2021-11-25 19:10:35,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 34 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:10:35,116 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 660 transitions. [2021-11-25 19:10:35,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 19:10:35,117 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:10:35,118 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:10:35,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-25 19:10:35,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-11-25 19:10:35,333 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:10:35,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:10:35,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1516867919, now seen corresponding path program 16 times [2021-11-25 19:10:35,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:10:35,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171697672] [2021-11-25 19:10:35,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:10:35,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:10:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:10:36,666 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:10:36,666 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:10:36,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171697672] [2021-11-25 19:10:36,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171697672] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:10:36,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608017086] [2021-11-25 19:10:36,667 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:10:36,667 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:10:36,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:10:36,667 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:10:36,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-25 19:10:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:10:36,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-25 19:10:36,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:10:37,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:10:37,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-11-25 19:10:37,366 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:10:37,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 40 [2021-11-25 19:10:37,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:10:37,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:10:38,030 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:10:38,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 236 [2021-11-25 19:10:38,054 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:10:38,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 142 [2021-11-25 19:10:40,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 19:10:40,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608017086] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:10:40,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [460860632] [2021-11-25 19:10:40,713 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 19:10:40,713 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:10:40,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 34 [2021-11-25 19:10:40,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709910588] [2021-11-25 19:10:40,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:10:40,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-11-25 19:10:40,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:10:40,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-25 19:10:40,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1153, Unknown=4, NotChecked=0, Total=1260 [2021-11-25 19:10:40,714 INFO L87 Difference]: Start difference. First operand 275 states and 660 transitions. Second operand has 36 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 35 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:10:45,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:10:45,372 INFO L93 Difference]: Finished difference Result 409 states and 950 transitions. [2021-11-25 19:10:45,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-25 19:10:45,373 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 35 states have internal predecessors, (55), 0 states have call successors, (0), 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 20 [2021-11-25 19:10:45,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:10:45,375 INFO L225 Difference]: With dead ends: 409 [2021-11-25 19:10:45,375 INFO L226 Difference]: Without dead ends: 393 [2021-11-25 19:10:45,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=516, Invalid=3885, Unknown=21, NotChecked=0, Total=4422 [2021-11-25 19:10:45,376 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 193 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 271 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:10:45,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 0 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1297 Invalid, 0 Unknown, 271 Unchecked, 1.0s Time] [2021-11-25 19:10:45,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2021-11-25 19:10:45,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 273. [2021-11-25 19:10:45,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 272 states have (on average 2.4080882352941178) internal successors, (655), 272 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:10:45,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 655 transitions. [2021-11-25 19:10:45,387 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 655 transitions. Word has length 20 [2021-11-25 19:10:45,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:10:45,387 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 655 transitions. [2021-11-25 19:10:45,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 35 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:10:45,388 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 655 transitions. [2021-11-25 19:10:45,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 19:10:45,389 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:10:45,389 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:10:45,436 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-25 19:10:45,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-25 19:10:45,603 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:10:45,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:10:45,604 INFO L85 PathProgramCache]: Analyzing trace with hash -112880217, now seen corresponding path program 17 times [2021-11-25 19:10:45,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:10:45,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460793518] [2021-11-25 19:10:45,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:10:45,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:10:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:10:45,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 19:10:45,655 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:10:45,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460793518] [2021-11-25 19:10:45,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460793518] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:10:45,656 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:10:45,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 19:10:45,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045595140] [2021-11-25 19:10:45,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:10:45,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:10:45,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:10:45,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:10:45,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:10:45,659 INFO L87 Difference]: Start difference. First operand 273 states and 655 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:10:45,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:10:45,694 INFO L93 Difference]: Finished difference Result 269 states and 639 transitions. [2021-11-25 19:10:45,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:10:45,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-25 19:10:45,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:10:45,697 INFO L225 Difference]: With dead ends: 269 [2021-11-25 19:10:45,697 INFO L226 Difference]: Without dead ends: 269 [2021-11-25 19:10:45,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:10:45,698 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:10:45,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 19:10:45,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-11-25 19:10:45,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2021-11-25 19:10:45,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 2.3843283582089554) internal successors, (639), 268 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:10:45,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 639 transitions. [2021-11-25 19:10:45,707 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 639 transitions. Word has length 20 [2021-11-25 19:10:45,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:10:45,707 INFO L470 AbstractCegarLoop]: Abstraction has 269 states and 639 transitions. [2021-11-25 19:10:45,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:10:45,708 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 639 transitions. [2021-11-25 19:10:45,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 19:10:45,709 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:10:45,709 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:10:45,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-25 19:10:45,709 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:10:45,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:10:45,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1860102785, now seen corresponding path program 18 times [2021-11-25 19:10:45,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:10:45,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560906915] [2021-11-25 19:10:45,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:10:45,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:10:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:10:46,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:10:46,974 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:10:46,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560906915] [2021-11-25 19:10:46,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560906915] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:10:46,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607739596] [2021-11-25 19:10:46,974 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:10:46,974 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:10:46,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:10:46,975 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:10:46,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-25 19:10:47,078 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:10:47,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:10:47,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 74 conjunts are in the unsatisfiable core [2021-11-25 19:10:47,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:10:47,110 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-11-25 19:10:47,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2021-11-25 19:10:47,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:10:47,259 INFO L354 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2021-11-25 19:10:47,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 14 [2021-11-25 19:10:47,326 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-25 19:10:47,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 19:10:47,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:10:47,756 INFO L354 Elim1Store]: treesize reduction 34, result has 42.4 percent of original size [2021-11-25 19:10:47,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 41 [2021-11-25 19:10:47,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:10:47,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:10:48,930 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:10:48,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 135 [2021-11-25 19:10:49,005 INFO L354 Elim1Store]: treesize reduction 12, result has 89.0 percent of original size [2021-11-25 19:10:49,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 925 treesize of output 845 [2021-11-25 19:10:49,035 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:10:49,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 749 treesize of output 629 [2021-11-25 19:10:49,084 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:10:49,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 556 treesize of output 520 [2021-11-25 19:11:00,837 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:11:00,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 135 [2021-11-25 19:11:00,841 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:11:00,884 INFO L354 Elim1Store]: treesize reduction 63, result has 42.2 percent of original size [2021-11-25 19:11:00,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1161 treesize of output 950 [2021-11-25 19:11:00,903 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:11:00,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 832 treesize of output 688 [2021-11-25 19:11:00,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:11:00,917 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 19:11:00,930 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:11:00,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 730 treesize of output 552 [2021-11-25 19:13:58,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:13:58,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607739596] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:13:58,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [12776277] [2021-11-25 19:13:58,026 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 19:13:58,027 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:13:58,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2021-11-25 19:13:58,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037938509] [2021-11-25 19:13:58,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:13:58,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-25 19:13:58,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:13:58,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-25 19:13:58,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1309, Unknown=4, NotChecked=0, Total=1482 [2021-11-25 19:13:58,029 INFO L87 Difference]: Start difference. First operand 269 states and 639 transitions. Second operand has 39 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:13:59,079 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~q1_front~0 0))) (and (< c_~j~0 (+ c_~i~0 1)) (or (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ c_~q1_back~0 1) c_~q1_front~0) .cse0 (<= c_~n2~0 c_~q2_back~0) (<= c_~n1~0 c_~q1_back~0) (and (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_864 (Array Int Int)) (~q1~0.base Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_864))) (let ((.cse6 (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_865))) (let ((.cse7 (select .cse6 ~q1~0.base))) (let ((.cse2 (select .cse7 (+ (* c_~q1_back~0 4) c_~q1~0.offset))) (.cse1 (select .cse7 (+ c_~q1~0.offset (* c_~q1_front~0 4)))) (.cse3 (+ (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= .cse1 .cse2) (<= .cse3 .cse2) (<= .cse1 .cse4) (<= .cse3 .cse4))))))) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_864 (Array Int Int)) (~q1~0.base Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_864))) (let ((.cse14 (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_865))) (let ((.cse13 (select .cse14 ~q1~0.base))) (let ((.cse10 (select (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse9 (select .cse13 (+ (* c_~q1_back~0 4) c_~q1~0.offset))) (.cse8 (+ (select .cse13 (+ c_~q1~0.offset (* c_~q1_front~0 4))) 1)) (.cse11 (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= .cse8 .cse9) (<= .cse10 .cse11) (<= .cse10 .cse9) (<= .cse8 .cse11)))))))) (< c_~q2_back~0 0)) (or (let ((.cse15 (+ 1 (select (select |c_#memory_int| c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))))) (.cse16 (select (select |c_#memory_int| c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))) (and (or (<= .cse15 c_~N~0) (< (+ .cse16 1) c_~N~0)) (or (< .cse15 c_~N~0) (< .cse16 c_~N~0)))) (<= c_~q1_back~0 c_~q1_front~0) .cse0 (<= c_~n1~0 c_~q1_front~0)) (<= c_~i~0 c_~j~0))) is different from false [2021-11-25 19:14:00,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:14:00,954 INFO L93 Difference]: Finished difference Result 478 states and 1099 transitions. [2021-11-25 19:14:00,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-11-25 19:14:00,955 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 states have internal predecessors, (52), 0 states have call successors, (0), 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 20 [2021-11-25 19:14:00,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:14:00,957 INFO L225 Difference]: With dead ends: 478 [2021-11-25 19:14:00,957 INFO L226 Difference]: Without dead ends: 468 [2021-11-25 19:14:00,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=547, Invalid=3347, Unknown=16, NotChecked=122, Total=4032 [2021-11-25 19:14:00,958 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 147 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 740 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-25 19:14:00,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 0 Invalid, 1568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 764 Invalid, 0 Unknown, 740 Unchecked, 0.5s Time] [2021-11-25 19:14:00,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-11-25 19:14:00,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 302. [2021-11-25 19:14:00,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 2.338870431893688) internal successors, (704), 301 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:00,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 704 transitions. [2021-11-25 19:14:00,970 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 704 transitions. Word has length 20 [2021-11-25 19:14:00,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:14:00,970 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 704 transitions. [2021-11-25 19:14:00,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:14:00,970 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 704 transitions. [2021-11-25 19:14:00,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 19:14:00,972 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:14:00,972 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:14:01,012 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-11-25 19:14:01,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:14:01,192 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:14:01,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:14:01,193 INFO L85 PathProgramCache]: Analyzing trace with hash -671139279, now seen corresponding path program 19 times [2021-11-25 19:14:01,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:14:01,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676495184] [2021-11-25 19:14:01,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:14:01,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:14:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:14:02,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:14:02,675 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:14:02,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676495184] [2021-11-25 19:14:02,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676495184] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:14:02,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301334346] [2021-11-25 19:14:02,675 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:14:02,675 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:14:02,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:14:02,676 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:14:02,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-25 19:14:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:14:02,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 47 conjunts are in the unsatisfiable core [2021-11-25 19:14:02,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:14:02,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-25 19:14:02,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 19:14:03,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:14:03,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-11-25 19:14:03,313 INFO L354 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2021-11-25 19:14:03,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 20 [2021-11-25 19:14:03,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 19:14:03,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:14:03,794 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q1~0.offset Int) (v_ArrVal_911 (Array Int Int)) (~q1~0.base Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_911))) (let ((.cse2 (select .cse3 ~q1~0.base))) (or (let ((.cse0 (select (select .cse3 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (.cse1 (+ (select .cse2 (+ ~q1~0.offset (* c_~q1_front~0 4))) 1))) (and (or (< .cse0 c_~N~0) (< .cse1 c_~N~0)) (or (< (+ .cse0 1) c_~N~0) (<= .cse1 c_~N~0)))) (not (= c_~j~0 (select .cse2 (+ (* c_~q1_back~0 4) ~q1~0.offset)))))))) is different from false [2021-11-25 19:14:04,384 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:14:04,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 181 treesize of output 121 [2021-11-25 19:14:04,421 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:14:04,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 392 treesize of output 452 [2021-11-25 19:14:04,448 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:14:04,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 320 treesize of output 308 [2021-11-25 19:14:04,490 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:14:04,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 284 treesize of output 344 [2021-11-25 19:15:42,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 19:15:42,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301334346] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:15:42,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [299840357] [2021-11-25 19:15:42,418 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 19:15:42,418 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:15:42,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 34 [2021-11-25 19:15:42,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246596398] [2021-11-25 19:15:42,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:15:42,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-11-25 19:15:42,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:15:42,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-25 19:15:42,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1084, Unknown=1, NotChecked=66, Total=1260 [2021-11-25 19:15:42,420 INFO L87 Difference]: Start difference. First operand 302 states and 704 transitions. Second operand has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:46,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:15:46,746 INFO L93 Difference]: Finished difference Result 458 states and 1056 transitions. [2021-11-25 19:15:46,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-25 19:15:46,747 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 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 20 [2021-11-25 19:15:46,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:15:46,749 INFO L225 Difference]: With dead ends: 458 [2021-11-25 19:15:46,749 INFO L226 Difference]: Without dead ends: 448 [2021-11-25 19:15:46,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=480, Invalid=3428, Unknown=2, NotChecked=122, Total=4032 [2021-11-25 19:15:46,750 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 142 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 465 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:15:46,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 0 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 633 Invalid, 0 Unknown, 465 Unchecked, 0.6s Time] [2021-11-25 19:15:46,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-11-25 19:15:46,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 325. [2021-11-25 19:15:46,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 2.330246913580247) internal successors, (755), 324 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:46,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 755 transitions. [2021-11-25 19:15:46,762 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 755 transitions. Word has length 20 [2021-11-25 19:15:46,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:15:46,763 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 755 transitions. [2021-11-25 19:15:46,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:46,763 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 755 transitions. [2021-11-25 19:15:46,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 19:15:46,764 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:15:46,765 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:15:46,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-11-25 19:15:46,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-11-25 19:15:46,980 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:15:46,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:15:46,980 INFO L85 PathProgramCache]: Analyzing trace with hash 668435887, now seen corresponding path program 20 times [2021-11-25 19:15:46,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:15:46,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425005396] [2021-11-25 19:15:46,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:15:46,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:15:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:15:48,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:15:48,311 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:15:48,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425005396] [2021-11-25 19:15:48,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425005396] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:15:48,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847041953] [2021-11-25 19:15:48,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:15:48,311 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:15:48,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:15:48,312 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:15:48,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-25 19:15:48,433 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 19:15:48,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:15:48,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-25 19:15:48,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:15:48,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:15:48,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 19:15:48,827 INFO L354 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2021-11-25 19:15:48,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 17 [2021-11-25 19:15:48,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 19:15:48,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:15:49,241 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q1~0.offset Int) (v_ArrVal_954 (Array Int Int)) (~q1~0.base Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_954))) (let ((.cse3 (select .cse4 ~q1~0.base))) (or (let ((.cse0 (select (select .cse4 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))) (let ((.cse1 (+ (select .cse3 (+ ~q1~0.offset (* c_~q1_front~0 4))) 1)) (.cse2 (< (+ .cse0 1) c_~N~0))) (and (or (< .cse0 .cse1) .cse2) (or (<= .cse1 c_~N~0) .cse2)))) (not (= c_~j~0 (select .cse3 (+ (* c_~q1_back~0 4) ~q1~0.offset)))))))) is different from false [2021-11-25 19:15:49,289 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:15:49,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 252 treesize of output 288 [2021-11-25 19:15:49,313 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:15:49,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 176 treesize of output 176 [2021-11-25 19:15:50,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 19:15:50,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847041953] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:15:50,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [592995529] [2021-11-25 19:15:50,998 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 19:15:50,999 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:15:51,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 30 [2021-11-25 19:15:51,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101776871] [2021-11-25 19:15:51,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:15:51,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-25 19:15:51,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:15:51,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-25 19:15:51,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=835, Unknown=1, NotChecked=58, Total=992 [2021-11-25 19:15:51,001 INFO L87 Difference]: Start difference. First operand 325 states and 755 transitions. Second operand has 32 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:52,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:15:52,994 INFO L93 Difference]: Finished difference Result 461 states and 1111 transitions. [2021-11-25 19:15:53,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-25 19:15:53,000 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 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 20 [2021-11-25 19:15:53,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:15:53,003 INFO L225 Difference]: With dead ends: 461 [2021-11-25 19:15:53,003 INFO L226 Difference]: Without dead ends: 451 [2021-11-25 19:15:53,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=343, Invalid=2312, Unknown=1, NotChecked=100, Total=2756 [2021-11-25 19:15:53,003 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 119 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 19:15:53,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 0 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 757 Invalid, 0 Unknown, 181 Unchecked, 0.6s Time] [2021-11-25 19:15:53,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2021-11-25 19:15:53,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 285. [2021-11-25 19:15:53,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 2.408450704225352) internal successors, (684), 284 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:53,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 684 transitions. [2021-11-25 19:15:53,014 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 684 transitions. Word has length 20 [2021-11-25 19:15:53,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:15:53,015 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 684 transitions. [2021-11-25 19:15:53,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:15:53,015 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 684 transitions. [2021-11-25 19:15:53,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 19:15:53,016 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:15:53,016 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:15:53,052 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-25 19:15:53,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:15:53,238 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:15:53,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:15:53,239 INFO L85 PathProgramCache]: Analyzing trace with hash 626430577, now seen corresponding path program 21 times [2021-11-25 19:15:53,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:15:53,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299512621] [2021-11-25 19:15:53,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:15:53,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:15:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:15:54,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:15:54,448 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:15:54,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299512621] [2021-11-25 19:15:54,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299512621] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:15:54,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060640407] [2021-11-25 19:15:54,448 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 19:15:54,448 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:15:54,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:15:54,450 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:15:54,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-25 19:15:54,553 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 19:15:54,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:15:54,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 63 conjunts are in the unsatisfiable core [2021-11-25 19:15:54,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:15:54,585 INFO L354 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2021-11-25 19:15:54,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 16 [2021-11-25 19:15:54,691 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 19:15:54,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-25 19:15:54,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-11-25 19:15:55,259 INFO L354 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2021-11-25 19:15:55,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 20 [2021-11-25 19:15:55,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:15:55,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:15:56,998 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_1002 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1002))) (let ((.cse0 (select .cse3 ~q1~0.base))) (or (not (= (select .cse0 (+ (* c_~q1_back~0 4) ~q1~0.offset)) c_~j~0)) (let ((.cse2 (select (select .cse3 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (.cse1 (+ (select .cse0 (+ ~q1~0.offset (* c_~q1_front~0 4))) 1))) (and (or (<= .cse1 c_~N~0) (< (+ .cse2 1) c_~N~0)) (or (< .cse2 c_~N~0) (< .cse1 c_~N~0)))))))) is different from false [2021-11-25 19:15:57,056 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:15:57,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 236 [2021-11-25 19:15:57,081 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:15:57,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 142 [2021-11-25 19:16:04,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 19:16:04,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060640407] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:16:04,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [406045142] [2021-11-25 19:16:04,021 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 19:16:04,022 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:16:04,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 35 [2021-11-25 19:16:04,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137726457] [2021-11-25 19:16:04,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:16:04,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-11-25 19:16:04,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:16:04,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-11-25 19:16:04,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1139, Unknown=2, NotChecked=68, Total=1332 [2021-11-25 19:16:04,024 INFO L87 Difference]: Start difference. First operand 285 states and 684 transitions. Second operand has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:08,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:16:08,457 INFO L93 Difference]: Finished difference Result 434 states and 988 transitions. [2021-11-25 19:16:08,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-11-25 19:16:08,458 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 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 20 [2021-11-25 19:16:08,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:16:08,460 INFO L225 Difference]: With dead ends: 434 [2021-11-25 19:16:08,460 INFO L226 Difference]: Without dead ends: 430 [2021-11-25 19:16:08,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=508, Invalid=3647, Unknown=9, NotChecked=126, Total=4290 [2021-11-25 19:16:08,461 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 197 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 428 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-25 19:16:08,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 0 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 801 Invalid, 0 Unknown, 428 Unchecked, 0.7s Time] [2021-11-25 19:16:08,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2021-11-25 19:16:08,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 305. [2021-11-25 19:16:08,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 2.3914473684210527) internal successors, (727), 304 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:08,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 727 transitions. [2021-11-25 19:16:08,474 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 727 transitions. Word has length 20 [2021-11-25 19:16:08,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:16:08,474 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 727 transitions. [2021-11-25 19:16:08,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:16:08,475 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 727 transitions. [2021-11-25 19:16:08,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 19:16:08,476 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:16:08,476 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:16:08,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-25 19:16:08,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-25 19:16:08,689 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-11-25 19:16:08,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:16:08,690 INFO L85 PathProgramCache]: Analyzing trace with hash -568190765, now seen corresponding path program 22 times [2021-11-25 19:16:08,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:16:08,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489248496] [2021-11-25 19:16:08,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:16:08,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:16:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:16:10,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:16:10,342 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:16:10,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489248496] [2021-11-25 19:16:10,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489248496] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:16:10,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247608808] [2021-11-25 19:16:10,342 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 19:16:10,343 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:16:10,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:16:10,343 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:16:10,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5471919-e746-4509-ab65-394ba9ba4df5/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-25 19:16:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:16:10,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 56 conjunts are in the unsatisfiable core [2021-11-25 19:16:10,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:16:10,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 19:16:10,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 19:16:10,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 19:16:10,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-11-25 19:16:11,264 INFO L354 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2021-11-25 19:16:11,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 20 [2021-11-25 19:16:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 19:16:11,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:16:11,836 WARN L838 $PredicateComparison]: unable to prove that (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_1048 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1048))) (let ((.cse3 (select .cse2 ~q1~0.base))) (or (let ((.cse1 (+ (select .cse3 (+ ~q1~0.offset (* c_~q1_front~0 4))) 1)) (.cse0 (select (select .cse2 c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))))) (and (or (< .cse0 c_~N~0) (< .cse1 c_~N~0)) (or (<= .cse1 c_~N~0) (< (+ .cse0 1) c_~N~0)))) (not (= (select .cse3 (+ (* c_~q1_back~0 4) ~q1~0.offset)) c_~j~0)))))) is different from false [2021-11-25 19:16:12,453 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:16:12,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 181 treesize of output 121 [2021-11-25 19:16:12,502 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:16:12,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 556 treesize of output 600 [2021-11-25 19:16:12,538 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:16:12,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 468 treesize of output 432 [2021-11-25 19:16:12,593 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 19:16:12,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 408 treesize of output 456