./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW --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 9d38eb9d6ba70070fe3ced1aec90f1c3400cc1f89786e1bd625a19020cb0869f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 16:11:31,254 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 16:11:31,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 16:11:31,276 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 16:11:31,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 16:11:31,278 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 16:11:31,279 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 16:11:31,281 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 16:11:31,282 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 16:11:31,284 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 16:11:31,285 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 16:11:31,286 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 16:11:31,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 16:11:31,288 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 16:11:31,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 16:11:31,290 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 16:11:31,291 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 16:11:31,292 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 16:11:31,293 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 16:11:31,295 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 16:11:31,297 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 16:11:31,298 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 16:11:31,299 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 16:11:31,300 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 16:11:31,304 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 16:11:31,304 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 16:11:31,305 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 16:11:31,305 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 16:11:31,306 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 16:11:31,307 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 16:11:31,307 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 16:11:31,308 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 16:11:31,309 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 16:11:31,310 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 16:11:31,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 16:11:31,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 16:11:31,312 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 16:11:31,313 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 16:11:31,313 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 16:11:31,314 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 16:11:31,315 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 16:11:31,316 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 16:11:31,341 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 16:11:31,341 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 16:11:31,342 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 16:11:31,342 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 16:11:31,343 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 16:11:31,343 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 16:11:31,343 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 16:11:31,343 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 16:11:31,344 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 16:11:31,344 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 16:11:31,344 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 16:11:31,345 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 16:11:31,345 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 16:11:31,345 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 16:11:31,346 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 16:11:31,346 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 16:11:31,346 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 16:11:31,346 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 16:11:31,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 16:11:31,348 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 16:11:31,348 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 16:11:31,348 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 16:11:31,348 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 16:11:31,349 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 16:11:31,349 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 16:11:31,349 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 16:11:31,350 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 16:11:31,350 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 16:11:31,350 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 16:11:31,350 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 16:11:31,351 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 16:11:31,351 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 16:11:31,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 16:11:31,352 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 16:11:31,352 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 16:11:31,352 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 16:11:31,353 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 16:11:31,353 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 16:11:31,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 16:11:31,353 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 16:11:31,354 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 16:11:31,354 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/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_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW 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 -> 9d38eb9d6ba70070fe3ced1aec90f1c3400cc1f89786e1bd625a19020cb0869f [2022-11-23 16:11:31,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 16:11:31,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 16:11:31,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 16:11:31,609 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 16:11:31,609 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 16:11:31,610 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2022-11-23 16:11:34,730 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 16:11:34,998 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 16:11:34,999 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2022-11-23 16:11:35,006 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/data/059b018bf/853c97bf8729437ca2ac8cc12e4b8dd1/FLAG77e931146 [2022-11-23 16:11:35,031 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/data/059b018bf/853c97bf8729437ca2ac8cc12e4b8dd1 [2022-11-23 16:11:35,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 16:11:35,035 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 16:11:35,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 16:11:35,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 16:11:35,048 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 16:11:35,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:11:35" (1/1) ... [2022-11-23 16:11:35,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c0bbc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:11:35, skipping insertion in model container [2022-11-23 16:11:35,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:11:35" (1/1) ... [2022-11-23 16:11:35,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 16:11:35,090 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 16:11:35,262 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c[2533,2546] [2022-11-23 16:11:35,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 16:11:35,281 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 16:11:35,302 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c[2533,2546] [2022-11-23 16:11:35,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 16:11:35,322 INFO L208 MainTranslator]: Completed translation [2022-11-23 16:11:35,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:11:35 WrapperNode [2022-11-23 16:11:35,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 16:11:35,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 16:11:35,324 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 16:11:35,324 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 16:11:35,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:11:35" (1/1) ... [2022-11-23 16:11:35,346 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:11:35" (1/1) ... [2022-11-23 16:11:35,378 INFO L138 Inliner]: procedures = 25, calls = 46, calls flagged for inlining = 13, calls inlined = 19, statements flattened = 225 [2022-11-23 16:11:35,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 16:11:35,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 16:11:35,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 16:11:35,380 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 16:11:35,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:11:35" (1/1) ... [2022-11-23 16:11:35,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:11:35" (1/1) ... [2022-11-23 16:11:35,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:11:35" (1/1) ... [2022-11-23 16:11:35,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:11:35" (1/1) ... [2022-11-23 16:11:35,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:11:35" (1/1) ... [2022-11-23 16:11:35,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:11:35" (1/1) ... [2022-11-23 16:11:35,417 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:11:35" (1/1) ... [2022-11-23 16:11:35,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:11:35" (1/1) ... [2022-11-23 16:11:35,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 16:11:35,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 16:11:35,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 16:11:35,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 16:11:35,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:11:35" (1/1) ... [2022-11-23 16:11:35,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 16:11:35,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:11:35,467 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 16:11:35,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 16:11:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 16:11:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 16:11:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 16:11:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 16:11:35,507 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-23 16:11:35,508 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-23 16:11:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-23 16:11:35,508 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-23 16:11:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-23 16:11:35,508 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-23 16:11:35,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 16:11:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 16:11:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 16:11:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 16:11:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 16:11:35,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 16:11:35,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 16:11:35,511 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 16:11:35,646 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 16:11:35,648 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 16:11:36,161 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 16:11:36,368 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 16:11:36,368 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-23 16:11:36,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:11:36 BoogieIcfgContainer [2022-11-23 16:11:36,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 16:11:36,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 16:11:36,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 16:11:36,379 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 16:11:36,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:11:35" (1/3) ... [2022-11-23 16:11:36,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a65a746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:11:36, skipping insertion in model container [2022-11-23 16:11:36,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:11:35" (2/3) ... [2022-11-23 16:11:36,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a65a746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:11:36, skipping insertion in model container [2022-11-23 16:11:36,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:11:36" (3/3) ... [2022-11-23 16:11:36,384 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2022-11-23 16:11:36,392 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 16:11:36,401 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 16:11:36,401 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 16:11:36,402 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 16:11:36,516 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-23 16:11:36,552 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 16:11:36,567 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 219 places, 227 transitions, 478 flow [2022-11-23 16:11:36,570 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 219 places, 227 transitions, 478 flow [2022-11-23 16:11:36,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 219 places, 227 transitions, 478 flow [2022-11-23 16:11:36,714 INFO L130 PetriNetUnfolder]: 18/224 cut-off events. [2022-11-23 16:11:36,715 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-23 16:11:36,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 224 events. 18/224 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 327 event pairs, 0 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 186. Up to 2 conditions per place. [2022-11-23 16:11:36,749 INFO L119 LiptonReduction]: Number of co-enabled transitions 8736 [2022-11-23 16:11:45,523 INFO L134 LiptonReduction]: Checked pairs total: 8985 [2022-11-23 16:11:45,523 INFO L136 LiptonReduction]: Total number of compositions: 249 [2022-11-23 16:11:45,533 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 31 transitions, 86 flow [2022-11-23 16:11:45,567 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 171 states, 170 states have (on average 3.388235294117647) internal successors, (576), 170 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:11:45,587 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 16:11:45,593 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@f43ebf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 16:11:45,593 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-23 16:11:45,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 170 states have (on average 3.388235294117647) internal successors, (576), 170 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:11:45,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 16:11:45,606 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:11:45,607 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:11:45,608 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-23 16:11:45,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:11:45,613 INFO L85 PathProgramCache]: Analyzing trace with hash -2060047069, now seen corresponding path program 1 times [2022-11-23 16:11:45,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:11:45,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678162448] [2022-11-23 16:11:45,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:11:45,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:11:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:11:46,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:11:46,415 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:11:46,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678162448] [2022-11-23 16:11:46,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678162448] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:11:46,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:11:46,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 16:11:46,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153089378] [2022-11-23 16:11:46,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:11:46,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 16:11:46,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:11:46,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 16:11:46,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 16:11:46,448 INFO L87 Difference]: Start difference. First operand has 171 states, 170 states have (on average 3.388235294117647) internal successors, (576), 170 states have internal predecessors, (576), 0 states have call successors, (0), 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 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:11:46,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:11:46,731 INFO L93 Difference]: Finished difference Result 425 states and 1355 transitions. [2022-11-23 16:11:46,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 16:11:46,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 [2022-11-23 16:11:46,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:11:46,748 INFO L225 Difference]: With dead ends: 425 [2022-11-23 16:11:46,748 INFO L226 Difference]: Without dead ends: 425 [2022-11-23 16:11:46,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-23 16:11:46,753 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 81 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 16:11:46,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 10 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 16:11:46,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-11-23 16:11:46,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 213. [2022-11-23 16:11:46,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 3.19811320754717) internal successors, (678), 212 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:11:46,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 678 transitions. [2022-11-23 16:11:46,816 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 678 transitions. Word has length 20 [2022-11-23 16:11:46,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:11:46,817 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 678 transitions. [2022-11-23 16:11:46,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:11:46,818 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 678 transitions. [2022-11-23 16:11:46,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-23 16:11:46,820 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:11:46,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:11:46,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 16:11:46,821 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-23 16:11:46,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:11:46,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1767274735, now seen corresponding path program 1 times [2022-11-23 16:11:46,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:11:46,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225770425] [2022-11-23 16:11:46,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:11:46,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:11:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:11:47,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:11:47,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:11:47,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225770425] [2022-11-23 16:11:47,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225770425] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:11:47,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:11:47,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 16:11:47,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741322888] [2022-11-23 16:11:47,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:11:47,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 16:11:47,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:11:47,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 16:11:47,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 16:11:47,110 INFO L87 Difference]: Start difference. First operand 213 states and 678 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:11:47,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:11:47,214 INFO L93 Difference]: Finished difference Result 214 states and 679 transitions. [2022-11-23 16:11:47,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 16:11:47,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-23 16:11:47,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:11:47,217 INFO L225 Difference]: With dead ends: 214 [2022-11-23 16:11:47,217 INFO L226 Difference]: Without dead ends: 214 [2022-11-23 16:11:47,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 16:11:47,219 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:11:47,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 11 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:11:47,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-11-23 16:11:47,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2022-11-23 16:11:47,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 3.187793427230047) internal successors, (679), 213 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:11:47,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 679 transitions. [2022-11-23 16:11:47,237 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 679 transitions. Word has length 21 [2022-11-23 16:11:47,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:11:47,237 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 679 transitions. [2022-11-23 16:11:47,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:11:47,237 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 679 transitions. [2022-11-23 16:11:47,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-23 16:11:47,240 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:11:47,240 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:11:47,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 16:11:47,240 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-23 16:11:47,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:11:47,241 INFO L85 PathProgramCache]: Analyzing trace with hash -855468510, now seen corresponding path program 1 times [2022-11-23 16:11:47,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:11:47,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194542194] [2022-11-23 16:11:47,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:11:47,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:11:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:11:47,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:11:47,358 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:11:47,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194542194] [2022-11-23 16:11:47,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194542194] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:11:47,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450354559] [2022-11-23 16:11:47,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:11:47,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:11:47,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:11:47,363 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:11:47,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 16:11:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:11:47,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 16:11:47,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:11:47,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:11:47,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:11:47,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:11:47,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450354559] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-23 16:11:47,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-23 16:11:47,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2022-11-23 16:11:47,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229401652] [2022-11-23 16:11:47,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:11:47,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 16:11:47,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:11:47,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 16:11:47,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-23 16:11:47,641 INFO L87 Difference]: Start difference. First operand 214 states and 679 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:11:47,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:11:47,730 INFO L93 Difference]: Finished difference Result 256 states and 819 transitions. [2022-11-23 16:11:47,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 16:11:47,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-23 16:11:47,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:11:47,733 INFO L225 Difference]: With dead ends: 256 [2022-11-23 16:11:47,733 INFO L226 Difference]: Without dead ends: 256 [2022-11-23 16:11:47,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-23 16:11:47,735 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 38 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:11:47,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 7 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:11:47,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-11-23 16:11:47,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2022-11-23 16:11:47,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 3.211764705882353) internal successors, (819), 255 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:11:47,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 819 transitions. [2022-11-23 16:11:47,753 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 819 transitions. Word has length 22 [2022-11-23 16:11:47,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:11:47,753 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 819 transitions. [2022-11-23 16:11:47,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:11:47,754 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 819 transitions. [2022-11-23 16:11:47,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 16:11:47,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:11:47,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:11:47,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 16:11:47,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:11:47,987 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-23 16:11:47,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:11:47,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1178114729, now seen corresponding path program 1 times [2022-11-23 16:11:47,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:11:47,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425723180] [2022-11-23 16:11:47,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:11:47,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:11:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:11:49,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:11:49,891 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:11:49,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425723180] [2022-11-23 16:11:49,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425723180] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:11:49,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35275620] [2022-11-23 16:11:49,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:11:49,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:11:49,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:11:49,895 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:11:49,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 16:11:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:11:50,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-23 16:11:50,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:11:50,165 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 16:11:50,264 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 16:11:50,372 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 16:11:50,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:11:50,987 INFO L350 Elim1Store]: Elim1 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 51 treesize of output 45 [2022-11-23 16:11:51,469 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:11:51,470 INFO L350 Elim1Store]: Elim1 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 94 treesize of output 60 [2022-11-23 16:11:51,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:11:51,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:11:57,166 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:11:57,167 INFO L350 Elim1Store]: Elim1 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 126 treesize of output 90 [2022-11-23 16:11:57,194 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:11:57,196 INFO L350 Elim1Store]: Elim1 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 2983 treesize of output 2849 [2022-11-23 16:11:57,253 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:11:57,254 INFO L350 Elim1Store]: Elim1 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 2839 treesize of output 2745 [2022-11-23 16:11:57,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2475 treesize of output 2091 [2022-11-23 16:11:57,343 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:11:57,344 INFO L350 Elim1Store]: Elim1 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 2351 treesize of output 2153 [2022-11-23 16:15:02,492 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:15:02,493 INFO L350 Elim1Store]: Elim1 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 153 treesize of output 105 [2022-11-23 16:15:02,509 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:15:02,521 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:15:02,522 INFO L350 Elim1Store]: Elim1 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 342 treesize of output 318 [2022-11-23 16:15:02,545 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:15:02,546 INFO L350 Elim1Store]: Elim1 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 314 treesize of output 282 [2022-11-23 16:15:02,570 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:15:02,571 INFO L350 Elim1Store]: Elim1 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 201 treesize of output 187 [2022-11-23 16:15:02,992 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:15:02,992 INFO L350 Elim1Store]: Elim1 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 127 treesize of output 91 [2022-11-23 16:15:03,004 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:15:03,019 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:15:03,020 INFO L350 Elim1Store]: Elim1 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 287 treesize of output 267 [2022-11-23 16:15:03,046 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:15:03,046 INFO L350 Elim1Store]: Elim1 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 263 treesize of output 235 [2022-11-23 16:15:03,068 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:15:03,068 INFO L350 Elim1Store]: Elim1 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 179 treesize of output 167 [2022-11-23 16:15:03,368 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:15:03,368 INFO L350 Elim1Store]: Elim1 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 92 treesize of output 68 [2022-11-23 16:15:03,376 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:15:03,389 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:15:03,391 INFO L350 Elim1Store]: Elim1 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 446 treesize of output 418 [2022-11-23 16:15:03,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:15:03,410 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 342 treesize of output 322 [2022-11-23 16:15:03,431 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:15:03,431 INFO L350 Elim1Store]: Elim1 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 394 treesize of output 358 [2022-11-23 16:15:03,605 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:15:03,606 INFO L350 Elim1Store]: Elim1 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 149 treesize of output 101 [2022-11-23 16:15:03,618 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:15:03,650 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:15:03,651 INFO L350 Elim1Store]: Elim1 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 2146 treesize of output 1926 [2022-11-23 16:15:03,706 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:15:03,707 INFO L350 Elim1Store]: Elim1 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 1910 treesize of output 1766 [2022-11-23 16:15:03,762 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:15:03,762 INFO L350 Elim1Store]: Elim1 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 1750 treesize of output 1458 [2022-11-23 16:15:07,005 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:15:07,007 INFO L350 Elim1Store]: Elim1 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 185 treesize of output 125 [2022-11-23 16:15:07,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:15:07,038 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:15:07,039 INFO L350 Elim1Store]: Elim1 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 704 treesize of output 636 [2022-11-23 16:15:07,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:15:07,065 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 569 treesize of output 518 [2022-11-23 16:15:07,090 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:15:07,091 INFO L350 Elim1Store]: Elim1 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 578 treesize of output 486 [2022-11-23 16:15:08,135 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:15:08,135 INFO L350 Elim1Store]: Elim1 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 148 treesize of output 100 [2022-11-23 16:15:08,143 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:15:08,161 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:15:08,162 INFO L350 Elim1Store]: Elim1 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 604 treesize of output 544 [2022-11-23 16:15:08,194 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:15:08,195 INFO L350 Elim1Store]: Elim1 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 536 treesize of output 456 [2022-11-23 16:15:08,226 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:15:08,227 INFO L350 Elim1Store]: Elim1 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 386 treesize of output 348 [2022-11-23 16:15:13,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:15:13,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35275620] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:15:13,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1052687857] [2022-11-23 16:15:13,211 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 16:15:13,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:15:13,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 38 [2022-11-23 16:15:13,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032294208] [2022-11-23 16:15:13,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:15:13,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-23 16:15:13,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:15:13,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-23 16:15:13,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1299, Unknown=10, NotChecked=0, Total=1560 [2022-11-23 16:15:13,226 INFO L87 Difference]: Start difference. First operand 256 states and 819 transitions. Second operand has 40 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 39 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:15:20,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:15:20,391 INFO L93 Difference]: Finished difference Result 684 states and 2113 transitions. [2022-11-23 16:15:20,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-23 16:15:20,392 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 39 states have internal predecessors, (72), 0 states have call successors, (0), 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 24 [2022-11-23 16:15:20,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:15:20,396 INFO L225 Difference]: With dead ends: 684 [2022-11-23 16:15:20,396 INFO L226 Difference]: Without dead ends: 670 [2022-11-23 16:15:20,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=772, Invalid=3000, Unknown=10, NotChecked=0, Total=3782 [2022-11-23 16:15:20,398 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 330 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 2121 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 2151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-23 16:15:20,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 170 Invalid, 2151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2121 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-11-23 16:15:20,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-11-23 16:15:20,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 414. [2022-11-23 16:15:20,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 413 states have (on average 3.1598062953995156) internal successors, (1305), 413 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:15:20,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 1305 transitions. [2022-11-23 16:15:20,426 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 1305 transitions. Word has length 24 [2022-11-23 16:15:20,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:15:20,427 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 1305 transitions. [2022-11-23 16:15:20,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 39 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:15:20,427 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 1305 transitions. [2022-11-23 16:15:20,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 16:15:20,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:15:20,431 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:15:20,456 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 16:15:20,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:15:20,637 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-23 16:15:20,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:15:20,638 INFO L85 PathProgramCache]: Analyzing trace with hash 967510981, now seen corresponding path program 2 times [2022-11-23 16:15:20,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:15:20,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360574776] [2022-11-23 16:15:20,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:15:20,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:15:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:15:22,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:15:22,305 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:15:22,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360574776] [2022-11-23 16:15:22,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360574776] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:15:22,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119384501] [2022-11-23 16:15:22,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 16:15:22,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:15:22,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:15:22,307 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:15:22,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 16:15:22,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 16:15:22,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:15:22,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-23 16:15:22,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:15:22,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:15:22,870 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 22 [2022-11-23 16:15:23,206 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-23 16:15:23,207 INFO L350 Elim1Store]: Elim1 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 115 treesize of output 85 [2022-11-23 16:15:23,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:15:23,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:15:24,732 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:15:24,732 INFO L350 Elim1Store]: Elim1 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 211 treesize of output 159 [2022-11-23 16:15:24,747 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:15:24,748 INFO L350 Elim1Store]: Elim1 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 135 treesize of output 130 [2022-11-23 16:15:24,760 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:15:24,761 INFO L350 Elim1Store]: Elim1 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 117 treesize of output 112 [2022-11-23 16:15:25,035 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-23 16:15:25,035 INFO L350 Elim1Store]: Elim1 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 99 treesize of output 71 [2022-11-23 16:15:25,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2022-11-23 16:15:25,080 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-23 16:15:25,080 INFO L350 Elim1Store]: Elim1 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 259 treesize of output 191 [2022-11-23 16:15:25,096 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-23 16:15:25,097 INFO L350 Elim1Store]: Elim1 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 172 treesize of output 159 [2022-11-23 16:15:25,112 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-23 16:15:25,113 INFO L350 Elim1Store]: Elim1 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 154 treesize of output 135 [2022-11-23 16:15:25,196 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:15:25,205 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-23 16:15:25,205 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 77 treesize of output 1 [2022-11-23 16:15:25,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:15:25,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119384501] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:15:25,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [871613627] [2022-11-23 16:15:25,636 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 16:15:25,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:15:25,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 32 [2022-11-23 16:15:25,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186245815] [2022-11-23 16:15:25,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:15:25,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-23 16:15:25,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:15:25,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-23 16:15:25,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=949, Unknown=1, NotChecked=0, Total=1122 [2022-11-23 16:15:25,639 INFO L87 Difference]: Start difference. First operand 414 states and 1305 transitions. Second operand has 34 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:15:27,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:15:27,694 INFO L93 Difference]: Finished difference Result 581 states and 1793 transitions. [2022-11-23 16:15:27,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 16:15:27,695 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 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 24 [2022-11-23 16:15:27,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:15:27,698 INFO L225 Difference]: With dead ends: 581 [2022-11-23 16:15:27,699 INFO L226 Difference]: Without dead ends: 574 [2022-11-23 16:15:27,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=363, Invalid=1442, Unknown=1, NotChecked=0, Total=1806 [2022-11-23 16:15:27,700 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 141 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-23 16:15:27,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 43 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-23 16:15:27,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2022-11-23 16:15:27,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 430. [2022-11-23 16:15:27,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 3.1305361305361306) internal successors, (1343), 429 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:15:27,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1343 transitions. [2022-11-23 16:15:27,721 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1343 transitions. Word has length 24 [2022-11-23 16:15:27,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:15:27,722 INFO L495 AbstractCegarLoop]: Abstraction has 430 states and 1343 transitions. [2022-11-23 16:15:27,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:15:27,722 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1343 transitions. [2022-11-23 16:15:27,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 16:15:27,725 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:15:27,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:15:27,743 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-23 16:15:27,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:15:27,932 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-23 16:15:27,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:15:27,932 INFO L85 PathProgramCache]: Analyzing trace with hash 532102869, now seen corresponding path program 3 times [2022-11-23 16:15:27,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:15:27,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258615546] [2022-11-23 16:15:27,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:15:27,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:15:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:15:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:15:29,216 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:15:29,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258615546] [2022-11-23 16:15:29,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258615546] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:15:29,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289309629] [2022-11-23 16:15:29,216 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 16:15:29,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:15:29,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:15:29,218 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:15:29,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 16:15:29,352 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 16:15:29,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:15:29,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-23 16:15:29,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:15:29,938 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-23 16:15:29,938 INFO L350 Elim1Store]: Elim1 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 115 treesize of output 85 [2022-11-23 16:15:30,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:15:30,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:15:30,754 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:15:30,754 INFO L350 Elim1Store]: Elim1 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 125 treesize of output 73 [2022-11-23 16:15:30,813 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-23 16:15:30,813 INFO L350 Elim1Store]: Elim1 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 116 treesize of output 56 [2022-11-23 16:15:31,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:15:31,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289309629] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:15:31,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1370156836] [2022-11-23 16:15:31,158 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 16:15:31,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:15:31,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 29 [2022-11-23 16:15:31,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937790711] [2022-11-23 16:15:31,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:15:31,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-23 16:15:31,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:15:31,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-23 16:15:31,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=770, Unknown=0, NotChecked=0, Total=930 [2022-11-23 16:15:31,160 INFO L87 Difference]: Start difference. First operand 430 states and 1343 transitions. Second operand has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:15:32,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:15:32,736 INFO L93 Difference]: Finished difference Result 589 states and 1813 transitions. [2022-11-23 16:15:32,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 16:15:32,736 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 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 24 [2022-11-23 16:15:32,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:15:32,740 INFO L225 Difference]: With dead ends: 589 [2022-11-23 16:15:32,741 INFO L226 Difference]: Without dead ends: 582 [2022-11-23 16:15:32,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=320, Invalid=1162, Unknown=0, NotChecked=0, Total=1482 [2022-11-23 16:15:32,742 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 156 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-23 16:15:32,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 48 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-23 16:15:32,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-11-23 16:15:32,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 434. [2022-11-23 16:15:32,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 3.1247113163972284) internal successors, (1353), 433 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:15:32,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1353 transitions. [2022-11-23 16:15:32,760 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1353 transitions. Word has length 24 [2022-11-23 16:15:32,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:15:32,761 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 1353 transitions. [2022-11-23 16:15:32,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:15:32,761 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1353 transitions. [2022-11-23 16:15:32,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 16:15:32,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:15:32,764 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:15:32,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 16:15:32,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-23 16:15:32,969 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-23 16:15:32,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:15:32,970 INFO L85 PathProgramCache]: Analyzing trace with hash 986035751, now seen corresponding path program 4 times [2022-11-23 16:15:32,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:15:32,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102708766] [2022-11-23 16:15:32,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:15:32,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:15:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:15:34,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:15:34,115 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:15:34,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102708766] [2022-11-23 16:15:34,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102708766] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:15:34,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666769889] [2022-11-23 16:15:34,115 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 16:15:34,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:15:34,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:15:34,119 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:15:34,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 16:15:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:15:34,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-23 16:15:34,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:15:34,352 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 16:15:34,457 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 16:15:34,537 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 16:15:34,707 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 16:15:35,189 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-23 16:15:35,190 INFO L350 Elim1Store]: Elim1 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 115 treesize of output 85 [2022-11-23 16:15:35,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:15:35,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:15:36,664 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse15 (+ c_~sum~0 c_~mts2~0))) (let ((.cse5 (<= .cse15 c_~mts3~0)) (.cse4 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse3 (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset))) (and (or (forall ((v_ArrVal_271 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base))) (let ((.cse0 (select .cse2 .cse4)) (.cse1 (+ c_~mts1~0 (select .cse2 .cse3)))) (or (< (+ c_~mts3~0 .cse0) 0) (< .cse1 0) (not (<= .cse1 2147483647)) (= (+ c_~sum~0 .cse0 c_~mts2~0) .cse1))))) .cse5) (or (forall ((v_ArrVal_271 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base))) (let ((.cse7 (select .cse6 .cse3))) (or (< (+ c_~mts3~0 (select .cse6 .cse4)) 0) (not (< (+ c_~mts1~0 .cse7) 0)) (not (<= 0 (+ c_~mts1~0 .cse7 2147483648))))))) .cse5) (forall ((v_ArrVal_271 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base))) (let ((.cse8 (+ c_~mts3~0 (select .cse10 .cse4))) (.cse9 (select .cse10 .cse3))) (or (< .cse8 0) (not (< (+ c_~mts1~0 .cse9) 0)) (= .cse8 0) (not (<= 0 (+ c_~mts1~0 .cse9 2147483648))))))) (forall ((v_ArrVal_271 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base))) (let ((.cse13 (select .cse14 .cse4))) (let ((.cse12 (+ c_~sum~0 .cse13 c_~mts2~0)) (.cse11 (+ c_~mts1~0 (select .cse14 .cse3)))) (or (< .cse11 0) (<= .cse12 0) (not (<= .cse11 2147483647)) (= .cse12 .cse11) (not (< (+ c_~mts3~0 .cse13) 0))))))) (or (< c_~mts3~0 .cse15) (forall ((v_ArrVal_271 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base))) (let ((.cse16 (+ c_~mts3~0 (select .cse18 .cse4))) (.cse17 (+ c_~mts1~0 (select .cse18 .cse3)))) (or (< .cse16 0) (< .cse17 0) (not (<= .cse17 2147483647)) (= .cse16 .cse17)))))) (forall ((v_ArrVal_271 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base))) (let ((.cse19 (select .cse21 .cse3)) (.cse20 (select .cse21 .cse4))) (or (<= 0 (+ c_~mts1~0 .cse19)) (<= (+ c_~sum~0 .cse20 c_~mts2~0) 0) (< (+ c_~mts1~0 .cse19 2147483648) 0) (not (< (+ c_~mts3~0 .cse20) 0)))))) (forall ((v_ArrVal_271 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base))) (let ((.cse22 (+ c_~mts1~0 (select .cse24 .cse3))) (.cse23 (select .cse24 .cse4))) (or (< .cse22 0) (= .cse22 0) (< 0 (+ c_~sum~0 .cse23 c_~mts2~0)) (not (<= .cse22 2147483647)) (not (< (+ c_~mts3~0 .cse23) 0))))))))) is different from false [2022-11-23 16:15:36,798 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~sum~0 c_~mts2~0))) (let ((.cse4 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse17 (<= .cse0 c_~mts3~0))) (and (or (< c_~mts3~0 .cse0) (forall ((v_ArrVal_271 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base))) (let ((.cse1 (+ c_~mts3~0 (select .cse3 .cse4))) (.cse2 (+ (select .cse3 c_~A~0.offset) c_~mts1~0))) (or (< .cse1 0) (= .cse1 .cse2) (< .cse2 0) (not (<= .cse2 2147483647))))))) (forall ((v_ArrVal_271 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base))) (let ((.cse7 (select .cse8 .cse4))) (let ((.cse5 (+ c_~sum~0 .cse7 c_~mts2~0)) (.cse6 (+ (select .cse8 c_~A~0.offset) c_~mts1~0))) (or (<= .cse5 0) (< .cse6 0) (not (<= .cse6 2147483647)) (= .cse5 .cse6) (not (< (+ c_~mts3~0 .cse7) 0))))))) (forall ((v_ArrVal_271 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base))) (let ((.cse9 (+ c_~mts3~0 (select .cse11 .cse4))) (.cse10 (select .cse11 c_~A~0.offset))) (or (< .cse9 0) (not (< (+ .cse10 c_~mts1~0) 0)) (= .cse9 0) (not (<= 0 (+ .cse10 c_~mts1~0 2147483648))))))) (forall ((v_ArrVal_271 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base))) (let ((.cse12 (select .cse14 .cse4)) (.cse13 (+ (select .cse14 c_~A~0.offset) c_~mts1~0))) (or (< 0 (+ c_~sum~0 .cse12 c_~mts2~0)) (< .cse13 0) (not (<= .cse13 2147483647)) (not (< (+ c_~mts3~0 .cse12) 0)) (= .cse13 0))))) (or (forall ((v_ArrVal_271 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base))) (let ((.cse16 (select .cse15 c_~A~0.offset))) (or (< (+ c_~mts3~0 (select .cse15 .cse4)) 0) (not (< (+ .cse16 c_~mts1~0) 0)) (not (<= 0 (+ .cse16 c_~mts1~0 2147483648))))))) .cse17) (forall ((v_ArrVal_271 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base))) (let ((.cse18 (select .cse20 .cse4)) (.cse19 (select .cse20 c_~A~0.offset))) (or (<= (+ c_~sum~0 .cse18 c_~mts2~0) 0) (<= 0 (+ .cse19 c_~mts1~0)) (not (< (+ c_~mts3~0 .cse18) 0)) (< (+ .cse19 c_~mts1~0 2147483648) 0))))) (or (forall ((v_ArrVal_271 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base))) (let ((.cse21 (select .cse23 .cse4)) (.cse22 (+ (select .cse23 c_~A~0.offset) c_~mts1~0))) (or (< (+ c_~mts3~0 .cse21) 0) (< .cse22 0) (not (<= .cse22 2147483647)) (= (+ c_~sum~0 .cse21 c_~mts2~0) .cse22))))) .cse17)))) is different from false [2022-11-23 16:15:37,261 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse14 (+ c_~sum~0 c_~mts2~0))) (let ((.cse10 (<= .cse14 c_~mts3~0)) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_270 (Array Int Int)) (v_ArrVal_271 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base))) (let ((.cse0 (+ (select .cse2 c_~A~0.offset) c_~mts1~0)) (.cse1 (select .cse2 .cse3))) (or (= .cse0 0) (not (< (+ c_~mts3~0 .cse1) 0)) (not (<= .cse0 2147483647)) (< .cse0 0) (< 0 (+ c_~sum~0 c_~mts2~0 .cse1)))))) (forall ((v_ArrVal_270 (Array Int Int)) (v_ArrVal_271 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base))) (let ((.cse4 (+ c_~mts3~0 (select .cse6 .cse3))) (.cse5 (select .cse6 c_~A~0.offset))) (or (< .cse4 0) (= .cse4 0) (not (< (+ .cse5 c_~mts1~0) 0)) (not (<= 0 (+ .cse5 c_~mts1~0 2147483648))))))) (or (forall ((v_ArrVal_270 (Array Int Int)) (v_ArrVal_271 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base))) (let ((.cse7 (select .cse9 .cse3)) (.cse8 (+ (select .cse9 c_~A~0.offset) c_~mts1~0))) (or (< (+ c_~mts3~0 .cse7) 0) (= (+ c_~sum~0 c_~mts2~0 .cse7) .cse8) (not (<= .cse8 2147483647)) (< .cse8 0))))) .cse10) (or (forall ((v_ArrVal_270 (Array Int Int)) (v_ArrVal_271 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base))) (let ((.cse11 (+ c_~mts3~0 (select .cse13 .cse3))) (.cse12 (+ (select .cse13 c_~A~0.offset) c_~mts1~0))) (or (< .cse11 0) (= .cse12 .cse11) (not (<= .cse12 2147483647)) (< .cse12 0))))) (< c_~mts3~0 .cse14)) (or (forall ((v_ArrVal_270 (Array Int Int)) (v_ArrVal_271 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base))) (let ((.cse16 (select .cse15 c_~A~0.offset))) (or (< (+ c_~mts3~0 (select .cse15 .cse3)) 0) (not (< (+ .cse16 c_~mts1~0) 0)) (not (<= 0 (+ .cse16 c_~mts1~0 2147483648))))))) .cse10) (forall ((v_ArrVal_270 (Array Int Int)) (v_ArrVal_271 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base))) (let ((.cse19 (select .cse20 .cse3))) (let ((.cse17 (+ c_~sum~0 c_~mts2~0 .cse19)) (.cse18 (+ (select .cse20 c_~A~0.offset) c_~mts1~0))) (or (= .cse17 .cse18) (not (< (+ c_~mts3~0 .cse19) 0)) (not (<= .cse18 2147483647)) (<= .cse17 0) (< .cse18 0)))))) (forall ((v_ArrVal_270 (Array Int Int)) (v_ArrVal_271 (Array Int Int))) (let ((.cse23 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_270) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base))) (let ((.cse21 (select .cse23 c_~A~0.offset)) (.cse22 (select .cse23 .cse3))) (or (< (+ .cse21 c_~mts1~0 2147483648) 0) (not (< (+ c_~mts3~0 .cse22) 0)) (<= 0 (+ .cse21 c_~mts1~0)) (<= (+ c_~sum~0 c_~mts2~0 .cse22) 0)))))))) is different from false [2022-11-23 16:15:38,056 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:15:38,056 INFO L350 Elim1Store]: Elim1 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 158 treesize of output 110 [2022-11-23 16:15:38,076 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:15:38,076 INFO L350 Elim1Store]: Elim1 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 2622 treesize of output 2520 [2022-11-23 16:15:38,122 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:15:38,122 INFO L350 Elim1Store]: Elim1 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 2510 treesize of output 2376 [2022-11-23 16:15:38,165 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:15:38,165 INFO L350 Elim1Store]: Elim1 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 2366 treesize of output 2088 [2022-11-23 16:15:38,214 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:15:38,214 INFO L350 Elim1Store]: Elim1 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 1562 treesize of output 1500 [2022-11-23 16:15:43,874 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:15:43,875 INFO L350 Elim1Store]: Elim1 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 157 treesize of output 109 [2022-11-23 16:15:43,896 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:15:43,896 INFO L350 Elim1Store]: Elim1 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 1274 treesize of output 1228 [2022-11-23 16:15:43,925 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:15:43,925 INFO L350 Elim1Store]: Elim1 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 1218 treesize of output 1084 [2022-11-23 16:15:43,959 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:15:43,960 INFO L350 Elim1Store]: Elim1 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 668 treesize of output 642 [2022-11-23 16:15:43,991 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:15:43,992 INFO L350 Elim1Store]: Elim1 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 1038 treesize of output 976 [2022-11-23 16:15:46,987 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-23 16:15:46,988 INFO L350 Elim1Store]: Elim1 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 98 treesize of output 1 [2022-11-23 16:15:47,003 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:15:47,003 INFO L350 Elim1Store]: Elim1 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 194 treesize of output 134 [2022-11-23 16:15:47,033 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:15:47,034 INFO L350 Elim1Store]: Elim1 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 3356 treesize of output 3216 [2022-11-23 16:15:47,090 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:15:47,091 INFO L350 Elim1Store]: Elim1 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 3200 treesize of output 3108 [2022-11-23 16:15:47,150 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:15:47,151 INFO L350 Elim1Store]: Elim1 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 3092 treesize of output 2904 [2022-11-23 16:15:47,209 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:15:47,210 INFO L350 Elim1Store]: Elim1 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 2876 treesize of output 2496 [2022-11-23 16:16:09,778 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-23 16:16:09,778 INFO L350 Elim1Store]: Elim1 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 132 treesize of output 1 [2022-11-23 16:16:09,794 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:16:09,794 INFO L350 Elim1Store]: Elim1 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 162 treesize of output 114 [2022-11-23 16:16:09,826 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:16:09,827 INFO L350 Elim1Store]: Elim1 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 3060 treesize of output 2952 [2022-11-23 16:16:09,932 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:16:09,933 INFO L350 Elim1Store]: Elim1 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 2948 treesize of output 2880 [2022-11-23 16:16:10,002 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:16:10,003 INFO L350 Elim1Store]: Elim1 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 2876 treesize of output 2736 [2022-11-23 16:16:10,073 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:16:10,074 INFO L350 Elim1Store]: Elim1 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 2732 treesize of output 2448 [2022-11-23 16:16:14,935 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-23 16:16:14,936 INFO L350 Elim1Store]: Elim1 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 132 treesize of output 1 [2022-11-23 16:16:15,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:16:15,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666769889] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:16:15,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [370086789] [2022-11-23 16:16:15,197 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 16:16:15,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:16:15,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2022-11-23 16:16:15,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207298945] [2022-11-23 16:16:15,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:16:15,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-23 16:16:15,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:16:15,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-23 16:16:15,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=743, Unknown=3, NotChecked=174, Total=1056 [2022-11-23 16:16:15,200 INFO L87 Difference]: Start difference. First operand 434 states and 1353 transitions. Second operand has 33 states, 32 states have (on average 2.25) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:16:18,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:16:18,288 INFO L93 Difference]: Finished difference Result 646 states and 2019 transitions. [2022-11-23 16:16:18,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 16:16:18,288 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.25) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 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 24 [2022-11-23 16:16:18,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:16:18,292 INFO L225 Difference]: With dead ends: 646 [2022-11-23 16:16:18,292 INFO L226 Difference]: Without dead ends: 632 [2022-11-23 16:16:18,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=356, Invalid=1545, Unknown=3, NotChecked=258, Total=2162 [2022-11-23 16:16:18,294 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 202 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 197 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-23 16:16:18,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 83 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1129 Invalid, 0 Unknown, 197 Unchecked, 1.5s Time] [2022-11-23 16:16:18,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2022-11-23 16:16:18,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 462. [2022-11-23 16:16:18,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 461 states have (on average 3.1518438177874186) internal successors, (1453), 461 states have internal predecessors, (1453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:16:18,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1453 transitions. [2022-11-23 16:16:18,313 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 1453 transitions. Word has length 24 [2022-11-23 16:16:18,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:16:18,314 INFO L495 AbstractCegarLoop]: Abstraction has 462 states and 1453 transitions. [2022-11-23 16:16:18,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.25) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:16:18,314 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 1453 transitions. [2022-11-23 16:16:18,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 16:16:18,316 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:16:18,316 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:16:18,326 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 16:16:18,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-23 16:16:18,523 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-23 16:16:18,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:16:18,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1887494715, now seen corresponding path program 5 times [2022-11-23 16:16:18,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:16:18,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100863937] [2022-11-23 16:16:18,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:16:18,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:16:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:16:20,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:16:20,305 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:16:20,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100863937] [2022-11-23 16:16:20,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100863937] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:16:20,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495569720] [2022-11-23 16:16:20,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 16:16:20,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:16:20,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:16:20,311 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:16:20,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 16:16:20,461 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 16:16:20,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:16:20,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-23 16:16:20,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:16:21,036 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-23 16:16:21,036 INFO L350 Elim1Store]: Elim1 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 115 treesize of output 85 [2022-11-23 16:16:21,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:16:21,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:16:21,983 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:16:21,983 INFO L350 Elim1Store]: Elim1 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 52 treesize of output 32 [2022-11-23 16:16:21,996 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:16:21,996 INFO L350 Elim1Store]: Elim1 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 56 treesize of output 36 [2022-11-23 16:16:22,021 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-23 16:16:22,021 INFO L350 Elim1Store]: Elim1 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 32 [2022-11-23 16:16:22,041 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-23 16:16:22,042 INFO L350 Elim1Store]: Elim1 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 163 treesize of output 71 [2022-11-23 16:16:22,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:16:22,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495569720] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:16:22,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2011680294] [2022-11-23 16:16:22,581 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 16:16:22,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:16:22,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 29 [2022-11-23 16:16:22,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056148719] [2022-11-23 16:16:22,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:16:22,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-23 16:16:22,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:16:22,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-23 16:16:22,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2022-11-23 16:16:22,583 INFO L87 Difference]: Start difference. First operand 462 states and 1453 transitions. Second operand has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:16:25,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:16:25,370 INFO L93 Difference]: Finished difference Result 695 states and 2157 transitions. [2022-11-23 16:16:25,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-23 16:16:25,371 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 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 24 [2022-11-23 16:16:25,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:16:25,375 INFO L225 Difference]: With dead ends: 695 [2022-11-23 16:16:25,375 INFO L226 Difference]: Without dead ends: 674 [2022-11-23 16:16:25,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=526, Invalid=1826, Unknown=0, NotChecked=0, Total=2352 [2022-11-23 16:16:25,378 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 211 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-23 16:16:25,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 99 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-23 16:16:25,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-11-23 16:16:25,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 470. [2022-11-23 16:16:25,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 3.1492537313432836) internal successors, (1477), 469 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:16:25,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1477 transitions. [2022-11-23 16:16:25,398 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1477 transitions. Word has length 24 [2022-11-23 16:16:25,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:16:25,399 INFO L495 AbstractCegarLoop]: Abstraction has 470 states and 1477 transitions. [2022-11-23 16:16:25,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:16:25,399 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1477 transitions. [2022-11-23 16:16:25,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 16:16:25,403 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:16:25,403 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:16:25,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 16:16:25,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:16:25,615 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-23 16:16:25,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:16:25,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1433561833, now seen corresponding path program 6 times [2022-11-23 16:16:25,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:16:25,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847393591] [2022-11-23 16:16:25,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:16:25,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:16:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:16:26,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:16:26,862 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:16:26,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847393591] [2022-11-23 16:16:26,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847393591] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:16:26,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086274248] [2022-11-23 16:16:26,862 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 16:16:26,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:16:26,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:16:26,864 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:16:26,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 16:16:27,002 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 16:16:27,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:16:27,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-23 16:16:27,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:16:27,644 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-23 16:16:27,645 INFO L350 Elim1Store]: Elim1 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 115 treesize of output 85 [2022-11-23 16:16:27,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:16:27,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:16:28,372 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:16:28,372 INFO L350 Elim1Store]: Elim1 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 252 treesize of output 136 [2022-11-23 16:16:28,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:16:28,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086274248] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:16:28,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [290810658] [2022-11-23 16:16:28,958 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 16:16:28,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:16:28,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 28 [2022-11-23 16:16:28,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733700123] [2022-11-23 16:16:28,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:16:28,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-23 16:16:28,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:16:28,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-23 16:16:28,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2022-11-23 16:16:28,961 INFO L87 Difference]: Start difference. First operand 470 states and 1477 transitions. Second operand has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 29 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:16:29,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:16:29,963 INFO L93 Difference]: Finished difference Result 621 states and 1931 transitions. [2022-11-23 16:16:29,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-23 16:16:29,964 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 29 states have internal predecessors, (72), 0 states have call successors, (0), 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 24 [2022-11-23 16:16:29,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:16:29,968 INFO L225 Difference]: With dead ends: 621 [2022-11-23 16:16:29,968 INFO L226 Difference]: Without dead ends: 614 [2022-11-23 16:16:29,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=237, Invalid=1095, Unknown=0, NotChecked=0, Total=1332 [2022-11-23 16:16:29,969 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 139 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 16:16:29,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 45 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-23 16:16:29,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2022-11-23 16:16:29,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 472. [2022-11-23 16:16:29,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 3.1464968152866244) internal successors, (1482), 471 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:16:29,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1482 transitions. [2022-11-23 16:16:29,986 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1482 transitions. Word has length 24 [2022-11-23 16:16:29,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:16:29,986 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 1482 transitions. [2022-11-23 16:16:29,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 29 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:16:29,987 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1482 transitions. [2022-11-23 16:16:29,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 16:16:29,988 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:16:29,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:16:29,999 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 16:16:30,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:16:30,194 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-23 16:16:30,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:16:30,195 INFO L85 PathProgramCache]: Analyzing trace with hash 2027765289, now seen corresponding path program 7 times [2022-11-23 16:16:30,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:16:30,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662620503] [2022-11-23 16:16:30,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:16:30,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:16:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:16:31,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:16:31,497 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:16:31,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662620503] [2022-11-23 16:16:31,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662620503] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:16:31,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160210895] [2022-11-23 16:16:31,497 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 16:16:31,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:16:31,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:16:31,499 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:16:31,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 16:16:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:16:31,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-23 16:16:31,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:16:31,712 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 16:16:31,791 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 16:16:31,871 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 16:16:31,978 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 16:16:32,495 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-23 16:16:32,495 INFO L350 Elim1Store]: Elim1 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 125 treesize of output 85 [2022-11-23 16:16:32,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:16:32,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:16:34,183 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~sum~0 c_~mts2~0)) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (forall ((v_ArrVal_408 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_408) c_~A~0.base))) (let ((.cse0 (+ c_~mts3~0 (select .cse2 .cse3))) (.cse1 (+ (select .cse2 c_~A~0.offset) c_~mts1~0))) (or (< .cse0 0) (= .cse0 .cse1) (not (<= .cse1 2147483647)) (< .cse1 0))))) (< c_~mts3~0 .cse4)) (or (and (forall ((v_ArrVal_408 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_408) c_~A~0.base))) (let ((.cse6 (select .cse5 c_~A~0.offset))) (or (< (+ c_~mts3~0 (select .cse5 .cse3)) 0) (not (<= 0 (+ .cse6 c_~mts1~0 2147483648))) (not (< (+ .cse6 c_~mts1~0) 0)))))) (forall ((v_ArrVal_408 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_408) c_~A~0.base))) (let ((.cse7 (+ c_~mts3~0 (select .cse9 .cse3))) (.cse8 (+ (select .cse9 c_~A~0.offset) c_~mts1~0))) (or (< .cse7 0) (not (= .cse7 .cse8)) (not (<= .cse8 2147483647))))))) (<= .cse4 c_~mts3~0)) (forall ((v_ArrVal_408 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_408) c_~A~0.base))) (let ((.cse10 (select .cse11 .cse3))) (or (not (< (+ c_~mts3~0 .cse10) 0)) (<= (+ c_~sum~0 c_~mts2~0 .cse10) 0) (not (= (+ (select .cse11 c_~A~0.offset) c_~mts1~0) 0)))))) (forall ((v_ArrVal_408 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_408) c_~A~0.base))) (let ((.cse13 (select .cse14 c_~A~0.offset)) (.cse12 (+ c_~mts3~0 (select .cse14 .cse3)))) (or (< .cse12 0) (not (<= 0 (+ .cse13 c_~mts1~0 2147483648))) (not (< (+ .cse13 c_~mts1~0) 0)) (= .cse12 0))))) (forall ((v_ArrVal_408 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_408) c_~A~0.base))) (let ((.cse15 (select .cse17 .cse3)) (.cse16 (select .cse17 c_~A~0.offset))) (or (not (< (+ c_~mts3~0 .cse15) 0)) (not (<= 0 (+ .cse16 c_~mts1~0 2147483648))) (<= (+ c_~sum~0 c_~mts2~0 .cse15) 0) (not (< (+ .cse16 c_~mts1~0) 0)))))) (forall ((v_ArrVal_408 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_408) c_~A~0.base))) (let ((.cse18 (select .cse20 .cse3)) (.cse19 (+ (select .cse20 c_~A~0.offset) c_~mts1~0))) (or (not (< (+ c_~mts3~0 .cse18) 0)) (= .cse19 (+ c_~sum~0 c_~mts2~0 .cse18)) (= .cse19 0) (not (<= .cse19 2147483647)) (< .cse19 0))))) (forall ((v_ArrVal_408 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_408) c_~A~0.base))) (let ((.cse23 (select .cse24 .cse3))) (let ((.cse21 (+ c_~mts3~0 .cse23)) (.cse22 (+ (select .cse24 c_~A~0.offset) c_~mts1~0))) (or (< .cse21 0) (= .cse21 .cse22) (= .cse22 (+ c_~sum~0 c_~mts2~0 .cse23)) (not (<= .cse22 2147483647)) (< .cse22 0)))))))) is different from false [2022-11-23 16:16:34,723 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_~sum~0 c_~mts2~0)) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_407) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_408) c_~A~0.base))) (let ((.cse1 (select .cse0 .cse2))) (or (not (= (+ c_~mts1~0 (select .cse0 c_~A~0.offset)) 0)) (not (< (+ .cse1 c_~mts3~0) 0)) (<= (+ c_~sum~0 .cse1 c_~mts2~0) 0))))) (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_407) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_408) c_~A~0.base))) (let ((.cse4 (select .cse6 .cse2))) (let ((.cse5 (+ .cse4 c_~mts3~0)) (.cse3 (+ c_~mts1~0 (select .cse6 c_~A~0.offset)))) (or (= .cse3 (+ c_~sum~0 .cse4 c_~mts2~0)) (< .cse3 0) (= .cse5 .cse3) (< .cse5 0) (not (<= .cse3 2147483647))))))) (or (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_407) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_408) c_~A~0.base))) (let ((.cse8 (+ (select .cse9 .cse2) c_~mts3~0)) (.cse7 (+ c_~mts1~0 (select .cse9 c_~A~0.offset)))) (or (< .cse7 0) (= .cse8 .cse7) (< .cse8 0) (not (<= .cse7 2147483647)))))) (< c_~mts3~0 .cse10)) (or (and (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_407) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_408) c_~A~0.base))) (let ((.cse11 (+ (select .cse13 .cse2) c_~mts3~0)) (.cse12 (+ c_~mts1~0 (select .cse13 c_~A~0.offset)))) (or (not (= .cse11 .cse12)) (< .cse11 0) (not (<= .cse12 2147483647)))))) (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_407) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_408) c_~A~0.base))) (let ((.cse14 (select .cse15 c_~A~0.offset))) (or (not (< (+ c_~mts1~0 .cse14) 0)) (< (+ (select .cse15 .cse2) c_~mts3~0) 0) (not (<= 0 (+ c_~mts1~0 .cse14 2147483648)))))))) (<= .cse10 c_~mts3~0)) (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_407) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_408) c_~A~0.base))) (let ((.cse17 (select .cse18 .cse2)) (.cse16 (select .cse18 c_~A~0.offset))) (or (not (< (+ c_~mts1~0 .cse16) 0)) (not (< (+ .cse17 c_~mts3~0) 0)) (<= (+ c_~sum~0 .cse17 c_~mts2~0) 0) (not (<= 0 (+ c_~mts1~0 .cse16 2147483648))))))) (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (let ((.cse21 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_407) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_408) c_~A~0.base))) (let ((.cse20 (+ (select .cse21 .cse2) c_~mts3~0)) (.cse19 (select .cse21 c_~A~0.offset))) (or (not (< (+ c_~mts1~0 .cse19) 0)) (= .cse20 0) (< .cse20 0) (not (<= 0 (+ c_~mts1~0 .cse19 2147483648))))))) (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_408 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_407) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_408) c_~A~0.base))) (let ((.cse22 (select .cse24 .cse2)) (.cse23 (+ c_~mts1~0 (select .cse24 c_~A~0.offset)))) (or (not (< (+ .cse22 c_~mts3~0) 0)) (= .cse23 (+ c_~sum~0 .cse22 c_~mts2~0)) (= .cse23 0) (< .cse23 0) (not (<= .cse23 2147483647)))))))) is different from false [2022-11-23 16:16:37,885 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:16:37,886 INFO L350 Elim1Store]: Elim1 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 132 treesize of output 96 [2022-11-23 16:16:37,901 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:16:37,901 INFO L350 Elim1Store]: Elim1 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 599 treesize of output 585 [2022-11-23 16:16:37,924 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:16:37,924 INFO L350 Elim1Store]: Elim1 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 429 treesize of output 423 [2022-11-23 16:16:37,954 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:16:37,954 INFO L350 Elim1Store]: Elim1 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 559 treesize of output 505 [2022-11-23 16:16:37,973 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:16:37,973 INFO L350 Elim1Store]: Elim1 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 495 treesize of output 473 [2022-11-23 16:16:41,018 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:16:41,018 INFO L350 Elim1Store]: Elim1 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 102 treesize of output 78 [2022-11-23 16:16:41,041 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:16:41,042 INFO L350 Elim1Store]: Elim1 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 472 treesize of output 456 [2022-11-23 16:16:41,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:16:41,060 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 375 treesize of output 361 [2022-11-23 16:16:41,079 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:16:41,080 INFO L350 Elim1Store]: Elim1 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 438 treesize of output 386 [2022-11-23 16:16:41,104 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:16:41,104 INFO L350 Elim1Store]: Elim1 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 382 treesize of output 358 [2022-11-23 16:16:41,642 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:16:41,643 INFO L350 Elim1Store]: Elim1 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 134 treesize of output 98 [2022-11-23 16:16:41,670 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:16:41,671 INFO L350 Elim1Store]: Elim1 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 1272 treesize of output 1228 [2022-11-23 16:16:41,706 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:16:41,706 INFO L350 Elim1Store]: Elim1 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 1224 treesize of output 1164 [2022-11-23 16:16:41,746 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:16:41,746 INFO L350 Elim1Store]: Elim1 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 1160 treesize of output 1036 [2022-11-23 16:16:41,791 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:16:41,792 INFO L350 Elim1Store]: Elim1 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 909 treesize of output 881 [2022-11-23 16:16:42,855 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:16:42,856 INFO L350 Elim1Store]: Elim1 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 98 treesize of output 74 [2022-11-23 16:16:42,886 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:16:42,887 INFO L350 Elim1Store]: Elim1 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 3730 treesize of output 3606 [2022-11-23 16:16:42,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:16:42,937 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 2960 treesize of output 2880 [2022-11-23 16:16:42,978 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:16:42,978 INFO L350 Elim1Store]: Elim1 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 3522 treesize of output 3366 [2022-11-23 16:16:43,048 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:16:43,049 INFO L350 Elim1Store]: Elim1 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 3362 treesize of output 3046 [2022-11-23 16:16:44,140 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:16:44,140 INFO L350 Elim1Store]: Elim1 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 128 treesize of output 92 [2022-11-23 16:16:44,164 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:16:44,164 INFO L350 Elim1Store]: Elim1 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 498 treesize of output 478 [2022-11-23 16:16:44,190 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:16:44,190 INFO L350 Elim1Store]: Elim1 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 470 treesize of output 410 [2022-11-23 16:16:44,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:16:44,210 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 329 treesize of output 309 [2022-11-23 16:16:44,231 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:16:44,231 INFO L350 Elim1Store]: Elim1 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 370 treesize of output 342 [2022-11-23 16:16:44,745 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:16:44,745 INFO L350 Elim1Store]: Elim1 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 189 treesize of output 129 [2022-11-23 16:16:44,775 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:16:44,776 INFO L350 Elim1Store]: Elim1 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 1572 treesize of output 1512 [2022-11-23 16:16:44,818 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:16:44,819 INFO L350 Elim1Store]: Elim1 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 1502 treesize of output 1426 [2022-11-23 16:16:44,882 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:16:44,883 INFO L350 Elim1Store]: Elim1 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 1410 treesize of output 1254 [2022-11-23 16:16:44,963 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:16:44,963 INFO L350 Elim1Store]: Elim1 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 881 treesize of output 845 [2022-11-23 16:16:46,925 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:16:46,926 INFO L350 Elim1Store]: Elim1 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 147 [2022-11-23 16:16:46,957 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:16:46,957 INFO L350 Elim1Store]: Elim1 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 1687 treesize of output 1611 [2022-11-23 16:16:47,000 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:16:47,001 INFO L350 Elim1Store]: Elim1 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 1593 treesize of output 1389 [2022-11-23 16:16:47,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:16:47,037 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 796 treesize of output 730 [2022-11-23 16:16:47,067 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:16:47,068 INFO L350 Elim1Store]: Elim1 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 1263 treesize of output 1163 [2022-11-23 16:16:49,186 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:16:49,186 INFO L350 Elim1Store]: Elim1 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 157 treesize of output 109 [2022-11-23 16:16:49,235 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:16:49,236 INFO L350 Elim1Store]: Elim1 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 616 treesize of output 592 [2022-11-23 16:16:49,264 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:16:49,265 INFO L350 Elim1Store]: Elim1 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 584 treesize of output 516 [2022-11-23 16:16:49,296 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:16:49,296 INFO L350 Elim1Store]: Elim1 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 496 treesize of output 464 [2022-11-23 16:16:49,349 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 16:16:49,350 INFO L350 Elim1Store]: Elim1 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 295 treesize of output 281 [2022-11-23 16:16:50,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:16:50,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160210895] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:16:50,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1284731497] [2022-11-23 16:16:50,767 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 16:16:50,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:16:50,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2022-11-23 16:16:50,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048436975] [2022-11-23 16:16:50,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:16:50,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-23 16:16:50,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:16:50,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-23 16:16:50,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=804, Unknown=2, NotChecked=118, Total=1056 [2022-11-23 16:16:50,769 INFO L87 Difference]: Start difference. First operand 472 states and 1482 transitions. Second operand has 33 states, 32 states have (on average 2.25) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:16:54,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:16:54,223 INFO L93 Difference]: Finished difference Result 756 states and 2375 transitions. [2022-11-23 16:16:54,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-23 16:16:54,224 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.25) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 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 24 [2022-11-23 16:16:54,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:16:54,228 INFO L225 Difference]: With dead ends: 756 [2022-11-23 16:16:54,229 INFO L226 Difference]: Without dead ends: 742 [2022-11-23 16:16:54,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=319, Invalid=1667, Unknown=2, NotChecked=174, Total=2162 [2022-11-23 16:16:54,230 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 214 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 185 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-23 16:16:54,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 158 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1406 Invalid, 0 Unknown, 185 Unchecked, 1.9s Time] [2022-11-23 16:16:54,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2022-11-23 16:16:54,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 486. [2022-11-23 16:16:54,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 485 states have (on average 3.156701030927835) internal successors, (1531), 485 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:16:54,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1531 transitions. [2022-11-23 16:16:54,248 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1531 transitions. Word has length 24 [2022-11-23 16:16:54,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:16:54,249 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 1531 transitions. [2022-11-23 16:16:54,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.25) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:16:54,249 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1531 transitions. [2022-11-23 16:16:54,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 16:16:54,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:16:54,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:16:54,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 16:16:54,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:16:54,457 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-23 16:16:54,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:16:54,457 INFO L85 PathProgramCache]: Analyzing trace with hash 2104682507, now seen corresponding path program 8 times [2022-11-23 16:16:54,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:16:54,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712921304] [2022-11-23 16:16:54,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:16:54,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:16:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:16:55,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:16:55,845 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:16:55,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712921304] [2022-11-23 16:16:55,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712921304] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:16:55,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365280950] [2022-11-23 16:16:55,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 16:16:55,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:16:55,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:16:55,847 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:16:55,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 16:16:55,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 16:16:55,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:16:55,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-23 16:16:56,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:16:56,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:16:56,434 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 22 [2022-11-23 16:16:56,823 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-23 16:16:56,823 INFO L350 Elim1Store]: Elim1 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 115 treesize of output 85 [2022-11-23 16:16:57,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:16:57,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:16:58,236 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:16:58,236 INFO L350 Elim1Store]: Elim1 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 101 treesize of output 81 [2022-11-23 16:16:58,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2022-11-23 16:16:58,305 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:16:58,305 INFO L350 Elim1Store]: Elim1 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 155 treesize of output 119 [2022-11-23 16:16:58,319 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:16:58,319 INFO L350 Elim1Store]: Elim1 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 95 treesize of output 90 [2022-11-23 16:16:58,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 71 [2022-11-23 16:16:58,489 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-23 16:16:58,489 INFO L350 Elim1Store]: Elim1 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 171 treesize of output 127 [2022-11-23 16:16:58,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 99 [2022-11-23 16:16:58,512 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-23 16:16:58,513 INFO L350 Elim1Store]: Elim1 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 99 treesize of output 92 [2022-11-23 16:16:58,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:16:58,584 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-23 16:16:58,585 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 79 treesize of output 1 [2022-11-23 16:16:58,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:16:58,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365280950] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:16:58,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2000585695] [2022-11-23 16:16:58,982 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 16:16:58,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:16:58,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2022-11-23 16:16:58,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735523495] [2022-11-23 16:16:58,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:16:58,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-23 16:16:58,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:16:58,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-23 16:16:58,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=903, Unknown=3, NotChecked=0, Total=1056 [2022-11-23 16:16:58,987 INFO L87 Difference]: Start difference. First operand 486 states and 1531 transitions. Second operand has 33 states, 32 states have (on average 2.25) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:17:01,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:17:01,345 INFO L93 Difference]: Finished difference Result 742 states and 2270 transitions. [2022-11-23 16:17:01,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 16:17:01,346 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.25) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 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 24 [2022-11-23 16:17:01,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:17:01,352 INFO L225 Difference]: With dead ends: 742 [2022-11-23 16:17:01,352 INFO L226 Difference]: Without dead ends: 728 [2022-11-23 16:17:01,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=429, Invalid=1730, Unknown=3, NotChecked=0, Total=2162 [2022-11-23 16:17:01,353 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 195 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-23 16:17:01,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 34 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-23 16:17:01,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-11-23 16:17:01,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 506. [2022-11-23 16:17:01,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 505 states have (on average 3.1445544554455447) internal successors, (1588), 505 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:17:01,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 1588 transitions. [2022-11-23 16:17:01,372 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 1588 transitions. Word has length 24 [2022-11-23 16:17:01,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:17:01,373 INFO L495 AbstractCegarLoop]: Abstraction has 506 states and 1588 transitions. [2022-11-23 16:17:01,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.25) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:17:01,373 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 1588 transitions. [2022-11-23 16:17:01,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 16:17:01,375 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:17:01,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:17:01,381 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 16:17:01,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-23 16:17:01,581 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-23 16:17:01,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:17:01,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1669274395, now seen corresponding path program 9 times [2022-11-23 16:17:01,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:17:01,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604674540] [2022-11-23 16:17:01,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:17:01,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:17:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:17:02,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:17:02,952 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:17:02,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604674540] [2022-11-23 16:17:02,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604674540] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:17:02,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597232034] [2022-11-23 16:17:02,953 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 16:17:02,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:17:02,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:17:02,955 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:17:02,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 16:17:03,105 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 16:17:03,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:17:03,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-23 16:17:03,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:17:03,815 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:17:03,816 INFO L350 Elim1Store]: Elim1 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 119 treesize of output 101 [2022-11-23 16:17:04,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:17:04,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:17:04,924 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:17:04,924 INFO L350 Elim1Store]: Elim1 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 125 treesize of output 73 [2022-11-23 16:17:04,984 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-23 16:17:04,985 INFO L350 Elim1Store]: Elim1 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 116 treesize of output 56 [2022-11-23 16:17:05,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:17:05,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597232034] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:17:05,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [216473339] [2022-11-23 16:17:05,507 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 16:17:05,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:17:05,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 32 [2022-11-23 16:17:05,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416012174] [2022-11-23 16:17:05,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:17:05,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-23 16:17:05,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:17:05,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-23 16:17:05,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2022-11-23 16:17:05,508 INFO L87 Difference]: Start difference. First operand 506 states and 1588 transitions. Second operand has 34 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:17:07,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:17:07,164 INFO L93 Difference]: Finished difference Result 713 states and 2153 transitions. [2022-11-23 16:17:07,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 16:17:07,164 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 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 24 [2022-11-23 16:17:07,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:17:07,168 INFO L225 Difference]: With dead ends: 713 [2022-11-23 16:17:07,168 INFO L226 Difference]: Without dead ends: 706 [2022-11-23 16:17:07,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=393, Invalid=1587, Unknown=0, NotChecked=0, Total=1980 [2022-11-23 16:17:07,170 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 158 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-23 16:17:07,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 46 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-23 16:17:07,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2022-11-23 16:17:07,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 516. [2022-11-23 16:17:07,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 515 states have (on average 3.1359223300970873) internal successors, (1615), 515 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:17:07,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 1615 transitions. [2022-11-23 16:17:07,188 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 1615 transitions. Word has length 24 [2022-11-23 16:17:07,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:17:07,188 INFO L495 AbstractCegarLoop]: Abstraction has 516 states and 1615 transitions. [2022-11-23 16:17:07,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:17:07,189 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 1615 transitions. [2022-11-23 16:17:07,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 16:17:07,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:17:07,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:17:07,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-23 16:17:07,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-23 16:17:07,396 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-23 16:17:07,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:17:07,397 INFO L85 PathProgramCache]: Analyzing trace with hash 998034879, now seen corresponding path program 10 times [2022-11-23 16:17:07,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:17:07,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455571957] [2022-11-23 16:17:07,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:17:07,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:17:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:17:08,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:17:08,751 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:17:08,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455571957] [2022-11-23 16:17:08,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455571957] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:17:08,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720173916] [2022-11-23 16:17:08,751 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 16:17:08,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:17:08,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:17:08,752 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:17:08,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-23 16:17:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:17:08,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-23 16:17:08,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:17:09,557 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-23 16:17:09,557 INFO L350 Elim1Store]: Elim1 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 115 treesize of output 85 [2022-11-23 16:17:09,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:17:09,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:17:10,464 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:17:10,464 INFO L350 Elim1Store]: Elim1 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 125 treesize of output 65 [2022-11-23 16:17:10,525 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-23 16:17:10,525 INFO L350 Elim1Store]: Elim1 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 143 treesize of output 67 [2022-11-23 16:17:10,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:17:10,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720173916] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:17:10,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1531454845] [2022-11-23 16:17:10,859 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 16:17:10,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:17:10,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 27 [2022-11-23 16:17:10,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144982439] [2022-11-23 16:17:10,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:17:10,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-23 16:17:10,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:17:10,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-23 16:17:10,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2022-11-23 16:17:10,861 INFO L87 Difference]: Start difference. First operand 516 states and 1615 transitions. Second operand has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:17:13,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:17:13,376 INFO L93 Difference]: Finished difference Result 732 states and 2279 transitions. [2022-11-23 16:17:13,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-23 16:17:13,376 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 0 states have call successors, (0), 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 24 [2022-11-23 16:17:13,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:17:13,380 INFO L225 Difference]: With dead ends: 732 [2022-11-23 16:17:13,381 INFO L226 Difference]: Without dead ends: 718 [2022-11-23 16:17:13,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=430, Invalid=1732, Unknown=0, NotChecked=0, Total=2162 [2022-11-23 16:17:13,382 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 193 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:17:13,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 84 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-23 16:17:13,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2022-11-23 16:17:13,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 502. [2022-11-23 16:17:13,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 501 states have (on average 3.151696606786427) internal successors, (1579), 501 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:17:13,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 1579 transitions. [2022-11-23 16:17:13,399 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 1579 transitions. Word has length 24 [2022-11-23 16:17:13,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:17:13,400 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 1579 transitions. [2022-11-23 16:17:13,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:17:13,400 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 1579 transitions. [2022-11-23 16:17:13,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 16:17:13,402 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:17:13,402 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:17:13,411 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-23 16:17:13,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-23 16:17:13,608 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-23 16:17:13,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:17:13,608 INFO L85 PathProgramCache]: Analyzing trace with hash 2107270213, now seen corresponding path program 11 times [2022-11-23 16:17:13,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:17:13,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975900804] [2022-11-23 16:17:13,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:17:13,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:17:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:17:15,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:17:15,153 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:17:15,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975900804] [2022-11-23 16:17:15,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975900804] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:17:15,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453469472] [2022-11-23 16:17:15,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 16:17:15,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:17:15,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:17:15,155 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:17:15,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-23 16:17:15,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 16:17:15,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:17:15,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-23 16:17:15,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:17:15,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:17:15,772 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 22 [2022-11-23 16:17:16,110 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-23 16:17:16,111 INFO L350 Elim1Store]: Elim1 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 115 treesize of output 85 [2022-11-23 16:17:16,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:17:16,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:17:18,208 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:17:18,208 INFO L350 Elim1Store]: Elim1 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 153 treesize of output 149 [2022-11-23 16:17:18,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 93 [2022-11-23 16:17:18,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 81 [2022-11-23 16:17:18,722 INFO L321 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-11-23 16:17:18,722 INFO L350 Elim1Store]: Elim1 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 275 treesize of output 227 [2022-11-23 16:17:18,745 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:17:18,745 INFO L350 Elim1Store]: Elim1 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 191 treesize of output 180 [2022-11-23 16:17:18,764 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:17:18,765 INFO L350 Elim1Store]: Elim1 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 167 treesize of output 162 [2022-11-23 16:17:19,155 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:17:19,166 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-23 16:17:19,167 INFO L350 Elim1Store]: Elim1 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 56 treesize of output 28 [2022-11-23 16:17:19,221 INFO L321 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-11-23 16:17:19,221 INFO L350 Elim1Store]: Elim1 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 227 treesize of output 187 [2022-11-23 16:17:19,240 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:17:19,240 INFO L350 Elim1Store]: Elim1 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 151 treesize of output 146 [2022-11-23 16:17:19,261 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:17:19,261 INFO L350 Elim1Store]: Elim1 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 133 treesize of output 128 [2022-11-23 16:17:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:17:20,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453469472] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:17:20,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1452612607] [2022-11-23 16:17:20,146 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 16:17:20,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:17:20,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 30 [2022-11-23 16:17:20,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655069080] [2022-11-23 16:17:20,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:17:20,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-23 16:17:20,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:17:20,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-23 16:17:20,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=827, Unknown=1, NotChecked=0, Total=992 [2022-11-23 16:17:20,150 INFO L87 Difference]: Start difference. First operand 502 states and 1579 transitions. Second operand has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 31 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:17:26,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:17:26,616 INFO L93 Difference]: Finished difference Result 1151 states and 3479 transitions. [2022-11-23 16:17:26,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-23 16:17:26,617 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 31 states have internal predecessors, (72), 0 states have call successors, (0), 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 24 [2022-11-23 16:17:26,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:17:26,621 INFO L225 Difference]: With dead ends: 1151 [2022-11-23 16:17:26,621 INFO L226 Difference]: Without dead ends: 1109 [2022-11-23 16:17:26,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=700, Invalid=2959, Unknown=1, NotChecked=0, Total=3660 [2022-11-23 16:17:26,622 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 283 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 2033 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 2060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-23 16:17:26,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 158 Invalid, 2060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2033 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-23 16:17:26,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2022-11-23 16:17:26,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 519. [2022-11-23 16:17:26,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 518 states have (on average 3.1814671814671813) internal successors, (1648), 518 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:17:26,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 1648 transitions. [2022-11-23 16:17:26,643 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 1648 transitions. Word has length 24 [2022-11-23 16:17:26,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:17:26,644 INFO L495 AbstractCegarLoop]: Abstraction has 519 states and 1648 transitions. [2022-11-23 16:17:26,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 31 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:17:26,644 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 1648 transitions. [2022-11-23 16:17:26,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 16:17:26,646 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:17:26,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:17:26,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-23 16:17:26,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:17:26,852 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-23 16:17:26,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:17:26,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1396871529, now seen corresponding path program 12 times [2022-11-23 16:17:26,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:17:26,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058890262] [2022-11-23 16:17:26,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:17:26,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:17:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:17:28,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:17:28,085 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:17:28,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058890262] [2022-11-23 16:17:28,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058890262] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:17:28,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216786762] [2022-11-23 16:17:28,085 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 16:17:28,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:17:28,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:17:28,087 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:17:28,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-23 16:17:28,231 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 16:17:28,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:17:28,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-23 16:17:28,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:17:28,957 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-23 16:17:28,957 INFO L350 Elim1Store]: Elim1 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 115 treesize of output 85 [2022-11-23 16:17:29,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:17:29,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:17:29,588 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:17:29,589 INFO L350 Elim1Store]: Elim1 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 191 treesize of output 123 [2022-11-23 16:17:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:17:30,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216786762] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:17:30,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1169587064] [2022-11-23 16:17:30,191 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:1621) 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:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2022-11-23 16:17:30,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:17:30,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 29 [2022-11-23 16:17:30,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325799789] [2022-11-23 16:17:30,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:17:30,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-23 16:17:30,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:17:30,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-23 16:17:30,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2022-11-23 16:17:30,194 INFO L87 Difference]: Start difference. First operand 519 states and 1648 transitions. Second operand has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:17:31,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:17:31,849 INFO L93 Difference]: Finished difference Result 736 states and 2314 transitions. [2022-11-23 16:17:31,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 16:17:31,849 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 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 24 [2022-11-23 16:17:31,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:17:31,852 INFO L225 Difference]: With dead ends: 736 [2022-11-23 16:17:31,852 INFO L226 Difference]: Without dead ends: 729 [2022-11-23 16:17:31,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=288, Invalid=1352, Unknown=0, NotChecked=0, Total=1640 [2022-11-23 16:17:31,855 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 141 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-23 16:17:31,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 47 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-23 16:17:31,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2022-11-23 16:17:31,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 527. [2022-11-23 16:17:31,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 3.182509505703422) internal successors, (1674), 526 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:17:31,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 1674 transitions. [2022-11-23 16:17:31,871 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 1674 transitions. Word has length 24 [2022-11-23 16:17:31,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:17:31,872 INFO L495 AbstractCegarLoop]: Abstraction has 527 states and 1674 transitions. [2022-11-23 16:17:31,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:17:31,872 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 1674 transitions. [2022-11-23 16:17:31,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 16:17:31,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:17:31,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:17:31,886 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-23 16:17:32,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-23 16:17:32,080 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-23 16:17:32,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:17:32,081 INFO L85 PathProgramCache]: Analyzing trace with hash -2031218195, now seen corresponding path program 13 times [2022-11-23 16:17:32,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:17:32,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840855398] [2022-11-23 16:17:32,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:17:32,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:17:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:17:33,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:17:33,395 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:17:33,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840855398] [2022-11-23 16:17:33,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840855398] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:17:33,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306450882] [2022-11-23 16:17:33,395 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 16:17:33,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:17:33,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:17:33,397 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:17:33,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3b551ff-c3b8-448d-bf94-46f0ba11bb6a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-23 16:17:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:17:33,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-23 16:17:33,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:17:33,635 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 16:17:33,702 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 16:17:33,771 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 16:17:33,897 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 16:17:34,539 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-23 16:17:34,539 INFO L350 Elim1Store]: Elim1 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 125 treesize of output 85 [2022-11-23 16:17:34,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:17:34,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:17:36,923 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_679 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_679) c_~A~0.base))) (let ((.cse1 (select .cse0 c_~A~0.offset))) (or (forall ((~M~0 Int)) (or (<= (+ c_~sum~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~mts2~0) 0) (< |c_thread2Thread1of1ForFork2_~i~1#1| ~M~0) (< (+ ~M~0 1) c_~N~0))) (not (< (+ c_~mts1~0 .cse1) 0)) (not (<= 0 (+ c_~mts1~0 .cse1 2147483648))))))) (forall ((v_ArrVal_679 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_679) c_~A~0.base))) (let ((.cse2 (+ c_~mts1~0 (select .cse5 c_~A~0.offset)))) (or (not (<= .cse2 2147483647)) (< .cse2 0) (forall ((~M~0 Int)) (let ((.cse3 (select .cse5 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse4 (+ c_~mts3~0 .cse3))) (or (= (+ c_~sum~0 .cse3 c_~mts2~0) .cse2) (< |c_thread2Thread1of1ForFork2_~i~1#1| ~M~0) (< .cse4 0) (= .cse2 .cse4) (< (+ ~M~0 1) c_~N~0))))))))) (forall ((v_ArrVal_679 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_679) c_~A~0.base))) (let ((.cse7 (+ c_~mts1~0 (select .cse6 c_~A~0.offset)))) (or (forall ((~M~0 Int)) (or (< |c_thread2Thread1of1ForFork2_~i~1#1| ~M~0) (< (+ ~M~0 1) c_~N~0) (<= (+ c_~sum~0 (select .cse6 (+ c_~A~0.offset (* ~M~0 4))) c_~mts2~0) .cse7))) (not (<= .cse7 2147483647)) (< .cse7 0))))) (or (forall ((v_ArrVal_679 (Array Int Int)) (~M~0 Int)) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_679) c_~A~0.base))) (let ((.cse8 (+ c_~mts1~0 (select .cse10 c_~A~0.offset))) (.cse9 (+ c_~mts3~0 (select .cse10 (+ c_~A~0.offset (* ~M~0 4)))))) (or (not (<= .cse8 2147483647)) (< |c_thread2Thread1of1ForFork2_~i~1#1| ~M~0) (< .cse9 0) (< .cse8 0) (= .cse8 .cse9) (< (+ ~M~0 1) c_~N~0))))) (< c_~mts3~0 (+ c_~sum~0 c_~mts2~0))) (forall ((v_ArrVal_679 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_679) c_~A~0.base))) (let ((.cse11 (select .cse13 c_~A~0.offset))) (or (not (< (+ c_~mts1~0 .cse11) 0)) (not (<= 0 (+ c_~mts1~0 .cse11 2147483648))) (forall ((~M~0 Int)) (let ((.cse12 (+ c_~mts3~0 (select .cse13 (+ c_~A~0.offset (* ~M~0 4)))))) (or (= .cse12 0) (< |c_thread2Thread1of1ForFork2_~i~1#1| ~M~0) (< .cse12 0) (< (+ ~M~0 1) c_~N~0)))))))) (forall ((v_ArrVal_679 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_679) c_~A~0.base))) (let ((.cse14 (+ c_~mts1~0 (select .cse16 c_~A~0.offset)))) (or (= .cse14 0) (not (<= .cse14 2147483647)) (forall ((~M~0 Int)) (let ((.cse15 (select .cse16 (+ c_~A~0.offset (* ~M~0 4))))) (or (= (+ c_~sum~0 .cse15 c_~mts2~0) .cse14) (< |c_thread2Thread1of1ForFork2_~i~1#1| ~M~0) (not (< (+ c_~mts3~0 .cse15) 0)) (< (+ ~M~0 1) c_~N~0)))) (< .cse14 0)))))) is different from false [2022-11-23 16:17:38,732 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:17:38,732 INFO L350 Elim1Store]: Elim1 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 189 treesize of output 129 [2022-11-23 16:17:38,766 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:17:38,767 INFO L350 Elim1Store]: Elim1 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 12940 treesize of output 12438 [2022-11-23 16:17:38,878 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:17:38,879 INFO L350 Elim1Store]: Elim1 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 12428 treesize of output 11798 [2022-11-23 16:17:39,012 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:17:39,013 INFO L350 Elim1Store]: Elim1 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 11788 treesize of output 11478 [2022-11-23 16:17:39,105 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:17:39,106 INFO L350 Elim1Store]: Elim1 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 11468 treesize of output 10198