./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba --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 2b8fef41c3119c5f4fc9586ebd31a4ff7152be41d9f2f8da139e8cd34cf0da86 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 00:16:15,649 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 00:16:15,653 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 00:16:15,690 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 00:16:15,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 00:16:15,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 00:16:15,704 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 00:16:15,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 00:16:15,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 00:16:15,718 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 00:16:15,720 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 00:16:15,722 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 00:16:15,723 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 00:16:15,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 00:16:15,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 00:16:15,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 00:16:15,735 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 00:16:15,737 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 00:16:15,739 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 00:16:15,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 00:16:15,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 00:16:15,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 00:16:15,758 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 00:16:15,760 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 00:16:15,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 00:16:15,777 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 00:16:15,778 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 00:16:15,779 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 00:16:15,780 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 00:16:15,781 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 00:16:15,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 00:16:15,783 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 00:16:15,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 00:16:15,785 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 00:16:15,786 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 00:16:15,789 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 00:16:15,791 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 00:16:15,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 00:16:15,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 00:16:15,794 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 00:16:15,795 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 00:16:15,797 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-22 00:16:15,850 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 00:16:15,850 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 00:16:15,851 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 00:16:15,851 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 00:16:15,852 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 00:16:15,853 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 00:16:15,853 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 00:16:15,853 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 00:16:15,854 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 00:16:15,854 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 00:16:15,855 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 00:16:15,856 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 00:16:15,856 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 00:16:15,856 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 00:16:15,857 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 00:16:15,857 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 00:16:15,857 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 00:16:15,858 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 00:16:15,859 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 00:16:15,859 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 00:16:15,859 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 00:16:15,859 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 00:16:15,860 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 00:16:15,860 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 00:16:15,860 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 00:16:15,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 00:16:15,861 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 00:16:15,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 00:16:15,862 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 00:16:15,863 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 00:16:15,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 00:16:15,863 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 00:16:15,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:16:15,864 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 00:16:15,864 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 00:16:15,865 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 00:16:15,865 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 00:16:15,865 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 00:16:15,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 00:16:15,866 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 00:16:15,866 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 00:16:15,866 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/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_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba 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 -> 2b8fef41c3119c5f4fc9586ebd31a4ff7152be41d9f2f8da139e8cd34cf0da86 [2022-11-22 00:16:16,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 00:16:16,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 00:16:16,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 00:16:16,267 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 00:16:16,268 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 00:16:16,269 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c [2022-11-22 00:16:20,012 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 00:16:20,276 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 00:16:20,277 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c [2022-11-22 00:16:20,287 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/data/4d394b0af/ce3c4f1810034520b5b956abc48e9ea1/FLAG4c91d2467 [2022-11-22 00:16:20,306 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/data/4d394b0af/ce3c4f1810034520b5b956abc48e9ea1 [2022-11-22 00:16:20,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 00:16:20,311 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 00:16:20,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 00:16:20,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 00:16:20,318 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 00:16:20,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:16:20" (1/1) ... [2022-11-22 00:16:20,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26c938b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:20, skipping insertion in model container [2022-11-22 00:16:20,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:16:20" (1/1) ... [2022-11-22 00:16:20,331 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 00:16:20,359 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 00:16:20,627 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c[4372,4385] [2022-11-22 00:16:20,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:16:20,661 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 00:16:20,704 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c[4372,4385] [2022-11-22 00:16:20,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:16:20,746 INFO L208 MainTranslator]: Completed translation [2022-11-22 00:16:20,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:20 WrapperNode [2022-11-22 00:16:20,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 00:16:20,748 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 00:16:20,748 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 00:16:20,748 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 00:16:20,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:20" (1/1) ... [2022-11-22 00:16:20,767 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:20" (1/1) ... [2022-11-22 00:16:20,818 INFO L138 Inliner]: procedures = 29, calls = 95, calls flagged for inlining = 21, calls inlined = 27, statements flattened = 289 [2022-11-22 00:16:20,819 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 00:16:20,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 00:16:20,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 00:16:20,820 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 00:16:20,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:20" (1/1) ... [2022-11-22 00:16:20,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:20" (1/1) ... [2022-11-22 00:16:20,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:20" (1/1) ... [2022-11-22 00:16:20,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:20" (1/1) ... [2022-11-22 00:16:20,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:20" (1/1) ... [2022-11-22 00:16:20,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:20" (1/1) ... [2022-11-22 00:16:20,863 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:20" (1/1) ... [2022-11-22 00:16:20,865 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:20" (1/1) ... [2022-11-22 00:16:20,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 00:16:20,872 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 00:16:20,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 00:16:20,872 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 00:16:20,874 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:20" (1/1) ... [2022-11-22 00:16:20,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:16:20,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:16:20,920 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 00:16:20,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 00:16:20,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 00:16:20,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 00:16:20,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 00:16:20,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 00:16:20,997 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-22 00:16:20,998 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-22 00:16:20,998 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-22 00:16:20,998 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-22 00:16:20,998 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-22 00:16:20,999 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-22 00:16:20,999 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-22 00:16:20,999 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-22 00:16:20,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 00:16:21,000 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-11-22 00:16:21,000 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-11-22 00:16:21,000 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-11-22 00:16:21,000 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-11-22 00:16:21,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-22 00:16:21,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-22 00:16:21,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-22 00:16:21,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 00:16:21,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 00:16:21,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 00:16:21,005 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 00:16:21,228 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 00:16:21,231 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 00:16:21,978 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 00:16:22,354 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 00:16:22,355 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-22 00:16:22,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:16:22 BoogieIcfgContainer [2022-11-22 00:16:22,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 00:16:22,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 00:16:22,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 00:16:22,366 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 00:16:22,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:16:20" (1/3) ... [2022-11-22 00:16:22,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34cc850d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:16:22, skipping insertion in model container [2022-11-22 00:16:22,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:16:20" (2/3) ... [2022-11-22 00:16:22,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34cc850d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:16:22, skipping insertion in model container [2022-11-22 00:16:22,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:16:22" (3/3) ... [2022-11-22 00:16:22,370 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1-dsl.wvr.c [2022-11-22 00:16:22,381 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-22 00:16:22,394 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 00:16:22,395 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-22 00:16:22,395 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 00:16:22,611 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2022-11-22 00:16:22,677 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 00:16:22,713 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 261 places, 260 transitions, 592 flow [2022-11-22 00:16:22,725 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 261 places, 260 transitions, 592 flow [2022-11-22 00:16:22,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 260 transitions, 592 flow [2022-11-22 00:16:22,865 INFO L130 PetriNetUnfolder]: 18/232 cut-off events. [2022-11-22 00:16:22,865 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-22 00:16:22,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 232 events. 18/232 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 285 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 200. Up to 3 conditions per place. [2022-11-22 00:16:22,885 INFO L119 LiptonReduction]: Number of co-enabled transitions 7312 [2022-11-22 00:16:34,174 INFO L134 LiptonReduction]: Checked pairs total: 36353 [2022-11-22 00:16:34,175 INFO L136 LiptonReduction]: Total number of compositions: 204 [2022-11-22 00:16:34,185 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 82 transitions, 236 flow [2022-11-22 00:16:34,617 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5101 states, 5100 states have (on average 4.53) internal successors, (23103), 5100 states have internal predecessors, (23103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:34,649 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 00:16:34,659 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3b1e87db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 00:16:34,659 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-11-22 00:16:34,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 5101 states, 5100 states have (on average 4.53) internal successors, (23103), 5100 states have internal predecessors, (23103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:34,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-22 00:16:34,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:34,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1] [2022-11-22 00:16:34,756 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-22 00:16:34,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:34,802 INFO L85 PathProgramCache]: Analyzing trace with hash 325335062, now seen corresponding path program 1 times [2022-11-22 00:16:34,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:34,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665607022] [2022-11-22 00:16:34,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:34,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:35,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:16:35,744 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:35,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665607022] [2022-11-22 00:16:35,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665607022] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:35,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:16:35,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:16:35,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002275304] [2022-11-22 00:16:35,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:35,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:16:35,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:35,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:16:35,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:16:35,804 INFO L87 Difference]: Start difference. First operand has 5101 states, 5100 states have (on average 4.53) internal successors, (23103), 5100 states have internal predecessors, (23103), 0 states have call successors, (0), 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 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:36,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:36,504 INFO L93 Difference]: Finished difference Result 14006 states and 64835 transitions. [2022-11-22 00:16:36,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:16:36,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-11-22 00:16:36,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:36,721 INFO L225 Difference]: With dead ends: 14006 [2022-11-22 00:16:36,722 INFO L226 Difference]: Without dead ends: 13825 [2022-11-22 00:16:36,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:16:36,727 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 85 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:36,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 87 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:16:36,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13825 states. [2022-11-22 00:16:37,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13825 to 6933. [2022-11-22 00:16:37,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6933 states, 6932 states have (on average 4.474321984997115) internal successors, (31016), 6932 states have internal predecessors, (31016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:37,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6933 states to 6933 states and 31016 transitions. [2022-11-22 00:16:37,616 INFO L78 Accepts]: Start accepts. Automaton has 6933 states and 31016 transitions. Word has length 52 [2022-11-22 00:16:37,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:37,621 INFO L495 AbstractCegarLoop]: Abstraction has 6933 states and 31016 transitions. [2022-11-22 00:16:37,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:37,627 INFO L276 IsEmpty]: Start isEmpty. Operand 6933 states and 31016 transitions. [2022-11-22 00:16:37,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-22 00:16:37,663 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:37,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1] [2022-11-22 00:16:37,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 00:16:37,670 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-22 00:16:37,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:37,671 INFO L85 PathProgramCache]: Analyzing trace with hash 432429094, now seen corresponding path program 2 times [2022-11-22 00:16:37,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:37,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978512237] [2022-11-22 00:16:37,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:37,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:38,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:16:38,345 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:38,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978512237] [2022-11-22 00:16:38,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978512237] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:38,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:16:38,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:16:38,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995062986] [2022-11-22 00:16:38,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:38,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:16:38,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:38,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:16:38,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:16:38,351 INFO L87 Difference]: Start difference. First operand 6933 states and 31016 transitions. Second operand has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:39,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:39,043 INFO L93 Difference]: Finished difference Result 15474 states and 71548 transitions. [2022-11-22 00:16:39,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:16:39,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-11-22 00:16:39,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:39,177 INFO L225 Difference]: With dead ends: 15474 [2022-11-22 00:16:39,177 INFO L226 Difference]: Without dead ends: 15293 [2022-11-22 00:16:39,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:16:39,180 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 62 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:39,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 90 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:16:39,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15293 states. [2022-11-22 00:16:39,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15293 to 7065. [2022-11-22 00:16:39,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7065 states, 7064 states have (on average 4.462061155152888) internal successors, (31520), 7064 states have internal predecessors, (31520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:39,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7065 states to 7065 states and 31520 transitions. [2022-11-22 00:16:39,824 INFO L78 Accepts]: Start accepts. Automaton has 7065 states and 31520 transitions. Word has length 52 [2022-11-22 00:16:39,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:39,825 INFO L495 AbstractCegarLoop]: Abstraction has 7065 states and 31520 transitions. [2022-11-22 00:16:39,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:39,826 INFO L276 IsEmpty]: Start isEmpty. Operand 7065 states and 31520 transitions. [2022-11-22 00:16:39,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-22 00:16:39,996 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:39,997 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1] [2022-11-22 00:16:39,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 00:16:39,998 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-22 00:16:39,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:40,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1856582988, now seen corresponding path program 1 times [2022-11-22 00:16:40,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:40,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122586612] [2022-11-22 00:16:40,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:40,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:16:40,620 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:40,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122586612] [2022-11-22 00:16:40,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122586612] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:40,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:16:40,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:16:40,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602410866] [2022-11-22 00:16:40,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:40,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:16:40,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:40,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:16:40,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:16:40,624 INFO L87 Difference]: Start difference. First operand 7065 states and 31520 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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) [2022-11-22 00:16:41,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:41,137 INFO L93 Difference]: Finished difference Result 11967 states and 49648 transitions. [2022-11-22 00:16:41,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 00:16:41,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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 54 [2022-11-22 00:16:41,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:41,209 INFO L225 Difference]: With dead ends: 11967 [2022-11-22 00:16:41,210 INFO L226 Difference]: Without dead ends: 11355 [2022-11-22 00:16:41,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:16:41,211 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 158 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:41,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 114 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:16:41,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11355 states. [2022-11-22 00:16:41,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11355 to 8501. [2022-11-22 00:16:41,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8501 states, 8500 states have (on average 4.270117647058823) internal successors, (36296), 8500 states have internal predecessors, (36296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:41,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8501 states to 8501 states and 36296 transitions. [2022-11-22 00:16:41,945 INFO L78 Accepts]: Start accepts. Automaton has 8501 states and 36296 transitions. Word has length 54 [2022-11-22 00:16:41,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:41,946 INFO L495 AbstractCegarLoop]: Abstraction has 8501 states and 36296 transitions. [2022-11-22 00:16:41,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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) [2022-11-22 00:16:41,946 INFO L276 IsEmpty]: Start isEmpty. Operand 8501 states and 36296 transitions. [2022-11-22 00:16:41,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-22 00:16:41,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:41,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1] [2022-11-22 00:16:41,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 00:16:41,981 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-22 00:16:41,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:41,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1721045454, now seen corresponding path program 1 times [2022-11-22 00:16:41,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:41,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979712355] [2022-11-22 00:16:41,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:41,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:42,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:16:42,562 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:42,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979712355] [2022-11-22 00:16:42,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979712355] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:16:42,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:16:42,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:16:42,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844512200] [2022-11-22 00:16:42,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:42,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:16:42,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:42,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:16:42,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:16:42,574 INFO L87 Difference]: Start difference. First operand 8501 states and 36296 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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) [2022-11-22 00:16:42,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:42,987 INFO L93 Difference]: Finished difference Result 8515 states and 34660 transitions. [2022-11-22 00:16:42,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:16:42,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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 54 [2022-11-22 00:16:42,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:43,040 INFO L225 Difference]: With dead ends: 8515 [2022-11-22 00:16:43,040 INFO L226 Difference]: Without dead ends: 6868 [2022-11-22 00:16:43,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:16:43,042 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 108 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:43,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 89 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:16:43,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6868 states. [2022-11-22 00:16:43,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6868 to 6868. [2022-11-22 00:16:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6868 states, 6867 states have (on average 4.300859181593126) internal successors, (29534), 6867 states have internal predecessors, (29534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:43,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6868 states to 6868 states and 29534 transitions. [2022-11-22 00:16:43,439 INFO L78 Accepts]: Start accepts. Automaton has 6868 states and 29534 transitions. Word has length 54 [2022-11-22 00:16:43,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:43,439 INFO L495 AbstractCegarLoop]: Abstraction has 6868 states and 29534 transitions. [2022-11-22 00:16:43,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 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) [2022-11-22 00:16:43,440 INFO L276 IsEmpty]: Start isEmpty. Operand 6868 states and 29534 transitions. [2022-11-22 00:16:43,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-22 00:16:43,468 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:43,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:43,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 00:16:43,470 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-22 00:16:43,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:43,471 INFO L85 PathProgramCache]: Analyzing trace with hash 2126341667, now seen corresponding path program 1 times [2022-11-22 00:16:43,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:43,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153024987] [2022-11-22 00:16:43,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:43,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:43,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:44,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:16:44,073 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:44,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153024987] [2022-11-22 00:16:44,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153024987] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:16:44,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482378989] [2022-11-22 00:16:44,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:44,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:44,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:16:44,082 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:16:44,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 00:16:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:44,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-22 00:16:44,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:16:44,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:16:44,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:16:44,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:16:44,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482378989] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:16:44,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [905010730] [2022-11-22 00:16:44,708 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:16:44,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:16:44,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-22 00:16:44,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402051492] [2022-11-22 00:16:44,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:16:44,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-22 00:16:44,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:44,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-22 00:16:44,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-22 00:16:44,713 INFO L87 Difference]: Start difference. First operand 6868 states and 29534 transitions. Second operand has 12 states, 12 states have (on average 9.916666666666666) internal successors, (119), 11 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:45,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:45,332 INFO L93 Difference]: Finished difference Result 11572 states and 48055 transitions. [2022-11-22 00:16:45,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 00:16:45,332 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.916666666666666) internal successors, (119), 11 states have internal predecessors, (119), 0 states have call successors, (0), 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 55 [2022-11-22 00:16:45,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:45,493 INFO L225 Difference]: With dead ends: 11572 [2022-11-22 00:16:45,493 INFO L226 Difference]: Without dead ends: 11356 [2022-11-22 00:16:45,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-11-22 00:16:45,495 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 212 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:45,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 222 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 00:16:45,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11356 states. [2022-11-22 00:16:45,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11356 to 8502. [2022-11-22 00:16:45,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8502 states, 8501 states have (on average 4.26973297259146) internal successors, (36297), 8501 states have internal predecessors, (36297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:45,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8502 states to 8502 states and 36297 transitions. [2022-11-22 00:16:45,879 INFO L78 Accepts]: Start accepts. Automaton has 8502 states and 36297 transitions. Word has length 55 [2022-11-22 00:16:45,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:45,880 INFO L495 AbstractCegarLoop]: Abstraction has 8502 states and 36297 transitions. [2022-11-22 00:16:45,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.916666666666666) internal successors, (119), 11 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:45,880 INFO L276 IsEmpty]: Start isEmpty. Operand 8502 states and 36297 transitions. [2022-11-22 00:16:46,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-22 00:16:46,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:46,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:46,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 00:16:46,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:46,274 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-22 00:16:46,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:46,275 INFO L85 PathProgramCache]: Analyzing trace with hash -786283212, now seen corresponding path program 1 times [2022-11-22 00:16:46,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:46,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833492197] [2022-11-22 00:16:46,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:46,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:46,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:16:46,800 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:46,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833492197] [2022-11-22 00:16:46,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833492197] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:16:46,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424299634] [2022-11-22 00:16:46,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:46,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:46,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:16:46,804 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:16:46,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 00:16:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:47,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-22 00:16:47,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:16:47,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:16:47,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:16:47,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:16:47,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424299634] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:16:47,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1850804035] [2022-11-22 00:16:47,383 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:16:47,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:16:47,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-22 00:16:47,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934479318] [2022-11-22 00:16:47,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:16:47,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-22 00:16:47,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:47,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-22 00:16:47,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-22 00:16:47,388 INFO L87 Difference]: Start difference. First operand 8502 states and 36297 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:47,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:47,866 INFO L93 Difference]: Finished difference Result 8516 states and 33499 transitions. [2022-11-22 00:16:47,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 00:16:47,867 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-11-22 00:16:47,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:47,913 INFO L225 Difference]: With dead ends: 8516 [2022-11-22 00:16:47,913 INFO L226 Difference]: Without dead ends: 6407 [2022-11-22 00:16:47,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-11-22 00:16:47,915 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 281 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:47,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 106 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:16:48,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6407 states. [2022-11-22 00:16:48,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6407 to 6407. [2022-11-22 00:16:48,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6407 states, 6406 states have (on average 4.153137683421792) internal successors, (26605), 6406 states have internal predecessors, (26605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:48,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6407 states to 6407 states and 26605 transitions. [2022-11-22 00:16:48,261 INFO L78 Accepts]: Start accepts. Automaton has 6407 states and 26605 transitions. Word has length 55 [2022-11-22 00:16:48,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:48,261 INFO L495 AbstractCegarLoop]: Abstraction has 6407 states and 26605 transitions. [2022-11-22 00:16:48,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:48,261 INFO L276 IsEmpty]: Start isEmpty. Operand 6407 states and 26605 transitions. [2022-11-22 00:16:48,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-22 00:16:48,284 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:48,284 INFO L195 NwaCegarLoop]: 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, 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, 1, 1, 1, 1, 1] [2022-11-22 00:16:48,300 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 00:16:48,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-22 00:16:48,492 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-22 00:16:48,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:48,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1708564349, now seen corresponding path program 2 times [2022-11-22 00:16:48,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:48,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026566318] [2022-11-22 00:16:48,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:48,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:48,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 00:16:48,859 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:48,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026566318] [2022-11-22 00:16:48,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026566318] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:16:48,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047553180] [2022-11-22 00:16:48,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 00:16:48,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:48,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:16:48,863 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:16:48,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 00:16:49,130 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 00:16:49,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:16:49,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-22 00:16:49,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:16:49,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 00:16:49,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:16:49,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 00:16:49,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047553180] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 00:16:49,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-22 00:16:49,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2022-11-22 00:16:49,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934354672] [2022-11-22 00:16:49,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:49,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:16:49,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:49,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:16:49,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-22 00:16:49,535 INFO L87 Difference]: Start difference. First operand 6407 states and 26605 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 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) [2022-11-22 00:16:49,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:49,763 INFO L93 Difference]: Finished difference Result 6455 states and 27235 transitions. [2022-11-22 00:16:49,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 00:16:49,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 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 56 [2022-11-22 00:16:49,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:49,799 INFO L225 Difference]: With dead ends: 6455 [2022-11-22 00:16:49,799 INFO L226 Difference]: Without dead ends: 6455 [2022-11-22 00:16:49,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-11-22 00:16:49,801 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 231 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:49,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 46 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:16:49,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6455 states. [2022-11-22 00:16:49,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6455 to 5703. [2022-11-22 00:16:50,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5703 states, 5702 states have (on average 4.283584707120308) internal successors, (24425), 5702 states have internal predecessors, (24425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5703 states to 5703 states and 24425 transitions. [2022-11-22 00:16:50,041 INFO L78 Accepts]: Start accepts. Automaton has 5703 states and 24425 transitions. Word has length 56 [2022-11-22 00:16:50,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:50,042 INFO L495 AbstractCegarLoop]: Abstraction has 5703 states and 24425 transitions. [2022-11-22 00:16:50,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 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) [2022-11-22 00:16:50,042 INFO L276 IsEmpty]: Start isEmpty. Operand 5703 states and 24425 transitions. [2022-11-22 00:16:50,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-22 00:16:50,062 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:50,062 INFO L195 NwaCegarLoop]: 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, 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, 1, 1, 1, 1, 1] [2022-11-22 00:16:50,075 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 00:16:50,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-22 00:16:50,270 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-22 00:16:50,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:50,270 INFO L85 PathProgramCache]: Analyzing trace with hash -747093958, now seen corresponding path program 1 times [2022-11-22 00:16:50,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:50,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738858892] [2022-11-22 00:16:50,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:50,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:50,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 00:16:50,747 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:50,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738858892] [2022-11-22 00:16:50,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738858892] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:16:50,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362096465] [2022-11-22 00:16:50,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:50,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:50,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:16:50,749 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:16:50,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 00:16:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:50,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-22 00:16:50,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:16:51,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 00:16:51,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:16:51,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 00:16:51,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362096465] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 00:16:51,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-22 00:16:51,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2022-11-22 00:16:51,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586324355] [2022-11-22 00:16:51,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:16:51,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:16:51,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:51,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:16:51,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-22 00:16:51,381 INFO L87 Difference]: Start difference. First operand 5703 states and 24425 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 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) [2022-11-22 00:16:51,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:51,603 INFO L93 Difference]: Finished difference Result 6387 states and 27545 transitions. [2022-11-22 00:16:51,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 00:16:51,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 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 56 [2022-11-22 00:16:51,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:51,637 INFO L225 Difference]: With dead ends: 6387 [2022-11-22 00:16:51,637 INFO L226 Difference]: Without dead ends: 6387 [2022-11-22 00:16:51,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-11-22 00:16:51,640 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 145 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:51,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 49 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:16:51,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6387 states. [2022-11-22 00:16:51,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6387 to 6387. [2022-11-22 00:16:52,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6387 states, 6386 states have (on average 4.313341684935797) internal successors, (27545), 6386 states have internal predecessors, (27545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:52,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6387 states to 6387 states and 27545 transitions. [2022-11-22 00:16:52,067 INFO L78 Accepts]: Start accepts. Automaton has 6387 states and 27545 transitions. Word has length 56 [2022-11-22 00:16:52,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:52,067 INFO L495 AbstractCegarLoop]: Abstraction has 6387 states and 27545 transitions. [2022-11-22 00:16:52,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 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) [2022-11-22 00:16:52,068 INFO L276 IsEmpty]: Start isEmpty. Operand 6387 states and 27545 transitions. [2022-11-22 00:16:52,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-22 00:16:52,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:52,104 INFO L195 NwaCegarLoop]: 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, 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:52,115 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 00:16:52,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:52,305 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-22 00:16:52,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:52,306 INFO L85 PathProgramCache]: Analyzing trace with hash 526565857, now seen corresponding path program 1 times [2022-11-22 00:16:52,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:52,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282816139] [2022-11-22 00:16:52,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:52,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:54,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 00:16:54,259 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:16:54,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282816139] [2022-11-22 00:16:54,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282816139] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:16:54,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780953780] [2022-11-22 00:16:54,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:54,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:54,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:16:54,262 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:16:54,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 00:16:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:16:54,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-22 00:16:54,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:16:55,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:16:55,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 00:16:55,243 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 10 [2022-11-22 00:16:55,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 00:16:55,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:16:55,650 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_495 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_495) c_~X_0~0.base) .cse0) c_~s_2~0))) (forall ((v_ArrVal_495 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_495) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 1))))) is different from false [2022-11-22 00:16:55,695 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_495 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_495) c_~X_0~0.base) .cse0) c_~s_2~0))) (forall ((v_ArrVal_495 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_495) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))))) is different from false [2022-11-22 00:16:55,718 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:16:55,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 43 [2022-11-22 00:16:55,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2022-11-22 00:16:55,757 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:16:55,767 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-22 00:16:55,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2022-11-22 00:16:56,102 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-11-22 00:16:56,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780953780] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:16:56,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1082574206] [2022-11-22 00:16:56,104 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:16:56,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:16:56,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2022-11-22 00:16:56,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984362257] [2022-11-22 00:16:56,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:16:56,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-22 00:16:56,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:16:56,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-22 00:16:56,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=360, Unknown=2, NotChecked=78, Total=506 [2022-11-22 00:16:56,109 INFO L87 Difference]: Start difference. First operand 6387 states and 27545 transitions. Second operand has 23 states, 22 states have (on average 5.136363636363637) internal successors, (113), 22 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:58,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:16:58,580 INFO L93 Difference]: Finished difference Result 13020 states and 57913 transitions. [2022-11-22 00:16:58,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-22 00:16:58,581 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.136363636363637) internal successors, (113), 22 states have internal predecessors, (113), 0 states have call successors, (0), 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 58 [2022-11-22 00:16:58,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:16:58,651 INFO L225 Difference]: With dead ends: 13020 [2022-11-22 00:16:58,651 INFO L226 Difference]: Without dead ends: 12099 [2022-11-22 00:16:58,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 99 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=210, Invalid=852, Unknown=2, NotChecked=126, Total=1190 [2022-11-22 00:16:58,655 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 467 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 1590 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 1998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 395 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-22 00:16:58,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 401 Invalid, 1998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1590 Invalid, 0 Unknown, 395 Unchecked, 1.7s Time] [2022-11-22 00:16:58,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12099 states. [2022-11-22 00:16:58,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12099 to 7427. [2022-11-22 00:16:59,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7427 states, 7426 states have (on average 4.35591166172906) internal successors, (32347), 7426 states have internal predecessors, (32347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:59,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7427 states to 7427 states and 32347 transitions. [2022-11-22 00:16:59,047 INFO L78 Accepts]: Start accepts. Automaton has 7427 states and 32347 transitions. Word has length 58 [2022-11-22 00:16:59,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:16:59,048 INFO L495 AbstractCegarLoop]: Abstraction has 7427 states and 32347 transitions. [2022-11-22 00:16:59,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.136363636363637) internal successors, (113), 22 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:16:59,048 INFO L276 IsEmpty]: Start isEmpty. Operand 7427 states and 32347 transitions. [2022-11-22 00:16:59,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-22 00:16:59,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:16:59,074 INFO L195 NwaCegarLoop]: 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, 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:16:59,094 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-22 00:16:59,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:16:59,291 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-22 00:16:59,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:16:59,292 INFO L85 PathProgramCache]: Analyzing trace with hash -2007082927, now seen corresponding path program 2 times [2022-11-22 00:16:59,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:16:59,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896876782] [2022-11-22 00:16:59,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:16:59,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:16:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:17:01,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 00:17:01,245 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:17:01,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896876782] [2022-11-22 00:17:01,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896876782] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:17:01,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419313055] [2022-11-22 00:17:01,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 00:17:01,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:17:01,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:17:01,247 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:17:01,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 00:17:01,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 00:17:01,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:17:01,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-22 00:17:01,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:17:01,608 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-22 00:17:01,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-22 00:17:01,732 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 00:17:01,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-22 00:17:01,794 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 00:17:01,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-22 00:17:02,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:02,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 00:17:02,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-22 00:17:02,620 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 10 [2022-11-22 00:17:02,723 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 00:17:02,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:17:03,319 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_575 (Array Int Int)) (v_ArrVal_574 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_574) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_575) c_~X_0~0.base) .cse0)))) (forall ((v_ArrVal_575 (Array Int Int)) (v_ArrVal_574 (Array Int Int))) (< (+ c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_574) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_575) c_~X_0~0.base) .cse0)) (+ c_~s_6~0 c_~t_8~0 1))))) is different from false [2022-11-22 00:17:03,339 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:17:03,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 180 [2022-11-22 00:17:03,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 140 [2022-11-22 00:17:03,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 63 [2022-11-22 00:17:03,421 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:17:03,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:17:03,430 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-22 00:17:03,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2022-11-22 00:17:04,061 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 00:17:04,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419313055] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:17:04,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1692755459] [2022-11-22 00:17:04,063 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:17:04,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:17:04,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 27 [2022-11-22 00:17:04,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527409823] [2022-11-22 00:17:04,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:17:04,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-22 00:17:04,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:17:04,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-22 00:17:04,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=655, Unknown=9, NotChecked=52, Total=812 [2022-11-22 00:17:04,070 INFO L87 Difference]: Start difference. First operand 7427 states and 32347 transitions. Second operand has 29 states, 28 states have (on average 4.607142857142857) internal successors, (129), 28 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:12,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:17:12,767 INFO L93 Difference]: Finished difference Result 13761 states and 61394 transitions. [2022-11-22 00:17:12,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-22 00:17:12,768 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.607142857142857) internal successors, (129), 28 states have internal predecessors, (129), 0 states have call successors, (0), 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 58 [2022-11-22 00:17:12,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:17:12,820 INFO L225 Difference]: With dead ends: 13761 [2022-11-22 00:17:12,820 INFO L226 Difference]: Without dead ends: 12960 [2022-11-22 00:17:12,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 94 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=472, Invalid=1973, Unknown=9, NotChecked=96, Total=2550 [2022-11-22 00:17:12,821 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 1037 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 2065 mSolverCounterSat, 40 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 2377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2065 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 256 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-22 00:17:12,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 492 Invalid, 2377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2065 Invalid, 16 Unknown, 256 Unchecked, 2.9s Time] [2022-11-22 00:17:12,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12960 states. [2022-11-22 00:17:13,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12960 to 7427. [2022-11-22 00:17:13,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7427 states, 7426 states have (on average 4.35591166172906) internal successors, (32347), 7426 states have internal predecessors, (32347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7427 states to 7427 states and 32347 transitions. [2022-11-22 00:17:13,236 INFO L78 Accepts]: Start accepts. Automaton has 7427 states and 32347 transitions. Word has length 58 [2022-11-22 00:17:13,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:17:13,238 INFO L495 AbstractCegarLoop]: Abstraction has 7427 states and 32347 transitions. [2022-11-22 00:17:13,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.607142857142857) internal successors, (129), 28 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:13,238 INFO L276 IsEmpty]: Start isEmpty. Operand 7427 states and 32347 transitions. [2022-11-22 00:17:13,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-22 00:17:13,271 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:17:13,272 INFO L195 NwaCegarLoop]: 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, 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:17:13,285 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 00:17:13,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-22 00:17:13,481 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-22 00:17:13,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:17:13,482 INFO L85 PathProgramCache]: Analyzing trace with hash 2068287604, now seen corresponding path program 1 times [2022-11-22 00:17:13,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:17:13,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886624961] [2022-11-22 00:17:13,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:17:13,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:17:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:17:15,272 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 00:17:15,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:17:15,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886624961] [2022-11-22 00:17:15,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886624961] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:17:15,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383260962] [2022-11-22 00:17:15,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:17:15,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:17:15,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:17:15,276 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:17:15,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 00:17:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:17:15,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-22 00:17:15,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:17:16,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:16,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 00:17:16,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:16,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 00:17:16,505 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 10 [2022-11-22 00:17:16,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 00:17:16,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:17:16,843 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_651 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_651) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 1))) (forall ((v_ArrVal_651 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_651) c_~X_0~0.base) .cse0) c_~s_2~0))))) is different from false [2022-11-22 00:17:16,988 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_650 (Array Int Int)) (v_ArrVal_651 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_650) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_651) c_~X_0~0.base) .cse0) c_~s_2~0))) (forall ((v_ArrVal_650 (Array Int Int)) (v_ArrVal_651 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_650) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_651) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 1))))) is different from false [2022-11-22 00:17:17,019 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_650 (Array Int Int)) (v_ArrVal_651 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_650) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_651) c_~X_0~0.base) .cse0) c_~s_2~0))) (forall ((v_ArrVal_650 (Array Int Int)) (v_ArrVal_651 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_650) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_651) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))))) is different from false [2022-11-22 00:17:17,036 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:17:17,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 180 [2022-11-22 00:17:17,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 70 [2022-11-22 00:17:17,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 126 [2022-11-22 00:17:17,186 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:17:17,187 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:17:17,196 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-22 00:17:17,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2022-11-22 00:17:17,617 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-11-22 00:17:17,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383260962] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:17:17,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1319523362] [2022-11-22 00:17:17,618 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:17:17,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:17:17,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2022-11-22 00:17:17,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007235339] [2022-11-22 00:17:17,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:17:17,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-22 00:17:17,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:17:17,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-22 00:17:17,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=603, Unknown=3, NotChecked=156, Total=870 [2022-11-22 00:17:17,621 INFO L87 Difference]: Start difference. First operand 7427 states and 32347 transitions. Second operand has 30 states, 29 states have (on average 4.689655172413793) internal successors, (136), 29 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:23,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:17:23,211 INFO L93 Difference]: Finished difference Result 12768 states and 57020 transitions. [2022-11-22 00:17:23,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-22 00:17:23,212 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.689655172413793) internal successors, (136), 29 states have internal predecessors, (136), 0 states have call successors, (0), 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 58 [2022-11-22 00:17:23,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:17:23,257 INFO L225 Difference]: With dead ends: 12768 [2022-11-22 00:17:23,257 INFO L226 Difference]: Without dead ends: 11887 [2022-11-22 00:17:23,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 95 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=359, Invalid=1372, Unknown=3, NotChecked=246, Total=1980 [2022-11-22 00:17:23,259 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 732 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 1942 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 2963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 994 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:17:23,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 488 Invalid, 2963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1942 Invalid, 0 Unknown, 994 Unchecked, 2.2s Time] [2022-11-22 00:17:23,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11887 states. [2022-11-22 00:17:23,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11887 to 7531. [2022-11-22 00:17:23,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7531 states, 7530 states have (on average 4.365869853917663) internal successors, (32875), 7530 states have internal predecessors, (32875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:23,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7531 states to 7531 states and 32875 transitions. [2022-11-22 00:17:23,640 INFO L78 Accepts]: Start accepts. Automaton has 7531 states and 32875 transitions. Word has length 58 [2022-11-22 00:17:23,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:17:23,641 INFO L495 AbstractCegarLoop]: Abstraction has 7531 states and 32875 transitions. [2022-11-22 00:17:23,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.689655172413793) internal successors, (136), 29 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:23,642 INFO L276 IsEmpty]: Start isEmpty. Operand 7531 states and 32875 transitions. [2022-11-22 00:17:23,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-22 00:17:23,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:17:23,669 INFO L195 NwaCegarLoop]: 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, 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:17:23,686 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-22 00:17:23,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:17:23,878 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-22 00:17:23,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:17:23,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1123086771, now seen corresponding path program 3 times [2022-11-22 00:17:23,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:17:23,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567666271] [2022-11-22 00:17:23,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:17:23,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:17:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:17:26,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:17:26,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:17:26,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567666271] [2022-11-22 00:17:26,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567666271] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:17:26,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954346554] [2022-11-22 00:17:26,684 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 00:17:26,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:17:26,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:17:26,686 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:17:26,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-22 00:17:26,969 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 00:17:26,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:17:26,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-22 00:17:26,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:17:27,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:27,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 00:17:27,703 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-22 00:17:27,969 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 00:17:27,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:17:28,389 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_726 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_726) c_~X_0~0.base) .cse0) c_~s_2~0))) (forall ((v_ArrVal_726 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_726) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))))) is different from false [2022-11-22 00:17:28,408 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:17:28,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 43 [2022-11-22 00:17:28,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2022-11-22 00:17:28,442 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:17:28,454 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-22 00:17:28,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2022-11-22 00:17:28,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 00:17:28,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954346554] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:17:28,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1447667634] [2022-11-22 00:17:28,896 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:17:28,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:17:28,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2022-11-22 00:17:28,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252072140] [2022-11-22 00:17:28,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:17:28,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-22 00:17:28,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:17:28,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-22 00:17:28,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=755, Unknown=1, NotChecked=56, Total=930 [2022-11-22 00:17:28,900 INFO L87 Difference]: Start difference. First operand 7531 states and 32875 transitions. Second operand has 31 states, 30 states have (on average 4.133333333333334) internal successors, (124), 30 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:33,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:17:33,724 INFO L93 Difference]: Finished difference Result 15264 states and 68229 transitions. [2022-11-22 00:17:33,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-22 00:17:33,724 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.133333333333334) internal successors, (124), 30 states have internal predecessors, (124), 0 states have call successors, (0), 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 58 [2022-11-22 00:17:33,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:17:33,799 INFO L225 Difference]: With dead ends: 15264 [2022-11-22 00:17:33,799 INFO L226 Difference]: Without dead ends: 14343 [2022-11-22 00:17:33,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 98 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=475, Invalid=1978, Unknown=1, NotChecked=96, Total=2550 [2022-11-22 00:17:33,801 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 829 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 2857 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 3009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:17:33,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 787 Invalid, 3009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2857 Invalid, 0 Unknown, 123 Unchecked, 3.0s Time] [2022-11-22 00:17:33,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14343 states. [2022-11-22 00:17:34,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14343 to 7803. [2022-11-22 00:17:34,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7803 states, 7802 states have (on average 4.3782363496539345) internal successors, (34159), 7802 states have internal predecessors, (34159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7803 states to 7803 states and 34159 transitions. [2022-11-22 00:17:34,336 INFO L78 Accepts]: Start accepts. Automaton has 7803 states and 34159 transitions. Word has length 58 [2022-11-22 00:17:34,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:17:34,337 INFO L495 AbstractCegarLoop]: Abstraction has 7803 states and 34159 transitions. [2022-11-22 00:17:34,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.133333333333334) internal successors, (124), 30 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:34,338 INFO L276 IsEmpty]: Start isEmpty. Operand 7803 states and 34159 transitions. [2022-11-22 00:17:34,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-22 00:17:34,374 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:17:34,374 INFO L195 NwaCegarLoop]: 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, 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:17:34,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-22 00:17:34,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-22 00:17:34,582 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-22 00:17:34,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:17:34,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1988938719, now seen corresponding path program 4 times [2022-11-22 00:17:34,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:17:34,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365098772] [2022-11-22 00:17:34,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:17:34,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:17:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:17:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 00:17:36,162 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:17:36,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365098772] [2022-11-22 00:17:36,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365098772] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:17:36,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197324161] [2022-11-22 00:17:36,163 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 00:17:36,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:17:36,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:17:36,165 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:17:36,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-22 00:17:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:17:36,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-22 00:17:36,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:17:36,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:36,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 00:17:37,103 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-22 00:17:37,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 00:17:37,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:17:37,859 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:17:37,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 43 [2022-11-22 00:17:37,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2022-11-22 00:17:37,893 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:17:37,908 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-22 00:17:37,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2022-11-22 00:17:38,314 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 00:17:38,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197324161] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:17:38,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [967457338] [2022-11-22 00:17:38,315 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:17:38,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:17:38,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-11-22 00:17:38,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632001525] [2022-11-22 00:17:38,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:17:38,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-22 00:17:38,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:17:38,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-22 00:17:38,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=389, Unknown=3, NotChecked=0, Total=462 [2022-11-22 00:17:38,318 INFO L87 Difference]: Start difference. First operand 7803 states and 34159 transitions. Second operand has 22 states, 21 states have (on average 5.0) internal successors, (105), 21 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:40,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:17:40,950 INFO L93 Difference]: Finished difference Result 13606 states and 60926 transitions. [2022-11-22 00:17:40,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-22 00:17:40,951 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 5.0) internal successors, (105), 21 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-22 00:17:40,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:17:41,015 INFO L225 Difference]: With dead ends: 13606 [2022-11-22 00:17:41,015 INFO L226 Difference]: Without dead ends: 12673 [2022-11-22 00:17:41,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 99 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=203, Invalid=850, Unknown=3, NotChecked=0, Total=1056 [2022-11-22 00:17:41,017 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 553 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 1751 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 1760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-22 00:17:41,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 477 Invalid, 1760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1751 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-22 00:17:41,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12673 states. [2022-11-22 00:17:41,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12673 to 8247. [2022-11-22 00:17:41,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8247 states, 8246 states have (on average 4.393039049235993) internal successors, (36225), 8246 states have internal predecessors, (36225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:41,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8247 states to 8247 states and 36225 transitions. [2022-11-22 00:17:41,372 INFO L78 Accepts]: Start accepts. Automaton has 8247 states and 36225 transitions. Word has length 58 [2022-11-22 00:17:41,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:17:41,372 INFO L495 AbstractCegarLoop]: Abstraction has 8247 states and 36225 transitions. [2022-11-22 00:17:41,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 5.0) internal successors, (105), 21 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:41,373 INFO L276 IsEmpty]: Start isEmpty. Operand 8247 states and 36225 transitions. [2022-11-22 00:17:41,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-22 00:17:41,401 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:17:41,402 INFO L195 NwaCegarLoop]: 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, 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:17:41,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-22 00:17:41,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-22 00:17:41,609 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-22 00:17:41,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:17:41,609 INFO L85 PathProgramCache]: Analyzing trace with hash 658175327, now seen corresponding path program 5 times [2022-11-22 00:17:41,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:17:41,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58379122] [2022-11-22 00:17:41,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:17:41,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:17:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:17:43,266 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 00:17:43,267 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:17:43,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58379122] [2022-11-22 00:17:43,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58379122] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:17:43,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330531243] [2022-11-22 00:17:43,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 00:17:43,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:17:43,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:17:43,271 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:17:43,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-22 00:17:43,571 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 00:17:43,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:17:43,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-22 00:17:43,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:17:43,651 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-22 00:17:43,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-22 00:17:43,925 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-22 00:17:43,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-22 00:17:43,955 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 00:17:43,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-22 00:17:44,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:44,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 00:17:44,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 00:17:44,931 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-22 00:17:45,169 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:17:45,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:17:45,545 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_881 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_881) c_~X_0~0.base) .cse0) c_~s_2~0))) (forall ((v_ArrVal_881 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_881) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))))) is different from false [2022-11-22 00:17:45,783 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:17:45,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 180 [2022-11-22 00:17:45,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 140 [2022-11-22 00:17:45,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 126 [2022-11-22 00:17:45,921 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:17:45,922 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:17:45,936 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-22 00:17:45,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2022-11-22 00:17:46,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:17:46,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330531243] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:17:46,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1909381875] [2022-11-22 00:17:46,896 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:17:46,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:17:46,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 30 [2022-11-22 00:17:46,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111369192] [2022-11-22 00:17:46,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:17:46,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-22 00:17:46,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:17:46,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-22 00:17:46,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=811, Unknown=7, NotChecked=58, Total=992 [2022-11-22 00:17:46,899 INFO L87 Difference]: Start difference. First operand 8247 states and 36225 transitions. Second operand has 32 states, 31 states have (on average 4.064516129032258) internal successors, (126), 31 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:52,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:17:52,122 INFO L93 Difference]: Finished difference Result 14438 states and 64810 transitions. [2022-11-22 00:17:52,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-22 00:17:52,123 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.064516129032258) internal successors, (126), 31 states have internal predecessors, (126), 0 states have call successors, (0), 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 58 [2022-11-22 00:17:52,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:17:52,191 INFO L225 Difference]: With dead ends: 14438 [2022-11-22 00:17:52,191 INFO L226 Difference]: Without dead ends: 13637 [2022-11-22 00:17:52,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 90 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=500, Invalid=2047, Unknown=7, NotChecked=98, Total=2652 [2022-11-22 00:17:52,192 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 877 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 2686 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 3008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 288 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:17:52,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 670 Invalid, 3008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2686 Invalid, 0 Unknown, 288 Unchecked, 3.2s Time] [2022-11-22 00:17:52,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13637 states. [2022-11-22 00:17:52,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13637 to 8247. [2022-11-22 00:17:52,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8247 states, 8246 states have (on average 4.393039049235993) internal successors, (36225), 8246 states have internal predecessors, (36225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:52,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8247 states to 8247 states and 36225 transitions. [2022-11-22 00:17:52,611 INFO L78 Accepts]: Start accepts. Automaton has 8247 states and 36225 transitions. Word has length 58 [2022-11-22 00:17:52,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:17:52,611 INFO L495 AbstractCegarLoop]: Abstraction has 8247 states and 36225 transitions. [2022-11-22 00:17:52,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.064516129032258) internal successors, (126), 31 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:17:52,612 INFO L276 IsEmpty]: Start isEmpty. Operand 8247 states and 36225 transitions. [2022-11-22 00:17:52,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-22 00:17:52,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:17:52,648 INFO L195 NwaCegarLoop]: 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, 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:17:52,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-22 00:17:52,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-22 00:17:52,856 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-22 00:17:52,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:17:52,857 INFO L85 PathProgramCache]: Analyzing trace with hash -306655221, now seen corresponding path program 6 times [2022-11-22 00:17:52,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:17:52,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106152831] [2022-11-22 00:17:52,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:17:52,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:17:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:17:54,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 00:17:54,622 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:17:54,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106152831] [2022-11-22 00:17:54,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106152831] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:17:54,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591617304] [2022-11-22 00:17:54,622 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 00:17:54,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:17:54,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:17:54,624 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:17:54,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-22 00:17:54,919 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 00:17:54,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:17:54,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-22 00:17:54,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:17:55,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:55,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 00:17:55,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:17:55,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 00:17:56,065 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-22 00:17:56,281 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 00:17:56,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:17:56,923 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:17:56,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 266 treesize of output 188 [2022-11-22 00:17:56,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 148 [2022-11-22 00:17:56,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 67 [2022-11-22 00:17:57,089 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:17:57,090 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:17:57,112 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-22 00:17:57,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-11-22 00:17:57,780 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 00:17:57,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591617304] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:17:57,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [966502052] [2022-11-22 00:17:57,782 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:17:57,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:17:57,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 26 [2022-11-22 00:17:57,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738903651] [2022-11-22 00:17:57,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:17:57,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-22 00:17:57,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:17:57,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-22 00:17:57,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=638, Unknown=10, NotChecked=0, Total=756 [2022-11-22 00:17:57,786 INFO L87 Difference]: Start difference. First operand 8247 states and 36225 transitions. Second operand has 28 states, 27 states have (on average 4.518518518518518) internal successors, (122), 27 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:18:00,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:18:00,932 INFO L93 Difference]: Finished difference Result 14182 states and 63558 transitions. [2022-11-22 00:18:00,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-22 00:18:00,939 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.518518518518518) internal successors, (122), 27 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-22 00:18:00,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:18:00,995 INFO L225 Difference]: With dead ends: 14182 [2022-11-22 00:18:00,995 INFO L226 Difference]: Without dead ends: 13381 [2022-11-22 00:18:00,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 95 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=326, Invalid=1386, Unknown=10, NotChecked=0, Total=1722 [2022-11-22 00:18:00,997 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 576 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 2190 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 2204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:18:00,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 527 Invalid, 2204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2190 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-22 00:18:01,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13381 states. [2022-11-22 00:18:01,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13381 to 8199. [2022-11-22 00:18:01,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8199 states, 8198 states have (on average 4.388997316418639) internal successors, (35981), 8198 states have internal predecessors, (35981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:18:01,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8199 states to 8199 states and 35981 transitions. [2022-11-22 00:18:01,328 INFO L78 Accepts]: Start accepts. Automaton has 8199 states and 35981 transitions. Word has length 58 [2022-11-22 00:18:01,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:18:01,328 INFO L495 AbstractCegarLoop]: Abstraction has 8199 states and 35981 transitions. [2022-11-22 00:18:01,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.518518518518518) internal successors, (122), 27 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:18:01,328 INFO L276 IsEmpty]: Start isEmpty. Operand 8199 states and 35981 transitions. [2022-11-22 00:18:01,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-22 00:18:01,355 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:18:01,355 INFO L195 NwaCegarLoop]: 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, 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:18:01,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-22 00:18:01,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:18:01,563 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-22 00:18:01,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:18:01,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1481044152, now seen corresponding path program 2 times [2022-11-22 00:18:01,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:18:01,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628343423] [2022-11-22 00:18:01,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:18:01,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:18:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:18:02,928 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 00:18:02,928 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:18:02,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628343423] [2022-11-22 00:18:02,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628343423] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:18:02,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743633078] [2022-11-22 00:18:02,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 00:18:02,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:18:02,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:18:02,935 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:18:02,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-22 00:18:03,365 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-22 00:18:03,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:18:03,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-22 00:18:03,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:18:03,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:18:03,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 00:18:04,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:18:04,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 00:18:04,221 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-22 00:18:04,381 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:18:04,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:18:04,655 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) (.cse0 (+ c_~s_6~0 c_~t_8~0))) (and (forall ((v_ArrVal_1033 (Array Int Int))) (< .cse0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1033) c_~X_0~0.base) .cse1) 1 c_~s_2~0))) (forall ((v_ArrVal_1033 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1033) c_~X_0~0.base) .cse1) c_~s_2~0) .cse0)))) is different from false [2022-11-22 00:18:04,895 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:18:04,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 180 [2022-11-22 00:18:04,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 70 [2022-11-22 00:18:04,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 126 [2022-11-22 00:18:05,005 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:18:05,007 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:18:05,017 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-22 00:18:05,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2022-11-22 00:18:05,608 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:18:05,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743633078] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:18:05,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [849265235] [2022-11-22 00:18:05,610 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:18:05,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:18:05,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 31 [2022-11-22 00:18:05,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767468568] [2022-11-22 00:18:05,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:18:05,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-22 00:18:05,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:18:05,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-22 00:18:05,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=858, Unknown=10, NotChecked=60, Total=1056 [2022-11-22 00:18:05,613 INFO L87 Difference]: Start difference. First operand 8199 states and 35981 transitions. Second operand has 33 states, 32 states have (on average 3.96875) internal successors, (127), 32 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:18:11,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:18:11,008 INFO L93 Difference]: Finished difference Result 25513 states and 114029 transitions. [2022-11-22 00:18:11,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-22 00:18:11,011 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.96875) internal successors, (127), 32 states have internal predecessors, (127), 0 states have call successors, (0), 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 58 [2022-11-22 00:18:11,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:18:11,121 INFO L225 Difference]: With dead ends: 25513 [2022-11-22 00:18:11,121 INFO L226 Difference]: Without dead ends: 24015 [2022-11-22 00:18:11,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 91 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=714, Invalid=3062, Unknown=10, NotChecked=120, Total=3906 [2022-11-22 00:18:11,123 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 1274 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 2994 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 3273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 241 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:18:11,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 728 Invalid, 3273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2994 Invalid, 0 Unknown, 241 Unchecked, 3.2s Time] [2022-11-22 00:18:11,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24015 states. [2022-11-22 00:18:11,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24015 to 8311. [2022-11-22 00:18:11,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8311 states, 8310 states have (on average 4.397232250300842) internal successors, (36541), 8310 states have internal predecessors, (36541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:18:11,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8311 states to 8311 states and 36541 transitions. [2022-11-22 00:18:11,517 INFO L78 Accepts]: Start accepts. Automaton has 8311 states and 36541 transitions. Word has length 58 [2022-11-22 00:18:11,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:18:11,518 INFO L495 AbstractCegarLoop]: Abstraction has 8311 states and 36541 transitions. [2022-11-22 00:18:11,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.96875) internal successors, (127), 32 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:18:11,518 INFO L276 IsEmpty]: Start isEmpty. Operand 8311 states and 36541 transitions. [2022-11-22 00:18:11,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-22 00:18:11,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:18:11,538 INFO L195 NwaCegarLoop]: 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, 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:18:11,544 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-22 00:18:11,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-22 00:18:11,739 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-22 00:18:11,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:18:11,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1359016328, now seen corresponding path program 3 times [2022-11-22 00:18:11,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:18:11,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681853876] [2022-11-22 00:18:11,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:18:11,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:18:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:18:13,107 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 00:18:13,108 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:18:13,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681853876] [2022-11-22 00:18:13,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681853876] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:18:13,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045700518] [2022-11-22 00:18:13,108 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 00:18:13,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:18:13,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:18:13,110 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:18:13,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d26c2c-7f20-48de-92e8-b7857bec73a9/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-22 00:18:13,411 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 00:18:13,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:18:13,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-22 00:18:13,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:18:13,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 00:18:13,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 00:18:13,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 00:18:13,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 00:18:14,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 00:18:14,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:18:14,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 00:18:14,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:18:14,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-22 00:18:14,849 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-22 00:18:15,032 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:18:15,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:18:15,648 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) (.cse0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))))) (and (forall ((v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1114 (Array Int Int))) (<= (+ c_~s_6~0 .cse0) (+ (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_1114) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1115) c_~X_0~0.base) .cse1) c_~s_2~0))) (forall ((v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1114 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_1114) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1115) c_~X_0~0.base) .cse1) c_~s_2~0) (+ c_~s_6~0 .cse0 1))))) is different from false [2022-11-22 00:18:15,715 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))) (.cse1 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1113 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_1113))) (< (+ (select (select (store (store .cse0 |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_1114) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1115) c_~X_0~0.base) .cse1) c_~s_2~0) (+ c_~s_6~0 (select (select .cse0 c_~X_0~0.base) .cse2) 1)))) (forall ((v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1113 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_1113))) (<= (+ c_~s_6~0 (select (select .cse3 c_~X_0~0.base) .cse2)) (+ (select (select (store (store .cse3 |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_1114) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1115) c_~X_0~0.base) .cse1) c_~s_2~0)))))) is different from false [2022-11-22 00:18:15,828 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~X_0~0.offset 4)) (.cse1 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_117| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_117|)) (forall ((v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1113 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_1113))) (< (+ (select (select (store (store .cse0 |v_thread4Thread1of1ForFork0_~#t6~0.base_117| v_ArrVal_1114) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1115) c_~X_0~0.base) .cse1) c_~s_2~0) (+ (select (select .cse0 c_~X_0~0.base) .cse2) 1)))))) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_117| Int)) (or (forall ((v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1113 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_1113))) (<= (select (select .cse3 c_~X_0~0.base) .cse2) (+ (select (select (store (store .cse3 |v_thread4Thread1of1ForFork0_~#t6~0.base_117| v_ArrVal_1114) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1115) c_~X_0~0.base) .cse1) c_~s_2~0)))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_117|)))))) is different from false [2022-11-22 00:18:17,889 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) (.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_114| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_114|)) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_117| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_117|)) (forall ((v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1113 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_114| v_ArrVal_1113))) (<= (select (select .cse0 c_~X_0~0.base) .cse1) (+ (select (select (store (store .cse0 |v_thread4Thread1of1ForFork0_~#t6~0.base_117| v_ArrVal_1114) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1115) c_~X_0~0.base) .cse2) c_~s_2~0)))))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_114| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_114|)) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_117| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_117|)) (forall ((v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1113 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_114| v_ArrVal_1113))) (< (+ (select (select (store (store .cse3 |v_thread4Thread1of1ForFork0_~#t6~0.base_117| v_ArrVal_1114) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1115) c_~X_0~0.base) .cse2) c_~s_2~0) (+ (select (select .cse3 c_~X_0~0.base) .cse1) 1)))))))))) is different from false [2022-11-22 00:18:18,015 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) (.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_114| Int) (v_ArrVal_1112 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_114|)) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_117| Int)) (or (forall ((v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1113 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1112) |v_thread4Thread1of1ForFork0_~#t5~0.base_114| v_ArrVal_1113))) (<= (select (select .cse0 c_~X_0~0.base) .cse1) (+ (select (select (store (store .cse0 |v_thread4Thread1of1ForFork0_~#t6~0.base_117| v_ArrVal_1114) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1115) c_~X_0~0.base) .cse2) c_~s_2~0)))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_117|)))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_114| Int) (v_ArrVal_1112 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_114|)) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_117| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_117|)) (forall ((v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1113 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1112) |v_thread4Thread1of1ForFork0_~#t5~0.base_114| v_ArrVal_1113))) (< (+ (select (select (store (store .cse3 |v_thread4Thread1of1ForFork0_~#t6~0.base_117| v_ArrVal_1114) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1115) c_~X_0~0.base) .cse2) c_~s_2~0) (+ (select (select .cse3 c_~X_0~0.base) .cse1) 1)))))))))) is different from false [2022-11-22 00:18:18,143 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) (.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_114| Int) (v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_114|)) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_117| Int)) (or (forall ((v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1113 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1111) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1112) |v_thread4Thread1of1ForFork0_~#t5~0.base_114| v_ArrVal_1113))) (<= (select (select .cse0 c_~X_0~0.base) .cse1) (+ (select (select (store (store .cse0 |v_thread4Thread1of1ForFork0_~#t6~0.base_117| v_ArrVal_1114) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1115) c_~X_0~0.base) .cse2) c_~s_2~0)))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_117|)))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_114| Int) (v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_114|)) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_117| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_117|)) (forall ((v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1113 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1111) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1112) |v_thread4Thread1of1ForFork0_~#t5~0.base_114| v_ArrVal_1113))) (< (+ (select (select (store (store .cse3 |v_thread4Thread1of1ForFork0_~#t6~0.base_117| v_ArrVal_1114) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1115) c_~X_0~0.base) .cse2) c_~s_2~0) (+ (select (select .cse3 c_~X_0~0.base) .cse1) 1)))))))))) is different from false [2022-11-22 00:18:18,290 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_114| Int) (v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_114|)) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_117| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_117|)) (forall ((v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1113 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1111) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1112) |v_thread4Thread1of1ForFork0_~#t5~0.base_114| v_ArrVal_1113))) (<= (select (select .cse0 c_~X_0~0.base) .cse1) (select (select (store (store .cse0 |v_thread4Thread1of1ForFork0_~#t6~0.base_117| v_ArrVal_1114) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1115) c_~X_0~0.base) .cse1)))))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_114| Int) (v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1111 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_114|)) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_117| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_117|)) (forall ((v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1114 (Array Int Int)) (v_ArrVal_1113 (Array Int Int))) (let ((.cse2 (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1111) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1112) |v_thread4Thread1of1ForFork0_~#t5~0.base_114| v_ArrVal_1113))) (< (select (select (store (store .cse2 |v_thread4Thread1of1ForFork0_~#t6~0.base_117| v_ArrVal_1114) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1115) c_~X_0~0.base) .cse1) (+ (select (select .cse2 c_~X_0~0.base) .cse1) 1)))))))))) is different from false [2022-11-22 00:18:29,496 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:18:29,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 60 [2022-11-22 00:18:29,862 INFO L350 Elim1Store]: Elim1 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 2943967222 treesize of output 2882625526