./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/stack-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/stack-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI --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 a5e93db72222dd521789305cbf7823ac91f269c62c97020d54f95f5ba14d3fd2 --- 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-5e519f3 [2022-11-03 02:15:31,866 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:15:31,869 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:15:31,925 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:15:31,925 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:15:31,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:15:31,933 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:15:31,937 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:15:31,939 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:15:31,945 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:15:31,946 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:15:31,948 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:15:31,949 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:15:31,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:15:31,953 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:15:31,954 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:15:31,956 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:15:31,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:15:31,958 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:15:31,968 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:15:31,969 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:15:31,971 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:15:31,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:15:31,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:15:31,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:15:31,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:15:31,986 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:15:31,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:15:31,988 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:15:31,989 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:15:31,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:15:31,991 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:15:31,992 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:15:31,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:15:31,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:15:31,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:15:31,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:15:31,996 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:15:31,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:15:31,997 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:15:31,998 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:15:31,999 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:15:32,041 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:15:32,041 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:15:32,042 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:15:32,042 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:15:32,043 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:15:32,044 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:15:32,044 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:15:32,044 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:15:32,044 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:15:32,044 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:15:32,046 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:15:32,046 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:15:32,046 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:15:32,046 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:15:32,047 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:15:32,047 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:15:32,047 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:15:32,047 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:15:32,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:15:32,048 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:15:32,049 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:15:32,049 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:15:32,049 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:15:32,049 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:15:32,050 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:15:32,050 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:15:32,050 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:15:32,050 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:15:32,051 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:15:32,051 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:15:32,051 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:15:32,051 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:15:32,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:15:32,052 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:15:32,052 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:15:32,053 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:15:32,053 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:15:32,053 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:15:32,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:15:32,053 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:15:32,054 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:15:32,054 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_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/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_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI 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 -> a5e93db72222dd521789305cbf7823ac91f269c62c97020d54f95f5ba14d3fd2 [2022-11-03 02:15:32,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:15:32,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:15:32,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:15:32,424 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:15:32,425 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:15:32,426 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/pthread/stack-1.i [2022-11-03 02:15:32,499 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/data/e699679b0/abc81ceb88ba456c90ee5bb0a61820a0/FLAGbe74f0488 [2022-11-03 02:15:33,047 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:15:33,047 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/sv-benchmarks/c/pthread/stack-1.i [2022-11-03 02:15:33,067 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/data/e699679b0/abc81ceb88ba456c90ee5bb0a61820a0/FLAGbe74f0488 [2022-11-03 02:15:33,352 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/data/e699679b0/abc81ceb88ba456c90ee5bb0a61820a0 [2022-11-03 02:15:33,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:15:33,356 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:15:33,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:15:33,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:15:33,368 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:15:33,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:15:33" (1/1) ... [2022-11-03 02:15:33,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eea364f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:33, skipping insertion in model container [2022-11-03 02:15:33,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:15:33" (1/1) ... [2022-11-03 02:15:33,379 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:15:33,419 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:15:33,902 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/sv-benchmarks/c/pthread/stack-1.i[41520,41533] [2022-11-03 02:15:33,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:15:33,936 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:15:33,994 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/sv-benchmarks/c/pthread/stack-1.i[41520,41533] [2022-11-03 02:15:34,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:15:34,086 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:15:34,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:34 WrapperNode [2022-11-03 02:15:34,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:15:34,087 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:15:34,087 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:15:34,087 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:15:34,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:34" (1/1) ... [2022-11-03 02:15:34,122 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:34" (1/1) ... [2022-11-03 02:15:34,163 INFO L138 Inliner]: procedures = 277, calls = 45, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 154 [2022-11-03 02:15:34,164 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:15:34,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:15:34,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:15:34,166 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:15:34,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:34" (1/1) ... [2022-11-03 02:15:34,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:34" (1/1) ... [2022-11-03 02:15:34,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:34" (1/1) ... [2022-11-03 02:15:34,189 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:34" (1/1) ... [2022-11-03 02:15:34,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:34" (1/1) ... [2022-11-03 02:15:34,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:34" (1/1) ... [2022-11-03 02:15:34,216 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:34" (1/1) ... [2022-11-03 02:15:34,217 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:34" (1/1) ... [2022-11-03 02:15:34,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:15:34,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:15:34,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:15:34,227 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:15:34,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:34" (1/1) ... [2022-11-03 02:15:34,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:15:34,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:15:34,264 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:15:34,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:15:34,311 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-03 02:15:34,311 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-03 02:15:34,311 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-03 02:15:34,312 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-03 02:15:34,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:15:34,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:15:34,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 02:15:34,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:15:34,313 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-03 02:15:34,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:15:34,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:15:34,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:15:34,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:15:34,316 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 02:15:34,522 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:15:34,524 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:15:34,852 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:15:34,860 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:15:34,860 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-03 02:15:34,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:15:34 BoogieIcfgContainer [2022-11-03 02:15:34,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:15:34,865 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:15:34,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:15:34,869 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:15:34,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:15:33" (1/3) ... [2022-11-03 02:15:34,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1103c207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:15:34, skipping insertion in model container [2022-11-03 02:15:34,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:15:34" (2/3) ... [2022-11-03 02:15:34,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1103c207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:15:34, skipping insertion in model container [2022-11-03 02:15:34,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:15:34" (3/3) ... [2022-11-03 02:15:34,872 INFO L112 eAbstractionObserver]: Analyzing ICFG stack-1.i [2022-11-03 02:15:34,881 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 02:15:34,895 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:15:34,895 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-03 02:15:34,895 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 02:15:35,045 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-03 02:15:35,109 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:15:35,126 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 176 transitions, 368 flow [2022-11-03 02:15:35,131 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 176 transitions, 368 flow [2022-11-03 02:15:35,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 176 transitions, 368 flow [2022-11-03 02:15:35,261 INFO L130 PetriNetUnfolder]: 10/174 cut-off events. [2022-11-03 02:15:35,262 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-03 02:15:35,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 174 events. 10/174 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 416 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 126. Up to 3 conditions per place. [2022-11-03 02:15:35,280 INFO L118 LiptonReduction]: Number of co-enabled transitions 8324 [2022-11-03 02:15:40,847 INFO L133 LiptonReduction]: Checked pairs total: 11654 [2022-11-03 02:15:40,847 INFO L135 LiptonReduction]: Total number of compositions: 170 [2022-11-03 02:15:40,856 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 37 transitions, 90 flow [2022-11-03 02:15:40,911 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 304 states, 301 states have (on average 2.681063122923588) internal successors, (807), 303 states have internal predecessors, (807), 0 states have call successors, (0), 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-03 02:15:40,927 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:15:40,932 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;@10c53967, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:15:40,933 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-03 02:15:40,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 304 states, 301 states have (on average 2.681063122923588) internal successors, (807), 303 states have internal predecessors, (807), 0 states have call successors, (0), 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-03 02:15:40,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 02:15:40,941 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:40,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 02:15:40,943 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:15:40,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:40,950 INFO L85 PathProgramCache]: Analyzing trace with hash -337140606, now seen corresponding path program 1 times [2022-11-03 02:15:40,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:15:40,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851974587] [2022-11-03 02:15:40,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:40,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:15:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:41,337 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-03 02:15:41,337 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:15:41,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851974587] [2022-11-03 02:15:41,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851974587] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:15:41,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:15:41,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:15:41,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443705332] [2022-11-03 02:15:41,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:15:41,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:15:41,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:15:41,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:15:41,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:15:41,383 INFO L87 Difference]: Start difference. First operand has 304 states, 301 states have (on average 2.681063122923588) internal successors, (807), 303 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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-03 02:15:41,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:15:41,529 INFO L93 Difference]: Finished difference Result 434 states and 1115 transitions. [2022-11-03 02:15:41,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:15:41,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-03 02:15:41,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:15:41,556 INFO L225 Difference]: With dead ends: 434 [2022-11-03 02:15:41,557 INFO L226 Difference]: Without dead ends: 416 [2022-11-03 02:15:41,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:15:41,561 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:15:41,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:15:41,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-11-03 02:15:41,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 392. [2022-11-03 02:15:41,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 389 states have (on average 2.67866323907455) internal successors, (1042), 391 states have internal predecessors, (1042), 0 states have call successors, (0), 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-03 02:15:41,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1042 transitions. [2022-11-03 02:15:41,655 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1042 transitions. Word has length 6 [2022-11-03 02:15:41,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:15:41,657 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 1042 transitions. [2022-11-03 02:15:41,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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-03 02:15:41,657 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1042 transitions. [2022-11-03 02:15:41,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:15:41,660 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:41,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:41,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:15:41,666 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:15:41,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:41,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1441763216, now seen corresponding path program 1 times [2022-11-03 02:15:41,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:15:41,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644064135] [2022-11-03 02:15:41,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:41,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:15:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:41,833 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-03 02:15:41,833 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:15:41,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644064135] [2022-11-03 02:15:41,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644064135] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:15:41,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:15:41,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:15:41,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200732424] [2022-11-03 02:15:41,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:15:41,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:15:41,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:15:41,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:15:41,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:15:41,836 INFO L87 Difference]: Start difference. First operand 392 states and 1042 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:15:41,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:15:41,925 INFO L93 Difference]: Finished difference Result 432 states and 1145 transitions. [2022-11-03 02:15:41,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:15:41,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-03 02:15:41,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:15:41,931 INFO L225 Difference]: With dead ends: 432 [2022-11-03 02:15:41,931 INFO L226 Difference]: Without dead ends: 432 [2022-11-03 02:15:41,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:15:41,933 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:15:41,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:15:41,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-11-03 02:15:41,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2022-11-03 02:15:41,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 429 states have (on average 2.668997668997669) internal successors, (1145), 431 states have internal predecessors, (1145), 0 states have call successors, (0), 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-03 02:15:41,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1145 transitions. [2022-11-03 02:15:41,960 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 1145 transitions. Word has length 10 [2022-11-03 02:15:41,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:15:41,961 INFO L495 AbstractCegarLoop]: Abstraction has 432 states and 1145 transitions. [2022-11-03 02:15:41,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:15:41,961 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1145 transitions. [2022-11-03 02:15:41,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:15:41,962 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:41,963 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:41,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:15:41,963 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:15:41,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:41,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1892775260, now seen corresponding path program 1 times [2022-11-03 02:15:41,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:15:41,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510532103] [2022-11-03 02:15:41,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:41,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:15:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:42,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:15:42,127 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:15:42,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510532103] [2022-11-03 02:15:42,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510532103] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:15:42,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678608247] [2022-11-03 02:15:42,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:42,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:15:42,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:15:42,130 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:15:42,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:15:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:42,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:15:42,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:15:42,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:15:42,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:15:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:15:42,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678608247] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:15:42,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2081143936] [2022-11-03 02:15:42,457 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-03 02:15:42,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:15:42,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-11-03 02:15:42,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305892244] [2022-11-03 02:15:42,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:15:42,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 02:15:42,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:15:42,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 02:15:42,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:15:42,467 INFO L87 Difference]: Start difference. First operand 432 states and 1145 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 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-03 02:15:42,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:15:42,897 INFO L93 Difference]: Finished difference Result 1058 states and 2714 transitions. [2022-11-03 02:15:42,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:15:42,898 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 02:15:42,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:15:42,904 INFO L225 Difference]: With dead ends: 1058 [2022-11-03 02:15:42,904 INFO L226 Difference]: Without dead ends: 1046 [2022-11-03 02:15:42,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:15:42,905 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 162 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:15:42,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 0 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:15:42,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2022-11-03 02:15:42,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 720. [2022-11-03 02:15:42,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 717 states have (on average 2.693165969316597) internal successors, (1931), 719 states have internal predecessors, (1931), 0 states have call successors, (0), 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-03 02:15:42,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1931 transitions. [2022-11-03 02:15:42,962 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1931 transitions. Word has length 13 [2022-11-03 02:15:42,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:15:42,963 INFO L495 AbstractCegarLoop]: Abstraction has 720 states and 1931 transitions. [2022-11-03 02:15:42,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 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-03 02:15:42,963 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1931 transitions. [2022-11-03 02:15:42,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 02:15:42,965 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:42,965 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:43,005 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:15:43,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:15:43,190 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:15:43,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:43,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1282520059, now seen corresponding path program 1 times [2022-11-03 02:15:43,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:15:43,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400473853] [2022-11-03 02:15:43,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:43,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:15:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:43,289 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-03 02:15:43,289 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:15:43,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400473853] [2022-11-03 02:15:43,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400473853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:15:43,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:15:43,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:15:43,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122770482] [2022-11-03 02:15:43,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:15:43,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:15:43,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:15:43,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:15:43,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:15:43,294 INFO L87 Difference]: Start difference. First operand 720 states and 1931 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:15:43,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:15:43,360 INFO L93 Difference]: Finished difference Result 310 states and 703 transitions. [2022-11-03 02:15:43,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:15:43,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 02:15:43,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:15:43,363 INFO L225 Difference]: With dead ends: 310 [2022-11-03 02:15:43,363 INFO L226 Difference]: Without dead ends: 310 [2022-11-03 02:15:43,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:15:43,367 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:15:43,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:15:43,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-11-03 02:15:43,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 288. [2022-11-03 02:15:43,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 286 states have (on average 2.2447552447552446) internal successors, (642), 287 states have internal predecessors, (642), 0 states have call successors, (0), 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-03 02:15:43,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 642 transitions. [2022-11-03 02:15:43,383 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 642 transitions. Word has length 16 [2022-11-03 02:15:43,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:15:43,384 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 642 transitions. [2022-11-03 02:15:43,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:15:43,385 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 642 transitions. [2022-11-03 02:15:43,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:15:43,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:43,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:43,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 02:15:43,397 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:15:43,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:43,398 INFO L85 PathProgramCache]: Analyzing trace with hash -267549148, now seen corresponding path program 1 times [2022-11-03 02:15:43,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:15:43,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524920174] [2022-11-03 02:15:43,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:43,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:15:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:43,472 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-03 02:15:43,472 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:15:43,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524920174] [2022-11-03 02:15:43,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524920174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:15:43,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:15:43,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:15:43,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325306652] [2022-11-03 02:15:43,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:15:43,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:15:43,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:15:43,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:15:43,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:15:43,475 INFO L87 Difference]: Start difference. First operand 288 states and 642 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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-03 02:15:43,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:15:43,568 INFO L93 Difference]: Finished difference Result 346 states and 774 transitions. [2022-11-03 02:15:43,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:15:43,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-11-03 02:15:43,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:15:43,570 INFO L225 Difference]: With dead ends: 346 [2022-11-03 02:15:43,571 INFO L226 Difference]: Without dead ends: 340 [2022-11-03 02:15:43,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:15:43,572 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:15:43,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:15:43,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-11-03 02:15:43,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 284. [2022-11-03 02:15:43,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 282 states have (on average 2.2588652482269502) internal successors, (637), 283 states have internal predecessors, (637), 0 states have call successors, (0), 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-03 02:15:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 637 transitions. [2022-11-03 02:15:43,583 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 637 transitions. Word has length 17 [2022-11-03 02:15:43,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:15:43,583 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 637 transitions. [2022-11-03 02:15:43,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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-03 02:15:43,584 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 637 transitions. [2022-11-03 02:15:43,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:15:43,586 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:43,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:43,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 02:15:43,586 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:15:43,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:43,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1082463390, now seen corresponding path program 1 times [2022-11-03 02:15:43,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:15:43,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163475544] [2022-11-03 02:15:43,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:43,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:15:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:44,712 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-03 02:15:44,712 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:15:44,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163475544] [2022-11-03 02:15:44,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163475544] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:15:44,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:15:44,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-03 02:15:44,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762222096] [2022-11-03 02:15:44,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:15:44,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 02:15:44,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:15:44,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 02:15:44,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:15:44,714 INFO L87 Difference]: Start difference. First operand 284 states and 637 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:15:46,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:15:46,355 INFO L93 Difference]: Finished difference Result 531 states and 1147 transitions. [2022-11-03 02:15:46,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-03 02:15:46,356 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-03 02:15:46,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:15:46,358 INFO L225 Difference]: With dead ends: 531 [2022-11-03 02:15:46,358 INFO L226 Difference]: Without dead ends: 474 [2022-11-03 02:15:46,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=172, Invalid=820, Unknown=0, NotChecked=0, Total=992 [2022-11-03 02:15:46,359 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 114 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:15:46,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 0 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-03 02:15:46,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-11-03 02:15:46,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 346. [2022-11-03 02:15:46,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 344 states have (on average 2.2674418604651163) internal successors, (780), 345 states have internal predecessors, (780), 0 states have call successors, (0), 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-03 02:15:46,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 780 transitions. [2022-11-03 02:15:46,371 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 780 transitions. Word has length 21 [2022-11-03 02:15:46,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:15:46,371 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 780 transitions. [2022-11-03 02:15:46,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:15:46,372 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 780 transitions. [2022-11-03 02:15:46,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:15:46,373 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:46,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:46,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 02:15:46,373 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:15:46,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:46,374 INFO L85 PathProgramCache]: Analyzing trace with hash -839910030, now seen corresponding path program 2 times [2022-11-03 02:15:46,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:15:46,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756542153] [2022-11-03 02:15:46,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:46,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:15:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:47,329 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-03 02:15:47,330 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:15:47,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756542153] [2022-11-03 02:15:47,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756542153] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:15:47,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:15:47,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-03 02:15:47,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009809274] [2022-11-03 02:15:47,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:15:47,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-03 02:15:47,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:15:47,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-03 02:15:47,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-11-03 02:15:47,332 INFO L87 Difference]: Start difference. First operand 346 states and 780 transitions. Second operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:15:48,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:15:48,567 INFO L93 Difference]: Finished difference Result 557 states and 1214 transitions. [2022-11-03 02:15:48,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 02:15:48,568 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-03 02:15:48,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:15:48,570 INFO L225 Difference]: With dead ends: 557 [2022-11-03 02:15:48,570 INFO L226 Difference]: Without dead ends: 512 [2022-11-03 02:15:48,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2022-11-03 02:15:48,571 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 92 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:15:48,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 0 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-03 02:15:48,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2022-11-03 02:15:48,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 376. [2022-11-03 02:15:48,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 374 states have (on average 2.2566844919786098) internal successors, (844), 375 states have internal predecessors, (844), 0 states have call successors, (0), 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-03 02:15:48,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 844 transitions. [2022-11-03 02:15:48,589 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 844 transitions. Word has length 21 [2022-11-03 02:15:48,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:15:48,589 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 844 transitions. [2022-11-03 02:15:48,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:15:48,589 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 844 transitions. [2022-11-03 02:15:48,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:15:48,591 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:48,591 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:48,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 02:15:48,592 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:15:48,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:48,592 INFO L85 PathProgramCache]: Analyzing trace with hash 459758782, now seen corresponding path program 3 times [2022-11-03 02:15:48,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:15:48,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954310094] [2022-11-03 02:15:48,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:48,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:15:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:49,623 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-03 02:15:49,624 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:15:49,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954310094] [2022-11-03 02:15:49,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954310094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:15:49,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:15:49,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-03 02:15:49,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607668399] [2022-11-03 02:15:49,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:15:49,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-03 02:15:49,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:15:49,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-03 02:15:49,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-11-03 02:15:49,626 INFO L87 Difference]: Start difference. First operand 376 states and 844 transitions. Second operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:15:50,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:15:50,912 INFO L93 Difference]: Finished difference Result 574 states and 1241 transitions. [2022-11-03 02:15:50,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 02:15:50,912 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-03 02:15:50,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:15:50,915 INFO L225 Difference]: With dead ends: 574 [2022-11-03 02:15:50,915 INFO L226 Difference]: Without dead ends: 528 [2022-11-03 02:15:50,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2022-11-03 02:15:50,916 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 104 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:15:50,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 0 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 02:15:50,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-11-03 02:15:50,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 370. [2022-11-03 02:15:50,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 368 states have (on average 2.244565217391304) internal successors, (826), 369 states have internal predecessors, (826), 0 states have call successors, (0), 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-03 02:15:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 826 transitions. [2022-11-03 02:15:50,947 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 826 transitions. Word has length 21 [2022-11-03 02:15:50,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:15:50,947 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 826 transitions. [2022-11-03 02:15:50,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:15:50,948 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 826 transitions. [2022-11-03 02:15:50,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 02:15:50,949 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:50,949 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2022-11-03 02:15:50,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 02:15:50,950 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:15:50,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:50,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1824611556, now seen corresponding path program 2 times [2022-11-03 02:15:50,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:15:50,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429591530] [2022-11-03 02:15:50,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:50,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:15:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:51,144 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:15:51,148 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:15:51,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429591530] [2022-11-03 02:15:51,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429591530] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:15:51,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460205924] [2022-11-03 02:15:51,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:15:51,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:15:51,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:15:51,150 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:15:51,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 02:15:51,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 02:15:51,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:15:51,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 02:15:51,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:15:51,353 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:15:51,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:15:51,445 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:15:51,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460205924] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:15:51,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1649501226] [2022-11-03 02:15:51,445 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-03 02:15:51,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:15:51,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2022-11-03 02:15:51,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425050329] [2022-11-03 02:15:51,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:15:51,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 02:15:51,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:15:51,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 02:15:51,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-11-03 02:15:51,451 INFO L87 Difference]: Start difference. First operand 370 states and 826 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 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-03 02:15:51,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:15:51,721 INFO L93 Difference]: Finished difference Result 704 states and 1509 transitions. [2022-11-03 02:15:51,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 02:15:51,721 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-03 02:15:51,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:15:51,724 INFO L225 Difference]: With dead ends: 704 [2022-11-03 02:15:51,724 INFO L226 Difference]: Without dead ends: 704 [2022-11-03 02:15:51,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:15:51,725 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 163 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:15:51,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 0 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:15:51,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-11-03 02:15:51,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 482. [2022-11-03 02:15:51,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 480 states have (on average 2.25) internal successors, (1080), 481 states have internal predecessors, (1080), 0 states have call successors, (0), 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-03 02:15:51,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1080 transitions. [2022-11-03 02:15:51,742 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1080 transitions. Word has length 27 [2022-11-03 02:15:51,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:15:51,743 INFO L495 AbstractCegarLoop]: Abstraction has 482 states and 1080 transitions. [2022-11-03 02:15:51,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 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-03 02:15:51,743 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1080 transitions. [2022-11-03 02:15:51,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 02:15:51,744 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:15:51,744 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:15:51,784 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:15:51,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:15:51,967 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:15:51,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:15:51,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1586201792, now seen corresponding path program 4 times [2022-11-03 02:15:51,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:15:51,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376362418] [2022-11-03 02:15:51,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:15:51,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:15:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:52,830 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:15:52,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:15:52,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376362418] [2022-11-03 02:15:52,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376362418] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:15:52,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128896318] [2022-11-03 02:15:52,832 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:15:52,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:15:52,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:15:52,835 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:15:52,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 02:15:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:15:52,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-03 02:15:52,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:15:53,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-11-03 02:15:54,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 46 [2022-11-03 02:15:58,954 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:15:58,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:15:59,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-03 02:15:59,749 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:15:59,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128896318] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 02:15:59,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:15:59,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15, 15] total 43 [2022-11-03 02:15:59,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917538594] [2022-11-03 02:15:59,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:15:59,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 02:15:59,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:15:59,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 02:15:59,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1750, Unknown=1, NotChecked=0, Total=1892 [2022-11-03 02:15:59,752 INFO L87 Difference]: Start difference. First operand 482 states and 1080 transitions. Second operand has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 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-03 02:16:02,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:16:02,430 INFO L93 Difference]: Finished difference Result 961 states and 2130 transitions. [2022-11-03 02:16:02,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-03 02:16:02,431 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-03 02:16:02,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:16:02,435 INFO L225 Difference]: With dead ends: 961 [2022-11-03 02:16:02,435 INFO L226 Difference]: Without dead ends: 961 [2022-11-03 02:16:02,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=303, Invalid=3602, Unknown=1, NotChecked=0, Total=3906 [2022-11-03 02:16:02,437 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 148 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:16:02,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 0 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-03 02:16:02,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2022-11-03 02:16:02,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 630. [2022-11-03 02:16:02,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 628 states have (on average 2.323248407643312) internal successors, (1459), 629 states have internal predecessors, (1459), 0 states have call successors, (0), 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-03 02:16:02,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 1459 transitions. [2022-11-03 02:16:02,457 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 1459 transitions. Word has length 28 [2022-11-03 02:16:02,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:16:02,458 INFO L495 AbstractCegarLoop]: Abstraction has 630 states and 1459 transitions. [2022-11-03 02:16:02,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 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-03 02:16:02,458 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 1459 transitions. [2022-11-03 02:16:02,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 02:16:02,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:16:02,460 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:16:02,494 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:16:02,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 02:16:02,687 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:16:02,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:16:02,687 INFO L85 PathProgramCache]: Analyzing trace with hash 2023739152, now seen corresponding path program 5 times [2022-11-03 02:16:02,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:16:02,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348535397] [2022-11-03 02:16:02,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:02,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:16:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:16:03,827 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:16:03,827 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:16:03,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348535397] [2022-11-03 02:16:03,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348535397] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:16:03,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826431822] [2022-11-03 02:16:03,828 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:16:03,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:16:03,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:16:03,831 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:16:03,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 02:16:03,962 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 02:16:03,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:16:03,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-03 02:16:03,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:16:04,005 INFO L356 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-11-03 02:16:04,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-11-03 02:16:04,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-11-03 02:16:04,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-11-03 02:16:05,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 46 [2022-11-03 02:16:05,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:16:05,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:16:06,009 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_315) |c_~#arr~0.base|) (+ (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) |c_~#arr~0.offset|)) 4294967296)))) is different from false [2022-11-03 02:16:06,017 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_315) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) is different from false [2022-11-03 02:16:06,026 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:16:06,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-03 02:16:06,039 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:16:06,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 52 [2022-11-03 02:16:06,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-11-03 02:16:06,370 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-11-03 02:16:06,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826431822] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:16:06,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1170099823] [2022-11-03 02:16:06,371 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-03 02:16:06,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:16:06,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 44 [2022-11-03 02:16:06,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258125454] [2022-11-03 02:16:06,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:16:06,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-03 02:16:06,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:16:06,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-03 02:16:06,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1750, Unknown=2, NotChecked=170, Total=2070 [2022-11-03 02:16:06,373 INFO L87 Difference]: Start difference. First operand 630 states and 1459 transitions. Second operand has 46 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 45 states have internal predecessors, (84), 0 states have call successors, (0), 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-03 02:16:20,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:16:20,617 INFO L93 Difference]: Finished difference Result 1749 states and 3828 transitions. [2022-11-03 02:16:20,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-11-03 02:16:20,618 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 45 states have internal predecessors, (84), 0 states have call successors, (0), 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 28 [2022-11-03 02:16:20,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:16:20,627 INFO L225 Difference]: With dead ends: 1749 [2022-11-03 02:16:20,627 INFO L226 Difference]: Without dead ends: 1749 [2022-11-03 02:16:20,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 2 IntricatePredicates, 3 DeprecatedPredicates, 1776 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=1045, Invalid=8080, Unknown=3, NotChecked=378, Total=9506 [2022-11-03 02:16:20,630 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 680 mSDsluCounter, 1789 mSDsCounter, 0 mSdLazyCounter, 3827 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 3827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 911 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:16:20,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 0 Invalid, 4872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 3827 Invalid, 0 Unknown, 911 Unchecked, 3.9s Time] [2022-11-03 02:16:20,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2022-11-03 02:16:20,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 686. [2022-11-03 02:16:20,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 684 states have (on average 2.3362573099415203) internal successors, (1598), 685 states have internal predecessors, (1598), 0 states have call successors, (0), 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-03 02:16:20,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1598 transitions. [2022-11-03 02:16:20,660 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1598 transitions. Word has length 28 [2022-11-03 02:16:20,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:16:20,660 INFO L495 AbstractCegarLoop]: Abstraction has 686 states and 1598 transitions. [2022-11-03 02:16:20,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 45 states have internal predecessors, (84), 0 states have call successors, (0), 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-03 02:16:20,661 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1598 transitions. [2022-11-03 02:16:20,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:16:20,662 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:16:20,662 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:16:20,702 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:16:20,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:16:20,891 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:16:20,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:16:20,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1306026223, now seen corresponding path program 1 times [2022-11-03 02:16:20,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:16:20,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128655985] [2022-11-03 02:16:20,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:20,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:16:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:16:21,074 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:16:21,075 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:16:21,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128655985] [2022-11-03 02:16:21,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128655985] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:16:21,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038705580] [2022-11-03 02:16:21,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:21,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:16:21,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:16:21,076 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:16:21,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 02:16:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:16:21,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 02:16:21,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:16:21,275 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:16:21,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:16:21,397 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:16:21,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038705580] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:16:21,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [80246557] [2022-11-03 02:16:21,398 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-03 02:16:21,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:16:21,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-11-03 02:16:21,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356769574] [2022-11-03 02:16:21,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:16:21,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-03 02:16:21,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:16:21,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-03 02:16:21,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-11-03 02:16:21,400 INFO L87 Difference]: Start difference. First operand 686 states and 1598 transitions. Second operand has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 states have internal predecessors, (71), 0 states have call successors, (0), 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-03 02:16:21,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:16:21,940 INFO L93 Difference]: Finished difference Result 1007 states and 2236 transitions. [2022-11-03 02:16:21,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 02:16:21,941 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 states have internal predecessors, (71), 0 states have call successors, (0), 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 31 [2022-11-03 02:16:21,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:16:21,945 INFO L225 Difference]: With dead ends: 1007 [2022-11-03 02:16:21,945 INFO L226 Difference]: Without dead ends: 1007 [2022-11-03 02:16:21,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2022-11-03 02:16:21,947 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 165 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:16:21,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 0 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:16:21,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2022-11-03 02:16:21,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 732. [2022-11-03 02:16:21,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 730 states have (on average 2.3657534246575342) internal successors, (1727), 731 states have internal predecessors, (1727), 0 states have call successors, (0), 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-03 02:16:21,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1727 transitions. [2022-11-03 02:16:21,971 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1727 transitions. Word has length 31 [2022-11-03 02:16:21,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:16:21,971 INFO L495 AbstractCegarLoop]: Abstraction has 732 states and 1727 transitions. [2022-11-03 02:16:21,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 15 states have internal predecessors, (71), 0 states have call successors, (0), 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-03 02:16:21,972 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1727 transitions. [2022-11-03 02:16:21,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 02:16:21,974 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:16:21,975 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:16:22,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:16:22,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:16:22,191 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:16:22,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:16:22,191 INFO L85 PathProgramCache]: Analyzing trace with hash -987552056, now seen corresponding path program 6 times [2022-11-03 02:16:22,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:16:22,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160872073] [2022-11-03 02:16:22,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:22,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:16:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:16:23,767 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:16:23,767 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:16:23,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160872073] [2022-11-03 02:16:23,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160872073] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:16:23,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859007151] [2022-11-03 02:16:23,768 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:16:23,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:16:23,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:16:23,771 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:16:23,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 02:16:23,922 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:16:23,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:16:23,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-03 02:16:23,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:16:23,939 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:16:23,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-03 02:16:24,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-11-03 02:16:24,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-11-03 02:16:25,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 46 [2022-11-03 02:16:25,875 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 02:16:25,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:16:26,454 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_440 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_440) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) is different from false [2022-11-03 02:16:26,469 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:16:26,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-03 02:16:26,480 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:16:26,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 52 [2022-11-03 02:16:26,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-11-03 02:16:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 02:16:26,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859007151] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:16:26,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1370133220] [2022-11-03 02:16:26,883 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-03 02:16:26,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:16:26,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 14] total 47 [2022-11-03 02:16:26,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650894414] [2022-11-03 02:16:26,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:16:26,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-03 02:16:26,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:16:26,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-03 02:16:26,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2102, Unknown=1, NotChecked=92, Total=2352 [2022-11-03 02:16:26,887 INFO L87 Difference]: Start difference. First operand 732 states and 1727 transitions. Second operand has 49 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 48 states have internal predecessors, (91), 0 states have call successors, (0), 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-03 02:16:50,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:16:50,742 INFO L93 Difference]: Finished difference Result 1283 states and 2861 transitions. [2022-11-03 02:16:50,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-03 02:16:50,742 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 48 states have internal predecessors, (91), 0 states have call successors, (0), 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 35 [2022-11-03 02:16:50,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:16:50,748 INFO L225 Difference]: With dead ends: 1283 [2022-11-03 02:16:50,748 INFO L226 Difference]: Without dead ends: 1283 [2022-11-03 02:16:50,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 1395 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=928, Invalid=7446, Unknown=2, NotChecked=180, Total=8556 [2022-11-03 02:16:50,751 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 750 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 4250 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 4250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 673 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:16:50,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 0 Invalid, 5121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 4250 Invalid, 0 Unknown, 673 Unchecked, 4.2s Time] [2022-11-03 02:16:50,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2022-11-03 02:16:50,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 624. [2022-11-03 02:16:50,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 622 states have (on average 2.3135048231511255) internal successors, (1439), 623 states have internal predecessors, (1439), 0 states have call successors, (0), 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-03 02:16:50,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 1439 transitions. [2022-11-03 02:16:50,773 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 1439 transitions. Word has length 35 [2022-11-03 02:16:50,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:16:50,774 INFO L495 AbstractCegarLoop]: Abstraction has 624 states and 1439 transitions. [2022-11-03 02:16:50,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.8958333333333333) internal successors, (91), 48 states have internal predecessors, (91), 0 states have call successors, (0), 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-03 02:16:50,774 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 1439 transitions. [2022-11-03 02:16:50,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 02:16:50,775 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:16:50,776 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:16:50,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:16:51,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-03 02:16:51,003 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:16:51,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:16:51,003 INFO L85 PathProgramCache]: Analyzing trace with hash 220951699, now seen corresponding path program 1 times [2022-11-03 02:16:51,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:16:51,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694575217] [2022-11-03 02:16:51,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:51,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:16:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:16:52,304 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:16:52,304 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:16:52,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694575217] [2022-11-03 02:16:52,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694575217] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:16:52,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473244070] [2022-11-03 02:16:52,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:52,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:16:52,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:16:52,306 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:16:52,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 02:16:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:16:52,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-03 02:16:52,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:16:52,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-11-03 02:16:53,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:16:53,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2022-11-03 02:16:54,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:16:54,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 46 [2022-11-03 02:16:55,639 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:16:55,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:17:31,253 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:17:31,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-03 02:17:31,265 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:17:31,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2022-11-03 02:17:31,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-11-03 02:17:31,295 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:17:31,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 60 [2022-11-03 02:17:31,837 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:31,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473244070] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:17:31,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1378084563] [2022-11-03 02:17:31,838 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-03 02:17:31,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:17:31,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 21] total 61 [2022-11-03 02:17:31,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009062731] [2022-11-03 02:17:31,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:17:31,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-11-03 02:17:31,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:31,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-11-03 02:17:31,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=3486, Unknown=17, NotChecked=0, Total=3906 [2022-11-03 02:17:31,842 INFO L87 Difference]: Start difference. First operand 624 states and 1439 transitions. Second operand has 63 states, 62 states have (on average 1.7419354838709677) internal successors, (108), 62 states have internal predecessors, (108), 0 states have call successors, (0), 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-03 02:18:10,398 WARN L234 SmtUtils]: Spent 17.70s on a formula simplification. DAG size of input: 64 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:18:49,923 WARN L234 SmtUtils]: Spent 37.91s on a formula simplification. DAG size of input: 80 DAG size of output: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:19:44,625 WARN L234 SmtUtils]: Spent 54.38s on a formula simplification. DAG size of input: 89 DAG size of output: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:20:49,308 WARN L234 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:20:55,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:55,244 INFO L93 Difference]: Finished difference Result 1341 states and 2887 transitions. [2022-11-03 02:20:55,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-11-03 02:20:55,245 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 1.7419354838709677) internal successors, (108), 62 states have internal predecessors, (108), 0 states have call successors, (0), 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 36 [2022-11-03 02:20:55,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:55,253 INFO L225 Difference]: With dead ends: 1341 [2022-11-03 02:20:55,253 INFO L226 Difference]: Without dead ends: 1322 [2022-11-03 02:20:55,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 33 SyntacticMatches, 8 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4302 ImplicationChecksByTransitivity, 239.0s TimeCoverageRelationStatistics Valid=1421, Invalid=11643, Unknown=46, NotChecked=0, Total=13110 [2022-11-03 02:20:55,257 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 622 mSDsluCounter, 1693 mSDsCounter, 0 mSdLazyCounter, 2523 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 2523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1778 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:55,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 0 Invalid, 4375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 2523 Invalid, 0 Unknown, 1778 Unchecked, 2.7s Time] [2022-11-03 02:20:55,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2022-11-03 02:20:55,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 888. [2022-11-03 02:20:55,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 886 states have (on average 2.3137697516930023) internal successors, (2050), 887 states have internal predecessors, (2050), 0 states have call successors, (0), 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-03 02:20:55,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 2050 transitions. [2022-11-03 02:20:55,287 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 2050 transitions. Word has length 36 [2022-11-03 02:20:55,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:55,287 INFO L495 AbstractCegarLoop]: Abstraction has 888 states and 2050 transitions. [2022-11-03 02:20:55,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 1.7419354838709677) internal successors, (108), 62 states have internal predecessors, (108), 0 states have call successors, (0), 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-03 02:20:55,288 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 2050 transitions. [2022-11-03 02:20:55,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 02:20:55,290 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:55,290 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:20:55,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 02:20:55,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 02:20:55,519 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-03 02:20:55,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:55,519 INFO L85 PathProgramCache]: Analyzing trace with hash -85092541, now seen corresponding path program 2 times [2022-11-03 02:20:55,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:55,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864558222] [2022-11-03 02:20:55,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:55,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:57,109 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:20:57,110 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:57,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864558222] [2022-11-03 02:20:57,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864558222] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:20:57,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254981548] [2022-11-03 02:20:57,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:20:57,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:20:57,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:20:57,111 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:20:57,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39bd45b9-3850-4e66-b526-f0a197c4f10d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 02:20:57,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 02:20:57,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:20:57,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-03 02:20:57,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:20:57,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-11-03 02:20:58,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:58,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2022-11-03 02:20:59,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 46 [2022-11-03 02:21:01,925 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:21:01,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:22:09,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-11-03 02:22:09,292 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:22:09,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254981548] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:22:09,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1933539214] [2022-11-03 02:22:09,293 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-03 02:22:09,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:22:09,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2022-11-03 02:22:09,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093204658] [2022-11-03 02:22:09,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:22:09,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-11-03 02:22:09,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:22:09,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-11-03 02:22:09,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=3079, Unknown=24, NotChecked=0, Total=3306 [2022-11-03 02:22:09,297 INFO L87 Difference]: Start difference. First operand 888 states and 2050 transitions. Second operand has 58 states, 57 states have (on average 1.894736842105263) internal successors, (108), 58 states have internal predecessors, (108), 0 states have call successors, (0), 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-03 02:22:16,282 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_~#arr~0.base|) |c_~#arr~0.offset|)) (.cse0 (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4)))) (and (forall ((v_ArrVal_563 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_145| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_90| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_90|)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_145| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_145|) |v_t1Thread1of1ForFork0_push_~stack#1.offset_90|) v_ArrVal_563)) |c_~#arr~0.base|) .cse0) 4294967296) 4294967294)))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| 0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse1 4294967296) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= 2 c_~top~0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= 0 .cse1) (<= (+ .cse1 8589934588 (* (div (+ (- 4294967297) (- .cse1)) 4294967296) 4294967296)) 0) (= 5 |c_~#arr~0.base|) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))) (forall ((v_ArrVal_563 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_145| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_145|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_563)) |c_~#arr~0.base|) .cse0) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_145| c_~top~0))) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296))))) is different from false [2022-11-03 02:24:09,042 WARN L234 SmtUtils]: Spent 6.85s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:24:59,506 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) |c_~#arr~0.offset|))) (and (forall ((v_ArrVal_563 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_145| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_90| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_90|)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_145| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_145|) |v_t1Thread1of1ForFork0_push_~stack#1.offset_90|) v_ArrVal_563)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)))) (= |c_~#arr~0.offset| 0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse0 4294967296) (= 2 c_~top~0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= 0 .cse0) (<= (+ .cse0 8589934588 (* (div (+ (- 4294967297) (- .cse0)) 4294967296) 4294967296)) 0) (= 5 |c_~#arr~0.base|) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296))))) is different from false [2022-11-03 02:26:25,896 WARN L234 SmtUtils]: Spent 48.24s on a formula simplification. DAG size of input: 69 DAG size of output: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:27:44,814 WARN L234 SmtUtils]: Spent 15.50s on a formula simplification. DAG size of input: 47 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:27:51,975 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|)) (.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse2 (* c_~top~0 4))) (and (not (= 4294967294 (mod (select .cse0 (+ .cse1 |c_~#arr~0.offset| (- 4))) 4294967296))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (not (= (mod (select .cse0 (+ .cse1 |c_~#arr~0.offset|)) 4294967296) 4294967294)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (not (= 4294967294 (mod (select .cse0 (+ |c_~#arr~0.offset| .cse2)) 4294967296))) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))) (forall ((v_ArrVal_563 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_145| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_145|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_563)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse2)) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_145| c_~top~0))) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296))))) is different from false [2022-11-03 02:28:27,425 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~top~0 4))) (let ((.cse0 (+ |c_~#arr~0.offset| (- 4) .cse1))) (and (forall ((v_ArrVal_563 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_145| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_90| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_90|)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_145| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_145|) |v_t1Thread1of1ForFork0_push_~stack#1.offset_90|) v_ArrVal_563)) |c_~#arr~0.base|) .cse0) 4294967296) 4294967294)))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse1)) 4294967296))) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))) (forall ((v_ArrVal_563 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_145| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_145|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_563)) |c_~#arr~0.base|) .cse0) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_145| c_~top~0))) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))))) is different from false [2022-11-03 02:28:45,974 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~top~0 4))) (and (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse0)) 4294967296))) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))) (forall ((v_ArrVal_563 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_145| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_145|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_563)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse0)) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_145| c_~top~0))) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296))))) is different from false [2022-11-03 02:28:47,633 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|)) (.cse0 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse2 (* c_~top~0 4))) (and (not (= 4294967294 (mod (select .cse0 (+ .cse1 |c_~#arr~0.offset| (- 4))) 4294967296))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (not (= (mod (select .cse0 (+ .cse1 |c_~#arr~0.offset|)) 4294967296) 4294967294)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (not (= 4294967294 (mod (select .cse0 (+ |c_~#arr~0.offset| .cse2)) 4294967296))) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))) (forall ((v_ArrVal_563 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_145| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_145|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_563)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse2)) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_145| c_~top~0))))) is different from false [2022-11-03 02:28:49,339 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~top~0 4))) (and (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse0)) 4294967296))) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))) (forall ((v_ArrVal_563 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_145| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_145|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_563)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse0)) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_145| c_~top~0))))) is different from false [2022-11-03 02:29:02,878 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~top~0 4))) (and (forall ((v_ArrVal_563 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_145| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_90| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_90|)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_145| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_145|) |v_t1Thread1of1ForFork0_push_~stack#1.offset_90|) v_ArrVal_563)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse0)) 4294967296) 4294967294)))) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| .cse0 (- 8))) 4294967296))) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296))))) is different from false