./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c6847e0a77224cc67de11826c53270ee36a6eb5754e5add0bb0a49165dff2879 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 20:31:52,886 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 20:31:52,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 20:31:52,942 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 20:31:52,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 20:31:52,946 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 20:31:52,948 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 20:31:52,952 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 20:31:52,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 20:31:52,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 20:31:52,961 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 20:31:52,963 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 20:31:52,963 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 20:31:52,966 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 20:31:52,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 20:31:52,976 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 20:31:52,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 20:31:52,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 20:31:52,982 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 20:31:52,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 20:31:52,994 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 20:31:52,999 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 20:31:53,002 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 20:31:53,003 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 20:31:53,012 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 20:31:53,013 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 20:31:53,013 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 20:31:53,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 20:31:53,016 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 20:31:53,018 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 20:31:53,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 20:31:53,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 20:31:53,022 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 20:31:53,023 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 20:31:53,024 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 20:31:53,025 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 20:31:53,025 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 20:31:53,026 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 20:31:53,026 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 20:31:53,027 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 20:31:53,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 20:31:53,028 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-25 20:31:53,079 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 20:31:53,079 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 20:31:53,080 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 20:31:53,080 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 20:31:53,087 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 20:31:53,087 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 20:31:53,087 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 20:31:53,088 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 20:31:53,088 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 20:31:53,088 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 20:31:53,089 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 20:31:53,089 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 20:31:53,090 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 20:31:53,090 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 20:31:53,090 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 20:31:53,090 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 20:31:53,091 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 20:31:53,091 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 20:31:53,092 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 20:31:53,093 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 20:31:53,093 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 20:31:53,093 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 20:31:53,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 20:31:53,093 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 20:31:53,094 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 20:31:53,094 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 20:31:53,094 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 20:31:53,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 20:31:53,095 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 20:31:53,095 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 20:31:53,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 20:31:53,095 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 20:31:53,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 20:31:53,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 20:31:53,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 20:31:53,096 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 20:31:53,097 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 20:31:53,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 20:31:53,097 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 20:31:53,097 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 20:31:53,098 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 20:31:53,098 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c6847e0a77224cc67de11826c53270ee36a6eb5754e5add0bb0a49165dff2879 [2021-11-25 20:31:53,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 20:31:53,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 20:31:53,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 20:31:53,399 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 20:31:53,400 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 20:31:53,401 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c [2021-11-25 20:31:53,489 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/data/258da3cce/9d33a6b622a241c18d5872555f03a81e/FLAGa5f0cc204 [2021-11-25 20:31:53,962 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 20:31:53,963 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c [2021-11-25 20:31:53,971 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/data/258da3cce/9d33a6b622a241c18d5872555f03a81e/FLAGa5f0cc204 [2021-11-25 20:31:54,337 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/data/258da3cce/9d33a6b622a241c18d5872555f03a81e [2021-11-25 20:31:54,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 20:31:54,341 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 20:31:54,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 20:31:54,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 20:31:54,346 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 20:31:54,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:31:54" (1/1) ... [2021-11-25 20:31:54,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42ca2452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:31:54, skipping insertion in model container [2021-11-25 20:31:54,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:31:54" (1/1) ... [2021-11-25 20:31:54,355 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 20:31:54,376 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 20:31:54,572 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c[3615,3628] [2021-11-25 20:31:54,581 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 20:31:54,589 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 20:31:54,622 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c[3615,3628] [2021-11-25 20:31:54,630 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 20:31:54,643 INFO L208 MainTranslator]: Completed translation [2021-11-25 20:31:54,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:31:54 WrapperNode [2021-11-25 20:31:54,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 20:31:54,645 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 20:31:54,645 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 20:31:54,645 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 20:31:54,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:31:54" (1/1) ... [2021-11-25 20:31:54,667 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:31:54" (1/1) ... [2021-11-25 20:31:54,701 INFO L137 Inliner]: procedures = 26, calls = 55, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 257 [2021-11-25 20:31:54,707 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 20:31:54,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 20:31:54,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 20:31:54,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 20:31:54,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:31:54" (1/1) ... [2021-11-25 20:31:54,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:31:54" (1/1) ... [2021-11-25 20:31:54,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:31:54" (1/1) ... [2021-11-25 20:31:54,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:31:54" (1/1) ... [2021-11-25 20:31:54,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:31:54" (1/1) ... [2021-11-25 20:31:54,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:31:54" (1/1) ... [2021-11-25 20:31:54,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:31:54" (1/1) ... [2021-11-25 20:31:54,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 20:31:54,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 20:31:54,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 20:31:54,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 20:31:54,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:31:54" (1/1) ... [2021-11-25 20:31:54,793 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 20:31:54,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:31:54,820 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 20:31:54,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 20:31:54,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 20:31:54,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 20:31:54,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-25 20:31:54,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-25 20:31:54,872 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-11-25 20:31:54,873 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-11-25 20:31:54,873 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-11-25 20:31:54,873 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-11-25 20:31:54,873 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-11-25 20:31:54,873 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-11-25 20:31:54,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 20:31:54,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-25 20:31:54,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-25 20:31:54,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-25 20:31:54,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 20:31:54,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 20:31:54,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 20:31:54,876 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-25 20:31:55,031 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 20:31:55,035 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 20:31:55,504 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 20:31:55,628 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 20:31:55,628 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-11-25 20:31:55,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:31:55 BoogieIcfgContainer [2021-11-25 20:31:55,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 20:31:55,645 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 20:31:55,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 20:31:55,652 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 20:31:55,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:31:54" (1/3) ... [2021-11-25 20:31:55,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b10345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:31:55, skipping insertion in model container [2021-11-25 20:31:55,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:31:54" (2/3) ... [2021-11-25 20:31:55,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b10345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:31:55, skipping insertion in model container [2021-11-25 20:31:55,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:31:55" (3/3) ... [2021-11-25 20:31:55,655 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-3-nl.wvr.c [2021-11-25 20:31:55,662 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-25 20:31:55,663 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 20:31:55,663 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-25 20:31:55,663 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-25 20:31:55,724 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,725 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,725 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,725 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,725 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,726 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,726 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,726 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,726 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,727 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,727 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,727 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,727 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,728 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,728 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,729 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,729 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,729 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,729 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,730 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,730 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,730 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,730 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,731 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,731 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,731 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,731 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,732 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,732 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,732 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,732 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,733 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,733 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,733 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,733 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,734 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,734 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,734 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,735 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,735 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,735 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,735 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,736 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,736 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,736 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,736 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,736 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,737 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,737 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,737 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,737 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,738 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,738 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,738 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,739 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,739 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,739 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,739 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,740 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,740 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,740 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,740 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,741 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,741 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,741 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,741 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,742 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,742 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,742 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,743 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,743 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,743 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,744 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,744 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,744 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,744 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,744 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,745 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,745 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,745 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,745 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,746 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,746 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,746 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,747 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,747 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,747 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,747 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,748 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,748 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,751 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,751 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,751 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,752 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,752 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,752 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,752 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,753 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,753 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,753 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,754 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,754 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,755 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,755 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~j~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,755 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,755 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,755 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,756 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,756 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,757 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,757 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,757 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,757 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,758 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,758 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,758 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~k~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:31:55,762 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-11-25 20:31:55,809 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 20:31:55,816 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-25 20:31:55,816 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-11-25 20:31:55,834 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-25 20:31:55,848 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 215 places, 223 transitions, 470 flow [2021-11-25 20:31:55,851 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 215 places, 223 transitions, 470 flow [2021-11-25 20:31:55,853 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 215 places, 223 transitions, 470 flow [2021-11-25 20:31:55,946 INFO L129 PetriNetUnfolder]: 18/220 cut-off events. [2021-11-25 20:31:55,946 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-11-25 20:31:55,951 INFO L84 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 220 events. 18/220 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 125 event pairs, 0 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 180. Up to 3 conditions per place. [2021-11-25 20:31:55,955 INFO L116 LiptonReduction]: Number of co-enabled transitions 1880 [2021-11-25 20:32:04,644 INFO L131 LiptonReduction]: Checked pairs total: 2709 [2021-11-25 20:32:04,644 INFO L133 LiptonReduction]: Total number of compositions: 230 [2021-11-25 20:32:04,670 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 32 transitions, 88 flow [2021-11-25 20:32:04,703 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 138 states, 137 states have (on average 3.343065693430657) internal successors, (458), 137 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:04,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 137 states have (on average 3.343065693430657) internal successors, (458), 137 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:04,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 20:32:04,727 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:32:04,728 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:32:04,729 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 20:32:04,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:32:04,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1033417945, now seen corresponding path program 1 times [2021-11-25 20:32:04,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:32:04,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158872708] [2021-11-25 20:32:04,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:32:04,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:32:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:05,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:32:05,032 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:32:05,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158872708] [2021-11-25 20:32:05,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158872708] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:32:05,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:32:05,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 20:32:05,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180556771] [2021-11-25 20:32:05,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:32:05,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-25 20:32:05,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:32:05,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-25 20:32:05,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-25 20:32:05,071 INFO L87 Difference]: Start difference. First operand has 138 states, 137 states have (on average 3.343065693430657) internal successors, (458), 137 states have internal predecessors, (458), 0 states have call successors, (0), 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 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:05,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:32:05,153 INFO L93 Difference]: Finished difference Result 138 states and 428 transitions. [2021-11-25 20:32:05,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-25 20:32:05,156 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-25 20:32:05,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:32:05,172 INFO L225 Difference]: With dead ends: 138 [2021-11-25 20:32:05,172 INFO L226 Difference]: Without dead ends: 138 [2021-11-25 20:32:05,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-25 20:32:05,179 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:32:05,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:32:05,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-11-25 20:32:05,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2021-11-25 20:32:05,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 3.124087591240876) internal successors, (428), 137 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:05,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 428 transitions. [2021-11-25 20:32:05,224 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 428 transitions. Word has length 21 [2021-11-25 20:32:05,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:32:05,225 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 428 transitions. [2021-11-25 20:32:05,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 428 transitions. [2021-11-25 20:32:05,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-25 20:32:05,228 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:32:05,228 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:32:05,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 20:32:05,229 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 20:32:05,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:32:05,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1640744137, now seen corresponding path program 1 times [2021-11-25 20:32:05,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:32:05,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881239618] [2021-11-25 20:32:05,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:32:05,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:32:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:05,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:32:05,375 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:32:05,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881239618] [2021-11-25 20:32:05,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881239618] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:32:05,375 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:32:05,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:32:05,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949851613] [2021-11-25 20:32:05,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:32:05,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:32:05,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:32:05,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:32:05,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:32:05,379 INFO L87 Difference]: Start difference. First operand 138 states and 428 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:05,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:32:05,493 INFO L93 Difference]: Finished difference Result 177 states and 515 transitions. [2021-11-25 20:32:05,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:32:05,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-11-25 20:32:05,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:32:05,498 INFO L225 Difference]: With dead ends: 177 [2021-11-25 20:32:05,498 INFO L226 Difference]: Without dead ends: 139 [2021-11-25 20:32:05,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:32:05,500 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 10 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:32:05,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 3 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:32:05,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-11-25 20:32:05,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-11-25 20:32:05,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 3.108695652173913) internal successors, (429), 138 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:05,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 429 transitions. [2021-11-25 20:32:05,521 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 429 transitions. Word has length 22 [2021-11-25 20:32:05,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:32:05,522 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 429 transitions. [2021-11-25 20:32:05,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:05,522 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 429 transitions. [2021-11-25 20:32:05,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-25 20:32:05,524 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:32:05,524 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:32:05,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-25 20:32:05,525 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 20:32:05,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:32:05,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1854748050, now seen corresponding path program 1 times [2021-11-25 20:32:05,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:32:05,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700466299] [2021-11-25 20:32:05,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:32:05,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:32:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:05,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:32:05,638 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:32:05,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700466299] [2021-11-25 20:32:05,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700466299] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:32:05,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:32:05,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 20:32:05,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487489126] [2021-11-25 20:32:05,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:32:05,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:32:05,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:32:05,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:32:05,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:32:05,641 INFO L87 Difference]: Start difference. First operand 139 states and 429 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:05,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:32:05,753 INFO L93 Difference]: Finished difference Result 213 states and 614 transitions. [2021-11-25 20:32:05,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:32:05,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-25 20:32:05,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:32:05,758 INFO L225 Difference]: With dead ends: 213 [2021-11-25 20:32:05,758 INFO L226 Difference]: Without dead ends: 140 [2021-11-25 20:32:05,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-25 20:32:05,762 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 21 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:32:05,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 3 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:32:05,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-11-25 20:32:05,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2021-11-25 20:32:05,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 3.093525179856115) internal successors, (430), 139 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:05,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 430 transitions. [2021-11-25 20:32:05,797 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 430 transitions. Word has length 23 [2021-11-25 20:32:05,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:32:05,798 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 430 transitions. [2021-11-25 20:32:05,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:05,798 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 430 transitions. [2021-11-25 20:32:05,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 20:32:05,802 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:32:05,803 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:32:05,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-25 20:32:05,803 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 20:32:05,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:32:05,804 INFO L85 PathProgramCache]: Analyzing trace with hash -843547042, now seen corresponding path program 1 times [2021-11-25 20:32:05,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:32:05,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271346271] [2021-11-25 20:32:05,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:32:05,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:32:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:06,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 20:32:06,634 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:32:06,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271346271] [2021-11-25 20:32:06,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271346271] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:32:06,639 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:32:06,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-25 20:32:06,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367321612] [2021-11-25 20:32:06,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:32:06,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-25 20:32:06,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:32:06,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-25 20:32:06,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-25 20:32:06,640 INFO L87 Difference]: Start difference. First operand 140 states and 430 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:07,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:32:07,083 INFO L93 Difference]: Finished difference Result 269 states and 862 transitions. [2021-11-25 20:32:07,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 20:32:07,084 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 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 [2021-11-25 20:32:07,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:32:07,087 INFO L225 Difference]: With dead ends: 269 [2021-11-25 20:32:07,087 INFO L226 Difference]: Without dead ends: 262 [2021-11-25 20:32:07,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-25 20:32:07,089 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 48 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:32:07,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 6 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 20:32:07,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-11-25 20:32:07,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 196. [2021-11-25 20:32:07,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 3.066666666666667) internal successors, (598), 195 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:07,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 598 transitions. [2021-11-25 20:32:07,117 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 598 transitions. Word has length 24 [2021-11-25 20:32:07,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:32:07,118 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 598 transitions. [2021-11-25 20:32:07,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:07,118 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 598 transitions. [2021-11-25 20:32:07,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 20:32:07,121 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:32:07,121 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:32:07,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-25 20:32:07,121 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 20:32:07,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:32:07,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1655768830, now seen corresponding path program 2 times [2021-11-25 20:32:07,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:32:07,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076539204] [2021-11-25 20:32:07,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:32:07,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:32:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:07,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 20:32:07,700 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:32:07,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076539204] [2021-11-25 20:32:07,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076539204] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:32:07,701 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:32:07,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-25 20:32:07,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216717710] [2021-11-25 20:32:07,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:32:07,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-25 20:32:07,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:32:07,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-25 20:32:07,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-25 20:32:07,703 INFO L87 Difference]: Start difference. First operand 196 states and 598 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:08,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:32:08,098 INFO L93 Difference]: Finished difference Result 261 states and 835 transitions. [2021-11-25 20:32:08,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 20:32:08,099 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 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 [2021-11-25 20:32:08,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:32:08,102 INFO L225 Difference]: With dead ends: 261 [2021-11-25 20:32:08,102 INFO L226 Difference]: Without dead ends: 254 [2021-11-25 20:32:08,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-25 20:32:08,103 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 44 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:32:08,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 5 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 20:32:08,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-11-25 20:32:08,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 208. [2021-11-25 20:32:08,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 3.1256038647342996) internal successors, (647), 207 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:08,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 647 transitions. [2021-11-25 20:32:08,116 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 647 transitions. Word has length 24 [2021-11-25 20:32:08,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:32:08,117 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 647 transitions. [2021-11-25 20:32:08,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:08,117 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 647 transitions. [2021-11-25 20:32:08,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 20:32:08,118 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:32:08,118 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:32:08,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-25 20:32:08,119 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 20:32:08,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:32:08,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1880728252, now seen corresponding path program 3 times [2021-11-25 20:32:08,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:32:08,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114020702] [2021-11-25 20:32:08,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:32:08,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:32:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:08,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 20:32:08,202 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:32:08,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114020702] [2021-11-25 20:32:08,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114020702] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:32:08,203 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:32:08,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 20:32:08,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133041994] [2021-11-25 20:32:08,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:32:08,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:32:08,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:32:08,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:32:08,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:32:08,205 INFO L87 Difference]: Start difference. First operand 208 states and 647 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:08,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:32:08,261 INFO L93 Difference]: Finished difference Result 236 states and 708 transitions. [2021-11-25 20:32:08,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:32:08,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 [2021-11-25 20:32:08,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:32:08,264 INFO L225 Difference]: With dead ends: 236 [2021-11-25 20:32:08,265 INFO L226 Difference]: Without dead ends: 236 [2021-11-25 20:32:08,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:32:08,266 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 4 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:32:08,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 2 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:32:08,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-11-25 20:32:08,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2021-11-25 20:32:08,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 3.0127659574468084) internal successors, (708), 235 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:08,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 708 transitions. [2021-11-25 20:32:08,278 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 708 transitions. Word has length 24 [2021-11-25 20:32:08,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:32:08,278 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 708 transitions. [2021-11-25 20:32:08,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:08,279 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 708 transitions. [2021-11-25 20:32:08,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 20:32:08,280 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:32:08,280 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:32:08,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-25 20:32:08,281 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 20:32:08,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:32:08,281 INFO L85 PathProgramCache]: Analyzing trace with hash -782631612, now seen corresponding path program 4 times [2021-11-25 20:32:08,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:32:08,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775714649] [2021-11-25 20:32:08,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:32:08,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:32:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:08,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 20:32:08,357 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:32:08,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775714649] [2021-11-25 20:32:08,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775714649] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:32:08,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:32:08,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 20:32:08,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259611847] [2021-11-25 20:32:08,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:32:08,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:32:08,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:32:08,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:32:08,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:32:08,360 INFO L87 Difference]: Start difference. First operand 236 states and 708 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:08,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:32:08,409 INFO L93 Difference]: Finished difference Result 206 states and 584 transitions. [2021-11-25 20:32:08,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:32:08,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 [2021-11-25 20:32:08,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:32:08,412 INFO L225 Difference]: With dead ends: 206 [2021-11-25 20:32:08,413 INFO L226 Difference]: Without dead ends: 206 [2021-11-25 20:32:08,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:32:08,414 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 3 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:32:08,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 1 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 20:32:08,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-11-25 20:32:08,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2021-11-25 20:32:08,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 2.848780487804878) internal successors, (584), 205 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:08,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 584 transitions. [2021-11-25 20:32:08,424 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 584 transitions. Word has length 24 [2021-11-25 20:32:08,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:32:08,425 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 584 transitions. [2021-11-25 20:32:08,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:08,425 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 584 transitions. [2021-11-25 20:32:08,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 20:32:08,426 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:32:08,427 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:32:08,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-25 20:32:08,427 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 20:32:08,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:32:08,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1545368068, now seen corresponding path program 5 times [2021-11-25 20:32:08,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:32:08,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139846718] [2021-11-25 20:32:08,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:32:08,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:32:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:08,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 20:32:08,884 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:32:08,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139846718] [2021-11-25 20:32:08,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139846718] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:32:08,885 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:32:08,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-25 20:32:08,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852234943] [2021-11-25 20:32:08,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:32:08,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-25 20:32:08,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:32:08,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-25 20:32:08,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-25 20:32:08,887 INFO L87 Difference]: Start difference. First operand 206 states and 584 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:09,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:32:09,216 INFO L93 Difference]: Finished difference Result 251 states and 696 transitions. [2021-11-25 20:32:09,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 20:32:09,216 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 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 [2021-11-25 20:32:09,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:32:09,219 INFO L225 Difference]: With dead ends: 251 [2021-11-25 20:32:09,219 INFO L226 Difference]: Without dead ends: 244 [2021-11-25 20:32:09,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-25 20:32:09,220 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 33 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:32:09,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 4 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 20:32:09,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-11-25 20:32:09,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 210. [2021-11-25 20:32:09,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 2.851674641148325) internal successors, (596), 209 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:09,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 596 transitions. [2021-11-25 20:32:09,230 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 596 transitions. Word has length 24 [2021-11-25 20:32:09,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:32:09,231 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 596 transitions. [2021-11-25 20:32:09,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:09,231 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 596 transitions. [2021-11-25 20:32:09,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-25 20:32:09,232 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:32:09,232 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:32:09,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-25 20:32:09,233 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 20:32:09,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:32:09,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1119708322, now seen corresponding path program 6 times [2021-11-25 20:32:09,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:32:09,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73033598] [2021-11-25 20:32:09,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:32:09,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:32:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 20:32:09,681 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:32:09,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73033598] [2021-11-25 20:32:09,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73033598] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:32:09,681 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:32:09,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-25 20:32:09,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293525358] [2021-11-25 20:32:09,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:32:09,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-25 20:32:09,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:32:09,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-25 20:32:09,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-25 20:32:09,683 INFO L87 Difference]: Start difference. First operand 210 states and 596 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:09,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:32:09,942 INFO L93 Difference]: Finished difference Result 251 states and 696 transitions. [2021-11-25 20:32:09,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 20:32:09,942 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 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 [2021-11-25 20:32:09,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:32:09,945 INFO L225 Difference]: With dead ends: 251 [2021-11-25 20:32:09,945 INFO L226 Difference]: Without dead ends: 244 [2021-11-25 20:32:09,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-25 20:32:09,946 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 26 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:32:09,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 9 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 20:32:09,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-11-25 20:32:09,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 206. [2021-11-25 20:32:09,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 2.848780487804878) internal successors, (584), 205 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:09,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 584 transitions. [2021-11-25 20:32:09,956 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 584 transitions. Word has length 24 [2021-11-25 20:32:09,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:32:09,957 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 584 transitions. [2021-11-25 20:32:09,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:09,957 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 584 transitions. [2021-11-25 20:32:09,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 20:32:09,958 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:32:09,959 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:32:09,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-25 20:32:09,959 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 20:32:09,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:32:09,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1586183071, now seen corresponding path program 1 times [2021-11-25 20:32:09,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:32:09,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398107004] [2021-11-25 20:32:09,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:32:09,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:32:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:10,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:32:10,043 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:32:10,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398107004] [2021-11-25 20:32:10,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398107004] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:32:10,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431427957] [2021-11-25 20:32:10,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:32:10,044 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:32:10,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:32:10,050 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:32:10,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-25 20:32:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:10,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 20:32:10,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:32:10,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:32:10,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:32:10,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:32:10,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431427957] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:32:10,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [145213114] [2021-11-25 20:32:10,489 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:32:10,491 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:32:10,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2021-11-25 20:32:10,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771624872] [2021-11-25 20:32:10,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:32:10,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 20:32:10,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:32:10,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 20:32:10,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-11-25 20:32:10,494 INFO L87 Difference]: Start difference. First operand 206 states and 584 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:10,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:32:10,674 INFO L93 Difference]: Finished difference Result 378 states and 1000 transitions. [2021-11-25 20:32:10,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 20:32:10,674 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 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 25 [2021-11-25 20:32:10,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:32:10,677 INFO L225 Difference]: With dead ends: 378 [2021-11-25 20:32:10,677 INFO L226 Difference]: Without dead ends: 334 [2021-11-25 20:32:10,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-11-25 20:32:10,678 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 68 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:32:10,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 7 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 20:32:10,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-11-25 20:32:10,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 238. [2021-11-25 20:32:10,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 2.7763713080168775) internal successors, (658), 237 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:10,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 658 transitions. [2021-11-25 20:32:10,691 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 658 transitions. Word has length 25 [2021-11-25 20:32:10,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:32:10,692 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 658 transitions. [2021-11-25 20:32:10,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:10,692 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 658 transitions. [2021-11-25 20:32:10,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-25 20:32:10,696 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:32:10,697 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:32:10,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-25 20:32:10,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-25 20:32:10,910 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 20:32:10,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:32:10,910 INFO L85 PathProgramCache]: Analyzing trace with hash -613652850, now seen corresponding path program 1 times [2021-11-25 20:32:10,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:32:10,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733216617] [2021-11-25 20:32:10,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:32:10,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:32:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:10,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 20:32:10,990 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:32:10,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733216617] [2021-11-25 20:32:10,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733216617] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:32:10,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:32:10,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:32:10,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934898019] [2021-11-25 20:32:10,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:32:10,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 20:32:10,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:32:10,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 20:32:10,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:32:10,993 INFO L87 Difference]: Start difference. First operand 238 states and 658 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:11,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:32:11,059 INFO L93 Difference]: Finished difference Result 354 states and 978 transitions. [2021-11-25 20:32:11,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 20:32:11,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2021-11-25 20:32:11,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:32:11,063 INFO L225 Difference]: With dead ends: 354 [2021-11-25 20:32:11,063 INFO L226 Difference]: Without dead ends: 332 [2021-11-25 20:32:11,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-25 20:32:11,064 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 39 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:32:11,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 1 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:32:11,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-11-25 20:32:11,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 276. [2021-11-25 20:32:11,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 275 states have (on average 2.909090909090909) internal successors, (800), 275 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:11,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 800 transitions. [2021-11-25 20:32:11,078 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 800 transitions. Word has length 25 [2021-11-25 20:32:11,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:32:11,080 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 800 transitions. [2021-11-25 20:32:11,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:11,080 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 800 transitions. [2021-11-25 20:32:11,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 20:32:11,082 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:32:11,082 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:32:11,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-25 20:32:11,083 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 20:32:11,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:32:11,083 INFO L85 PathProgramCache]: Analyzing trace with hash -72921848, now seen corresponding path program 2 times [2021-11-25 20:32:11,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:32:11,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546466761] [2021-11-25 20:32:11,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:32:11,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:32:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:32:11,625 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:32:11,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546466761] [2021-11-25 20:32:11,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546466761] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:32:11,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695499736] [2021-11-25 20:32:11,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:32:11,626 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:32:11,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:32:11,627 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:32:11,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-25 20:32:11,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 20:32:11,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:32:11,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-25 20:32:11,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:32:12,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:12,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 20:32:12,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:12,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 20:32:12,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2021-11-25 20:32:12,482 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:32:12,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:32:12,824 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:32:12,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 159 [2021-11-25 20:32:12,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 138 treesize of output 126 [2021-11-25 20:32:12,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 126 treesize of output 102 [2021-11-25 20:32:13,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:32:13,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695499736] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:32:13,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1136440149] [2021-11-25 20:32:13,249 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:32:13,249 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:32:13,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 26 [2021-11-25 20:32:13,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787389676] [2021-11-25 20:32:13,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:32:13,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-25 20:32:13,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:32:13,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-25 20:32:13,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2021-11-25 20:32:13,251 INFO L87 Difference]: Start difference. First operand 276 states and 800 transitions. Second operand has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:16,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:32:16,773 INFO L93 Difference]: Finished difference Result 1302 states and 3737 transitions. [2021-11-25 20:32:16,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-25 20:32:16,774 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-25 20:32:16,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:32:16,785 INFO L225 Difference]: With dead ends: 1302 [2021-11-25 20:32:16,785 INFO L226 Difference]: Without dead ends: 1302 [2021-11-25 20:32:16,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=427, Invalid=2426, Unknown=9, NotChecked=0, Total=2862 [2021-11-25 20:32:16,788 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 229 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 280 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:32:16,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 16 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 869 Invalid, 0 Unknown, 280 Unchecked, 0.9s Time] [2021-11-25 20:32:16,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2021-11-25 20:32:16,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 617. [2021-11-25 20:32:16,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 616 states have (on average 3.262987012987013) internal successors, (2010), 616 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:16,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 2010 transitions. [2021-11-25 20:32:16,827 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 2010 transitions. Word has length 26 [2021-11-25 20:32:16,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:32:16,827 INFO L470 AbstractCegarLoop]: Abstraction has 617 states and 2010 transitions. [2021-11-25 20:32:16,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:16,828 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 2010 transitions. [2021-11-25 20:32:16,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 20:32:16,831 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:32:16,831 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:32:16,871 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-25 20:32:17,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:32:17,046 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 20:32:17,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:32:17,046 INFO L85 PathProgramCache]: Analyzing trace with hash -875114188, now seen corresponding path program 3 times [2021-11-25 20:32:17,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:32:17,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683447991] [2021-11-25 20:32:17,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:32:17,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:32:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:17,653 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:32:17,653 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:32:17,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683447991] [2021-11-25 20:32:17,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683447991] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:32:17,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581709528] [2021-11-25 20:32:17,654 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:32:17,654 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:32:17,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:32:17,655 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:32:17,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-25 20:32:17,833 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:32:17,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:32:17,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 27 conjunts are in the unsatisfiable core [2021-11-25 20:32:17,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:32:18,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:18,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 20:32:18,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:18,064 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 20:32:18,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 7 [2021-11-25 20:32:18,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 20:32:18,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:32:18,183 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_418 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_418) c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) 0))) is different from false [2021-11-25 20:32:18,199 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_418 (Array Int Int)) (v_ArrVal_417 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_417) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_418) c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) 0))) is different from false [2021-11-25 20:32:18,224 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:32:18,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 85 [2021-11-25 20:32:18,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 52 [2021-11-25 20:32:18,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 46 [2021-11-25 20:32:18,411 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2021-11-25 20:32:18,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581709528] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:32:18,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [573788533] [2021-11-25 20:32:18,412 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:32:18,413 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:32:18,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 20 [2021-11-25 20:32:18,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622734255] [2021-11-25 20:32:18,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:32:18,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-25 20:32:18,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:32:18,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-25 20:32:18,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=296, Unknown=2, NotChecked=70, Total=420 [2021-11-25 20:32:18,418 INFO L87 Difference]: Start difference. First operand 617 states and 2010 transitions. Second operand has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:19,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:32:19,501 INFO L93 Difference]: Finished difference Result 775 states and 2421 transitions. [2021-11-25 20:32:19,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-25 20:32:19,501 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-25 20:32:19,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:32:19,508 INFO L225 Difference]: With dead ends: 775 [2021-11-25 20:32:19,508 INFO L226 Difference]: Without dead ends: 775 [2021-11-25 20:32:19,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=110, Invalid=546, Unknown=2, NotChecked=98, Total=756 [2021-11-25 20:32:19,510 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 98 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 20:32:19,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 11 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 764 Invalid, 0 Unknown, 134 Unchecked, 0.6s Time] [2021-11-25 20:32:19,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2021-11-25 20:32:19,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 466. [2021-11-25 20:32:19,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 3.30752688172043) internal successors, (1538), 465 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1538 transitions. [2021-11-25 20:32:19,533 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 1538 transitions. Word has length 26 [2021-11-25 20:32:19,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:32:19,533 INFO L470 AbstractCegarLoop]: Abstraction has 466 states and 1538 transitions. [2021-11-25 20:32:19,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:19,534 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1538 transitions. [2021-11-25 20:32:19,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 20:32:19,536 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:32:19,536 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:32:19,567 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-25 20:32:19,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:32:19,750 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 20:32:19,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:32:19,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1330269105, now seen corresponding path program 1 times [2021-11-25 20:32:19,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:32:19,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031436683] [2021-11-25 20:32:19,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:32:19,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:32:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:19,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:32:19,814 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:32:19,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031436683] [2021-11-25 20:32:19,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031436683] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:32:19,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418029633] [2021-11-25 20:32:19,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:32:19,815 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:32:19,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:32:19,816 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:32:19,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-25 20:32:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:19,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 20:32:19,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:32:20,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:32:20,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:32:20,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:32:20,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418029633] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:32:20,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1431643230] [2021-11-25 20:32:20,177 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:32:20,178 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:32:20,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2021-11-25 20:32:20,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135167699] [2021-11-25 20:32:20,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:32:20,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 20:32:20,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:32:20,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 20:32:20,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-11-25 20:32:20,180 INFO L87 Difference]: Start difference. First operand 466 states and 1538 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:20,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:32:20,354 INFO L93 Difference]: Finished difference Result 808 states and 2491 transitions. [2021-11-25 20:32:20,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 20:32:20,354 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 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 26 [2021-11-25 20:32:20,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:32:20,358 INFO L225 Difference]: With dead ends: 808 [2021-11-25 20:32:20,359 INFO L226 Difference]: Without dead ends: 469 [2021-11-25 20:32:20,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-11-25 20:32:20,360 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 62 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:32:20,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 8 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:32:20,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2021-11-25 20:32:20,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2021-11-25 20:32:20,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 3.2927350427350426) internal successors, (1541), 468 states have internal predecessors, (1541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:20,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1541 transitions. [2021-11-25 20:32:20,378 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 1541 transitions. Word has length 26 [2021-11-25 20:32:20,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:32:20,378 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 1541 transitions. [2021-11-25 20:32:20,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:20,378 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 1541 transitions. [2021-11-25 20:32:20,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 20:32:20,380 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:32:20,380 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:32:20,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-25 20:32:20,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-25 20:32:20,606 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 20:32:20,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:32:20,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1541653921, now seen corresponding path program 2 times [2021-11-25 20:32:20,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:32:20,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322686078] [2021-11-25 20:32:20,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:32:20,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:32:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:20,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 20:32:20,710 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:32:20,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322686078] [2021-11-25 20:32:20,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322686078] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:32:20,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187678925] [2021-11-25 20:32:20,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:32:20,711 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:32:20,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:32:20,712 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:32:20,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-25 20:32:20,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 20:32:20,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:32:20,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-25 20:32:20,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:32:21,054 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:32:21,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:32:21,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:32:21,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187678925] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:32:21,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1031716686] [2021-11-25 20:32:21,268 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:32:21,270 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:32:21,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2021-11-25 20:32:21,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335438746] [2021-11-25 20:32:21,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:32:21,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-25 20:32:21,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:32:21,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-25 20:32:21,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-11-25 20:32:21,272 INFO L87 Difference]: Start difference. First operand 469 states and 1541 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:21,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:32:21,589 INFO L93 Difference]: Finished difference Result 884 states and 2784 transitions. [2021-11-25 20:32:21,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 20:32:21,590 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 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 27 [2021-11-25 20:32:21,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:32:21,597 INFO L225 Difference]: With dead ends: 884 [2021-11-25 20:32:21,597 INFO L226 Difference]: Without dead ends: 742 [2021-11-25 20:32:21,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2021-11-25 20:32:21,598 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 125 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 20:32:21,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 9 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-25 20:32:21,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2021-11-25 20:32:21,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 666. [2021-11-25 20:32:21,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 665 states have (on average 3.431578947368421) internal successors, (2282), 665 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:21,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 2282 transitions. [2021-11-25 20:32:21,634 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 2282 transitions. Word has length 27 [2021-11-25 20:32:21,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:32:21,634 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 2282 transitions. [2021-11-25 20:32:21,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:21,635 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 2282 transitions. [2021-11-25 20:32:21,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-25 20:32:21,638 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:32:21,638 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:32:21,677 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-25 20:32:21,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-25 20:32:21,866 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 20:32:21,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:32:21,866 INFO L85 PathProgramCache]: Analyzing trace with hash -695833801, now seen corresponding path program 1 times [2021-11-25 20:32:21,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:32:21,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504633337] [2021-11-25 20:32:21,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:32:21,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:32:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:22,171 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 20:32:22,173 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:32:22,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504633337] [2021-11-25 20:32:22,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504633337] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:32:22,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484456972] [2021-11-25 20:32:22,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:32:22,174 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:32:22,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:32:22,178 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:32:22,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-25 20:32:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:22,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-25 20:32:22,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:32:22,547 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 20:32:22,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:32:22,603 INFO L354 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2021-11-25 20:32:22,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 15 [2021-11-25 20:32:22,685 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-25 20:32:22,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484456972] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:32:22,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1448962742] [2021-11-25 20:32:22,685 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:32:22,687 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:32:22,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 3] total 11 [2021-11-25 20:32:22,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596795903] [2021-11-25 20:32:22,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:32:22,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-25 20:32:22,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:32:22,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-25 20:32:22,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-25 20:32:22,690 INFO L87 Difference]: Start difference. First operand 666 states and 2282 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:23,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:32:23,066 INFO L93 Difference]: Finished difference Result 1173 states and 3922 transitions. [2021-11-25 20:32:23,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-25 20:32:23,067 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-11-25 20:32:23,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:32:23,077 INFO L225 Difference]: With dead ends: 1173 [2021-11-25 20:32:23,078 INFO L226 Difference]: Without dead ends: 1173 [2021-11-25 20:32:23,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2021-11-25 20:32:23,079 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 44 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:32:23,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 8 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 258 Invalid, 0 Unknown, 39 Unchecked, 0.2s Time] [2021-11-25 20:32:23,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2021-11-25 20:32:23,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 796. [2021-11-25 20:32:23,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 795 states have (on average 3.4138364779874215) internal successors, (2714), 795 states have internal predecessors, (2714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:23,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 2714 transitions. [2021-11-25 20:32:23,116 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 2714 transitions. Word has length 29 [2021-11-25 20:32:23,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:32:23,118 INFO L470 AbstractCegarLoop]: Abstraction has 796 states and 2714 transitions. [2021-11-25 20:32:23,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:23,118 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 2714 transitions. [2021-11-25 20:32:23,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-25 20:32:23,121 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:32:23,122 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:32:23,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-25 20:32:23,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:32:23,343 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 20:32:23,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:32:23,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1256908661, now seen corresponding path program 2 times [2021-11-25 20:32:23,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:32:23,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904196404] [2021-11-25 20:32:23,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:32:23,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:32:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:23,825 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 20:32:23,825 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:32:23,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904196404] [2021-11-25 20:32:23,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904196404] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:32:23,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170509295] [2021-11-25 20:32:23,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:32:23,825 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:32:23,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:32:23,827 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:32:23,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-25 20:32:24,016 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 20:32:24,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:32:24,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 36 conjunts are in the unsatisfiable core [2021-11-25 20:32:24,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:32:24,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:24,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-11-25 20:32:24,626 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 20:32:24,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:32:24,840 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:32:24,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2021-11-25 20:32:24,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 18 [2021-11-25 20:32:25,389 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 20:32:25,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170509295] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:32:25,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [702236897] [2021-11-25 20:32:25,390 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:32:25,392 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:32:25,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2021-11-25 20:32:25,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496163224] [2021-11-25 20:32:25,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:32:25,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-25 20:32:25,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:32:25,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-25 20:32:25,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2021-11-25 20:32:25,394 INFO L87 Difference]: Start difference. First operand 796 states and 2714 transitions. Second operand has 26 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 25 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:30,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:32:30,266 INFO L93 Difference]: Finished difference Result 4216 states and 14423 transitions. [2021-11-25 20:32:30,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-11-25 20:32:30,266 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 25 states have internal predecessors, (68), 0 states have call successors, (0), 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 29 [2021-11-25 20:32:30,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:32:30,302 INFO L225 Difference]: With dead ends: 4216 [2021-11-25 20:32:30,302 INFO L226 Difference]: Without dead ends: 4216 [2021-11-25 20:32:30,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=864, Invalid=4680, Unknown=6, NotChecked=0, Total=5550 [2021-11-25 20:32:30,305 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 392 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 564 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-25 20:32:30,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 17 Invalid, 1642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 923 Invalid, 0 Unknown, 564 Unchecked, 0.9s Time] [2021-11-25 20:32:30,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4216 states. [2021-11-25 20:32:30,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4216 to 2399. [2021-11-25 20:32:30,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2399 states, 2398 states have (on average 3.602168473728107) internal successors, (8638), 2398 states have internal predecessors, (8638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:30,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2399 states to 2399 states and 8638 transitions. [2021-11-25 20:32:30,444 INFO L78 Accepts]: Start accepts. Automaton has 2399 states and 8638 transitions. Word has length 29 [2021-11-25 20:32:30,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:32:30,444 INFO L470 AbstractCegarLoop]: Abstraction has 2399 states and 8638 transitions. [2021-11-25 20:32:30,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 25 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:30,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2399 states and 8638 transitions. [2021-11-25 20:32:30,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-25 20:32:30,454 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:32:30,454 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:32:30,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-25 20:32:30,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-25 20:32:30,678 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 20:32:30,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:32:30,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1012057825, now seen corresponding path program 3 times [2021-11-25 20:32:30,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:32:30,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025658622] [2021-11-25 20:32:30,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:32:30,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:32:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:31,060 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 20:32:31,060 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:32:31,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025658622] [2021-11-25 20:32:31,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025658622] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:32:31,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711452071] [2021-11-25 20:32:31,061 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:32:31,061 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:32:31,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:32:31,062 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:32:31,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-25 20:32:31,313 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 20:32:31,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:32:31,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-25 20:32:31,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:32:31,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:31,646 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2021-11-25 20:32:31,871 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 20:32:31,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:32:32,025 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:32:32,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2021-11-25 20:32:32,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 18 [2021-11-25 20:32:32,456 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 20:32:32,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711452071] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:32:32,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [37643937] [2021-11-25 20:32:32,457 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:32:32,459 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:32:32,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2021-11-25 20:32:32,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613428901] [2021-11-25 20:32:32,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:32:32,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-25 20:32:32,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:32:32,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-25 20:32:32,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2021-11-25 20:32:32,461 INFO L87 Difference]: Start difference. First operand 2399 states and 8638 transitions. Second operand has 24 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:33,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:32:33,677 INFO L93 Difference]: Finished difference Result 4255 states and 15551 transitions. [2021-11-25 20:32:33,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-25 20:32:33,678 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 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 29 [2021-11-25 20:32:33,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:32:33,720 INFO L225 Difference]: With dead ends: 4255 [2021-11-25 20:32:33,720 INFO L226 Difference]: Without dead ends: 4255 [2021-11-25 20:32:33,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=271, Invalid=1210, Unknown=1, NotChecked=0, Total=1482 [2021-11-25 20:32:33,722 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 284 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 295 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:32:33,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 14 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 522 Invalid, 0 Unknown, 295 Unchecked, 0.4s Time] [2021-11-25 20:32:33,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4255 states. [2021-11-25 20:32:33,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4255 to 2720. [2021-11-25 20:32:33,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2720 states, 2719 states have (on average 3.6101507907318866) internal successors, (9816), 2719 states have internal predecessors, (9816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:33,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2720 states and 9816 transitions. [2021-11-25 20:32:33,885 INFO L78 Accepts]: Start accepts. Automaton has 2720 states and 9816 transitions. Word has length 29 [2021-11-25 20:32:33,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:32:33,886 INFO L470 AbstractCegarLoop]: Abstraction has 2720 states and 9816 transitions. [2021-11-25 20:32:33,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 23 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:33,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2720 states and 9816 transitions. [2021-11-25 20:32:33,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-25 20:32:33,896 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:32:33,897 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:32:33,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-25 20:32:34,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-25 20:32:34,122 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 20:32:34,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:32:34,122 INFO L85 PathProgramCache]: Analyzing trace with hash -132051807, now seen corresponding path program 4 times [2021-11-25 20:32:34,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:32:34,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094026040] [2021-11-25 20:32:34,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:32:34,123 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:32:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:34,594 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 20:32:34,594 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:32:34,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094026040] [2021-11-25 20:32:34,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094026040] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:32:34,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132068444] [2021-11-25 20:32:34,595 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-25 20:32:34,595 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:32:34,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:32:34,598 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:32:34,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-25 20:32:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:34,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-25 20:32:34,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:32:35,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:35,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-11-25 20:32:35,272 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 20:32:35,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:32:35,312 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_769 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 0))) is different from false [2021-11-25 20:32:35,373 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:32:35,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2021-11-25 20:32:35,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 18 [2021-11-25 20:32:35,809 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-25 20:32:35,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132068444] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:32:35,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1588945984] [2021-11-25 20:32:35,810 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:32:35,810 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:32:35,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2021-11-25 20:32:35,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774378286] [2021-11-25 20:32:35,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:32:35,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-25 20:32:35,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:32:35,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-25 20:32:35,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=455, Unknown=1, NotChecked=44, Total=600 [2021-11-25 20:32:35,812 INFO L87 Difference]: Start difference. First operand 2720 states and 9816 transitions. Second operand has 25 states, 25 states have (on average 2.6) internal successors, (65), 24 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:37,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:32:37,584 INFO L93 Difference]: Finished difference Result 4829 states and 16886 transitions. [2021-11-25 20:32:37,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-25 20:32:37,585 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 24 states have internal predecessors, (65), 0 states have call successors, (0), 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 29 [2021-11-25 20:32:37,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:32:37,608 INFO L225 Difference]: With dead ends: 4829 [2021-11-25 20:32:37,608 INFO L226 Difference]: Without dead ends: 4829 [2021-11-25 20:32:37,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=402, Invalid=1761, Unknown=3, NotChecked=90, Total=2256 [2021-11-25 20:32:37,610 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 445 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 338 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 20:32:37,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [445 Valid, 12 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 622 Invalid, 0 Unknown, 338 Unchecked, 0.6s Time] [2021-11-25 20:32:37,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4829 states. [2021-11-25 20:32:37,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4829 to 2017. [2021-11-25 20:32:37,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2017 states, 2016 states have (on average 3.5669642857142856) internal successors, (7191), 2016 states have internal predecessors, (7191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:37,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 7191 transitions. [2021-11-25 20:32:37,724 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 7191 transitions. Word has length 29 [2021-11-25 20:32:37,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:32:37,724 INFO L470 AbstractCegarLoop]: Abstraction has 2017 states and 7191 transitions. [2021-11-25 20:32:37,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 24 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:37,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 7191 transitions. [2021-11-25 20:32:37,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 20:32:37,732 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:32:37,732 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:32:37,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-25 20:32:37,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:32:37,958 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 20:32:37,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:32:37,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1997914473, now seen corresponding path program 5 times [2021-11-25 20:32:37,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:32:37,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890537203] [2021-11-25 20:32:37,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:32:37,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:32:38,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:40,562 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:32:40,563 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:32:40,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890537203] [2021-11-25 20:32:40,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890537203] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:32:40,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220874637] [2021-11-25 20:32:40,563 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:32:40,563 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:32:40,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:32:40,566 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:32:40,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-25 20:32:40,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 20:32:40,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:32:40,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-25 20:32:40,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:32:40,846 INFO L354 Elim1Store]: treesize reduction 76, result has 30.3 percent of original size [2021-11-25 20:32:40,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 38 [2021-11-25 20:32:40,911 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 20:32:40,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-25 20:32:41,071 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2021-11-25 20:32:41,133 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-25 20:32:41,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:32:41,165 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_838 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_838) c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_front~0 4))) 0))) is different from false [2021-11-25 20:32:41,179 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:32:41,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2021-11-25 20:32:41,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 18 [2021-11-25 20:32:41,376 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-25 20:32:41,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220874637] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:32:41,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1168165453] [2021-11-25 20:32:41,376 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:32:41,378 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:32:41,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 6] total 24 [2021-11-25 20:32:41,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103137074] [2021-11-25 20:32:41,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:32:41,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-25 20:32:41,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:32:41,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-25 20:32:41,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=493, Unknown=1, NotChecked=44, Total=600 [2021-11-25 20:32:41,380 INFO L87 Difference]: Start difference. First operand 2017 states and 7191 transitions. Second operand has 25 states, 25 states have (on average 2.36) internal successors, (59), 24 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:43,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:32:43,580 INFO L93 Difference]: Finished difference Result 3149 states and 11164 transitions. [2021-11-25 20:32:43,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-25 20:32:43,580 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.36) internal successors, (59), 24 states have internal predecessors, (59), 0 states have call successors, (0), 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 30 [2021-11-25 20:32:43,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:32:43,594 INFO L225 Difference]: With dead ends: 3149 [2021-11-25 20:32:43,594 INFO L226 Difference]: Without dead ends: 3149 [2021-11-25 20:32:43,595 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=192, Invalid=1371, Unknown=1, NotChecked=76, Total=1640 [2021-11-25 20:32:43,596 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 130 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:32:43,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 16 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1219 Invalid, 0 Unknown, 134 Unchecked, 1.0s Time] [2021-11-25 20:32:43,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3149 states. [2021-11-25 20:32:43,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3149 to 1375. [2021-11-25 20:32:43,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1374 states have (on average 3.566957787481805) internal successors, (4901), 1374 states have internal predecessors, (4901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 4901 transitions. [2021-11-25 20:32:43,664 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 4901 transitions. Word has length 30 [2021-11-25 20:32:43,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:32:43,664 INFO L470 AbstractCegarLoop]: Abstraction has 1375 states and 4901 transitions. [2021-11-25 20:32:43,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.36) internal successors, (59), 24 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:32:43,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 4901 transitions. [2021-11-25 20:32:43,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 20:32:43,669 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:32:43,669 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:32:43,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-25 20:32:43,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:32:43,885 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 20:32:43,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:32:43,886 INFO L85 PathProgramCache]: Analyzing trace with hash -329509675, now seen corresponding path program 1 times [2021-11-25 20:32:43,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:32:43,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510900885] [2021-11-25 20:32:43,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:32:43,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:32:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:47,095 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:32:47,095 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:32:47,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510900885] [2021-11-25 20:32:47,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510900885] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:32:47,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480747395] [2021-11-25 20:32:47,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:32:47,095 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:32:47,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:32:47,096 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:32:47,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-25 20:32:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:32:47,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 80 conjunts are in the unsatisfiable core [2021-11-25 20:32:47,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:32:47,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:47,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 20:32:48,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:32:48,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 20:32:48,758 INFO L354 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2021-11-25 20:32:48,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 10 [2021-11-25 20:32:49,064 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 20:32:49,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:33:08,676 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_900 (Array Int Int)) (~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_900))) (let ((.cse4 (select .cse1 ~q2~0.base))) (let ((.cse0 (select .cse4 (+ ~q2~0.offset (* c_~q2_back~0 4))))) (or (= .cse0 0) (not (= (select (select .cse1 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) .cse0)) (let ((.cse2 (mod c_~x~0 4294967296)) (.cse3 (* c_~C~0 2))) (and (= .cse2 (mod (+ .cse3 c_~y~0) 4294967296)) (= .cse2 (mod (+ .cse3 c_~z~0) 4294967296)) (= c_~N~0 (select .cse4 (+ ~q2~0.offset (* c_~q2_front~0 4))))))))))) is different from false [2021-11-25 20:33:08,813 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_900 (Array Int Int)) (v_ArrVal_899 (Array Int Int)) (~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_899) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_900))) (let ((.cse4 (select .cse1 ~q2~0.base))) (let ((.cse0 (select .cse4 (+ ~q2~0.offset (* c_~q2_back~0 4))))) (or (= 0 .cse0) (not (= (select (select .cse1 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) .cse0)) (let ((.cse2 (mod c_~x~0 4294967296)) (.cse3 (* c_~C~0 2))) (and (= .cse2 (mod (+ .cse3 c_~y~0) 4294967296)) (= .cse2 (mod (+ .cse3 c_~z~0) 4294967296)) (= (select .cse4 (+ ~q2~0.offset (* c_~q2_front~0 4))) c_~N~0)))))))) is different from false [2021-11-25 20:33:09,223 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:33:09,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1033 treesize of output 989 [2021-11-25 20:33:09,282 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:33:09,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 850 treesize of output 790 [2021-11-25 20:33:09,326 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:33:09,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 769 treesize of output 601 [2021-11-25 20:33:35,188 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 20:33:35,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480747395] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:33:35,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [928196521] [2021-11-25 20:33:35,189 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:33:35,190 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:33:35,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 15] total 50 [2021-11-25 20:33:35,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144723677] [2021-11-25 20:33:35,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:33:35,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-11-25 20:33:35,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:33:35,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-11-25 20:33:35,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2289, Unknown=6, NotChecked=194, Total=2652 [2021-11-25 20:33:35,193 INFO L87 Difference]: Start difference. First operand 1375 states and 4901 transitions. Second operand has 52 states, 51 states have (on average 1.7450980392156863) internal successors, (89), 51 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:40,430 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (* 4 c_~q2_back~0))) (let ((.cse5 (+ .cse9 c_~q2~0.offset))) (and (forall ((v_ArrVal_900 (Array Int Int)) (v_ArrVal_899 (Array Int Int)) (~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_899) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_900))) (let ((.cse4 (select .cse1 ~q2~0.base))) (let ((.cse0 (select .cse4 (+ ~q2~0.offset (* c_~q2_back~0 4))))) (or (= 0 .cse0) (not (= (select (select .cse1 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) .cse0)) (let ((.cse2 (mod c_~x~0 4294967296)) (.cse3 (* c_~C~0 2))) (and (= .cse2 (mod (+ .cse3 c_~y~0) 4294967296)) (= .cse2 (mod (+ .cse3 c_~z~0) 4294967296)) (= (select .cse4 (+ ~q2~0.offset (* c_~q2_front~0 4))) c_~N~0)))))))) (or (not (= 0 .cse5)) (and (not (= c_~q2~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|)) (= c_~q1~0.offset 0) (not (= c_~q1~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|)) (= (+ (* 4 c_~q1_front~0) c_~q1~0.offset) 0) (= c_~y~0 0) (let ((.cse6 (select (select |c_#memory_int| c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_back~0 4))))) (or (not (= .cse6 (select (select |c_#memory_int| c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))))) (let ((.cse7 (* 2 c_~C~0)) (.cse8 (* 4 c_~q2_front~0))) (and (<= .cse7 c_~x~0) (or (and (<= .cse6 c_~N~0) (<= c_~N~0 .cse6)) (not (= .cse8 .cse9))) (<= c_~x~0 .cse7) (or (and (<= (+ c_~n2~0 c_~q2_front~0) (+ 2 c_~q2_back~0)) (< 0 (+ .cse8 c_~q2~0.offset 1))) (= (+ .cse8 c_~q2~0.offset) 0)))))) (not (= c_~q1~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) (= c_~z~0 0) (not (= c_~q2~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)))) (= c_~q2~0.offset 0) (or (<= .cse5 0) (<= c_~n2~0 2))))) is different from false [2021-11-25 20:33:40,826 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (* 4 c_~q2_back~0))) (let ((.cse4 (+ .cse3 c_~q2~0.offset))) (and (or (and (not (= c_~q2~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|)) (= c_~q1~0.offset 0) (not (= c_~q1~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|)) (= (+ (* 4 c_~q1_front~0) c_~q1~0.offset) 0) (= c_~y~0 0) (let ((.cse0 (select (select |c_#memory_int| c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_back~0 4))))) (or (not (= .cse0 (select (select |c_#memory_int| c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))))) (let ((.cse1 (* 2 c_~C~0)) (.cse2 (* 4 c_~q2_front~0))) (and (<= .cse1 c_~x~0) (or (and (<= .cse0 c_~N~0) (<= c_~N~0 .cse0)) (not (= .cse2 .cse3))) (<= c_~x~0 .cse1) (or (and (<= (+ c_~n2~0 c_~q2_front~0) (+ 2 c_~q2_back~0)) (< 0 (+ .cse2 c_~q2~0.offset 1))) (= (+ .cse2 c_~q2~0.offset) 0)))))) (not (= c_~q1~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) (= c_~z~0 0)) (not (= 0 .cse4))) (forall ((v_ArrVal_900 (Array Int Int)) (~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_900))) (let ((.cse9 (select .cse6 ~q2~0.base))) (let ((.cse5 (select .cse9 (+ ~q2~0.offset (* c_~q2_back~0 4))))) (or (= .cse5 0) (not (= (select (select .cse6 c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))) .cse5)) (let ((.cse7 (mod c_~x~0 4294967296)) (.cse8 (* c_~C~0 2))) (and (= .cse7 (mod (+ .cse8 c_~y~0) 4294967296)) (= .cse7 (mod (+ .cse8 c_~z~0) 4294967296)) (= c_~N~0 (select .cse9 (+ ~q2~0.offset (* c_~q2_front~0 4))))))))))) (= c_~q2~0.offset 0) (or (<= .cse4 0) (<= c_~n2~0 2))))) is different from false [2021-11-25 20:33:43,483 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (* 4 c_~q2_back~0))) (let ((.cse8 (+ .cse7 c_~q2~0.offset))) (and (forall ((~q2~0.base Int) (~q2~0.offset Int)) (let ((.cse3 (select |c_#memory_int| ~q2~0.base))) (let ((.cse0 (select .cse3 (+ ~q2~0.offset (* c_~q2_back~0 4))))) (or (= .cse0 0) (let ((.cse1 (mod c_~x~0 4294967296)) (.cse2 (* c_~C~0 2))) (and (= .cse1 (mod (+ .cse2 c_~y~0) 4294967296)) (= .cse1 (mod (+ .cse2 c_~z~0) 4294967296)) (= (select .cse3 (+ ~q2~0.offset (* c_~q2_front~0 4))) c_~N~0))) (not (= .cse0 (select (select |c_#memory_int| c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))))))))) (or (and (= c_~q1~0.offset 0) (not (= c_~q1~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|)) (= (+ (* 4 c_~q1_front~0) c_~q1~0.offset) 0) (= c_~y~0 0) (let ((.cse4 (select (select |c_#memory_int| c_~q2~0.base) (+ c_~q2~0.offset (* c_~q2_back~0 4))))) (or (not (= .cse4 (select (select |c_#memory_int| c_~q1~0.base) (+ c_~q1~0.offset (* c_~q1_front~0 4))))) (let ((.cse5 (* 2 c_~C~0)) (.cse6 (* 4 c_~q2_front~0))) (and (<= .cse5 c_~x~0) (or (and (<= .cse4 c_~N~0) (<= c_~N~0 .cse4)) (not (= .cse6 .cse7))) (<= c_~x~0 .cse5) (or (and (<= (+ c_~n2~0 c_~q2_front~0) (+ 2 c_~q2_back~0)) (< 0 (+ .cse6 c_~q2~0.offset 1))) (= (+ .cse6 c_~q2~0.offset) 0)))))) (= c_~z~0 0)) (not (= 0 .cse8))) (= c_~q2~0.offset 0) (or (<= .cse8 0) (<= c_~n2~0 2))))) is different from false [2021-11-25 20:33:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:33:46,898 INFO L93 Difference]: Finished difference Result 1832 states and 6057 transitions. [2021-11-25 20:33:46,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-11-25 20:33:46,899 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.7450980392156863) internal successors, (89), 51 states have internal predecessors, (89), 0 states have call successors, (0), 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 30 [2021-11-25 20:33:46,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:33:46,906 INFO L225 Difference]: With dead ends: 1832 [2021-11-25 20:33:46,906 INFO L226 Difference]: Without dead ends: 1811 [2021-11-25 20:33:46,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1018 ImplicationChecksByTransitivity, 31.2s TimeCoverageRelationStatistics Valid=350, Invalid=5062, Unknown=10, NotChecked=740, Total=6162 [2021-11-25 20:33:46,909 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 162 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 2916 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 5106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2168 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:33:46,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 36 Invalid, 5106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2916 Invalid, 0 Unknown, 2168 Unchecked, 3.2s Time] [2021-11-25 20:33:46,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2021-11-25 20:33:46,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1505. [2021-11-25 20:33:46,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1504 states have (on average 3.4654255319148937) internal successors, (5212), 1504 states have internal predecessors, (5212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:46,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 5212 transitions. [2021-11-25 20:33:46,967 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 5212 transitions. Word has length 30 [2021-11-25 20:33:46,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:33:46,967 INFO L470 AbstractCegarLoop]: Abstraction has 1505 states and 5212 transitions. [2021-11-25 20:33:46,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.7450980392156863) internal successors, (89), 51 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:33:46,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 5212 transitions. [2021-11-25 20:33:46,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-25 20:33:46,972 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:33:46,972 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:33:47,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-25 20:33:47,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:33:47,186 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-25 20:33:47,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:33:47,186 INFO L85 PathProgramCache]: Analyzing trace with hash -82204355, now seen corresponding path program 2 times [2021-11-25 20:33:47,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:33:47,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979165138] [2021-11-25 20:33:47,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:33:47,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:33:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:33:49,524 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:33:49,524 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:33:49,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979165138] [2021-11-25 20:33:49,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979165138] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:33:49,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769177785] [2021-11-25 20:33:49,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:33:49,525 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:33:49,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:33:49,526 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:33:49,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a8db02f-f3d3-4d96-b22a-f45a69118339/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-25 20:33:49,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 20:33:49,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:33:49,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 86 conjunts are in the unsatisfiable core [2021-11-25 20:33:49,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:33:50,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:33:50,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 20:33:50,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:33:50,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-11-25 20:33:51,533 INFO L354 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2021-11-25 20:33:51,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 10 [2021-11-25 20:33:51,764 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:33:51,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:33:53,521 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:33:53,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1111 treesize of output 1059 [2021-11-25 20:33:53,564 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:33:53,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 947 treesize of output 767 [2021-11-25 20:33:53,601 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:33:53,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 698 treesize of output 632