./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/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_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9d38eb9d6ba70070fe3ced1aec90f1c3400cc1f89786e1bd625a19020cb0869f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 01:48:22,903 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:48:22,905 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:48:22,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:48:22,938 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:48:22,940 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:48:22,942 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:48:22,944 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:48:22,946 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:48:22,947 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:48:22,948 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:48:22,950 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:48:22,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:48:22,952 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:48:22,953 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:48:22,955 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:48:22,956 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:48:22,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:48:22,959 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:48:22,962 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:48:22,964 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:48:22,971 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:48:22,972 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:48:22,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:48:22,978 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:48:22,978 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:48:22,979 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:48:22,980 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:48:22,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:48:22,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:48:22,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:48:22,992 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:48:22,993 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:48:22,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:48:22,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:48:22,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:48:22,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:48:22,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:48:22,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:48:22,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:48:22,999 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:48:23,003 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-03 01:48:23,061 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:48:23,061 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:48:23,061 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:48:23,062 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:48:23,066 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:48:23,066 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:48:23,066 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:48:23,067 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:48:23,067 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:48:23,067 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:48:23,068 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:48:23,069 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:48:23,069 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:48:23,069 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:48:23,069 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:48:23,069 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:48:23,070 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:48:23,070 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:48:23,071 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:48:23,071 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:48:23,071 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 01:48:23,071 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:48:23,072 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:48:23,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:48:23,074 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 01:48:23,074 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:48:23,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 01:48:23,075 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-03 01:48:23,075 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:48:23,075 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 01:48:23,075 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:48:23,076 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 01:48:23,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:48:23,077 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:48:23,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:48:23,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:48:23,078 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:48:23,078 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:48:23,078 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 01:48:23,079 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:48:23,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:48:23,079 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 01:48:23,079 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:48:23,079 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_fb03e868-866c-4172-b7ba-055c5caa37a3/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_fb03e868-866c-4172-b7ba-055c5caa37a3/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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9d38eb9d6ba70070fe3ced1aec90f1c3400cc1f89786e1bd625a19020cb0869f [2022-11-03 01:48:23,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:48:23,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:48:23,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:48:23,467 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:48:23,468 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:48:23,470 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2022-11-03 01:48:23,553 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/data/5960c34cf/6199c05fabf5407786b3ac757bd53cc6/FLAG227b6cede [2022-11-03 01:48:24,160 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:48:24,160 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2022-11-03 01:48:24,173 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/data/5960c34cf/6199c05fabf5407786b3ac757bd53cc6/FLAG227b6cede [2022-11-03 01:48:24,468 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/data/5960c34cf/6199c05fabf5407786b3ac757bd53cc6 [2022-11-03 01:48:24,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:48:24,473 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:48:24,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:48:24,475 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:48:24,479 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:48:24,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:48:24" (1/1) ... [2022-11-03 01:48:24,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f5b14d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:48:24, skipping insertion in model container [2022-11-03 01:48:24,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:48:24" (1/1) ... [2022-11-03 01:48:24,521 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:48:24,552 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:48:24,805 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_fb03e868-866c-4172-b7ba-055c5caa37a3/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c[2533,2546] [2022-11-03 01:48:24,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:48:24,824 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:48:24,865 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_fb03e868-866c-4172-b7ba-055c5caa37a3/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c[2533,2546] [2022-11-03 01:48:24,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:48:24,888 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:48:24,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:48:24 WrapperNode [2022-11-03 01:48:24,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:48:24,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:48:24,891 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:48:24,891 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:48:24,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:48:24" (1/1) ... [2022-11-03 01:48:24,910 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:48:24" (1/1) ... [2022-11-03 01:48:24,952 INFO L138 Inliner]: procedures = 25, calls = 46, calls flagged for inlining = 13, calls inlined = 19, statements flattened = 303 [2022-11-03 01:48:24,953 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:48:24,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:48:24,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:48:24,959 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:48:24,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:48:24" (1/1) ... [2022-11-03 01:48:24,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:48:24" (1/1) ... [2022-11-03 01:48:24,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:48:24" (1/1) ... [2022-11-03 01:48:24,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:48:24" (1/1) ... [2022-11-03 01:48:24,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:48:24" (1/1) ... [2022-11-03 01:48:25,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:48:24" (1/1) ... [2022-11-03 01:48:25,009 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:48:24" (1/1) ... [2022-11-03 01:48:25,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:48:24" (1/1) ... [2022-11-03 01:48:25,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:48:25,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:48:25,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:48:25,017 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:48:25,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:48:24" (1/1) ... [2022-11-03 01:48:25,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:48:25,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:48:25,060 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:48:25,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:48:25,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:48:25,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 01:48:25,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 01:48:25,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 01:48:25,112 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-03 01:48:25,112 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-03 01:48:25,113 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-03 01:48:25,113 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-03 01:48:25,113 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-03 01:48:25,114 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-03 01:48:25,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 01:48:25,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-03 01:48:25,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-03 01:48:25,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 01:48:25,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:48:25,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:48:25,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 01:48:25,117 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 01:48:25,285 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:48:25,300 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:48:26,182 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:48:27,081 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:48:27,081 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-03 01:48:27,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:48:27 BoogieIcfgContainer [2022-11-03 01:48:27,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:48:27,089 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:48:27,089 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:48:27,093 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:48:27,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:48:24" (1/3) ... [2022-11-03 01:48:27,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e944a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:48:27, skipping insertion in model container [2022-11-03 01:48:27,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:48:24" (2/3) ... [2022-11-03 01:48:27,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e944a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:48:27, skipping insertion in model container [2022-11-03 01:48:27,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:48:27" (3/3) ... [2022-11-03 01:48:27,098 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2022-11-03 01:48:27,113 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 01:48:27,125 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:48:27,125 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2022-11-03 01:48:27,126 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 01:48:27,519 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-03 01:48:27,589 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 01:48:27,607 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 308 places, 321 transitions, 666 flow [2022-11-03 01:48:27,613 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 308 places, 321 transitions, 666 flow [2022-11-03 01:48:27,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 308 places, 321 transitions, 666 flow [2022-11-03 01:48:27,837 INFO L130 PetriNetUnfolder]: 23/318 cut-off events. [2022-11-03 01:48:27,838 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-03 01:48:27,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 318 events. 23/318 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 794 event pairs, 0 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 250. Up to 2 conditions per place. [2022-11-03 01:48:27,863 INFO L118 LiptonReduction]: Number of co-enabled transitions 24672 [2022-11-03 01:49:18,883 INFO L133 LiptonReduction]: Checked pairs total: 30043 [2022-11-03 01:49:18,883 INFO L135 LiptonReduction]: Total number of compositions: 402 [2022-11-03 01:49:18,893 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 74 transitions, 172 flow [2022-11-03 01:49:19,505 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 9644 states, 7582 states have (on average 4.444869427591664) internal successors, (33701), 9643 states have internal predecessors, (33701), 0 states have call successors, (0), 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 01:49:19,531 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:49:19,540 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;@9d4c421, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:49:19,541 INFO L358 AbstractCegarLoop]: Starting to check reachability of 81 error locations. [2022-11-03 01:49:19,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 9644 states, 7582 states have (on average 4.444869427591664) internal successors, (33701), 9643 states have internal predecessors, (33701), 0 states have call successors, (0), 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 01:49:19,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-03 01:49:19,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:49:19,601 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-03 01:49:19,602 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:49:19,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:49:19,611 INFO L85 PathProgramCache]: Analyzing trace with hash 53573, now seen corresponding path program 1 times [2022-11-03 01:49:19,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:49:19,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790049273] [2022-11-03 01:49:19,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:19,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:49:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:19,922 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 01:49:19,923 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:49:19,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790049273] [2022-11-03 01:49:19,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790049273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:49:19,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:49:19,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 01:49:19,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164539444] [2022-11-03 01:49:19,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:49:19,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:49:19,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:49:19,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:49:19,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:49:19,993 INFO L87 Difference]: Start difference. First operand has 9644 states, 7582 states have (on average 4.444869427591664) internal successors, (33701), 9643 states have internal predecessors, (33701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 01:49:20,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:49:20,496 INFO L93 Difference]: Finished difference Result 8785 states and 30555 transitions. [2022-11-03 01:49:20,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:49:20,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-03 01:49:20,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:49:20,621 INFO L225 Difference]: With dead ends: 8785 [2022-11-03 01:49:20,621 INFO L226 Difference]: Without dead ends: 8785 [2022-11-03 01:49:20,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:49:20,628 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 52 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:49:20,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 6 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:49:20,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8785 states. [2022-11-03 01:49:20,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8785 to 4395. [2022-11-03 01:49:20,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4395 states, 3663 states have (on average 4.171717171717172) internal successors, (15281), 4394 states have internal predecessors, (15281), 0 states have call successors, (0), 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 01:49:21,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4395 states to 4395 states and 15281 transitions. [2022-11-03 01:49:21,155 INFO L78 Accepts]: Start accepts. Automaton has 4395 states and 15281 transitions. Word has length 2 [2022-11-03 01:49:21,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:49:21,156 INFO L495 AbstractCegarLoop]: Abstraction has 4395 states and 15281 transitions. [2022-11-03 01:49:21,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 01:49:21,157 INFO L276 IsEmpty]: Start isEmpty. Operand 4395 states and 15281 transitions. [2022-11-03 01:49:21,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 01:49:21,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:49:21,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 01:49:21,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 01:49:21,158 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:49:21,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:49:21,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1662938, now seen corresponding path program 1 times [2022-11-03 01:49:21,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:49:21,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209052490] [2022-11-03 01:49:21,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:21,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:49:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:21,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:49:21,361 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:49:21,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209052490] [2022-11-03 01:49:21,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209052490] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:49:21,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:49:21,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:49:21,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057185647] [2022-11-03 01:49:21,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:49:21,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:49:21,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:49:21,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:49:21,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:49:21,367 INFO L87 Difference]: Start difference. First operand 4395 states and 15281 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 01:49:21,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:49:21,569 INFO L93 Difference]: Finished difference Result 4394 states and 15280 transitions. [2022-11-03 01:49:21,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:49:21,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-03 01:49:21,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:49:21,613 INFO L225 Difference]: With dead ends: 4394 [2022-11-03 01:49:21,613 INFO L226 Difference]: Without dead ends: 4394 [2022-11-03 01:49:21,614 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 01:49:21,615 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:49:21,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:49:21,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4394 states. [2022-11-03 01:49:21,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4394 to 4394. [2022-11-03 01:49:21,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4394 states, 3663 states have (on average 4.171444171444171) internal successors, (15280), 4393 states have internal predecessors, (15280), 0 states have call successors, (0), 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 01:49:21,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4394 states to 4394 states and 15280 transitions. [2022-11-03 01:49:21,896 INFO L78 Accepts]: Start accepts. Automaton has 4394 states and 15280 transitions. Word has length 3 [2022-11-03 01:49:21,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:49:21,897 INFO L495 AbstractCegarLoop]: Abstraction has 4394 states and 15280 transitions. [2022-11-03 01:49:21,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 01:49:21,898 INFO L276 IsEmpty]: Start isEmpty. Operand 4394 states and 15280 transitions. [2022-11-03 01:49:21,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 01:49:21,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:49:21,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 01:49:21,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 01:49:21,899 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:49:21,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:49:21,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1662939, now seen corresponding path program 1 times [2022-11-03 01:49:21,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:49:21,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967950611] [2022-11-03 01:49:21,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:21,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:49:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:22,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:49:22,071 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:49:22,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967950611] [2022-11-03 01:49:22,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967950611] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:49:22,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414606840] [2022-11-03 01:49:22,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:22,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:49:22,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:49:22,077 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:49:22,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 01:49:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:22,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 01:49:22,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:49:22,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:49:22,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:49:22,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:49:22,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414606840] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:49:22,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [931486419] [2022-11-03 01:49:22,522 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:243) 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 01:49:22,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:49:22,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2022-11-03 01:49:22,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535680641] [2022-11-03 01:49:22,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:49:22,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:49:22,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:49:22,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:49:22,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:49:22,537 INFO L87 Difference]: Start difference. First operand 4394 states and 15280 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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 01:49:23,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:49:23,569 INFO L93 Difference]: Finished difference Result 21957 states and 76382 transitions. [2022-11-03 01:49:23,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:49:23,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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 3 [2022-11-03 01:49:23,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:49:23,891 INFO L225 Difference]: With dead ends: 21957 [2022-11-03 01:49:23,892 INFO L226 Difference]: Without dead ends: 21957 [2022-11-03 01:49:23,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:49:23,893 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 260 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:49:23,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 15 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-03 01:49:23,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21957 states. [2022-11-03 01:49:24,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21957 to 4397. [2022-11-03 01:49:24,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4397 states, 3666 states have (on average 4.1696672122204035) internal successors, (15286), 4396 states have internal predecessors, (15286), 0 states have call successors, (0), 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 01:49:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4397 states to 4397 states and 15286 transitions. [2022-11-03 01:49:24,624 INFO L78 Accepts]: Start accepts. Automaton has 4397 states and 15286 transitions. Word has length 3 [2022-11-03 01:49:24,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:49:24,624 INFO L495 AbstractCegarLoop]: Abstraction has 4397 states and 15286 transitions. [2022-11-03 01:49:24,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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 01:49:24,625 INFO L276 IsEmpty]: Start isEmpty. Operand 4397 states and 15286 transitions. [2022-11-03 01:49:24,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 01:49:24,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:49:24,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 01:49:24,671 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-03 01:49:24,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:49:24,850 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:49:24,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:49:24,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1598802127, now seen corresponding path program 1 times [2022-11-03 01:49:24,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:49:24,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787786288] [2022-11-03 01:49:24,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:24,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:49:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:25,020 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 01:49:25,020 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:49:25,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787786288] [2022-11-03 01:49:25,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787786288] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:49:25,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:49:25,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 01:49:25,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233344441] [2022-11-03 01:49:25,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:49:25,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:49:25,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:49:25,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:49:25,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:49:25,023 INFO L87 Difference]: Start difference. First operand 4397 states and 15286 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 01:49:25,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:49:25,391 INFO L93 Difference]: Finished difference Result 7096 states and 25285 transitions. [2022-11-03 01:49:25,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:49:25,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-03 01:49:25,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:49:25,505 INFO L225 Difference]: With dead ends: 7096 [2022-11-03 01:49:25,505 INFO L226 Difference]: Without dead ends: 7096 [2022-11-03 01:49:25,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:49:25,506 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 46 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:49:25,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 5 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:49:25,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7096 states. [2022-11-03 01:49:25,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7096 to 4735. [2022-11-03 01:49:25,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4735 states, 4004 states have (on average 4.368131868131868) internal successors, (17490), 4734 states have internal predecessors, (17490), 0 states have call successors, (0), 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 01:49:25,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4735 states to 4735 states and 17490 transitions. [2022-11-03 01:49:25,715 INFO L78 Accepts]: Start accepts. Automaton has 4735 states and 17490 transitions. Word has length 5 [2022-11-03 01:49:25,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:49:25,716 INFO L495 AbstractCegarLoop]: Abstraction has 4735 states and 17490 transitions. [2022-11-03 01:49:25,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 01:49:25,717 INFO L276 IsEmpty]: Start isEmpty. Operand 4735 states and 17490 transitions. [2022-11-03 01:49:25,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 01:49:25,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:49:25,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 01:49:25,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 01:49:25,718 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:49:25,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:49:25,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1598802089, now seen corresponding path program 1 times [2022-11-03 01:49:25,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:49:25,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116914931] [2022-11-03 01:49:25,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:25,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:49:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:25,922 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 01:49:25,923 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:49:25,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116914931] [2022-11-03 01:49:25,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116914931] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:49:25,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:49:25,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:49:25,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15196891] [2022-11-03 01:49:25,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:49:25,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:49:25,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:49:25,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:49:25,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:49:25,933 INFO L87 Difference]: Start difference. First operand 4735 states and 17490 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 01:49:26,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:49:26,306 INFO L93 Difference]: Finished difference Result 4735 states and 17489 transitions. [2022-11-03 01:49:26,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:49:26,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-03 01:49:26,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:49:26,395 INFO L225 Difference]: With dead ends: 4735 [2022-11-03 01:49:26,396 INFO L226 Difference]: Without dead ends: 4735 [2022-11-03 01:49:26,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:49:26,397 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:49:26,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:49:26,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4735 states. [2022-11-03 01:49:26,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4735 to 4735. [2022-11-03 01:49:26,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4735 states, 4004 states have (on average 4.367882117882118) internal successors, (17489), 4734 states have internal predecessors, (17489), 0 states have call successors, (0), 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 01:49:26,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4735 states to 4735 states and 17489 transitions. [2022-11-03 01:49:26,747 INFO L78 Accepts]: Start accepts. Automaton has 4735 states and 17489 transitions. Word has length 5 [2022-11-03 01:49:26,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:49:26,748 INFO L495 AbstractCegarLoop]: Abstraction has 4735 states and 17489 transitions. [2022-11-03 01:49:26,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 01:49:26,748 INFO L276 IsEmpty]: Start isEmpty. Operand 4735 states and 17489 transitions. [2022-11-03 01:49:26,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 01:49:26,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:49:26,749 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1] [2022-11-03 01:49:26,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 01:49:26,750 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:49:26,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:49:26,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1996861818, now seen corresponding path program 2 times [2022-11-03 01:49:26,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:49:26,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182127701] [2022-11-03 01:49:26,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:26,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:49:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:26,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:49:26,939 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:49:26,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182127701] [2022-11-03 01:49:26,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182127701] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:49:26,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746388417] [2022-11-03 01:49:26,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:49:26,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:49:26,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:49:26,945 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:49:26,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 01:49:27,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 01:49:27,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:49:27,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 01:49:27,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:49:27,297 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 01:49:27,297 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:49:27,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746388417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:49:27,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:49:27,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2022-11-03 01:49:27,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202634871] [2022-11-03 01:49:27,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:49:27,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:49:27,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:49:27,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:49:27,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:49:27,300 INFO L87 Difference]: Start difference. First operand 4735 states and 17489 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 01:49:27,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:49:27,657 INFO L93 Difference]: Finished difference Result 4734 states and 17488 transitions. [2022-11-03 01:49:27,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:49:27,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 01:49:27,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:49:27,695 INFO L225 Difference]: With dead ends: 4734 [2022-11-03 01:49:27,696 INFO L226 Difference]: Without dead ends: 4734 [2022-11-03 01:49:27,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:49:27,697 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:49:27,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 3 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:49:27,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4734 states. [2022-11-03 01:49:27,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4734 to 4731. [2022-11-03 01:49:27,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4731 states, 4001 states have (on average 4.369407648087978) internal successors, (17482), 4730 states have internal predecessors, (17482), 0 states have call successors, (0), 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 01:49:27,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4731 states to 4731 states and 17482 transitions. [2022-11-03 01:49:27,866 INFO L78 Accepts]: Start accepts. Automaton has 4731 states and 17482 transitions. Word has length 6 [2022-11-03 01:49:27,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:49:27,866 INFO L495 AbstractCegarLoop]: Abstraction has 4731 states and 17482 transitions. [2022-11-03 01:49:27,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 01:49:27,866 INFO L276 IsEmpty]: Start isEmpty. Operand 4731 states and 17482 transitions. [2022-11-03 01:49:27,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 01:49:27,867 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:49:27,867 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 01:49:27,918 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 01:49:28,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-03 01:49:28,082 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:49:28,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:49:28,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1996212748, now seen corresponding path program 1 times [2022-11-03 01:49:28,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:49:28,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725981604] [2022-11-03 01:49:28,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:28,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:49:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:28,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:49:28,580 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:49:28,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725981604] [2022-11-03 01:49:28,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725981604] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:49:28,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798364044] [2022-11-03 01:49:28,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:28,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:49:28,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:49:28,582 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:49:28,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 01:49:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:28,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-03 01:49:28,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:49:29,009 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 11 treesize of output 7 [2022-11-03 01:49:29,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:49:29,046 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 16 treesize of output 18 [2022-11-03 01:49:29,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:49:29,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:49:29,139 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_189 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_189) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-11-03 01:49:29,159 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:49:29,160 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 24 treesize of output 25 [2022-11-03 01:49:29,172 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:49:29,172 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 39 treesize of output 37 [2022-11-03 01:49:29,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 01:49:29,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798364044] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:49:29,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1541706048] [2022-11-03 01:49:29,222 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 01:49:29,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:49:29,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-11-03 01:49:29,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847825343] [2022-11-03 01:49:29,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:49:29,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 01:49:29,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:49:29,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 01:49:29,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2022-11-03 01:49:29,226 INFO L87 Difference]: Start difference. First operand 4731 states and 17482 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:49:30,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:49:30,265 INFO L93 Difference]: Finished difference Result 7432 states and 25982 transitions. [2022-11-03 01:49:30,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:49:30,266 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-03 01:49:30,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:49:30,313 INFO L225 Difference]: With dead ends: 7432 [2022-11-03 01:49:30,314 INFO L226 Difference]: Without dead ends: 7432 [2022-11-03 01:49:30,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=231, Unknown=1, NotChecked=32, Total=342 [2022-11-03 01:49:30,315 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 104 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:49:30,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 44 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 714 Invalid, 0 Unknown, 88 Unchecked, 0.7s Time] [2022-11-03 01:49:30,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7432 states. [2022-11-03 01:49:30,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7432 to 4732. [2022-11-03 01:49:30,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4732 states, 4002 states have (on average 4.369065467266367) internal successors, (17485), 4731 states have internal predecessors, (17485), 0 states have call successors, (0), 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 01:49:30,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4732 states to 4732 states and 17485 transitions. [2022-11-03 01:49:30,517 INFO L78 Accepts]: Start accepts. Automaton has 4732 states and 17485 transitions. Word has length 6 [2022-11-03 01:49:30,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:49:30,517 INFO L495 AbstractCegarLoop]: Abstraction has 4732 states and 17485 transitions. [2022-11-03 01:49:30,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:49:30,518 INFO L276 IsEmpty]: Start isEmpty. Operand 4732 states and 17485 transitions. [2022-11-03 01:49:30,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 01:49:30,518 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:49:30,519 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 01:49:30,568 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 01:49:30,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-03 01:49:30,742 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:49:30,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:49:30,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1996212729, now seen corresponding path program 1 times [2022-11-03 01:49:30,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:49:30,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157320517] [2022-11-03 01:49:30,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:30,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:49:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:31,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:49:31,067 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:49:31,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157320517] [2022-11-03 01:49:31,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157320517] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:49:31,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274148918] [2022-11-03 01:49:31,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:31,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:49:31,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:49:31,069 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:49:31,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 01:49:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:31,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-03 01:49:31,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:49:31,511 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 11 treesize of output 7 [2022-11-03 01:49:31,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:49:31,544 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 14 treesize of output 16 [2022-11-03 01:49:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:49:31,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:49:31,630 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_228 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_228) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)) is different from false [2022-11-03 01:49:31,648 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:49:31,648 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 22 treesize of output 23 [2022-11-03 01:49:31,659 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:49:31,659 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 33 treesize of output 31 [2022-11-03 01:49:31,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 01:49:31,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274148918] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:49:31,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [226579582] [2022-11-03 01:49:31,696 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 01:49:31,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:49:31,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-11-03 01:49:31,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047399343] [2022-11-03 01:49:31,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:49:31,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 01:49:31,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:49:31,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 01:49:31,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2022-11-03 01:49:31,701 INFO L87 Difference]: Start difference. First operand 4732 states and 17485 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:49:32,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:49:32,759 INFO L93 Difference]: Finished difference Result 7431 states and 25980 transitions. [2022-11-03 01:49:32,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:49:32,760 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-03 01:49:32,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:49:32,817 INFO L225 Difference]: With dead ends: 7431 [2022-11-03 01:49:32,817 INFO L226 Difference]: Without dead ends: 7431 [2022-11-03 01:49:32,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=231, Unknown=1, NotChecked=32, Total=342 [2022-11-03 01:49:32,818 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 88 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:49:32,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 45 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 715 Invalid, 0 Unknown, 105 Unchecked, 0.8s Time] [2022-11-03 01:49:32,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7431 states. [2022-11-03 01:49:33,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7431 to 4732. [2022-11-03 01:49:33,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4732 states, 4002 states have (on average 4.368815592203898) internal successors, (17484), 4731 states have internal predecessors, (17484), 0 states have call successors, (0), 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 01:49:33,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4732 states to 4732 states and 17484 transitions. [2022-11-03 01:49:33,075 INFO L78 Accepts]: Start accepts. Automaton has 4732 states and 17484 transitions. Word has length 6 [2022-11-03 01:49:33,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:49:33,075 INFO L495 AbstractCegarLoop]: Abstraction has 4732 states and 17484 transitions. [2022-11-03 01:49:33,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:49:33,076 INFO L276 IsEmpty]: Start isEmpty. Operand 4732 states and 17484 transitions. [2022-11-03 01:49:33,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 01:49:33,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:49:33,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:49:33,127 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 01:49:33,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:49:33,290 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:49:33,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:49:33,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1752592820, now seen corresponding path program 1 times [2022-11-03 01:49:33,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:49:33,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650918851] [2022-11-03 01:49:33,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:33,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:49:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:33,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:49:33,806 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:49:33,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650918851] [2022-11-03 01:49:33,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650918851] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:49:33,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435803880] [2022-11-03 01:49:33,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:33,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:49:33,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:49:33,808 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:49:33,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 01:49:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:34,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-03 01:49:34,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:49:34,196 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 11 treesize of output 7 [2022-11-03 01:49:34,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:49:34,243 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 16 treesize of output 18 [2022-11-03 01:49:34,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:49:34,283 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 16 treesize of output 18 [2022-11-03 01:49:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:49:34,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:49:34,354 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_272 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-11-03 01:49:34,371 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) is different from false [2022-11-03 01:49:34,395 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:49:34,395 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 27 treesize of output 28 [2022-11-03 01:49:34,405 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:49:34,406 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 143 treesize of output 137 [2022-11-03 01:49:34,420 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 122 treesize of output 118 [2022-11-03 01:49:34,428 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 118 treesize of output 110 [2022-11-03 01:49:34,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 01:49:34,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435803880] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:49:34,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1618321036] [2022-11-03 01:49:34,531 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 01:49:34,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:49:34,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-11-03 01:49:34,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613883199] [2022-11-03 01:49:34,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:49:34,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 01:49:34,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:49:34,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 01:49:34,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=122, Unknown=2, NotChecked=46, Total=210 [2022-11-03 01:49:34,534 INFO L87 Difference]: Start difference. First operand 4732 states and 17484 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:49:35,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:49:35,414 INFO L93 Difference]: Finished difference Result 7386 states and 25845 transitions. [2022-11-03 01:49:35,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:49:35,415 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-03 01:49:35,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:49:35,459 INFO L225 Difference]: With dead ends: 7386 [2022-11-03 01:49:35,459 INFO L226 Difference]: Without dead ends: 7386 [2022-11-03 01:49:35,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=176, Unknown=2, NotChecked=58, Total=306 [2022-11-03 01:49:35,460 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 157 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 163 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:49:35,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 36 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 554 Invalid, 0 Unknown, 163 Unchecked, 0.7s Time] [2022-11-03 01:49:35,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7386 states. [2022-11-03 01:49:35,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7386 to 4747. [2022-11-03 01:49:35,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4747 states, 4017 states have (on average 4.367438386855863) internal successors, (17544), 4746 states have internal predecessors, (17544), 0 states have call successors, (0), 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 01:49:35,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4747 states to 4747 states and 17544 transitions. [2022-11-03 01:49:35,652 INFO L78 Accepts]: Start accepts. Automaton has 4747 states and 17544 transitions. Word has length 7 [2022-11-03 01:49:35,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:49:35,652 INFO L495 AbstractCegarLoop]: Abstraction has 4747 states and 17544 transitions. [2022-11-03 01:49:35,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:49:35,653 INFO L276 IsEmpty]: Start isEmpty. Operand 4747 states and 17544 transitions. [2022-11-03 01:49:35,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 01:49:35,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:49:35,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:49:35,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 01:49:35,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:49:35,862 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:49:35,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:49:35,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1752592801, now seen corresponding path program 1 times [2022-11-03 01:49:35,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:49:35,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519311115] [2022-11-03 01:49:35,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:35,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:49:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:36,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:49:36,351 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:49:36,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519311115] [2022-11-03 01:49:36,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519311115] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:49:36,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067352123] [2022-11-03 01:49:36,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:36,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:49:36,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:49:36,353 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:49:36,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 01:49:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:36,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-03 01:49:36,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:49:36,736 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 11 treesize of output 7 [2022-11-03 01:49:36,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:49:36,784 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 14 treesize of output 16 [2022-11-03 01:49:36,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:49:36,826 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 14 treesize of output 16 [2022-11-03 01:49:36,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:49:36,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:49:36,898 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_316 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2022-11-03 01:49:36,914 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_316 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)) is different from false [2022-11-03 01:49:36,933 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:49:36,934 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 25 treesize of output 26 [2022-11-03 01:49:36,945 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:49:36,946 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 125 treesize of output 119 [2022-11-03 01:49:36,957 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 53 treesize of output 49 [2022-11-03 01:49:36,965 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 102 treesize of output 94 [2022-11-03 01:49:37,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 01:49:37,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067352123] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:49:37,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1811340580] [2022-11-03 01:49:37,070 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 01:49:37,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:49:37,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-11-03 01:49:37,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042344864] [2022-11-03 01:49:37,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:49:37,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 01:49:37,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:49:37,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 01:49:37,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=122, Unknown=2, NotChecked=46, Total=210 [2022-11-03 01:49:37,077 INFO L87 Difference]: Start difference. First operand 4747 states and 17544 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:49:38,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:49:38,064 INFO L93 Difference]: Finished difference Result 7371 states and 25800 transitions. [2022-11-03 01:49:38,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:49:38,064 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-03 01:49:38,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:49:38,117 INFO L225 Difference]: With dead ends: 7371 [2022-11-03 01:49:38,117 INFO L226 Difference]: Without dead ends: 7371 [2022-11-03 01:49:38,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=176, Unknown=2, NotChecked=58, Total=306 [2022-11-03 01:49:38,120 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 203 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:49:38,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 35 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 531 Invalid, 0 Unknown, 175 Unchecked, 0.7s Time] [2022-11-03 01:49:38,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7371 states. [2022-11-03 01:49:38,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7371 to 4747. [2022-11-03 01:49:38,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4747 states, 4017 states have (on average 4.36370425690814) internal successors, (17529), 4746 states have internal predecessors, (17529), 0 states have call successors, (0), 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 01:49:38,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4747 states to 4747 states and 17529 transitions. [2022-11-03 01:49:38,331 INFO L78 Accepts]: Start accepts. Automaton has 4747 states and 17529 transitions. Word has length 7 [2022-11-03 01:49:38,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:49:38,331 INFO L495 AbstractCegarLoop]: Abstraction has 4747 states and 17529 transitions. [2022-11-03 01:49:38,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:49:38,331 INFO L276 IsEmpty]: Start isEmpty. Operand 4747 states and 17529 transitions. [2022-11-03 01:49:38,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 01:49:38,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:49:38,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:49:38,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 01:49:38,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 01:49:38,554 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:49:38,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:49:38,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1753050889, now seen corresponding path program 1 times [2022-11-03 01:49:38,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:49:38,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305110544] [2022-11-03 01:49:38,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:38,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:49:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:38,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:49:38,717 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:49:38,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305110544] [2022-11-03 01:49:38,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305110544] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:49:38,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:49:38,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:49:38,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91907172] [2022-11-03 01:49:38,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:49:38,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:49:38,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:49:38,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:49:38,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:49:38,720 INFO L87 Difference]: Start difference. First operand 4747 states and 17529 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 01:49:39,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:49:39,158 INFO L93 Difference]: Finished difference Result 7395 states and 26979 transitions. [2022-11-03 01:49:39,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:49:39,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-03 01:49:39,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:49:39,198 INFO L225 Difference]: With dead ends: 7395 [2022-11-03 01:49:39,198 INFO L226 Difference]: Without dead ends: 7395 [2022-11-03 01:49:39,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:49:39,199 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 71 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:49:39,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 9 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:49:39,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7395 states. [2022-11-03 01:49:39,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7395 to 5084. [2022-11-03 01:49:39,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5084 states, 4354 states have (on average 4.446256316031236) internal successors, (19359), 5083 states have internal predecessors, (19359), 0 states have call successors, (0), 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 01:49:39,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5084 states to 5084 states and 19359 transitions. [2022-11-03 01:49:39,415 INFO L78 Accepts]: Start accepts. Automaton has 5084 states and 19359 transitions. Word has length 7 [2022-11-03 01:49:39,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:49:39,416 INFO L495 AbstractCegarLoop]: Abstraction has 5084 states and 19359 transitions. [2022-11-03 01:49:39,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 01:49:39,416 INFO L276 IsEmpty]: Start isEmpty. Operand 5084 states and 19359 transitions. [2022-11-03 01:49:39,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 01:49:39,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:49:39,419 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:49:39,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 01:49:39,420 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:49:39,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:49:39,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1504358245, now seen corresponding path program 1 times [2022-11-03 01:49:39,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:49:39,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990893919] [2022-11-03 01:49:39,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:39,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:49:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:39,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:49:39,626 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:49:39,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990893919] [2022-11-03 01:49:39,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990893919] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:49:39,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505581025] [2022-11-03 01:49:39,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:39,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:49:39,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:49:39,628 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:49:39,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 01:49:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:39,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 01:49:39,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:49:40,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:49:40,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:49:40,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:49:40,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505581025] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:49:40,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [983144215] [2022-11-03 01:49:40,134 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 01:49:40,134 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:49:40,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-11-03 01:49:40,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32009574] [2022-11-03 01:49:40,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:49:40,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 01:49:40,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:49:40,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 01:49:40,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-03 01:49:40,137 INFO L87 Difference]: Start difference. First operand 5084 states and 19359 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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 01:49:41,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:49:41,000 INFO L93 Difference]: Finished difference Result 6217 states and 23159 transitions. [2022-11-03 01:49:41,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:49:41,001 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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 8 [2022-11-03 01:49:41,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:49:41,036 INFO L225 Difference]: With dead ends: 6217 [2022-11-03 01:49:41,037 INFO L226 Difference]: Without dead ends: 6217 [2022-11-03 01:49:41,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2022-11-03 01:49:41,038 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 246 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:49:41,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 25 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 01:49:41,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6217 states. [2022-11-03 01:49:41,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6217 to 5833. [2022-11-03 01:49:41,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5833 states, 5103 states have (on average 4.3350970017636685) internal successors, (22122), 5832 states have internal predecessors, (22122), 0 states have call successors, (0), 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 01:49:41,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5833 states to 5833 states and 22122 transitions. [2022-11-03 01:49:41,264 INFO L78 Accepts]: Start accepts. Automaton has 5833 states and 22122 transitions. Word has length 8 [2022-11-03 01:49:41,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:49:41,264 INFO L495 AbstractCegarLoop]: Abstraction has 5833 states and 22122 transitions. [2022-11-03 01:49:41,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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 01:49:41,265 INFO L276 IsEmpty]: Start isEmpty. Operand 5833 states and 22122 transitions. [2022-11-03 01:49:41,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 01:49:41,266 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:49:41,266 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:49:41,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 01:49:41,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:49:41,482 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:49:41,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:49:41,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1489997553, now seen corresponding path program 1 times [2022-11-03 01:49:41,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:49:41,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105133784] [2022-11-03 01:49:41,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:41,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:49:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:41,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:49:41,704 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:49:41,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105133784] [2022-11-03 01:49:41,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105133784] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:49:41,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:49:41,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:49:41,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716271808] [2022-11-03 01:49:41,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:49:41,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:49:41,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:49:41,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:49:41,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:49:41,707 INFO L87 Difference]: Start difference. First operand 5833 states and 22122 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 01:49:42,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:49:42,073 INFO L93 Difference]: Finished difference Result 8021 states and 29129 transitions. [2022-11-03 01:49:42,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:49:42,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-03 01:49:42,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:49:42,119 INFO L225 Difference]: With dead ends: 8021 [2022-11-03 01:49:42,120 INFO L226 Difference]: Without dead ends: 8021 [2022-11-03 01:49:42,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:49:42,121 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 163 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:49:42,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 7 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:49:42,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8021 states. [2022-11-03 01:49:42,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8021 to 6181. [2022-11-03 01:49:42,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6181 states, 5451 states have (on average 4.486149330398092) internal successors, (24454), 6180 states have internal predecessors, (24454), 0 states have call successors, (0), 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 01:49:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6181 states to 6181 states and 24454 transitions. [2022-11-03 01:49:42,386 INFO L78 Accepts]: Start accepts. Automaton has 6181 states and 24454 transitions. Word has length 8 [2022-11-03 01:49:42,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:49:42,386 INFO L495 AbstractCegarLoop]: Abstraction has 6181 states and 24454 transitions. [2022-11-03 01:49:42,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 01:49:42,387 INFO L276 IsEmpty]: Start isEmpty. Operand 6181 states and 24454 transitions. [2022-11-03 01:49:42,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 01:49:42,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:49:42,388 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:49:42,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 01:49:42,388 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:49:42,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:49:42,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1489997554, now seen corresponding path program 1 times [2022-11-03 01:49:42,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:49:42,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456659503] [2022-11-03 01:49:42,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:42,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:49:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:42,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:49:42,639 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:49:42,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456659503] [2022-11-03 01:49:42,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456659503] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:49:42,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:49:42,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:49:42,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190062112] [2022-11-03 01:49:42,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:49:42,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:49:42,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:49:42,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:49:42,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:49:42,641 INFO L87 Difference]: Start difference. First operand 6181 states and 24454 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 01:49:42,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:49:42,983 INFO L93 Difference]: Finished difference Result 7633 states and 27751 transitions. [2022-11-03 01:49:42,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:49:42,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-03 01:49:42,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:49:43,028 INFO L225 Difference]: With dead ends: 7633 [2022-11-03 01:49:43,028 INFO L226 Difference]: Without dead ends: 7633 [2022-11-03 01:49:43,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:49:43,029 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 159 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:49:43,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 7 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:49:43,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7633 states. [2022-11-03 01:49:43,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7633 to 5775. [2022-11-03 01:49:43,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5775 states, 5045 states have (on average 4.344697720515362) internal successors, (21919), 5774 states have internal predecessors, (21919), 0 states have call successors, (0), 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 01:49:43,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5775 states to 5775 states and 21919 transitions. [2022-11-03 01:49:43,271 INFO L78 Accepts]: Start accepts. Automaton has 5775 states and 21919 transitions. Word has length 8 [2022-11-03 01:49:43,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:49:43,272 INFO L495 AbstractCegarLoop]: Abstraction has 5775 states and 21919 transitions. [2022-11-03 01:49:43,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 01:49:43,272 INFO L276 IsEmpty]: Start isEmpty. Operand 5775 states and 21919 transitions. [2022-11-03 01:49:43,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 01:49:43,279 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:49:43,279 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:49:43,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 01:49:43,282 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:49:43,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:49:43,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1490000456, now seen corresponding path program 1 times [2022-11-03 01:49:43,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:49:43,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317901447] [2022-11-03 01:49:43,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:43,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:49:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:43,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:49:43,436 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:49:43,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317901447] [2022-11-03 01:49:43,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317901447] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:49:43,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83349915] [2022-11-03 01:49:43,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:43,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:49:43,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:49:43,443 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:49:43,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 01:49:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:43,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 01:49:43,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:49:43,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:49:43,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:49:43,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:49:43,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83349915] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:49:43,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1913059039] [2022-11-03 01:49:43,894 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 01:49:43,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:49:43,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-11-03 01:49:43,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928328459] [2022-11-03 01:49:43,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:49:43,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 01:49:43,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:49:43,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 01:49:43,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:49:43,898 INFO L87 Difference]: Start difference. First operand 5775 states and 21919 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 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 01:49:44,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:49:44,669 INFO L93 Difference]: Finished difference Result 5928 states and 21781 transitions. [2022-11-03 01:49:44,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:49:44,670 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 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 8 [2022-11-03 01:49:44,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:49:44,694 INFO L225 Difference]: With dead ends: 5928 [2022-11-03 01:49:44,694 INFO L226 Difference]: Without dead ends: 5928 [2022-11-03 01:49:44,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2022-11-03 01:49:44,695 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 288 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:49:44,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 47 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 01:49:44,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5928 states. [2022-11-03 01:49:44,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5928 to 5662. [2022-11-03 01:49:44,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5662 states, 4932 states have (on average 4.33110300081103) internal successors, (21361), 5661 states have internal predecessors, (21361), 0 states have call successors, (0), 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 01:49:44,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5662 states to 5662 states and 21361 transitions. [2022-11-03 01:49:44,899 INFO L78 Accepts]: Start accepts. Automaton has 5662 states and 21361 transitions. Word has length 8 [2022-11-03 01:49:44,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:49:44,900 INFO L495 AbstractCegarLoop]: Abstraction has 5662 states and 21361 transitions. [2022-11-03 01:49:44,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 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 01:49:44,900 INFO L276 IsEmpty]: Start isEmpty. Operand 5662 states and 21361 transitions. [2022-11-03 01:49:44,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 01:49:44,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:49:44,901 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:49:44,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 01:49:45,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 01:49:45,115 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:49:45,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:49:45,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1721842234, now seen corresponding path program 2 times [2022-11-03 01:49:45,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:49:45,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354026918] [2022-11-03 01:49:45,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:45,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:49:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:45,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:49:45,630 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:49:45,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354026918] [2022-11-03 01:49:45,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354026918] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:49:45,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425707184] [2022-11-03 01:49:45,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:49:45,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:49:45,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:49:45,632 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:49:45,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 01:49:45,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:49:45,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:49:46,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-03 01:49:46,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:49:46,059 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 11 treesize of output 7 [2022-11-03 01:49:46,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:49:46,118 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 25 treesize of output 24 [2022-11-03 01:49:46,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:49:46,168 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 16 treesize of output 18 [2022-11-03 01:49:46,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:49:46,221 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 16 treesize of output 18 [2022-11-03 01:49:46,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:49:46,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:49:46,311 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_500) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-11-03 01:49:46,323 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_500) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-11-03 01:49:46,333 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_497 Int) (v_ArrVal_500 (Array Int Int)) (v_ArrVal_499 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_497)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_500) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-11-03 01:49:46,366 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-03 01:49:46,366 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 2 case distinctions, treesize of input 34 treesize of output 40 [2022-11-03 01:49:46,377 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:49:46,377 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 143 treesize of output 137 [2022-11-03 01:49:46,383 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 122 treesize of output 118 [2022-11-03 01:49:46,389 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 118 treesize of output 110 [2022-11-03 01:49:46,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 01:49:46,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425707184] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:49:46,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [28887971] [2022-11-03 01:49:46,525 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 01:49:46,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:49:46,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-11-03 01:49:46,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206905618] [2022-11-03 01:49:46,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:49:46,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 01:49:46,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:49:46,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 01:49:46,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=169, Unknown=3, NotChecked=84, Total=306 [2022-11-03 01:49:46,531 INFO L87 Difference]: Start difference. First operand 5662 states and 21361 transitions. Second operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:49:47,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:49:47,629 INFO L93 Difference]: Finished difference Result 9222 states and 33377 transitions. [2022-11-03 01:49:47,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:49:47,630 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-03 01:49:47,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:49:47,692 INFO L225 Difference]: With dead ends: 9222 [2022-11-03 01:49:47,692 INFO L226 Difference]: Without dead ends: 9222 [2022-11-03 01:49:47,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=229, Unknown=3, NotChecked=102, Total=420 [2022-11-03 01:49:47,693 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 247 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 374 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:49:47,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 42 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 529 Invalid, 0 Unknown, 374 Unchecked, 0.8s Time] [2022-11-03 01:49:47,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9222 states. [2022-11-03 01:49:47,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9222 to 5698. [2022-11-03 01:49:47,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5698 states, 4968 states have (on average 4.336553945249597) internal successors, (21544), 5697 states have internal predecessors, (21544), 0 states have call successors, (0), 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 01:49:48,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5698 states to 5698 states and 21544 transitions. [2022-11-03 01:49:48,013 INFO L78 Accepts]: Start accepts. Automaton has 5698 states and 21544 transitions. Word has length 9 [2022-11-03 01:49:48,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:49:48,014 INFO L495 AbstractCegarLoop]: Abstraction has 5698 states and 21544 transitions. [2022-11-03 01:49:48,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:49:48,015 INFO L276 IsEmpty]: Start isEmpty. Operand 5698 states and 21544 transitions. [2022-11-03 01:49:48,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 01:49:48,016 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:49:48,016 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:49:48,053 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 01:49:48,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 01:49:48,242 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:49:48,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:49:48,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1721842273, now seen corresponding path program 1 times [2022-11-03 01:49:48,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:49:48,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045193773] [2022-11-03 01:49:48,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:48,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:49:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:48,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:49:48,346 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:49:48,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045193773] [2022-11-03 01:49:48,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045193773] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:49:48,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:49:48,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 01:49:48,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38574257] [2022-11-03 01:49:48,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:49:48,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:49:48,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:49:48,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:49:48,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:49:48,349 INFO L87 Difference]: Start difference. First operand 5698 states and 21544 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 01:49:48,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:49:48,694 INFO L93 Difference]: Finished difference Result 9651 states and 36678 transitions. [2022-11-03 01:49:48,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:49:48,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 9 [2022-11-03 01:49:48,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:49:48,766 INFO L225 Difference]: With dead ends: 9651 [2022-11-03 01:49:48,766 INFO L226 Difference]: Without dead ends: 9651 [2022-11-03 01:49:48,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:49:48,768 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 43 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:49:48,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 5 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:49:48,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9651 states. [2022-11-03 01:49:49,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9651 to 6422. [2022-11-03 01:49:49,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6422 states, 5692 states have (on average 4.695186226282502) internal successors, (26725), 6421 states have internal predecessors, (26725), 0 states have call successors, (0), 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 01:49:49,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6422 states to 6422 states and 26725 transitions. [2022-11-03 01:49:49,129 INFO L78 Accepts]: Start accepts. Automaton has 6422 states and 26725 transitions. Word has length 9 [2022-11-03 01:49:49,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:49:49,129 INFO L495 AbstractCegarLoop]: Abstraction has 6422 states and 26725 transitions. [2022-11-03 01:49:49,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 01:49:49,129 INFO L276 IsEmpty]: Start isEmpty. Operand 6422 states and 26725 transitions. [2022-11-03 01:49:49,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 01:49:49,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:49:49,130 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:49:49,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-03 01:49:49,131 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:49:49,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:49:49,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1721842275, now seen corresponding path program 1 times [2022-11-03 01:49:49,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:49:49,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667270941] [2022-11-03 01:49:49,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:49,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:49:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:49,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:49:49,679 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:49:49,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667270941] [2022-11-03 01:49:49,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667270941] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:49:49,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381212136] [2022-11-03 01:49:49,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:49,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:49:49,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:49:49,682 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:49:49,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 01:49:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:50,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-03 01:49:50,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:49:50,106 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 11 treesize of output 7 [2022-11-03 01:49:50,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:49:50,149 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 23 treesize of output 22 [2022-11-03 01:49:50,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:49:50,201 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 14 treesize of output 16 [2022-11-03 01:49:50,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:49:50,249 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 14 treesize of output 16 [2022-11-03 01:49:50,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:49:50,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:49:50,338 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_572 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_572) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2022-11-03 01:49:50,351 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_571 (Array Int Int)) (v_ArrVal_572 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_571) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_572) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)) is different from false [2022-11-03 01:49:50,360 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_571 (Array Int Int)) (v_ArrVal_572 (Array Int Int)) (v_ArrVal_569 Int)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_569)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_571) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_572) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)) is different from false [2022-11-03 01:49:50,396 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-03 01:49:50,397 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 2 case distinctions, treesize of input 32 treesize of output 38 [2022-11-03 01:49:50,407 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:49:50,407 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 63 treesize of output 61 [2022-11-03 01:49:50,412 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 48 treesize of output 44 [2022-11-03 01:49:50,423 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 22 treesize of output 20 [2022-11-03 01:49:50,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 01:49:50,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381212136] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:49:50,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1106462727] [2022-11-03 01:49:50,504 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 01:49:50,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:49:50,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-11-03 01:49:50,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382572081] [2022-11-03 01:49:50,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:49:50,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 01:49:50,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:49:50,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 01:49:50,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=169, Unknown=3, NotChecked=84, Total=306 [2022-11-03 01:49:50,508 INFO L87 Difference]: Start difference. First operand 6422 states and 26725 transitions. Second operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:49:51,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:49:51,469 INFO L93 Difference]: Finished difference Result 9222 states and 36901 transitions. [2022-11-03 01:49:51,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:49:51,470 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-03 01:49:51,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:49:51,526 INFO L225 Difference]: With dead ends: 9222 [2022-11-03 01:49:51,526 INFO L226 Difference]: Without dead ends: 9222 [2022-11-03 01:49:51,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=229, Unknown=3, NotChecked=102, Total=420 [2022-11-03 01:49:51,527 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 209 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 336 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:49:51,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 37 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 564 Invalid, 0 Unknown, 336 Unchecked, 0.7s Time] [2022-11-03 01:49:51,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9222 states. [2022-11-03 01:49:51,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9222 to 6422. [2022-11-03 01:49:51,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6422 states, 5692 states have (on average 4.693078004216444) internal successors, (26713), 6421 states have internal predecessors, (26713), 0 states have call successors, (0), 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 01:49:51,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6422 states to 6422 states and 26713 transitions. [2022-11-03 01:49:51,817 INFO L78 Accepts]: Start accepts. Automaton has 6422 states and 26713 transitions. Word has length 9 [2022-11-03 01:49:51,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:49:51,817 INFO L495 AbstractCegarLoop]: Abstraction has 6422 states and 26713 transitions. [2022-11-03 01:49:51,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:49:51,818 INFO L276 IsEmpty]: Start isEmpty. Operand 6422 states and 26713 transitions. [2022-11-03 01:49:51,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 01:49:51,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:49:51,819 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:49:51,867 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 01:49:52,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 01:49:52,033 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:49:52,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:49:52,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1707484445, now seen corresponding path program 2 times [2022-11-03 01:49:52,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:49:52,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944470082] [2022-11-03 01:49:52,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:52,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:49:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:52,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:49:52,266 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:49:52,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944470082] [2022-11-03 01:49:52,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944470082] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:49:52,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903828091] [2022-11-03 01:49:52,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:49:52,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:49:52,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:49:52,269 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:49:52,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 01:49:52,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:49:52,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:49:52,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 01:49:52,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:49:52,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:49:52,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:49:52,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903828091] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:49:52,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:49:52,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2022-11-03 01:49:52,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007388525] [2022-11-03 01:49:52,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:49:52,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:49:52,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:49:52,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:49:52,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:49:52,662 INFO L87 Difference]: Start difference. First operand 6422 states and 26713 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 01:49:52,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:49:52,816 INFO L93 Difference]: Finished difference Result 5642 states and 23635 transitions. [2022-11-03 01:49:52,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:49:52,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 9 [2022-11-03 01:49:52,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:49:52,849 INFO L225 Difference]: With dead ends: 5642 [2022-11-03 01:49:52,850 INFO L226 Difference]: Without dead ends: 5642 [2022-11-03 01:49:52,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:49:52,851 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:49:52,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:49:52,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2022-11-03 01:49:53,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5274. [2022-11-03 01:49:53,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5274 states, 4706 states have (on average 4.476625584360391) internal successors, (21067), 5273 states have internal predecessors, (21067), 0 states have call successors, (0), 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 01:49:53,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5274 states to 5274 states and 21067 transitions. [2022-11-03 01:49:53,105 INFO L78 Accepts]: Start accepts. Automaton has 5274 states and 21067 transitions. Word has length 9 [2022-11-03 01:49:53,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:49:53,106 INFO L495 AbstractCegarLoop]: Abstraction has 5274 states and 21067 transitions. [2022-11-03 01:49:53,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 01:49:53,106 INFO L276 IsEmpty]: Start isEmpty. Operand 5274 states and 21067 transitions. [2022-11-03 01:49:53,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 01:49:53,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:49:53,107 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:49:53,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 01:49:53,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:49:53,334 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:49:53,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:49:53,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1707484407, now seen corresponding path program 1 times [2022-11-03 01:49:53,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:49:53,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530630885] [2022-11-03 01:49:53,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:53,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:49:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:53,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:49:53,809 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:49:53,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530630885] [2022-11-03 01:49:53,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530630885] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:49:53,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371623417] [2022-11-03 01:49:53,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:53,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:49:53,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:49:53,811 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:49:53,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 01:49:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:54,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-03 01:49:54,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:49:54,228 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 13 treesize of output 9 [2022-11-03 01:49:54,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:49:54,266 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 18 treesize of output 20 [2022-11-03 01:49:54,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:49:54,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:49:54,430 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_655 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_655) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-03 01:49:54,443 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:49:54,443 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 26 treesize of output 27 [2022-11-03 01:49:54,454 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:49:54,454 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 43 treesize of output 39 [2022-11-03 01:49:54,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 01:49:54,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371623417] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:49:54,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1509392602] [2022-11-03 01:49:54,513 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 01:49:54,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:49:54,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-03 01:49:54,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848471357] [2022-11-03 01:49:54,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:49:54,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 01:49:54,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:49:54,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 01:49:54,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=289, Unknown=1, NotChecked=34, Total=380 [2022-11-03 01:49:54,517 INFO L87 Difference]: Start difference. First operand 5274 states and 21067 transitions. Second operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 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 01:49:55,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:49:55,906 INFO L93 Difference]: Finished difference Result 6607 states and 24793 transitions. [2022-11-03 01:49:55,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 01:49:55,907 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 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 9 [2022-11-03 01:49:55,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:49:55,944 INFO L225 Difference]: With dead ends: 6607 [2022-11-03 01:49:55,944 INFO L226 Difference]: Without dead ends: 6607 [2022-11-03 01:49:55,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=624, Unknown=1, NotChecked=52, Total=812 [2022-11-03 01:49:55,945 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 160 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 01:49:55,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 57 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1056 Invalid, 0 Unknown, 98 Unchecked, 0.9s Time] [2022-11-03 01:49:55,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6607 states. [2022-11-03 01:49:56,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6607 to 5276. [2022-11-03 01:49:56,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5276 states, 4708 states have (on average 4.4759983007646555) internal successors, (21073), 5275 states have internal predecessors, (21073), 0 states have call successors, (0), 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 01:49:56,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5276 states to 5276 states and 21073 transitions. [2022-11-03 01:49:56,146 INFO L78 Accepts]: Start accepts. Automaton has 5276 states and 21073 transitions. Word has length 9 [2022-11-03 01:49:56,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:49:56,147 INFO L495 AbstractCegarLoop]: Abstraction has 5276 states and 21073 transitions. [2022-11-03 01:49:56,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 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 01:49:56,147 INFO L276 IsEmpty]: Start isEmpty. Operand 5276 states and 21073 transitions. [2022-11-03 01:49:56,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 01:49:56,148 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:49:56,148 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:49:56,190 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 01:49:56,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-11-03 01:49:56,374 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:49:56,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:49:56,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1707484426, now seen corresponding path program 1 times [2022-11-03 01:49:56,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:49:56,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440827495] [2022-11-03 01:49:56,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:56,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:49:56,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:56,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:49:56,757 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:49:56,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440827495] [2022-11-03 01:49:56,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440827495] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:49:56,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408113076] [2022-11-03 01:49:56,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:56,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:49:56,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:49:56,775 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:49:56,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 01:49:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:57,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-03 01:49:57,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:49:57,212 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 13 treesize of output 9 [2022-11-03 01:49:57,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:49:57,249 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 16 treesize of output 18 [2022-11-03 01:49:57,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:49:57,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:49:57,343 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_698 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_698) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-03 01:49:57,356 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:49:57,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-03 01:49:57,366 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:49:57,367 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 37 treesize of output 33 [2022-11-03 01:49:57,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 01:49:57,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408113076] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:49:57,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1574479538] [2022-11-03 01:49:57,390 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 01:49:57,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:49:57,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-11-03 01:49:57,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834523605] [2022-11-03 01:49:57,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:49:57,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-03 01:49:57,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:49:57,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-03 01:49:57,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2022-11-03 01:49:57,394 INFO L87 Difference]: Start difference. First operand 5276 states and 21073 transitions. Second operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:49:58,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:49:58,645 INFO L93 Difference]: Finished difference Result 6606 states and 24791 transitions. [2022-11-03 01:49:58,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 01:49:58,645 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-03 01:49:58,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:49:58,684 INFO L225 Difference]: With dead ends: 6606 [2022-11-03 01:49:58,684 INFO L226 Difference]: Without dead ends: 6606 [2022-11-03 01:49:58,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=399, Unknown=1, NotChecked=42, Total=552 [2022-11-03 01:49:58,685 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 158 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:49:58,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 65 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1179 Invalid, 0 Unknown, 116 Unchecked, 1.0s Time] [2022-11-03 01:49:58,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6606 states. [2022-11-03 01:49:58,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6606 to 5276. [2022-11-03 01:49:58,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5276 states, 4708 states have (on average 4.475785896346644) internal successors, (21072), 5275 states have internal predecessors, (21072), 0 states have call successors, (0), 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 01:49:58,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5276 states to 5276 states and 21072 transitions. [2022-11-03 01:49:58,833 INFO L78 Accepts]: Start accepts. Automaton has 5276 states and 21072 transitions. Word has length 9 [2022-11-03 01:49:58,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:49:58,834 INFO L495 AbstractCegarLoop]: Abstraction has 5276 states and 21072 transitions. [2022-11-03 01:49:58,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:49:58,834 INFO L276 IsEmpty]: Start isEmpty. Operand 5276 states and 21072 transitions. [2022-11-03 01:49:58,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 01:49:58,835 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:49:58,835 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:49:58,868 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 01:49:59,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-03 01:49:59,051 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:49:59,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:49:59,051 INFO L85 PathProgramCache]: Analyzing trace with hash -614826115, now seen corresponding path program 1 times [2022-11-03 01:49:59,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:49:59,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572382973] [2022-11-03 01:49:59,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:59,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:49:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:49:59,515 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:49:59,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572382973] [2022-11-03 01:49:59,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572382973] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:49:59,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899566444] [2022-11-03 01:49:59,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:49:59,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:49:59,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:49:59,519 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:49:59,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 01:49:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:49:59,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-03 01:49:59,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:49:59,937 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 11 treesize of output 7 [2022-11-03 01:49:59,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:49:59,997 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 16 treesize of output 18 [2022-11-03 01:50:00,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:00,103 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 16 treesize of output 18 [2022-11-03 01:50:00,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:00,191 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 16 treesize of output 18 [2022-11-03 01:50:00,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:00,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:50:00,231 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_747 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_747) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 9223372039002259456))) is different from false [2022-11-03 01:50:00,250 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_747 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_747) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-11-03 01:50:00,263 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_746 (Array Int Int)) (v_ArrVal_747 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_746) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_747) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-11-03 01:50:00,280 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_746 (Array Int Int)) (v_ArrVal_745 (Array Int Int)) (v_ArrVal_747 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_745) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_746) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_747) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-11-03 01:50:00,294 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:50:00,295 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 30 treesize of output 31 [2022-11-03 01:50:00,313 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:50:00,313 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 2211 treesize of output 2149 [2022-11-03 01:50:00,342 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 2134 treesize of output 2070 [2022-11-03 01:50:00,378 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 1035 treesize of output 1003 [2022-11-03 01:50:00,406 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 2038 treesize of output 1910 [2022-11-03 01:50:07,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 01:50:07,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899566444] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:50:07,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [121835386] [2022-11-03 01:50:07,418 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java: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 01:50:07,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:50:07,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-11-03 01:50:07,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125336640] [2022-11-03 01:50:07,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:50:07,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-03 01:50:07,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:50:07,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-03 01:50:07,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=169, Unknown=4, NotChecked=116, Total=342 [2022-11-03 01:50:07,422 INFO L87 Difference]: Start difference. First operand 5276 states and 21072 transitions. Second operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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 01:50:08,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:50:08,208 INFO L93 Difference]: Finished difference Result 8304 states and 32764 transitions. [2022-11-03 01:50:08,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:50:08,209 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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 9 [2022-11-03 01:50:08,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:50:08,244 INFO L225 Difference]: With dead ends: 8304 [2022-11-03 01:50:08,244 INFO L226 Difference]: Without dead ends: 8304 [2022-11-03 01:50:08,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=233, Unknown=4, NotChecked=140, Total=462 [2022-11-03 01:50:08,245 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 277 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 331 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:50:08,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 23 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 398 Invalid, 0 Unknown, 331 Unchecked, 0.6s Time] [2022-11-03 01:50:08,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8304 states. [2022-11-03 01:50:08,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8304 to 6333. [2022-11-03 01:50:08,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6333 states, 5765 states have (on average 4.6393755420641805) internal successors, (26746), 6332 states have internal predecessors, (26746), 0 states have call successors, (0), 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 01:50:08,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6333 states to 6333 states and 26746 transitions. [2022-11-03 01:50:08,454 INFO L78 Accepts]: Start accepts. Automaton has 6333 states and 26746 transitions. Word has length 9 [2022-11-03 01:50:08,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:50:08,455 INFO L495 AbstractCegarLoop]: Abstraction has 6333 states and 26746 transitions. [2022-11-03 01:50:08,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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 01:50:08,455 INFO L276 IsEmpty]: Start isEmpty. Operand 6333 states and 26746 transitions. [2022-11-03 01:50:08,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 01:50:08,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:50:08,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:50:08,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-03 01:50:08,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:50:08,658 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:50:08,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:50:08,659 INFO L85 PathProgramCache]: Analyzing trace with hash -614826096, now seen corresponding path program 1 times [2022-11-03 01:50:08,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:50:08,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935427159] [2022-11-03 01:50:08,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:08,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:50:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:09,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:09,076 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:50:09,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935427159] [2022-11-03 01:50:09,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935427159] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:50:09,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751252686] [2022-11-03 01:50:09,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:09,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:50:09,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:50:09,079 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:50:09,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 01:50:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:09,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-03 01:50:09,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:50:09,490 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 11 treesize of output 7 [2022-11-03 01:50:09,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:09,539 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 14 treesize of output 16 [2022-11-03 01:50:09,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:09,585 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 14 treesize of output 16 [2022-11-03 01:50:09,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:09,658 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 14 treesize of output 16 [2022-11-03 01:50:09,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:09,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:50:09,696 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_796 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_796) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 4294967296)) is different from false [2022-11-03 01:50:09,705 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_796 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_796) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2022-11-03 01:50:09,783 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_795) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_796) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2022-11-03 01:50:09,796 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_794) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_795) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_796) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)) is different from false [2022-11-03 01:50:09,807 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:50:09,827 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 28 treesize of output 29 [2022-11-03 01:50:09,840 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:50:09,840 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 977 treesize of output 947 [2022-11-03 01:50:09,865 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 934 treesize of output 918 [2022-11-03 01:50:09,880 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 918 treesize of output 854 [2022-11-03 01:50:09,894 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 854 treesize of output 822 [2022-11-03 01:50:12,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 01:50:12,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751252686] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:50:12,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [808250659] [2022-11-03 01:50:12,315 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 01:50:12,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:50:12,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-11-03 01:50:12,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520675342] [2022-11-03 01:50:12,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:50:12,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-03 01:50:12,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:50:12,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-03 01:50:12,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=169, Unknown=4, NotChecked=116, Total=342 [2022-11-03 01:50:12,319 INFO L87 Difference]: Start difference. First operand 6333 states and 26746 transitions. Second operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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 01:50:13,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:50:13,042 INFO L93 Difference]: Finished difference Result 7889 states and 31110 transitions. [2022-11-03 01:50:13,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:50:13,043 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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 9 [2022-11-03 01:50:13,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:50:13,075 INFO L225 Difference]: With dead ends: 7889 [2022-11-03 01:50:13,075 INFO L226 Difference]: Without dead ends: 7889 [2022-11-03 01:50:13,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=233, Unknown=4, NotChecked=140, Total=462 [2022-11-03 01:50:13,076 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 339 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 331 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:50:13,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 18 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 323 Invalid, 0 Unknown, 331 Unchecked, 0.5s Time] [2022-11-03 01:50:13,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7889 states. [2022-11-03 01:50:13,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7889 to 6286. [2022-11-03 01:50:13,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6286 states, 5718 states have (on average 4.579923050017489) internal successors, (26188), 6285 states have internal predecessors, (26188), 0 states have call successors, (0), 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 01:50:13,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6286 states to 6286 states and 26188 transitions. [2022-11-03 01:50:13,290 INFO L78 Accepts]: Start accepts. Automaton has 6286 states and 26188 transitions. Word has length 9 [2022-11-03 01:50:13,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:50:13,291 INFO L495 AbstractCegarLoop]: Abstraction has 6286 states and 26188 transitions. [2022-11-03 01:50:13,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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 01:50:13,291 INFO L276 IsEmpty]: Start isEmpty. Operand 6286 states and 26188 transitions. [2022-11-03 01:50:13,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 01:50:13,292 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:50:13,292 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:50:13,340 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-03 01:50:13,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:50:13,502 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:50:13,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:50:13,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1832586309, now seen corresponding path program 1 times [2022-11-03 01:50:13,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:50:13,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17084543] [2022-11-03 01:50:13,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:13,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:50:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:13,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:13,971 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:50:13,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17084543] [2022-11-03 01:50:13,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17084543] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:50:13,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591717123] [2022-11-03 01:50:13,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:13,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:50:13,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:50:13,975 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:50:14,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-03 01:50:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:14,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-03 01:50:14,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:50:14,384 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 13 treesize of output 9 [2022-11-03 01:50:14,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:14,425 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 18 treesize of output 20 [2022-11-03 01:50:14,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:14,471 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 18 treesize of output 20 [2022-11-03 01:50:14,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:14,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:50:14,575 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_844 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_844) c_~A~0.base) (+ c_~A~0.offset 4)) 9223372039002259456))) is different from false [2022-11-03 01:50:14,586 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_844 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_843) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_844) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-03 01:50:14,598 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:50:14,599 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 01:50:14,609 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:50:14,610 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 81 treesize of output 77 [2022-11-03 01:50:14,615 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 62 treesize of output 54 [2022-11-03 01:50:14,621 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 24 [2022-11-03 01:50:14,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 01:50:14,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591717123] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:50:14,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1704160807] [2022-11-03 01:50:14,745 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 01:50:14,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:50:14,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-11-03 01:50:14,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114776666] [2022-11-03 01:50:14,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:50:14,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-03 01:50:14,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:50:14,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-03 01:50:14,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=290, Unknown=2, NotChecked=70, Total=420 [2022-11-03 01:50:14,751 INFO L87 Difference]: Start difference. First operand 6286 states and 26188 transitions. Second operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 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 01:50:16,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:50:16,179 INFO L93 Difference]: Finished difference Result 7584 states and 29891 transitions. [2022-11-03 01:50:16,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 01:50:16,180 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 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 10 [2022-11-03 01:50:16,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:50:16,212 INFO L225 Difference]: With dead ends: 7584 [2022-11-03 01:50:16,213 INFO L226 Difference]: Without dead ends: 7584 [2022-11-03 01:50:16,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=618, Unknown=2, NotChecked=106, Total=870 [2022-11-03 01:50:16,213 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 371 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:50:16,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 73 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1152 Invalid, 0 Unknown, 272 Unchecked, 1.1s Time] [2022-11-03 01:50:16,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7584 states. [2022-11-03 01:50:16,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7584 to 6328. [2022-11-03 01:50:16,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6328 states, 5760 states have (on average 4.579166666666667) internal successors, (26376), 6327 states have internal predecessors, (26376), 0 states have call successors, (0), 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 01:50:16,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6328 states to 6328 states and 26376 transitions. [2022-11-03 01:50:16,430 INFO L78 Accepts]: Start accepts. Automaton has 6328 states and 26376 transitions. Word has length 10 [2022-11-03 01:50:16,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:50:16,430 INFO L495 AbstractCegarLoop]: Abstraction has 6328 states and 26376 transitions. [2022-11-03 01:50:16,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 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 01:50:16,431 INFO L276 IsEmpty]: Start isEmpty. Operand 6328 states and 26376 transitions. [2022-11-03 01:50:16,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 01:50:16,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:50:16,432 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:50:16,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-03 01:50:16,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-03 01:50:16,646 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:50:16,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:50:16,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1832586328, now seen corresponding path program 1 times [2022-11-03 01:50:16,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:50:16,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177382101] [2022-11-03 01:50:16,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:16,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:50:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:17,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:17,066 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:50:17,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177382101] [2022-11-03 01:50:17,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177382101] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:50:17,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037533675] [2022-11-03 01:50:17,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:17,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:50:17,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:50:17,075 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:50:17,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-03 01:50:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:17,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-03 01:50:17,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:50:17,504 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 13 treesize of output 9 [2022-11-03 01:50:17,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:17,541 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 16 treesize of output 18 [2022-11-03 01:50:17,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:17,575 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 16 treesize of output 18 [2022-11-03 01:50:17,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:17,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:50:17,672 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_892 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_892) c_~A~0.base) (+ c_~A~0.offset 4)) 4294967296)) is different from false [2022-11-03 01:50:17,682 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_891 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_891) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_892) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-03 01:50:17,692 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:50:17,693 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 27 treesize of output 28 [2022-11-03 01:50:17,701 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:50:17,702 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 71 treesize of output 67 [2022-11-03 01:50:17,705 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 54 treesize of output 46 [2022-11-03 01:50:17,710 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 24 treesize of output 20 [2022-11-03 01:50:17,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 01:50:17,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037533675] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:50:17,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1609028614] [2022-11-03 01:50:17,763 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 01:50:17,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:50:17,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-11-03 01:50:17,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921162269] [2022-11-03 01:50:17,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:50:17,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-03 01:50:17,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:50:17,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-03 01:50:17,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=226, Unknown=2, NotChecked=62, Total=342 [2022-11-03 01:50:17,765 INFO L87 Difference]: Start difference. First operand 6328 states and 26376 transitions. Second operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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 01:50:19,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:50:19,034 INFO L93 Difference]: Finished difference Result 7563 states and 29818 transitions. [2022-11-03 01:50:19,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 01:50:19,035 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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 01:50:19,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:50:19,064 INFO L225 Difference]: With dead ends: 7563 [2022-11-03 01:50:19,064 INFO L226 Difference]: Without dead ends: 7563 [2022-11-03 01:50:19,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=432, Unknown=2, NotChecked=90, Total=650 [2022-11-03 01:50:19,065 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 312 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 364 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:50:19,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 74 Invalid, 1561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1166 Invalid, 0 Unknown, 364 Unchecked, 1.0s Time] [2022-11-03 01:50:19,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7563 states. [2022-11-03 01:50:19,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7563 to 6328. [2022-11-03 01:50:19,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6328 states, 5760 states have (on average 4.575520833333333) internal successors, (26355), 6327 states have internal predecessors, (26355), 0 states have call successors, (0), 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 01:50:19,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6328 states to 6328 states and 26355 transitions. [2022-11-03 01:50:19,248 INFO L78 Accepts]: Start accepts. Automaton has 6328 states and 26355 transitions. Word has length 10 [2022-11-03 01:50:19,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:50:19,248 INFO L495 AbstractCegarLoop]: Abstraction has 6328 states and 26355 transitions. [2022-11-03 01:50:19,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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 01:50:19,248 INFO L276 IsEmpty]: Start isEmpty. Operand 6328 states and 26355 transitions. [2022-11-03 01:50:19,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 01:50:19,249 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:50:19,249 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:50:19,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-03 01:50:19,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:50:19,449 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:50:19,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:50:19,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1837880945, now seen corresponding path program 1 times [2022-11-03 01:50:19,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:50:19,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414942910] [2022-11-03 01:50:19,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:19,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:50:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:19,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:19,892 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:50:19,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414942910] [2022-11-03 01:50:19,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414942910] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:50:19,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624506069] [2022-11-03 01:50:19,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:19,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:50:19,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:50:19,894 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:50:19,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-03 01:50:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:20,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-03 01:50:20,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:50:20,311 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 11 treesize of output 7 [2022-11-03 01:50:20,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:20,350 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 25 treesize of output 24 [2022-11-03 01:50:20,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:20,406 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 16 treesize of output 18 [2022-11-03 01:50:20,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:20,450 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 16 treesize of output 18 [2022-11-03 01:50:20,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:20,484 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 16 treesize of output 18 [2022-11-03 01:50:20,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:20,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:50:20,549 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_947 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_947) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-11-03 01:50:20,562 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_947 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_946) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_947) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-11-03 01:50:20,573 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_945 (Array Int Int)) (v_ArrVal_947 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_945) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_946) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_947) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-11-03 01:50:20,587 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_945 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_944 Int)) (< 0 (+ 9223372039002259456 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_944)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_945) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_946) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_947) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) is different from false [2022-11-03 01:50:20,616 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-03 01:50:20,617 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 2 case distinctions, treesize of input 37 treesize of output 43 [2022-11-03 01:50:20,630 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:50:20,630 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 2211 treesize of output 2149 [2022-11-03 01:50:20,653 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 2134 treesize of output 2070 [2022-11-03 01:50:20,673 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 2070 treesize of output 1942 [2022-11-03 01:50:20,699 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 987 treesize of output 955 [2022-11-03 01:50:35,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 01:50:35,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624506069] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:50:35,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1508581571] [2022-11-03 01:50:35,168 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 01:50:35,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:50:35,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-11-03 01:50:35,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284863745] [2022-11-03 01:50:35,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:50:35,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-03 01:50:35,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:50:35,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-03 01:50:35,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=220, Unknown=4, NotChecked=132, Total=420 [2022-11-03 01:50:35,178 INFO L87 Difference]: Start difference. First operand 6328 states and 26355 transitions. Second operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 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 01:50:35,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:50:35,901 INFO L93 Difference]: Finished difference Result 9497 states and 38583 transitions. [2022-11-03 01:50:35,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:50:35,902 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 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 10 [2022-11-03 01:50:35,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:50:35,942 INFO L225 Difference]: With dead ends: 9497 [2022-11-03 01:50:35,942 INFO L226 Difference]: Without dead ends: 9497 [2022-11-03 01:50:35,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=286, Unknown=4, NotChecked=156, Total=552 [2022-11-03 01:50:35,943 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 516 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 430 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:50:35,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 19 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 302 Invalid, 0 Unknown, 430 Unchecked, 0.5s Time] [2022-11-03 01:50:35,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9497 states. [2022-11-03 01:50:36,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9497 to 7704. [2022-11-03 01:50:36,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7704 states, 7136 states have (on average 4.615330717488789) internal successors, (32935), 7703 states have internal predecessors, (32935), 0 states have call successors, (0), 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 01:50:36,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7704 states to 7704 states and 32935 transitions. [2022-11-03 01:50:36,145 INFO L78 Accepts]: Start accepts. Automaton has 7704 states and 32935 transitions. Word has length 10 [2022-11-03 01:50:36,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:50:36,145 INFO L495 AbstractCegarLoop]: Abstraction has 7704 states and 32935 transitions. [2022-11-03 01:50:36,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 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 01:50:36,146 INFO L276 IsEmpty]: Start isEmpty. Operand 7704 states and 32935 transitions. [2022-11-03 01:50:36,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 01:50:36,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:50:36,147 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:50:36,193 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-03 01:50:36,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-03 01:50:36,362 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:50:36,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:50:36,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1837880986, now seen corresponding path program 1 times [2022-11-03 01:50:36,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:50:36,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289738279] [2022-11-03 01:50:36,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:36,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:50:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:36,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:36,841 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:50:36,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289738279] [2022-11-03 01:50:36,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289738279] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:50:36,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240276217] [2022-11-03 01:50:36,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:36,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:50:36,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:50:36,843 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:50:36,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-03 01:50:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:37,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-03 01:50:37,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:50:37,275 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 11 treesize of output 7 [2022-11-03 01:50:37,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:37,323 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 23 treesize of output 22 [2022-11-03 01:50:37,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:37,369 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 14 treesize of output 16 [2022-11-03 01:50:37,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:37,418 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 14 treesize of output 16 [2022-11-03 01:50:37,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:37,457 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 14 treesize of output 16 [2022-11-03 01:50:37,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:37,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:50:37,521 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1002 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1002) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2022-11-03 01:50:37,530 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1002 (Array Int Int)) (v_ArrVal_1001 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1001) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1002) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2022-11-03 01:50:37,541 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1002 (Array Int Int)) (v_ArrVal_1001 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1000) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1001) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1002) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)) is different from false [2022-11-03 01:50:37,550 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1002 (Array Int Int)) (v_ArrVal_1001 (Array Int Int)) (v_ArrVal_1000 (Array Int Int)) (v_ArrVal_999 Int)) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_999)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1000) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1001) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1002) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)) is different from false [2022-11-03 01:50:37,577 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-03 01:50:37,577 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 2 case distinctions, treesize of input 35 treesize of output 41 [2022-11-03 01:50:37,587 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:50:37,587 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 489 treesize of output 475 [2022-11-03 01:50:37,597 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 462 treesize of output 454 [2022-11-03 01:50:37,606 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 454 treesize of output 438 [2022-11-03 01:50:37,615 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 438 treesize of output 406 [2022-11-03 01:50:38,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 01:50:38,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240276217] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:50:38,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1930661603] [2022-11-03 01:50:38,096 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 01:50:38,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:50:38,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-11-03 01:50:38,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840386695] [2022-11-03 01:50:38,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:50:38,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-03 01:50:38,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:50:38,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-03 01:50:38,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=220, Unknown=4, NotChecked=132, Total=420 [2022-11-03 01:50:38,098 INFO L87 Difference]: Start difference. First operand 7704 states and 32935 transitions. Second operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 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 01:50:38,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:50:38,749 INFO L93 Difference]: Finished difference Result 9153 states and 37282 transitions. [2022-11-03 01:50:38,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:50:38,749 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 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 10 [2022-11-03 01:50:38,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:50:38,787 INFO L225 Difference]: With dead ends: 9153 [2022-11-03 01:50:38,787 INFO L226 Difference]: Without dead ends: 9153 [2022-11-03 01:50:38,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=286, Unknown=4, NotChecked=156, Total=552 [2022-11-03 01:50:38,788 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 335 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 362 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:50:38,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 14 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 234 Invalid, 0 Unknown, 362 Unchecked, 0.4s Time] [2022-11-03 01:50:38,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9153 states. [2022-11-03 01:50:38,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9153 to 7704. [2022-11-03 01:50:38,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7704 states, 7136 states have (on average 4.5671244394618835) internal successors, (32591), 7703 states have internal predecessors, (32591), 0 states have call successors, (0), 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 01:50:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7704 states to 7704 states and 32591 transitions. [2022-11-03 01:50:39,025 INFO L78 Accepts]: Start accepts. Automaton has 7704 states and 32591 transitions. Word has length 10 [2022-11-03 01:50:39,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:50:39,026 INFO L495 AbstractCegarLoop]: Abstraction has 7704 states and 32591 transitions. [2022-11-03 01:50:39,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 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 01:50:39,026 INFO L276 IsEmpty]: Start isEmpty. Operand 7704 states and 32591 transitions. [2022-11-03 01:50:39,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 01:50:39,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:50:39,027 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:50:39,052 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-03 01:50:39,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-03 01:50:39,230 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:50:39,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:50:39,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1837504435, now seen corresponding path program 1 times [2022-11-03 01:50:39,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:50:39,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135493834] [2022-11-03 01:50:39,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:39,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:50:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:39,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:50:39,365 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:50:39,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135493834] [2022-11-03 01:50:39,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135493834] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:50:39,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:50:39,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:50:39,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361943238] [2022-11-03 01:50:39,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:50:39,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:50:39,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:50:39,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:50:39,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:50:39,367 INFO L87 Difference]: Start difference. First operand 7704 states and 32591 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 01:50:39,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:50:39,746 INFO L93 Difference]: Finished difference Result 14041 states and 53268 transitions. [2022-11-03 01:50:39,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:50:39,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 01:50:39,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:50:39,832 INFO L225 Difference]: With dead ends: 14041 [2022-11-03 01:50:39,832 INFO L226 Difference]: Without dead ends: 14037 [2022-11-03 01:50:39,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:50:39,833 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 70 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:50:39,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 9 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:50:39,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14037 states. [2022-11-03 01:50:40,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14037 to 8056. [2022-11-03 01:50:40,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8056 states, 7426 states have (on average 4.518583355776999) internal successors, (33555), 8055 states have internal predecessors, (33555), 0 states have call successors, (0), 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 01:50:40,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8056 states to 8056 states and 33555 transitions. [2022-11-03 01:50:40,127 INFO L78 Accepts]: Start accepts. Automaton has 8056 states and 33555 transitions. Word has length 10 [2022-11-03 01:50:40,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:50:40,127 INFO L495 AbstractCegarLoop]: Abstraction has 8056 states and 33555 transitions. [2022-11-03 01:50:40,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 01:50:40,128 INFO L276 IsEmpty]: Start isEmpty. Operand 8056 states and 33555 transitions. [2022-11-03 01:50:40,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 01:50:40,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:50:40,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:50:40,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-03 01:50:40,129 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:50:40,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:50:40,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1879659176, now seen corresponding path program 1 times [2022-11-03 01:50:40,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:50:40,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870126368] [2022-11-03 01:50:40,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:40,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:50:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:40,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:50:40,332 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:50:40,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870126368] [2022-11-03 01:50:40,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870126368] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:50:40,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:50:40,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:50:40,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910744398] [2022-11-03 01:50:40,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:50:40,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:50:40,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:50:40,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:50:40,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:50:40,334 INFO L87 Difference]: Start difference. First operand 8056 states and 33555 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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 01:50:40,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:50:40,701 INFO L93 Difference]: Finished difference Result 10683 states and 42569 transitions. [2022-11-03 01:50:40,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:50:40,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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 01:50:40,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:50:40,765 INFO L225 Difference]: With dead ends: 10683 [2022-11-03 01:50:40,765 INFO L226 Difference]: Without dead ends: 10683 [2022-11-03 01:50:40,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:50:40,767 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 147 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:50:40,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 11 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:50:40,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10683 states. [2022-11-03 01:50:40,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10683 to 8628. [2022-11-03 01:50:40,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8628 states, 7998 states have (on average 4.5378844711177795) internal successors, (36294), 8627 states have internal predecessors, (36294), 0 states have call successors, (0), 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 01:50:41,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8628 states to 8628 states and 36294 transitions. [2022-11-03 01:50:41,022 INFO L78 Accepts]: Start accepts. Automaton has 8628 states and 36294 transitions. Word has length 10 [2022-11-03 01:50:41,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:50:41,023 INFO L495 AbstractCegarLoop]: Abstraction has 8628 states and 36294 transitions. [2022-11-03 01:50:41,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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 01:50:41,023 INFO L276 IsEmpty]: Start isEmpty. Operand 8628 states and 36294 transitions. [2022-11-03 01:50:41,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 01:50:41,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:50:41,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:50:41,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-03 01:50:41,024 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:50:41,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:50:41,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1879659175, now seen corresponding path program 1 times [2022-11-03 01:50:41,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:50:41,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059071553] [2022-11-03 01:50:41,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:41,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:50:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:41,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:50:41,228 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:50:41,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059071553] [2022-11-03 01:50:41,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059071553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:50:41,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:50:41,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:50:41,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26402703] [2022-11-03 01:50:41,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:50:41,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:50:41,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:50:41,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:50:41,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:50:41,230 INFO L87 Difference]: Start difference. First operand 8628 states and 36294 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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 01:50:41,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:50:41,635 INFO L93 Difference]: Finished difference Result 10683 states and 42023 transitions. [2022-11-03 01:50:41,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:50:41,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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 01:50:41,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:50:41,770 INFO L225 Difference]: With dead ends: 10683 [2022-11-03 01:50:41,770 INFO L226 Difference]: Without dead ends: 10683 [2022-11-03 01:50:41,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:50:41,771 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 114 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:50:41,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 13 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:50:41,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10683 states. [2022-11-03 01:50:41,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10683 to 8082. [2022-11-03 01:50:41,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8082 states, 7452 states have (on average 4.514224369296833) internal successors, (33640), 8081 states have internal predecessors, (33640), 0 states have call successors, (0), 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 01:50:42,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8082 states to 8082 states and 33640 transitions. [2022-11-03 01:50:42,022 INFO L78 Accepts]: Start accepts. Automaton has 8082 states and 33640 transitions. Word has length 10 [2022-11-03 01:50:42,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:50:42,022 INFO L495 AbstractCegarLoop]: Abstraction has 8082 states and 33640 transitions. [2022-11-03 01:50:42,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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 01:50:42,022 INFO L276 IsEmpty]: Start isEmpty. Operand 8082 states and 33640 transitions. [2022-11-03 01:50:42,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 01:50:42,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:50:42,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:50:42,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-03 01:50:42,024 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:50:42,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:50:42,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1703856707, now seen corresponding path program 1 times [2022-11-03 01:50:42,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:50:42,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499359594] [2022-11-03 01:50:42,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:42,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:50:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:42,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:50:42,243 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:50:42,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499359594] [2022-11-03 01:50:42,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499359594] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:50:42,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:50:42,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 01:50:42,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400956287] [2022-11-03 01:50:42,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:50:42,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:50:42,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:50:42,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:50:42,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:50:42,245 INFO L87 Difference]: Start difference. First operand 8082 states and 33640 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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 01:50:42,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:50:42,519 INFO L93 Difference]: Finished difference Result 10803 states and 46403 transitions. [2022-11-03 01:50:42,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:50:42,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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 01:50:42,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:50:42,586 INFO L225 Difference]: With dead ends: 10803 [2022-11-03 01:50:42,587 INFO L226 Difference]: Without dead ends: 10803 [2022-11-03 01:50:42,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:50:42,588 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 36 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:50:42,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 5 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:50:42,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10803 states. [2022-11-03 01:50:42,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10803 to 8770. [2022-11-03 01:50:42,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8770 states, 8140 states have (on average 4.900491400491401) internal successors, (39890), 8769 states have internal predecessors, (39890), 0 states have call successors, (0), 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 01:50:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8770 states to 8770 states and 39890 transitions. [2022-11-03 01:50:42,914 INFO L78 Accepts]: Start accepts. Automaton has 8770 states and 39890 transitions. Word has length 10 [2022-11-03 01:50:42,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:50:42,915 INFO L495 AbstractCegarLoop]: Abstraction has 8770 states and 39890 transitions. [2022-11-03 01:50:42,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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 01:50:42,915 INFO L276 IsEmpty]: Start isEmpty. Operand 8770 states and 39890 transitions. [2022-11-03 01:50:42,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 01:50:42,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:50:42,916 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:50:42,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-03 01:50:42,916 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:50:42,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:50:42,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1703856705, now seen corresponding path program 1 times [2022-11-03 01:50:42,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:50:42,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754755111] [2022-11-03 01:50:42,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:42,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:50:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:43,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:43,327 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:50:43,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754755111] [2022-11-03 01:50:43,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754755111] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:50:43,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542908136] [2022-11-03 01:50:43,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:43,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:50:43,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:50:43,331 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:50:43,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-03 01:50:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:43,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 01:50:43,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:50:43,777 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 15 treesize of output 11 [2022-11-03 01:50:43,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:43,849 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 18 treesize of output 20 [2022-11-03 01:50:43,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:43,919 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 18 treesize of output 20 [2022-11-03 01:50:43,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:43,985 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 18 treesize of output 20 [2022-11-03 01:50:44,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:44,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:50:44,150 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1139) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 4294967296)) is different from false [2022-11-03 01:50:44,158 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1139) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 4294967296)) is different from false [2022-11-03 01:50:44,231 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:50:44,232 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 32 treesize of output 33 [2022-11-03 01:50:44,243 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:50:44,243 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 309 treesize of output 297 [2022-11-03 01:50:44,251 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 282 treesize of output 258 [2022-11-03 01:50:44,261 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 134 treesize of output 122 [2022-11-03 01:50:44,269 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 246 treesize of output 198 [2022-11-03 01:50:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:44,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542908136] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:50:44,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1349911950] [2022-11-03 01:50:44,490 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 01:50:44,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:50:44,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-03 01:50:44,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461809821] [2022-11-03 01:50:44,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:50:44,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 01:50:44,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:50:44,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 01:50:44,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=255, Unknown=2, NotChecked=66, Total=380 [2022-11-03 01:50:44,492 INFO L87 Difference]: Start difference. First operand 8770 states and 39890 transitions. Second operand has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 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 01:50:45,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:50:45,253 INFO L93 Difference]: Finished difference Result 11474 states and 47894 transitions. [2022-11-03 01:50:45,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:50:45,255 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 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 01:50:45,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:50:45,305 INFO L225 Difference]: With dead ends: 11474 [2022-11-03 01:50:45,305 INFO L226 Difference]: Without dead ends: 11474 [2022-11-03 01:50:45,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=97, Invalid=461, Unknown=2, NotChecked=90, Total=650 [2022-11-03 01:50:45,306 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 46 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 294 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:50:45,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 48 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 352 Invalid, 0 Unknown, 294 Unchecked, 0.3s Time] [2022-11-03 01:50:45,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11474 states. [2022-11-03 01:50:45,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11474 to 8770. [2022-11-03 01:50:45,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8770 states, 8140 states have (on average 4.9) internal successors, (39886), 8769 states have internal predecessors, (39886), 0 states have call successors, (0), 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 01:50:45,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8770 states to 8770 states and 39886 transitions. [2022-11-03 01:50:45,554 INFO L78 Accepts]: Start accepts. Automaton has 8770 states and 39886 transitions. Word has length 10 [2022-11-03 01:50:45,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:50:45,555 INFO L495 AbstractCegarLoop]: Abstraction has 8770 states and 39886 transitions. [2022-11-03 01:50:45,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 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 01:50:45,555 INFO L276 IsEmpty]: Start isEmpty. Operand 8770 states and 39886 transitions. [2022-11-03 01:50:45,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 01:50:45,555 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:50:45,556 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:50:45,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-03 01:50:45,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:50:45,762 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread3Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:50:45,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:50:45,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1703856527, now seen corresponding path program 1 times [2022-11-03 01:50:45,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:50:45,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027911209] [2022-11-03 01:50:45,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:45,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:50:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:45,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:50:45,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:50:45,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027911209] [2022-11-03 01:50:45,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027911209] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:50:45,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:50:45,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:50:45,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430797434] [2022-11-03 01:50:45,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:50:45,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:50:45,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:50:45,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:50:45,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:50:45,829 INFO L87 Difference]: Start difference. First operand 8770 states and 39886 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) 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 01:50:46,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:50:46,081 INFO L93 Difference]: Finished difference Result 8092 states and 36335 transitions. [2022-11-03 01:50:46,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:50:46,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) 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 01:50:46,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:50:46,131 INFO L225 Difference]: With dead ends: 8092 [2022-11-03 01:50:46,132 INFO L226 Difference]: Without dead ends: 8092 [2022-11-03 01:50:46,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:50:46,133 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 83 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:50:46,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 6 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:50:46,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8092 states. [2022-11-03 01:50:46,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8092 to 8092. [2022-11-03 01:50:46,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8092 states, 7532 states have (on average 4.8240839086564) internal successors, (36335), 8091 states have internal predecessors, (36335), 0 states have call successors, (0), 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 01:50:46,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8092 states to 8092 states and 36335 transitions. [2022-11-03 01:50:46,408 INFO L78 Accepts]: Start accepts. Automaton has 8092 states and 36335 transitions. Word has length 10 [2022-11-03 01:50:46,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:50:46,408 INFO L495 AbstractCegarLoop]: Abstraction has 8092 states and 36335 transitions. [2022-11-03 01:50:46,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) 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 01:50:46,409 INFO L276 IsEmpty]: Start isEmpty. Operand 8092 states and 36335 transitions. [2022-11-03 01:50:46,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 01:50:46,410 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:50:46,410 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:50:46,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-03 01:50:46,410 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:50:46,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:50:46,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1703856698, now seen corresponding path program 1 times [2022-11-03 01:50:46,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:50:46,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649218373] [2022-11-03 01:50:46,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:46,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:50:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:46,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:46,884 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:50:46,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649218373] [2022-11-03 01:50:46,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649218373] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:50:46,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226506721] [2022-11-03 01:50:46,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:46,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:50:46,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:50:46,887 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:50:46,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-03 01:50:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:47,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 01:50:47,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:50:47,329 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 15 treesize of output 11 [2022-11-03 01:50:47,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:47,413 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 20 treesize of output 22 [2022-11-03 01:50:47,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:47,490 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 20 treesize of output 22 [2022-11-03 01:50:47,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:47,551 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 20 treesize of output 22 [2022-11-03 01:50:47,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:47,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:50:47,695 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1210 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1210) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0)))))) is different from false [2022-11-03 01:50:47,704 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1210 (Array Int Int)) (v_ArrVal_1209 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1209) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1210) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 9223372039002259456))) is different from false [2022-11-03 01:50:47,776 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:50:47,776 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 34 treesize of output 35 [2022-11-03 01:50:47,787 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:50:47,787 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 343 treesize of output 331 [2022-11-03 01:50:47,794 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 314 treesize of output 266 [2022-11-03 01:50:47,813 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 266 treesize of output 242 [2022-11-03 01:50:47,821 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 242 treesize of output 230 [2022-11-03 01:50:48,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:48,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226506721] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:50:48,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1302396717] [2022-11-03 01:50:48,033 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 01:50:48,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:50:48,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-03 01:50:48,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040703880] [2022-11-03 01:50:48,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:50:48,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 01:50:48,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:50:48,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 01:50:48,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=259, Unknown=2, NotChecked=66, Total=380 [2022-11-03 01:50:48,035 INFO L87 Difference]: Start difference. First operand 8092 states and 36335 transitions. Second operand has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 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 01:50:48,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:50:48,800 INFO L93 Difference]: Finished difference Result 11344 states and 45956 transitions. [2022-11-03 01:50:48,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:50:48,801 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 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 01:50:48,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:50:48,848 INFO L225 Difference]: With dead ends: 11344 [2022-11-03 01:50:48,848 INFO L226 Difference]: Without dead ends: 11344 [2022-11-03 01:50:48,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=93, Invalid=465, Unknown=2, NotChecked=90, Total=650 [2022-11-03 01:50:48,849 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 49 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 359 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:50:48,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 50 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 329 Invalid, 0 Unknown, 359 Unchecked, 0.3s Time] [2022-11-03 01:50:48,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11344 states. [2022-11-03 01:50:49,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11344 to 8092. [2022-11-03 01:50:49,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8092 states, 7532 states have (on average 4.823552841210834) internal successors, (36331), 8091 states have internal predecessors, (36331), 0 states have call successors, (0), 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 01:50:49,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8092 states to 8092 states and 36331 transitions. [2022-11-03 01:50:49,074 INFO L78 Accepts]: Start accepts. Automaton has 8092 states and 36331 transitions. Word has length 10 [2022-11-03 01:50:49,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:50:49,075 INFO L495 AbstractCegarLoop]: Abstraction has 8092 states and 36331 transitions. [2022-11-03 01:50:49,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 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 01:50:49,075 INFO L276 IsEmpty]: Start isEmpty. Operand 8092 states and 36331 transitions. [2022-11-03 01:50:49,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 01:50:49,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:50:49,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:50:49,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-03 01:50:49,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:50:49,276 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:50:49,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:50:49,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1663245218, now seen corresponding path program 2 times [2022-11-03 01:50:49,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:50:49,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559462198] [2022-11-03 01:50:49,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:49,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:50:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:49,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:50:49,509 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:50:49,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559462198] [2022-11-03 01:50:49,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559462198] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:50:49,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:50:49,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:50:49,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573543010] [2022-11-03 01:50:49,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:50:49,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:50:49,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:50:49,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:50:49,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:50:49,511 INFO L87 Difference]: Start difference. First operand 8092 states and 36331 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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 01:50:49,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:50:49,974 INFO L93 Difference]: Finished difference Result 9621 states and 41042 transitions. [2022-11-03 01:50:49,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:50:49,975 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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 01:50:49,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:50:50,017 INFO L225 Difference]: With dead ends: 9621 [2022-11-03 01:50:50,017 INFO L226 Difference]: Without dead ends: 9621 [2022-11-03 01:50:50,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-03 01:50:50,018 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 140 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:50:50,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 13 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:50:50,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9621 states. [2022-11-03 01:50:50,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9621 to 8043. [2022-11-03 01:50:50,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8043 states, 7483 states have (on average 4.762662033943606) internal successors, (35639), 8042 states have internal predecessors, (35639), 0 states have call successors, (0), 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 01:50:50,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8043 states to 8043 states and 35639 transitions. [2022-11-03 01:50:50,236 INFO L78 Accepts]: Start accepts. Automaton has 8043 states and 35639 transitions. Word has length 10 [2022-11-03 01:50:50,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:50:50,236 INFO L495 AbstractCegarLoop]: Abstraction has 8043 states and 35639 transitions. [2022-11-03 01:50:50,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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 01:50:50,237 INFO L276 IsEmpty]: Start isEmpty. Operand 8043 states and 35639 transitions. [2022-11-03 01:50:50,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 01:50:50,238 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:50:50,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:50:50,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-03 01:50:50,239 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:50:50,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:50:50,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1663245219, now seen corresponding path program 2 times [2022-11-03 01:50:50,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:50:50,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820567633] [2022-11-03 01:50:50,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:50,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:50:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:50,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:50:50,460 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:50:50,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820567633] [2022-11-03 01:50:50,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820567633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:50:50,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:50:50,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:50:50,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800954774] [2022-11-03 01:50:50,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:50:50,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:50:50,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:50:50,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:50:50,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:50:50,463 INFO L87 Difference]: Start difference. First operand 8043 states and 35639 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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 01:50:50,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:50:50,805 INFO L93 Difference]: Finished difference Result 7511 states and 32869 transitions. [2022-11-03 01:50:50,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:50:50,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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 01:50:50,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:50:50,853 INFO L225 Difference]: With dead ends: 7511 [2022-11-03 01:50:50,853 INFO L226 Difference]: Without dead ends: 7511 [2022-11-03 01:50:50,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-03 01:50:50,854 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 145 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:50:50,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 7 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:50:50,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7511 states. [2022-11-03 01:50:51,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7511 to 6939. [2022-11-03 01:50:51,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6939 states, 6459 states have (on average 4.720544976002477) internal successors, (30490), 6938 states have internal predecessors, (30490), 0 states have call successors, (0), 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 01:50:51,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6939 states to 6939 states and 30490 transitions. [2022-11-03 01:50:51,110 INFO L78 Accepts]: Start accepts. Automaton has 6939 states and 30490 transitions. Word has length 10 [2022-11-03 01:50:51,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:50:51,110 INFO L495 AbstractCegarLoop]: Abstraction has 6939 states and 30490 transitions. [2022-11-03 01:50:51,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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 01:50:51,111 INFO L276 IsEmpty]: Start isEmpty. Operand 6939 states and 30490 transitions. [2022-11-03 01:50:51,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 01:50:51,112 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:50:51,112 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:50:51,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-03 01:50:51,112 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:50:51,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:50:51,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1139826516, now seen corresponding path program 2 times [2022-11-03 01:50:51,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:50:51,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22825866] [2022-11-03 01:50:51,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:51,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:50:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:51,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:51,901 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:50:51,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22825866] [2022-11-03 01:50:51,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22825866] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:50:51,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992248647] [2022-11-03 01:50:51,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:50:51,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:50:51,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:50:51,903 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:50:51,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-03 01:50:52,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:50:52,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:50:52,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-03 01:50:52,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:50:52,351 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 11 treesize of output 7 [2022-11-03 01:50:52,429 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 01:50:52,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 28 [2022-11-03 01:50:52,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:52,577 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 25 treesize of output 25 [2022-11-03 01:50:52,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:52,688 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 25 treesize of output 25 [2022-11-03 01:50:52,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:52,775 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 25 treesize of output 25 [2022-11-03 01:50:52,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:52,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:50:52,986 WARN L833 $PredicateComparison]: unable to prove that (or (not (< c_~M~0 c_~N~0)) (forall ((v_ArrVal_1309 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1309) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 4294967296))) is different from false [2022-11-03 01:50:53,001 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1309 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1308) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1309) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 4294967296)) (not (< c_~M~0 c_~N~0))) is different from false [2022-11-03 01:50:53,253 INFO L356 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-03 01:50:53,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 2 case distinctions, treesize of input 39 treesize of output 54 [2022-11-03 01:50:53,284 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:50:53,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 638 treesize of output 626 [2022-11-03 01:50:53,309 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 574 treesize of output 526 [2022-11-03 01:50:53,326 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 526 treesize of output 430 [2022-11-03 01:50:53,344 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 227 treesize of output 203 [2022-11-03 01:50:54,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:54,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992248647] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:50:54,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1863268993] [2022-11-03 01:50:54,262 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 01:50:54,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:50:54,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-03 01:50:54,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364867224] [2022-11-03 01:50:54,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:50:54,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 01:50:54,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:50:54,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 01:50:54,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=353, Unknown=3, NotChecked=78, Total=506 [2022-11-03 01:50:54,265 INFO L87 Difference]: Start difference. First operand 6939 states and 30490 transitions. Second operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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 01:50:55,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:50:55,322 INFO L93 Difference]: Finished difference Result 9250 states and 37685 transitions. [2022-11-03 01:50:55,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-03 01:50:55,323 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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 11 [2022-11-03 01:50:55,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:50:55,363 INFO L225 Difference]: With dead ends: 9250 [2022-11-03 01:50:55,363 INFO L226 Difference]: Without dead ends: 9250 [2022-11-03 01:50:55,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=139, Invalid=736, Unknown=3, NotChecked=114, Total=992 [2022-11-03 01:50:55,364 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 46 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 317 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:50:55,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 74 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 291 Invalid, 0 Unknown, 317 Unchecked, 0.3s Time] [2022-11-03 01:50:55,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9250 states. [2022-11-03 01:50:55,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9250 to 6966. [2022-11-03 01:50:55,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6966 states, 6486 states have (on average 4.719858156028369) internal successors, (30613), 6965 states have internal predecessors, (30613), 0 states have call successors, (0), 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 01:50:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6966 states to 6966 states and 30613 transitions. [2022-11-03 01:50:55,554 INFO L78 Accepts]: Start accepts. Automaton has 6966 states and 30613 transitions. Word has length 11 [2022-11-03 01:50:55,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:50:55,554 INFO L495 AbstractCegarLoop]: Abstraction has 6966 states and 30613 transitions. [2022-11-03 01:50:55,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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 01:50:55,554 INFO L276 IsEmpty]: Start isEmpty. Operand 6966 states and 30613 transitions. [2022-11-03 01:50:55,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 01:50:55,555 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:50:55,555 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:50:55,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-03 01:50:55,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:50:55,756 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:50:55,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:50:55,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1139826523, now seen corresponding path program 2 times [2022-11-03 01:50:55,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:50:55,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883186976] [2022-11-03 01:50:55,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:55,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:50:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:56,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:56,341 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:50:56,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883186976] [2022-11-03 01:50:56,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883186976] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:50:56,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108683749] [2022-11-03 01:50:56,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:50:56,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:50:56,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:50:56,347 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:50:56,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-03 01:50:56,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:50:56,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:50:56,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-03 01:50:56,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:50:56,802 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 11 treesize of output 7 [2022-11-03 01:50:56,862 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 01:50:56,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-11-03 01:50:56,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:56,964 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 29 treesize of output 29 [2022-11-03 01:50:57,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:57,047 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 29 treesize of output 29 [2022-11-03 01:50:57,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:50:57,134 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 29 treesize of output 29 [2022-11-03 01:50:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:57,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:50:57,669 INFO L356 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-03 01:50:57,669 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 2 case distinctions, treesize of input 41 treesize of output 56 [2022-11-03 01:50:57,693 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:50:57,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 364 treesize of output 368 [2022-11-03 01:50:57,705 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 314 treesize of output 266 [2022-11-03 01:50:57,718 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 266 treesize of output 242 [2022-11-03 01:50:57,730 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 242 treesize of output 230 [2022-11-03 01:50:58,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:58,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108683749] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:50:58,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [983183246] [2022-11-03 01:50:58,229 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 01:50:58,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:50:58,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-03 01:50:58,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688663155] [2022-11-03 01:50:58,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:50:58,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 01:50:58,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:50:58,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 01:50:58,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=429, Unknown=5, NotChecked=0, Total=506 [2022-11-03 01:50:58,231 INFO L87 Difference]: Start difference. First operand 6966 states and 30613 transitions. Second operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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 01:50:59,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:50:59,192 INFO L93 Difference]: Finished difference Result 9832 states and 39514 transitions. [2022-11-03 01:50:59,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-03 01:50:59,193 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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 11 [2022-11-03 01:50:59,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:50:59,234 INFO L225 Difference]: With dead ends: 9832 [2022-11-03 01:50:59,234 INFO L226 Difference]: Without dead ends: 9832 [2022-11-03 01:50:59,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=135, Invalid=790, Unknown=5, NotChecked=0, Total=930 [2022-11-03 01:50:59,235 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 96 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 182 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:50:59,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 107 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 371 Invalid, 0 Unknown, 182 Unchecked, 0.4s Time] [2022-11-03 01:50:59,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9832 states. [2022-11-03 01:50:59,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9832 to 6980. [2022-11-03 01:50:59,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6980 states, 6500 states have (on average 4.722769230769231) internal successors, (30698), 6979 states have internal predecessors, (30698), 0 states have call successors, (0), 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 01:50:59,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6980 states to 6980 states and 30698 transitions. [2022-11-03 01:50:59,423 INFO L78 Accepts]: Start accepts. Automaton has 6980 states and 30698 transitions. Word has length 11 [2022-11-03 01:50:59,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:50:59,423 INFO L495 AbstractCegarLoop]: Abstraction has 6980 states and 30698 transitions. [2022-11-03 01:50:59,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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 01:50:59,423 INFO L276 IsEmpty]: Start isEmpty. Operand 6980 states and 30698 transitions. [2022-11-03 01:50:59,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 01:50:59,424 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:50:59,424 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:50:59,457 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-11-03 01:50:59,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-03 01:50:59,624 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting thread3Err14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:50:59,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:50:59,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1139826604, now seen corresponding path program 1 times [2022-11-03 01:50:59,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:50:59,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383195651] [2022-11-03 01:50:59,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:59,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:50:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:50:59,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:50:59,741 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:50:59,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383195651] [2022-11-03 01:50:59,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383195651] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:50:59,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654102496] [2022-11-03 01:50:59,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:50:59,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:50:59,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:50:59,743 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:50:59,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-03 01:51:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:00,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 01:51:00,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:51:00,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:51:00,177 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:51:00,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654102496] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:51:00,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:51:00,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2022-11-03 01:51:00,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848774739] [2022-11-03 01:51:00,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:51:00,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:51:00,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:51:00,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:51:00,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:51:00,179 INFO L87 Difference]: Start difference. First operand 6980 states and 30698 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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 01:51:00,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:51:00,415 INFO L93 Difference]: Finished difference Result 6432 states and 27863 transitions. [2022-11-03 01:51:00,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:51:00,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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 11 [2022-11-03 01:51:00,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:51:00,457 INFO L225 Difference]: With dead ends: 6432 [2022-11-03 01:51:00,458 INFO L226 Difference]: Without dead ends: 6432 [2022-11-03 01:51:00,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:51:00,461 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:51:00,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 3 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:51:00,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6432 states. [2022-11-03 01:51:00,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6432 to 6412. [2022-11-03 01:51:00,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6412 states, 5992 states have (on average 4.634178905206943) internal successors, (27768), 6411 states have internal predecessors, (27768), 0 states have call successors, (0), 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 01:51:00,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6412 states to 6412 states and 27768 transitions. [2022-11-03 01:51:00,672 INFO L78 Accepts]: Start accepts. Automaton has 6412 states and 27768 transitions. Word has length 11 [2022-11-03 01:51:00,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:51:00,672 INFO L495 AbstractCegarLoop]: Abstraction has 6412 states and 27768 transitions. [2022-11-03 01:51:00,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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 01:51:00,673 INFO L276 IsEmpty]: Start isEmpty. Operand 6412 states and 27768 transitions. [2022-11-03 01:51:00,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 01:51:00,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:51:00,674 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:51:00,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-03 01:51:00,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-11-03 01:51:00,902 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:51:00,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:51:00,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1128061960, now seen corresponding path program 1 times [2022-11-03 01:51:00,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:51:00,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076983190] [2022-11-03 01:51:00,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:00,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:51:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:01,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:51:01,118 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:51:01,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076983190] [2022-11-03 01:51:01,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076983190] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:51:01,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:51:01,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:51:01,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624800690] [2022-11-03 01:51:01,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:51:01,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:51:01,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:51:01,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:51:01,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:51:01,120 INFO L87 Difference]: Start difference. First operand 6412 states and 27768 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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 01:51:01,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:51:01,461 INFO L93 Difference]: Finished difference Result 9259 states and 38922 transitions. [2022-11-03 01:51:01,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:51:01,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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 11 [2022-11-03 01:51:01,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:51:01,501 INFO L225 Difference]: With dead ends: 9259 [2022-11-03 01:51:01,501 INFO L226 Difference]: Without dead ends: 9255 [2022-11-03 01:51:01,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:51:01,502 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 99 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:51:01,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 13 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:51:01,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9255 states. [2022-11-03 01:51:01,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9255 to 6448. [2022-11-03 01:51:01,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6448 states, 6028 states have (on average 4.63735899137359) internal successors, (27954), 6447 states have internal predecessors, (27954), 0 states have call successors, (0), 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 01:51:01,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6448 states to 6448 states and 27954 transitions. [2022-11-03 01:51:01,678 INFO L78 Accepts]: Start accepts. Automaton has 6448 states and 27954 transitions. Word has length 11 [2022-11-03 01:51:01,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:51:01,679 INFO L495 AbstractCegarLoop]: Abstraction has 6448 states and 27954 transitions. [2022-11-03 01:51:01,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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 01:51:01,679 INFO L276 IsEmpty]: Start isEmpty. Operand 6448 states and 27954 transitions. [2022-11-03 01:51:01,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 01:51:01,680 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:51:01,680 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:51:01,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-03 01:51:01,680 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:51:01,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:51:01,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1128062750, now seen corresponding path program 1 times [2022-11-03 01:51:01,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:51:01,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395163577] [2022-11-03 01:51:01,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:01,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:51:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:01,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:01,835 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:51:01,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395163577] [2022-11-03 01:51:01,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395163577] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:51:01,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709961508] [2022-11-03 01:51:01,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:01,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:51:01,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:51:01,839 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:51:01,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-03 01:51:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:02,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-03 01:51:02,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:51:02,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:02,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:51:02,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:02,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709961508] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:51:02,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1235326652] [2022-11-03 01:51:02,470 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 01:51:02,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:51:02,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-11-03 01:51:02,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891395292] [2022-11-03 01:51:02,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:51:02,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 01:51:02,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:51:02,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 01:51:02,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-11-03 01:51:02,472 INFO L87 Difference]: Start difference. First operand 6448 states and 27954 transitions. Second operand has 18 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 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 01:51:03,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:51:03,763 INFO L93 Difference]: Finished difference Result 9411 states and 39330 transitions. [2022-11-03 01:51:03,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 01:51:03,763 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 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 11 [2022-11-03 01:51:03,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:51:03,799 INFO L225 Difference]: With dead ends: 9411 [2022-11-03 01:51:03,799 INFO L226 Difference]: Without dead ends: 9411 [2022-11-03 01:51:03,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=426, Unknown=0, NotChecked=0, Total=600 [2022-11-03 01:51:03,800 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 539 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:51:03,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 41 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-03 01:51:03,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9411 states. [2022-11-03 01:51:03,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9411 to 7842. [2022-11-03 01:51:03,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7842 states, 7422 states have (on average 4.616680140123956) internal successors, (34265), 7841 states have internal predecessors, (34265), 0 states have call successors, (0), 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 01:51:03,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7842 states to 7842 states and 34265 transitions. [2022-11-03 01:51:03,999 INFO L78 Accepts]: Start accepts. Automaton has 7842 states and 34265 transitions. Word has length 11 [2022-11-03 01:51:03,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:51:03,999 INFO L495 AbstractCegarLoop]: Abstraction has 7842 states and 34265 transitions. [2022-11-03 01:51:03,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 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 01:51:03,999 INFO L276 IsEmpty]: Start isEmpty. Operand 7842 states and 34265 transitions. [2022-11-03 01:51:04,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 01:51:04,000 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:51:04,000 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2022-11-03 01:51:04,033 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-03 01:51:04,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:51:04,214 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:51:04,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:51:04,215 INFO L85 PathProgramCache]: Analyzing trace with hash 215077989, now seen corresponding path program 2 times [2022-11-03 01:51:04,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:51:04,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962366831] [2022-11-03 01:51:04,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:04,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:51:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:04,349 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:04,349 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:51:04,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962366831] [2022-11-03 01:51:04,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962366831] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:51:04,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192274918] [2022-11-03 01:51:04,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:51:04,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:51:04,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:51:04,355 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:51:04,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-03 01:51:04,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 01:51:04,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:51:04,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 01:51:04,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:51:04,814 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:04,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:51:04,891 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:04,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192274918] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:51:04,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1504487194] [2022-11-03 01:51:04,891 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 01:51:04,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:51:04,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-11-03 01:51:04,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274083619] [2022-11-03 01:51:04,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:51:04,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-03 01:51:04,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:51:04,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-03 01:51:04,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2022-11-03 01:51:04,894 INFO L87 Difference]: Start difference. First operand 7842 states and 34265 transitions. Second operand has 19 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 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 01:51:06,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:51:06,145 INFO L93 Difference]: Finished difference Result 9272 states and 38239 transitions. [2022-11-03 01:51:06,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 01:51:06,145 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 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 11 [2022-11-03 01:51:06,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:51:06,183 INFO L225 Difference]: With dead ends: 9272 [2022-11-03 01:51:06,183 INFO L226 Difference]: Without dead ends: 9270 [2022-11-03 01:51:06,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2022-11-03 01:51:06,184 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 544 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:51:06,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 93 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-03 01:51:06,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9270 states. [2022-11-03 01:51:06,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9270 to 8067. [2022-11-03 01:51:06,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8067 states, 7647 states have (on average 4.579312148554989) internal successors, (35018), 8066 states have internal predecessors, (35018), 0 states have call successors, (0), 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 01:51:06,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8067 states to 8067 states and 35018 transitions. [2022-11-03 01:51:06,387 INFO L78 Accepts]: Start accepts. Automaton has 8067 states and 35018 transitions. Word has length 11 [2022-11-03 01:51:06,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:51:06,388 INFO L495 AbstractCegarLoop]: Abstraction has 8067 states and 35018 transitions. [2022-11-03 01:51:06,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 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 01:51:06,388 INFO L276 IsEmpty]: Start isEmpty. Operand 8067 states and 35018 transitions. [2022-11-03 01:51:06,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 01:51:06,389 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:51:06,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:51:06,415 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-03 01:51:06,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:51:06,589 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:51:06,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:51:06,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1279731692, now seen corresponding path program 1 times [2022-11-03 01:51:06,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:51:06,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3138481] [2022-11-03 01:51:06,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:06,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:51:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:06,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:06,959 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:51:06,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3138481] [2022-11-03 01:51:06,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3138481] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:51:06,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45055394] [2022-11-03 01:51:06,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:06,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:51:06,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:51:06,961 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:51:06,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-03 01:51:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:07,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 01:51:07,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:51:07,364 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 15 treesize of output 11 [2022-11-03 01:51:07,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:07,447 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 18 treesize of output 20 [2022-11-03 01:51:07,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:07,510 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 18 treesize of output 20 [2022-11-03 01:51:07,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:07,564 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 18 treesize of output 20 [2022-11-03 01:51:07,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:07,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:51:07,766 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1569 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1569) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 4294967296)) is different from false [2022-11-03 01:51:07,774 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1569 (Array Int Int)) (v_ArrVal_1568 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1568) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1569) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 4294967296)) is different from false [2022-11-03 01:51:07,859 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:07,860 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 32 treesize of output 33 [2022-11-03 01:51:07,871 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:07,871 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 155 treesize of output 151 [2022-11-03 01:51:07,882 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 136 treesize of output 112 [2022-11-03 01:51:07,893 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 58 treesize of output 52 [2022-11-03 01:51:07,901 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 106 treesize of output 94 [2022-11-03 01:51:08,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:08,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45055394] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:51:08,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2123532399] [2022-11-03 01:51:08,249 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 01:51:08,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:51:08,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-03 01:51:08,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487589957] [2022-11-03 01:51:08,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:51:08,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 01:51:08,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:51:08,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 01:51:08,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=255, Unknown=2, NotChecked=66, Total=380 [2022-11-03 01:51:08,251 INFO L87 Difference]: Start difference. First operand 8067 states and 35018 transitions. Second operand has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 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 01:51:09,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:51:09,143 INFO L93 Difference]: Finished difference Result 10563 states and 42352 transitions. [2022-11-03 01:51:09,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:51:09,143 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 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 11 [2022-11-03 01:51:09,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:51:09,195 INFO L225 Difference]: With dead ends: 10563 [2022-11-03 01:51:09,195 INFO L226 Difference]: Without dead ends: 10563 [2022-11-03 01:51:09,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=97, Invalid=461, Unknown=2, NotChecked=90, Total=650 [2022-11-03 01:51:09,196 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 45 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 334 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:51:09,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 54 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 389 Invalid, 0 Unknown, 334 Unchecked, 0.4s Time] [2022-11-03 01:51:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10563 states. [2022-11-03 01:51:09,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10563 to 8071. [2022-11-03 01:51:09,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8071 states, 7651 states have (on average 4.579793491046922) internal successors, (35040), 8070 states have internal predecessors, (35040), 0 states have call successors, (0), 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 01:51:09,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8071 states to 8071 states and 35040 transitions. [2022-11-03 01:51:09,493 INFO L78 Accepts]: Start accepts. Automaton has 8071 states and 35040 transitions. Word has length 11 [2022-11-03 01:51:09,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:51:09,494 INFO L495 AbstractCegarLoop]: Abstraction has 8071 states and 35040 transitions. [2022-11-03 01:51:09,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 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 01:51:09,494 INFO L276 IsEmpty]: Start isEmpty. Operand 8071 states and 35040 transitions. [2022-11-03 01:51:09,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 01:51:09,496 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:51:09,496 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:51:09,522 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-03 01:51:09,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-11-03 01:51:09,697 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:51:09,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:51:09,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1279731685, now seen corresponding path program 1 times [2022-11-03 01:51:09,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:51:09,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395070685] [2022-11-03 01:51:09,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:09,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:51:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:10,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:10,364 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:51:10,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395070685] [2022-11-03 01:51:10,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395070685] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:51:10,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644834512] [2022-11-03 01:51:10,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:10,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:51:10,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:51:10,366 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:51:10,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-03 01:51:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:10,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 01:51:10,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:51:10,840 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 15 treesize of output 11 [2022-11-03 01:51:10,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:10,915 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 20 treesize of output 22 [2022-11-03 01:51:10,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:10,993 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 20 treesize of output 22 [2022-11-03 01:51:11,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:11,058 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 20 treesize of output 22 [2022-11-03 01:51:11,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:11,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:51:11,217 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1618 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1618) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 9223372039002259456))) is different from false [2022-11-03 01:51:11,226 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1618 (Array Int Int)) (v_ArrVal_1617 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1617) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1618) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 9223372039002259456))) is different from false [2022-11-03 01:51:11,298 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:11,299 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 34 treesize of output 35 [2022-11-03 01:51:11,310 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:11,311 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 343 treesize of output 331 [2022-11-03 01:51:11,318 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 314 treesize of output 266 [2022-11-03 01:51:11,325 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 266 treesize of output 242 [2022-11-03 01:51:11,349 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 127 treesize of output 115 [2022-11-03 01:51:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:11,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644834512] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:51:11,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1565051007] [2022-11-03 01:51:11,611 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 01:51:11,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:51:11,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-03 01:51:11,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023443030] [2022-11-03 01:51:11,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:51:11,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 01:51:11,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:51:11,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 01:51:11,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=257, Unknown=2, NotChecked=66, Total=380 [2022-11-03 01:51:11,614 INFO L87 Difference]: Start difference. First operand 8071 states and 35040 transitions. Second operand has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 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 01:51:12,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:51:12,470 INFO L93 Difference]: Finished difference Result 11186 states and 44176 transitions. [2022-11-03 01:51:12,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:51:12,471 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 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 11 [2022-11-03 01:51:12,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:51:12,515 INFO L225 Difference]: With dead ends: 11186 [2022-11-03 01:51:12,515 INFO L226 Difference]: Without dead ends: 11186 [2022-11-03 01:51:12,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=95, Invalid=463, Unknown=2, NotChecked=90, Total=650 [2022-11-03 01:51:12,516 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 50 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 158 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:51:12,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 46 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 396 Invalid, 0 Unknown, 158 Unchecked, 0.4s Time] [2022-11-03 01:51:12,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11186 states. [2022-11-03 01:51:12,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11186 to 8071. [2022-11-03 01:51:12,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8071 states, 7651 states have (on average 4.579270683570775) internal successors, (35036), 8070 states have internal predecessors, (35036), 0 states have call successors, (0), 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 01:51:12,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8071 states to 8071 states and 35036 transitions. [2022-11-03 01:51:12,735 INFO L78 Accepts]: Start accepts. Automaton has 8071 states and 35036 transitions. Word has length 11 [2022-11-03 01:51:12,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:51:12,735 INFO L495 AbstractCegarLoop]: Abstraction has 8071 states and 35036 transitions. [2022-11-03 01:51:12,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 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 01:51:12,736 INFO L276 IsEmpty]: Start isEmpty. Operand 8071 states and 35036 transitions. [2022-11-03 01:51:12,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 01:51:12,736 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:51:12,737 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:51:12,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-03 01:51:12,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:51:12,938 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:51:12,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:51:12,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1279945592, now seen corresponding path program 2 times [2022-11-03 01:51:12,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:51:12,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99184954] [2022-11-03 01:51:12,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:12,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:51:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:13,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:13,337 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:51:13,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99184954] [2022-11-03 01:51:13,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99184954] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:51:13,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698165948] [2022-11-03 01:51:13,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:51:13,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:51:13,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:51:13,339 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:51:13,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-03 01:51:13,664 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:51:13,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:51:13,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 01:51:13,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:51:13,724 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 15 treesize of output 11 [2022-11-03 01:51:13,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:13,803 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 18 treesize of output 20 [2022-11-03 01:51:13,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:13,862 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 18 treesize of output 20 [2022-11-03 01:51:13,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:13,918 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 18 treesize of output 20 [2022-11-03 01:51:14,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:14,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:51:14,057 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1667 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1667) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 4294967296)) is different from false [2022-11-03 01:51:14,065 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1667 (Array Int Int)) (v_ArrVal_1666 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1666) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1667) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 4294967296)) is different from false [2022-11-03 01:51:14,134 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:14,135 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 32 treesize of output 33 [2022-11-03 01:51:14,149 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:14,149 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 309 treesize of output 297 [2022-11-03 01:51:14,157 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 282 treesize of output 234 [2022-11-03 01:51:14,168 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 129 treesize of output 105 [2022-11-03 01:51:14,176 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 210 treesize of output 198 [2022-11-03 01:51:14,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:14,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698165948] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:51:14,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [285451267] [2022-11-03 01:51:14,442 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 01:51:14,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:51:14,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-03 01:51:14,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546084450] [2022-11-03 01:51:14,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:51:14,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 01:51:14,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:51:14,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 01:51:14,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=251, Unknown=2, NotChecked=66, Total=380 [2022-11-03 01:51:14,444 INFO L87 Difference]: Start difference. First operand 8071 states and 35036 transitions. Second operand has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 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 01:51:15,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:51:15,241 INFO L93 Difference]: Finished difference Result 8357 states and 35773 transitions. [2022-11-03 01:51:15,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 01:51:15,241 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 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 11 [2022-11-03 01:51:15,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:51:15,277 INFO L225 Difference]: With dead ends: 8357 [2022-11-03 01:51:15,277 INFO L226 Difference]: Without dead ends: 8357 [2022-11-03 01:51:15,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=121, Invalid=485, Unknown=2, NotChecked=94, Total=702 [2022-11-03 01:51:15,278 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 87 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 469 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:51:15,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 44 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 312 Invalid, 0 Unknown, 469 Unchecked, 0.3s Time] [2022-11-03 01:51:15,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8357 states. [2022-11-03 01:51:15,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8357 to 8123. [2022-11-03 01:51:15,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8123 states, 7703 states have (on average 4.572893677787875) internal successors, (35225), 8122 states have internal predecessors, (35225), 0 states have call successors, (0), 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 01:51:15,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8123 states to 8123 states and 35225 transitions. [2022-11-03 01:51:15,475 INFO L78 Accepts]: Start accepts. Automaton has 8123 states and 35225 transitions. Word has length 11 [2022-11-03 01:51:15,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:51:15,476 INFO L495 AbstractCegarLoop]: Abstraction has 8123 states and 35225 transitions. [2022-11-03 01:51:15,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 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 01:51:15,476 INFO L276 IsEmpty]: Start isEmpty. Operand 8123 states and 35225 transitions. [2022-11-03 01:51:15,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 01:51:15,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:51:15,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:51:15,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-03 01:51:15,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-11-03 01:51:15,682 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:51:15,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:51:15,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1279945585, now seen corresponding path program 2 times [2022-11-03 01:51:15,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:51:15,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954337148] [2022-11-03 01:51:15,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:15,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:51:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:16,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:16,056 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:51:16,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954337148] [2022-11-03 01:51:16,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954337148] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:51:16,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299615116] [2022-11-03 01:51:16,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:51:16,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:51:16,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:51:16,059 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:51:16,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-03 01:51:16,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:51:16,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:51:16,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 01:51:16,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:51:16,447 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 15 treesize of output 11 [2022-11-03 01:51:16,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:16,591 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 20 treesize of output 22 [2022-11-03 01:51:16,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:16,670 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 20 treesize of output 22 [2022-11-03 01:51:16,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:16,737 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 20 treesize of output 22 [2022-11-03 01:51:16,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:16,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:51:17,140 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:17,140 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 34 treesize of output 35 [2022-11-03 01:51:17,153 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:17,153 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 343 treesize of output 331 [2022-11-03 01:51:17,161 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 314 treesize of output 266 [2022-11-03 01:51:17,169 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 266 treesize of output 242 [2022-11-03 01:51:17,182 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 126 treesize of output 114 [2022-11-03 01:51:17,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:17,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299615116] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:51:17,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [755179726] [2022-11-03 01:51:17,529 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 01:51:17,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:51:17,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-03 01:51:17,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099620499] [2022-11-03 01:51:17,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:51:17,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 01:51:17,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:51:17,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 01:51:17,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=313, Unknown=10, NotChecked=0, Total=380 [2022-11-03 01:51:17,531 INFO L87 Difference]: Start difference. First operand 8123 states and 35225 transitions. Second operand has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 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 01:51:18,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:51:18,297 INFO L93 Difference]: Finished difference Result 10703 states and 42651 transitions. [2022-11-03 01:51:18,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:51:18,297 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 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 11 [2022-11-03 01:51:18,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:51:18,341 INFO L225 Difference]: With dead ends: 10703 [2022-11-03 01:51:18,341 INFO L226 Difference]: Without dead ends: 10703 [2022-11-03 01:51:18,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=100, Invalid=540, Unknown=10, NotChecked=0, Total=650 [2022-11-03 01:51:18,342 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 54 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 330 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:51:18,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 56 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 398 Invalid, 0 Unknown, 330 Unchecked, 0.3s Time] [2022-11-03 01:51:18,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10703 states. [2022-11-03 01:51:18,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10703 to 8119. [2022-11-03 01:51:18,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8119 states, 7699 states have (on average 4.572412001558644) internal successors, (35203), 8118 states have internal predecessors, (35203), 0 states have call successors, (0), 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 01:51:18,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8119 states to 8119 states and 35203 transitions. [2022-11-03 01:51:18,563 INFO L78 Accepts]: Start accepts. Automaton has 8119 states and 35203 transitions. Word has length 11 [2022-11-03 01:51:18,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:51:18,563 INFO L495 AbstractCegarLoop]: Abstraction has 8119 states and 35203 transitions. [2022-11-03 01:51:18,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 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 01:51:18,564 INFO L276 IsEmpty]: Start isEmpty. Operand 8119 states and 35203 transitions. [2022-11-03 01:51:18,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 01:51:18,565 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:51:18,565 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:51:18,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-03 01:51:18,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:51:18,778 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting thread3Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:51:18,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:51:18,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1279943424, now seen corresponding path program 1 times [2022-11-03 01:51:18,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:51:18,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456133659] [2022-11-03 01:51:18,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:18,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:51:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:19,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:51:19,086 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:51:19,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456133659] [2022-11-03 01:51:19,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456133659] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:51:19,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:51:19,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:51:19,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665244818] [2022-11-03 01:51:19,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:51:19,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:51:19,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:51:19,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:51:19,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:51:19,088 INFO L87 Difference]: Start difference. First operand 8119 states and 35203 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 01:51:19,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:51:19,247 INFO L93 Difference]: Finished difference Result 7389 states and 32196 transitions. [2022-11-03 01:51:19,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:51:19,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-03 01:51:19,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:51:19,290 INFO L225 Difference]: With dead ends: 7389 [2022-11-03 01:51:19,290 INFO L226 Difference]: Without dead ends: 7389 [2022-11-03 01:51:19,292 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 01:51:19,292 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:51:19,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 3 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:51:19,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7389 states. [2022-11-03 01:51:19,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7389 to 7389. [2022-11-03 01:51:19,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7389 states, 7029 states have (on average 4.580452411438327) internal successors, (32196), 7388 states have internal predecessors, (32196), 0 states have call successors, (0), 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 01:51:19,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7389 states to 7389 states and 32196 transitions. [2022-11-03 01:51:19,530 INFO L78 Accepts]: Start accepts. Automaton has 7389 states and 32196 transitions. Word has length 11 [2022-11-03 01:51:19,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:51:19,531 INFO L495 AbstractCegarLoop]: Abstraction has 7389 states and 32196 transitions. [2022-11-03 01:51:19,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 01:51:19,531 INFO L276 IsEmpty]: Start isEmpty. Operand 7389 states and 32196 transitions. [2022-11-03 01:51:19,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 01:51:19,533 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:51:19,533 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:51:19,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-03 01:51:19,534 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:51:19,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:51:19,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1279943422, now seen corresponding path program 1 times [2022-11-03 01:51:19,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:51:19,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720422424] [2022-11-03 01:51:19,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:19,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:51:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:19,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:19,703 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:51:19,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720422424] [2022-11-03 01:51:19,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720422424] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:51:19,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556414295] [2022-11-03 01:51:19,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:19,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:51:19,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:51:19,705 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:51:19,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-03 01:51:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:20,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 01:51:20,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:51:20,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:20,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:51:20,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:20,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556414295] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:51:20,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1924416285] [2022-11-03 01:51:20,220 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 01:51:20,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:51:20,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-11-03 01:51:20,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085812460] [2022-11-03 01:51:20,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:51:20,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 01:51:20,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:51:20,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 01:51:20,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:51:20,221 INFO L87 Difference]: Start difference. First operand 7389 states and 32196 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:51:20,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:51:20,699 INFO L93 Difference]: Finished difference Result 7374 states and 32006 transitions. [2022-11-03 01:51:20,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:51:20,700 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 01:51:20,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:51:20,730 INFO L225 Difference]: With dead ends: 7374 [2022-11-03 01:51:20,730 INFO L226 Difference]: Without dead ends: 7374 [2022-11-03 01:51:20,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2022-11-03 01:51:20,731 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 215 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:51:20,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 38 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 01:51:20,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7374 states. [2022-11-03 01:51:20,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7374 to 7329. [2022-11-03 01:51:20,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7329 states, 6969 states have (on average 4.583584445401062) internal successors, (31943), 7328 states have internal predecessors, (31943), 0 states have call successors, (0), 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 01:51:20,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7329 states to 7329 states and 31943 transitions. [2022-11-03 01:51:20,906 INFO L78 Accepts]: Start accepts. Automaton has 7329 states and 31943 transitions. Word has length 11 [2022-11-03 01:51:20,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:51:20,907 INFO L495 AbstractCegarLoop]: Abstraction has 7329 states and 31943 transitions. [2022-11-03 01:51:20,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:51:20,907 INFO L276 IsEmpty]: Start isEmpty. Operand 7329 states and 31943 transitions. [2022-11-03 01:51:20,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 01:51:20,908 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:51:20,909 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:51:20,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-11-03 01:51:21,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-11-03 01:51:21,134 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:51:21,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:51:21,135 INFO L85 PathProgramCache]: Analyzing trace with hash -912070615, now seen corresponding path program 2 times [2022-11-03 01:51:21,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:51:21,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146657746] [2022-11-03 01:51:21,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:21,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:51:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:21,522 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 01:51:21,522 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:51:21,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146657746] [2022-11-03 01:51:21,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146657746] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:51:21,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854367126] [2022-11-03 01:51:21,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:51:21,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:51:21,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:51:21,527 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:51:21,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-03 01:51:21,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 01:51:21,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:51:21,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-03 01:51:21,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:51:21,970 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 13 treesize of output 9 [2022-11-03 01:51:22,012 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 01:51:22,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-11-03 01:51:22,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:22,042 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 18 treesize of output 20 [2022-11-03 01:51:22,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:22,071 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 18 treesize of output 20 [2022-11-03 01:51:22,103 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 01:51:22,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:51:22,161 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1836 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1836) c_~A~0.base) (+ c_~A~0.offset 4))))) is different from false [2022-11-03 01:51:22,170 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-03 01:51:22,179 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1835 (Array Int Int)) (v_ArrVal_1833 Int) (v_ArrVal_1836 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1833)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-03 01:51:22,210 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-03 01:51:22,211 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 2 case distinctions, treesize of input 36 treesize of output 42 [2022-11-03 01:51:22,222 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:22,222 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 159 treesize of output 149 [2022-11-03 01:51:22,230 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 67 treesize of output 59 [2022-11-03 01:51:22,235 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 126 treesize of output 110 [2022-11-03 01:51:22,291 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-03 01:51:22,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854367126] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:51:22,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [49150108] [2022-11-03 01:51:22,292 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 01:51:22,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:51:22,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-11-03 01:51:22,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765701133] [2022-11-03 01:51:22,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:51:22,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 01:51:22,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:51:22,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 01:51:22,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=289, Unknown=3, NotChecked=108, Total=462 [2022-11-03 01:51:22,296 INFO L87 Difference]: Start difference. First operand 7329 states and 31943 transitions. Second operand has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 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 01:51:23,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:51:23,422 INFO L93 Difference]: Finished difference Result 11881 states and 49027 transitions. [2022-11-03 01:51:23,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 01:51:23,426 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 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 12 [2022-11-03 01:51:23,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:51:23,480 INFO L225 Difference]: With dead ends: 11881 [2022-11-03 01:51:23,480 INFO L226 Difference]: Without dead ends: 11881 [2022-11-03 01:51:23,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=466, Unknown=3, NotChecked=144, Total=756 [2022-11-03 01:51:23,481 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 421 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 578 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:51:23,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 76 Invalid, 1526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 898 Invalid, 0 Unknown, 578 Unchecked, 0.8s Time] [2022-11-03 01:51:23,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11881 states. [2022-11-03 01:51:23,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11881 to 7401. [2022-11-03 01:51:23,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7401 states, 7041 states have (on average 4.586138332623207) internal successors, (32291), 7400 states have internal predecessors, (32291), 0 states have call successors, (0), 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 01:51:23,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7401 states to 7401 states and 32291 transitions. [2022-11-03 01:51:23,698 INFO L78 Accepts]: Start accepts. Automaton has 7401 states and 32291 transitions. Word has length 12 [2022-11-03 01:51:23,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:51:23,698 INFO L495 AbstractCegarLoop]: Abstraction has 7401 states and 32291 transitions. [2022-11-03 01:51:23,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 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 01:51:23,699 INFO L276 IsEmpty]: Start isEmpty. Operand 7401 states and 32291 transitions. [2022-11-03 01:51:23,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 01:51:23,700 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:51:23,700 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:51:23,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-03 01:51:23,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-11-03 01:51:23,900 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:51:23,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:51:23,901 INFO L85 PathProgramCache]: Analyzing trace with hash -912070574, now seen corresponding path program 1 times [2022-11-03 01:51:23,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:51:23,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616462454] [2022-11-03 01:51:23,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:23,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:51:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:24,357 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 01:51:24,357 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:51:24,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616462454] [2022-11-03 01:51:24,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616462454] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:51:24,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209256079] [2022-11-03 01:51:24,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:24,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:51:24,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:51:24,363 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:51:24,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-03 01:51:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:24,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-03 01:51:24,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:51:24,784 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 13 treesize of output 9 [2022-11-03 01:51:24,817 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 01:51:24,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 01:51:24,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:24,851 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 16 treesize of output 18 [2022-11-03 01:51:24,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:24,878 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 16 treesize of output 18 [2022-11-03 01:51:24,908 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 01:51:24,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:51:24,973 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1890 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1890) c_~A~0.base) (+ c_~A~0.offset 4)) 4294967296)) is different from false [2022-11-03 01:51:24,982 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1890 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1889) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1890) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-03 01:51:24,988 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1890 (Array Int Int)) (v_ArrVal_1888 Int)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1888)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1889) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1890) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-03 01:51:25,023 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-03 01:51:25,024 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 2 case distinctions, treesize of input 34 treesize of output 40 [2022-11-03 01:51:25,034 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:25,034 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 71 treesize of output 67 [2022-11-03 01:51:25,039 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 54 treesize of output 46 [2022-11-03 01:51:25,043 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 24 treesize of output 20 [2022-11-03 01:51:25,095 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-03 01:51:25,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209256079] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:51:25,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1096155045] [2022-11-03 01:51:25,096 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 01:51:25,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:51:25,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-11-03 01:51:25,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348623291] [2022-11-03 01:51:25,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:51:25,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 01:51:25,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:51:25,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 01:51:25,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=289, Unknown=3, NotChecked=108, Total=462 [2022-11-03 01:51:25,099 INFO L87 Difference]: Start difference. First operand 7401 states and 32291 transitions. Second operand has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 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 01:51:26,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:51:26,410 INFO L93 Difference]: Finished difference Result 10758 states and 45071 transitions. [2022-11-03 01:51:26,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 01:51:26,411 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 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 12 [2022-11-03 01:51:26,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:51:26,456 INFO L225 Difference]: With dead ends: 10758 [2022-11-03 01:51:26,456 INFO L226 Difference]: Without dead ends: 10758 [2022-11-03 01:51:26,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=466, Unknown=3, NotChecked=144, Total=756 [2022-11-03 01:51:26,457 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 268 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 427 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:51:26,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 103 Invalid, 1869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1413 Invalid, 0 Unknown, 427 Unchecked, 1.0s Time] [2022-11-03 01:51:26,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10758 states. [2022-11-03 01:51:26,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10758 to 7401. [2022-11-03 01:51:26,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7401 states, 7041 states have (on average 4.582729725891209) internal successors, (32267), 7400 states have internal predecessors, (32267), 0 states have call successors, (0), 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 01:51:26,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7401 states to 7401 states and 32267 transitions. [2022-11-03 01:51:26,665 INFO L78 Accepts]: Start accepts. Automaton has 7401 states and 32267 transitions. Word has length 12 [2022-11-03 01:51:26,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:51:26,665 INFO L495 AbstractCegarLoop]: Abstraction has 7401 states and 32267 transitions. [2022-11-03 01:51:26,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 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 01:51:26,665 INFO L276 IsEmpty]: Start isEmpty. Operand 7401 states and 32267 transitions. [2022-11-03 01:51:26,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 01:51:26,666 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:51:26,667 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2022-11-03 01:51:26,693 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-11-03 01:51:26,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-11-03 01:51:26,867 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:51:26,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:51:26,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1825055376, now seen corresponding path program 3 times [2022-11-03 01:51:26,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:51:26,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131633015] [2022-11-03 01:51:26,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:26,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:51:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:27,193 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:27,194 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:51:27,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131633015] [2022-11-03 01:51:27,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131633015] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:51:27,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405000123] [2022-11-03 01:51:27,194 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:51:27,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:51:27,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:51:27,199 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:51:27,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-11-03 01:51:27,643 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:51:27,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:51:27,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-03 01:51:27,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:51:27,702 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 13 treesize of output 9 [2022-11-03 01:51:27,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:27,728 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 18 treesize of output 20 [2022-11-03 01:51:27,784 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:27,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:51:27,868 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1937 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1937) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-03 01:51:27,877 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:27,878 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 26 treesize of output 27 [2022-11-03 01:51:27,884 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:27,885 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 43 treesize of output 39 [2022-11-03 01:51:27,913 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 01:51:27,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405000123] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:51:27,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2006471879] [2022-11-03 01:51:27,914 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 01:51:27,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:51:27,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-11-03 01:51:27,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664849872] [2022-11-03 01:51:27,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:51:27,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-03 01:51:27,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:51:27,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-03 01:51:27,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=326, Unknown=1, NotChecked=36, Total=420 [2022-11-03 01:51:27,916 INFO L87 Difference]: Start difference. First operand 7401 states and 32267 transitions. Second operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 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 01:51:29,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:51:29,311 INFO L93 Difference]: Finished difference Result 9802 states and 40164 transitions. [2022-11-03 01:51:29,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 01:51:29,311 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 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 12 [2022-11-03 01:51:29,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:51:29,351 INFO L225 Difference]: With dead ends: 9802 [2022-11-03 01:51:29,351 INFO L226 Difference]: Without dead ends: 9802 [2022-11-03 01:51:29,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=779, Unknown=1, NotChecked=58, Total=992 [2022-11-03 01:51:29,352 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 254 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 1587 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:51:29,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 118 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1587 Invalid, 0 Unknown, 121 Unchecked, 1.1s Time] [2022-11-03 01:51:29,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9802 states. [2022-11-03 01:51:29,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9802 to 7403. [2022-11-03 01:51:29,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7403 states, 7043 states have (on average 4.582280278290501) internal successors, (32273), 7402 states have internal predecessors, (32273), 0 states have call successors, (0), 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 01:51:29,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7403 states to 7403 states and 32273 transitions. [2022-11-03 01:51:29,553 INFO L78 Accepts]: Start accepts. Automaton has 7403 states and 32273 transitions. Word has length 12 [2022-11-03 01:51:29,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:51:29,553 INFO L495 AbstractCegarLoop]: Abstraction has 7403 states and 32273 transitions. [2022-11-03 01:51:29,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 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 01:51:29,553 INFO L276 IsEmpty]: Start isEmpty. Operand 7403 states and 32273 transitions. [2022-11-03 01:51:29,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 01:51:29,555 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:51:29,555 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2022-11-03 01:51:29,584 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-11-03 01:51:29,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2022-11-03 01:51:29,766 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:51:29,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:51:29,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1825055357, now seen corresponding path program 2 times [2022-11-03 01:51:29,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:51:29,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875721018] [2022-11-03 01:51:29,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:29,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:51:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:30,080 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:30,081 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:51:30,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875721018] [2022-11-03 01:51:30,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875721018] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:51:30,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537919004] [2022-11-03 01:51:30,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:51:30,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:51:30,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:51:30,083 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:51:30,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-11-03 01:51:30,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 01:51:30,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:51:30,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-03 01:51:30,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:51:30,572 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 15 treesize of output 11 [2022-11-03 01:51:30,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:30,622 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 18 treesize of output 20 [2022-11-03 01:51:30,798 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:30,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:51:31,058 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:31,058 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 26 treesize of output 27 [2022-11-03 01:51:31,070 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:31,071 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 41 treesize of output 37 [2022-11-03 01:51:31,076 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 13 treesize of output 7 [2022-11-03 01:51:31,313 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:31,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537919004] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:51:31,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [798622638] [2022-11-03 01:51:31,314 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java: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 01:51:31,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:51:31,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-03 01:51:31,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659412217] [2022-11-03 01:51:31,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:51:31,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 01:51:31,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:51:31,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 01:51:31,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2022-11-03 01:51:31,315 INFO L87 Difference]: Start difference. First operand 7403 states and 32273 transitions. Second operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 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 01:51:32,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:51:32,107 INFO L93 Difference]: Finished difference Result 7840 states and 33681 transitions. [2022-11-03 01:51:32,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 01:51:32,107 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 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 12 [2022-11-03 01:51:32,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:51:32,140 INFO L225 Difference]: With dead ends: 7840 [2022-11-03 01:51:32,140 INFO L226 Difference]: Without dead ends: 7840 [2022-11-03 01:51:32,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2022-11-03 01:51:32,141 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 28 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 216 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:51:32,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 83 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 713 Invalid, 0 Unknown, 216 Unchecked, 0.5s Time] [2022-11-03 01:51:32,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7840 states. [2022-11-03 01:51:32,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7840 to 7410. [2022-11-03 01:51:32,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7410 states, 7050 states have (on average 4.580567375886525) internal successors, (32293), 7409 states have internal predecessors, (32293), 0 states have call successors, (0), 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 01:51:32,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7410 states to 7410 states and 32293 transitions. [2022-11-03 01:51:32,323 INFO L78 Accepts]: Start accepts. Automaton has 7410 states and 32293 transitions. Word has length 12 [2022-11-03 01:51:32,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:51:32,324 INFO L495 AbstractCegarLoop]: Abstraction has 7410 states and 32293 transitions. [2022-11-03 01:51:32,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 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 01:51:32,324 INFO L276 IsEmpty]: Start isEmpty. Operand 7410 states and 32293 transitions. [2022-11-03 01:51:32,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 01:51:32,325 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:51:32,325 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:51:32,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-11-03 01:51:32,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-11-03 01:51:32,525 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:51:32,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:51:32,526 INFO L85 PathProgramCache]: Analyzing trace with hash -182473098, now seen corresponding path program 1 times [2022-11-03 01:51:32,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:51:32,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462686908] [2022-11-03 01:51:32,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:32,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:51:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:32,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:32,914 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:51:32,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462686908] [2022-11-03 01:51:32,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462686908] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:51:32,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686672876] [2022-11-03 01:51:32,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:32,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:51:32,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:51:32,916 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:51:32,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-11-03 01:51:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:33,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-03 01:51:33,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:51:33,463 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 13 treesize of output 9 [2022-11-03 01:51:33,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:33,507 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 18 treesize of output 20 [2022-11-03 01:51:33,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:33,548 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 18 treesize of output 20 [2022-11-03 01:51:33,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:33,622 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 18 treesize of output 20 [2022-11-03 01:51:33,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:33,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:51:33,704 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2037 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2037) c_~A~0.base) (+ c_~A~0.offset 4 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 9223372039002259456))) is different from false [2022-11-03 01:51:33,713 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2037 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2037) c_~A~0.base) (+ c_~A~0.offset 4)) 9223372039002259456))) is different from false [2022-11-03 01:51:33,719 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2037 (Array Int Int)) (v_ArrVal_2036 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2036) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2037) c_~A~0.base) (+ c_~A~0.offset 4)) 9223372039002259456))) is different from false [2022-11-03 01:51:33,730 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2037 (Array Int Int)) (v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2035 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2035) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2036) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2037) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-03 01:51:33,742 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:33,743 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 32 treesize of output 33 [2022-11-03 01:51:33,754 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:33,754 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 311 treesize of output 301 [2022-11-03 01:51:33,760 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 286 treesize of output 254 [2022-11-03 01:51:33,767 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 254 treesize of output 238 [2022-11-03 01:51:33,773 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 238 treesize of output 230 [2022-11-03 01:51:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 01:51:33,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686672876] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:51:33,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1772498391] [2022-11-03 01:51:33,980 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 01:51:33,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:51:33,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-11-03 01:51:33,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255277439] [2022-11-03 01:51:33,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:51:33,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 01:51:33,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:51:33,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 01:51:33,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=291, Unknown=4, NotChecked=148, Total=506 [2022-11-03 01:51:33,982 INFO L87 Difference]: Start difference. First operand 7410 states and 32293 transitions. Second operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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 01:51:35,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:51:35,625 INFO L93 Difference]: Finished difference Result 11337 states and 47431 transitions. [2022-11-03 01:51:35,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 01:51:35,625 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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 12 [2022-11-03 01:51:35,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:51:35,674 INFO L225 Difference]: With dead ends: 11337 [2022-11-03 01:51:35,674 INFO L226 Difference]: Without dead ends: 11335 [2022-11-03 01:51:35,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=521, Unknown=4, NotChecked=204, Total=870 [2022-11-03 01:51:35,674 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 365 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 1576 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 2331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 719 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:51:35,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 127 Invalid, 2331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1576 Invalid, 0 Unknown, 719 Unchecked, 1.3s Time] [2022-11-03 01:51:35,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11335 states. [2022-11-03 01:51:35,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11335 to 8403. [2022-11-03 01:51:35,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8403 states, 8043 states have (on average 4.6646773591943305) internal successors, (37518), 8402 states have internal predecessors, (37518), 0 states have call successors, (0), 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 01:51:35,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8403 states to 8403 states and 37518 transitions. [2022-11-03 01:51:35,905 INFO L78 Accepts]: Start accepts. Automaton has 8403 states and 37518 transitions. Word has length 12 [2022-11-03 01:51:35,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:51:35,905 INFO L495 AbstractCegarLoop]: Abstraction has 8403 states and 37518 transitions. [2022-11-03 01:51:35,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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 01:51:35,905 INFO L276 IsEmpty]: Start isEmpty. Operand 8403 states and 37518 transitions. [2022-11-03 01:51:35,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 01:51:35,906 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:51:35,906 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:51:35,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-11-03 01:51:36,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:51:36,107 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:51:36,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:51:36,107 INFO L85 PathProgramCache]: Analyzing trace with hash -182473079, now seen corresponding path program 1 times [2022-11-03 01:51:36,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:51:36,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939657237] [2022-11-03 01:51:36,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:36,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:51:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:36,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:36,499 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:51:36,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939657237] [2022-11-03 01:51:36,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939657237] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:51:36,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004751326] [2022-11-03 01:51:36,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:36,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:51:36,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:51:36,503 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:51:36,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-11-03 01:51:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:36,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-03 01:51:36,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:51:36,950 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 13 treesize of output 9 [2022-11-03 01:51:36,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:36,989 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 16 treesize of output 18 [2022-11-03 01:51:37,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:37,035 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 16 treesize of output 18 [2022-11-03 01:51:37,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:37,107 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 16 treesize of output 18 [2022-11-03 01:51:37,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:37,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:51:37,189 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2090 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2090) c_~A~0.base) (+ c_~A~0.offset 4 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 4294967296)) is different from false [2022-11-03 01:51:37,198 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2090 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2090) c_~A~0.base) (+ c_~A~0.offset 4)) 4294967296)) is different from false [2022-11-03 01:51:37,204 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2089 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2089) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2090) c_~A~0.base) (+ c_~A~0.offset 4)) 4294967296)) is different from false [2022-11-03 01:51:37,215 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2090 (Array Int Int)) (v_ArrVal_2089 (Array Int Int)) (v_ArrVal_2088 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2088) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2089) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2090) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-03 01:51:37,226 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:37,226 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 30 treesize of output 31 [2022-11-03 01:51:37,238 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:37,238 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 277 treesize of output 267 [2022-11-03 01:51:37,248 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 127 treesize of output 111 [2022-11-03 01:51:37,254 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 238 treesize of output 206 [2022-11-03 01:51:37,260 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 206 treesize of output 198 [2022-11-03 01:51:37,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 01:51:37,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004751326] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:51:37,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1599002682] [2022-11-03 01:51:37,486 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 01:51:37,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:51:37,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-11-03 01:51:37,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669043628] [2022-11-03 01:51:37,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:51:37,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 01:51:37,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:51:37,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 01:51:37,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=291, Unknown=4, NotChecked=148, Total=506 [2022-11-03 01:51:37,489 INFO L87 Difference]: Start difference. First operand 8403 states and 37518 transitions. Second operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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 01:51:39,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:51:39,069 INFO L93 Difference]: Finished difference Result 10841 states and 45265 transitions. [2022-11-03 01:51:39,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 01:51:39,069 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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 12 [2022-11-03 01:51:39,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:51:39,113 INFO L225 Difference]: With dead ends: 10841 [2022-11-03 01:51:39,114 INFO L226 Difference]: Without dead ends: 10833 [2022-11-03 01:51:39,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=521, Unknown=4, NotChecked=204, Total=870 [2022-11-03 01:51:39,114 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 465 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 2187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 565 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:51:39,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 127 Invalid, 2187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1578 Invalid, 0 Unknown, 565 Unchecked, 1.2s Time] [2022-11-03 01:51:39,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10833 states. [2022-11-03 01:51:39,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10833 to 8292. [2022-11-03 01:51:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8292 states, 7932 states have (on average 4.615229450327786) internal successors, (36608), 8291 states have internal predecessors, (36608), 0 states have call successors, (0), 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 01:51:39,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8292 states to 8292 states and 36608 transitions. [2022-11-03 01:51:39,338 INFO L78 Accepts]: Start accepts. Automaton has 8292 states and 36608 transitions. Word has length 12 [2022-11-03 01:51:39,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:51:39,338 INFO L495 AbstractCegarLoop]: Abstraction has 8292 states and 36608 transitions. [2022-11-03 01:51:39,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 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 01:51:39,338 INFO L276 IsEmpty]: Start isEmpty. Operand 8292 states and 36608 transitions. [2022-11-03 01:51:39,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 01:51:39,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:51:39,339 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:51:39,369 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-11-03 01:51:39,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:51:39,542 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:51:39,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:51:39,543 INFO L85 PathProgramCache]: Analyzing trace with hash 975102239, now seen corresponding path program 3 times [2022-11-03 01:51:39,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:51:39,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742644170] [2022-11-03 01:51:39,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:39,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:51:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:40,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:40,204 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:51:40,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742644170] [2022-11-03 01:51:40,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742644170] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:51:40,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026300591] [2022-11-03 01:51:40,204 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:51:40,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:51:40,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:51:40,206 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:51:40,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-11-03 01:51:40,676 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:51:40,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:51:40,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-03 01:51:40,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:51:40,729 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 11 treesize of output 7 [2022-11-03 01:51:40,797 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 01:51:40,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 28 [2022-11-03 01:51:40,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:40,934 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 25 treesize of output 25 [2022-11-03 01:51:41,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:41,032 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 25 treesize of output 25 [2022-11-03 01:51:41,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:41,110 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 25 treesize of output 25 [2022-11-03 01:51:41,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:41,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:51:41,327 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2145 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2145) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 4294967296)) is different from false [2022-11-03 01:51:41,336 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2145 (Array Int Int)) (v_ArrVal_2144 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2144) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2145) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 4294967296)) is different from false [2022-11-03 01:51:41,530 INFO L356 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-03 01:51:41,531 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 2 case distinctions, treesize of input 39 treesize of output 54 [2022-11-03 01:51:41,566 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:41,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 330 treesize of output 334 [2022-11-03 01:51:41,582 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 146 treesize of output 134 [2022-11-03 01:51:41,596 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 270 treesize of output 246 [2022-11-03 01:51:41,607 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 246 treesize of output 198 [2022-11-03 01:51:42,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:42,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026300591] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:51:42,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [235527055] [2022-11-03 01:51:42,121 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 01:51:42,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:51:42,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-03 01:51:42,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728453556] [2022-11-03 01:51:42,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:51:42,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 01:51:42,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:51:42,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 01:51:42,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=350, Unknown=3, NotChecked=78, Total=506 [2022-11-03 01:51:42,124 INFO L87 Difference]: Start difference. First operand 8292 states and 36608 transitions. Second operand has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 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 01:51:43,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:51:43,172 INFO L93 Difference]: Finished difference Result 10660 states and 44109 transitions. [2022-11-03 01:51:43,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-03 01:51:43,173 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 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 12 [2022-11-03 01:51:43,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:51:43,218 INFO L225 Difference]: With dead ends: 10660 [2022-11-03 01:51:43,218 INFO L226 Difference]: Without dead ends: 10660 [2022-11-03 01:51:43,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=138, Invalid=679, Unknown=3, NotChecked=110, Total=930 [2022-11-03 01:51:43,219 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 43 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 359 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:51:43,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 94 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 383 Invalid, 0 Unknown, 359 Unchecked, 0.3s Time] [2022-11-03 01:51:43,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10660 states. [2022-11-03 01:51:43,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10660 to 8304. [2022-11-03 01:51:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8304 states, 7944 states have (on average 4.617824773413897) internal successors, (36684), 8303 states have internal predecessors, (36684), 0 states have call successors, (0), 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 01:51:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8304 states to 8304 states and 36684 transitions. [2022-11-03 01:51:43,522 INFO L78 Accepts]: Start accepts. Automaton has 8304 states and 36684 transitions. Word has length 12 [2022-11-03 01:51:43,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:51:43,522 INFO L495 AbstractCegarLoop]: Abstraction has 8304 states and 36684 transitions. [2022-11-03 01:51:43,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 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 01:51:43,522 INFO L276 IsEmpty]: Start isEmpty. Operand 8304 states and 36684 transitions. [2022-11-03 01:51:43,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 01:51:43,524 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:51:43,524 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:51:43,562 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-11-03 01:51:43,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-11-03 01:51:43,734 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:51:43,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:51:43,736 INFO L85 PathProgramCache]: Analyzing trace with hash 975102246, now seen corresponding path program 3 times [2022-11-03 01:51:43,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:51:43,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447816223] [2022-11-03 01:51:43,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:43,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:51:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:44,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:44,342 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:51:44,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447816223] [2022-11-03 01:51:44,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447816223] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:51:44,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408998910] [2022-11-03 01:51:44,342 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:51:44,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:51:44,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:51:44,345 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:51:44,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-11-03 01:51:44,712 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:51:44,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:51:44,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-03 01:51:44,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:51:44,758 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 11 treesize of output 7 [2022-11-03 01:51:44,815 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 01:51:44,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-11-03 01:51:44,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:44,939 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 29 treesize of output 29 [2022-11-03 01:51:45,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:45,017 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 29 treesize of output 29 [2022-11-03 01:51:45,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:45,087 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 29 treesize of output 29 [2022-11-03 01:51:45,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:45,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:51:45,276 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2200 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2200) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 9223372039002259456))) is different from false [2022-11-03 01:51:45,286 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2199 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2199) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2200) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 9223372039002259456))) is different from false [2022-11-03 01:51:45,467 INFO L356 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-03 01:51:45,467 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 2 case distinctions, treesize of input 41 treesize of output 56 [2022-11-03 01:51:45,492 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:45,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 704 treesize of output 692 [2022-11-03 01:51:45,508 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 638 treesize of output 542 [2022-11-03 01:51:45,523 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 542 treesize of output 494 [2022-11-03 01:51:45,541 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 259 treesize of output 235 [2022-11-03 01:51:45,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:45,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408998910] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:51:45,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [333637819] [2022-11-03 01:51:46,000 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 01:51:46,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:51:46,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-03 01:51:46,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849395110] [2022-11-03 01:51:46,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:51:46,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 01:51:46,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:51:46,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 01:51:46,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=350, Unknown=3, NotChecked=78, Total=506 [2022-11-03 01:51:46,002 INFO L87 Difference]: Start difference. First operand 8304 states and 36684 transitions. Second operand has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 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 01:51:46,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:51:46,782 INFO L93 Difference]: Finished difference Result 8308 states and 36694 transitions. [2022-11-03 01:51:46,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-03 01:51:46,783 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 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 12 [2022-11-03 01:51:46,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:51:46,818 INFO L225 Difference]: With dead ends: 8308 [2022-11-03 01:51:46,818 INFO L226 Difference]: Without dead ends: 8308 [2022-11-03 01:51:46,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=135, Invalid=682, Unknown=3, NotChecked=110, Total=930 [2022-11-03 01:51:46,819 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 251 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:51:46,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 94 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 251 Unchecked, 0.2s Time] [2022-11-03 01:51:46,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8308 states. [2022-11-03 01:51:46,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8308 to 8304. [2022-11-03 01:51:46,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8304 states, 7944 states have (on average 4.616817724068479) internal successors, (36676), 8303 states have internal predecessors, (36676), 0 states have call successors, (0), 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 01:51:47,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8304 states to 8304 states and 36676 transitions. [2022-11-03 01:51:47,018 INFO L78 Accepts]: Start accepts. Automaton has 8304 states and 36676 transitions. Word has length 12 [2022-11-03 01:51:47,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:51:47,018 INFO L495 AbstractCegarLoop]: Abstraction has 8304 states and 36676 transitions. [2022-11-03 01:51:47,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 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 01:51:47,018 INFO L276 IsEmpty]: Start isEmpty. Operand 8304 states and 36676 transitions. [2022-11-03 01:51:47,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 01:51:47,019 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:51:47,020 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:51:47,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-11-03 01:51:47,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-11-03 01:51:47,220 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:51:47,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:51:47,220 INFO L85 PathProgramCache]: Analyzing trace with hash 974888339, now seen corresponding path program 4 times [2022-11-03 01:51:47,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:51:47,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958658111] [2022-11-03 01:51:47,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:47,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:51:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:47,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:47,879 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:51:47,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958658111] [2022-11-03 01:51:47,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958658111] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:51:47,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571365290] [2022-11-03 01:51:47,879 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:51:47,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:51:47,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:51:47,880 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:51:47,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-11-03 01:51:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:48,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-03 01:51:48,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:51:48,401 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 11 treesize of output 7 [2022-11-03 01:51:48,473 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 01:51:48,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 28 [2022-11-03 01:51:48,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:48,588 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 25 treesize of output 25 [2022-11-03 01:51:48,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:48,667 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 25 treesize of output 25 [2022-11-03 01:51:48,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:48,741 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 25 treesize of output 25 [2022-11-03 01:51:48,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:48,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:51:48,915 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2255 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2255) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 4294967296)) is different from false [2022-11-03 01:51:48,924 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2255 (Array Int Int)) (v_ArrVal_2254 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2254) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2255) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 4294967296)) is different from false [2022-11-03 01:51:49,106 INFO L356 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-03 01:51:49,106 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 2 case distinctions, treesize of input 39 treesize of output 54 [2022-11-03 01:51:49,131 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:49,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 330 treesize of output 334 [2022-11-03 01:51:49,143 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 282 treesize of output 234 [2022-11-03 01:51:49,155 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 234 treesize of output 210 [2022-11-03 01:51:49,169 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 110 treesize of output 98 [2022-11-03 01:51:50,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:50,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571365290] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:51:50,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [722136689] [2022-11-03 01:51:50,085 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 01:51:50,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:51:50,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-03 01:51:50,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924086835] [2022-11-03 01:51:50,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:51:50,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 01:51:50,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:51:50,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 01:51:50,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=351, Unknown=3, NotChecked=78, Total=506 [2022-11-03 01:51:50,087 INFO L87 Difference]: Start difference. First operand 8304 states and 36676 transitions. Second operand has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 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 01:51:52,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:51:52,695 INFO L93 Difference]: Finished difference Result 13930 states and 59419 transitions. [2022-11-03 01:51:52,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-03 01:51:52,696 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 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 12 [2022-11-03 01:51:52,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:51:52,752 INFO L225 Difference]: With dead ends: 13930 [2022-11-03 01:51:52,752 INFO L226 Difference]: Without dead ends: 13930 [2022-11-03 01:51:52,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=300, Invalid=1111, Unknown=3, NotChecked=146, Total=1560 [2022-11-03 01:51:52,753 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 493 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 843 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:51:52,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 77 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 636 Invalid, 0 Unknown, 843 Unchecked, 0.8s Time] [2022-11-03 01:51:52,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2022-11-03 01:51:52,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 9795. [2022-11-03 01:51:52,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9795 states, 9435 states have (on average 4.643137254901961) internal successors, (43808), 9794 states have internal predecessors, (43808), 0 states have call successors, (0), 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 01:51:53,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9795 states to 9795 states and 43808 transitions. [2022-11-03 01:51:53,030 INFO L78 Accepts]: Start accepts. Automaton has 9795 states and 43808 transitions. Word has length 12 [2022-11-03 01:51:53,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:51:53,030 INFO L495 AbstractCegarLoop]: Abstraction has 9795 states and 43808 transitions. [2022-11-03 01:51:53,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 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 01:51:53,030 INFO L276 IsEmpty]: Start isEmpty. Operand 9795 states and 43808 transitions. [2022-11-03 01:51:53,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 01:51:53,031 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:51:53,032 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:51:53,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-11-03 01:51:53,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-11-03 01:51:53,232 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:51:53,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:51:53,235 INFO L85 PathProgramCache]: Analyzing trace with hash 974888346, now seen corresponding path program 4 times [2022-11-03 01:51:53,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:51:53,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267232673] [2022-11-03 01:51:53,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:53,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:51:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:53,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:53,807 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:51:53,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267232673] [2022-11-03 01:51:53,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267232673] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:51:53,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541231620] [2022-11-03 01:51:53,808 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:51:53,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:51:53,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:51:53,811 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:51:53,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-11-03 01:51:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:54,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-03 01:51:54,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:51:54,356 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 11 treesize of output 7 [2022-11-03 01:51:54,421 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 01:51:54,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-11-03 01:51:54,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:54,536 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 29 treesize of output 29 [2022-11-03 01:51:54,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:54,626 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 29 treesize of output 29 [2022-11-03 01:51:54,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:54,699 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 29 treesize of output 29 [2022-11-03 01:51:54,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:54,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:51:54,884 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2310 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2310) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 9223372039002259456))) is different from false [2022-11-03 01:51:54,900 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2310 (Array Int Int)) (v_ArrVal_2309 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2309) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2310) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 9223372039002259456))) is different from false [2022-11-03 01:51:55,086 INFO L356 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-03 01:51:55,086 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 2 case distinctions, treesize of input 41 treesize of output 56 [2022-11-03 01:51:55,111 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:55,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 704 treesize of output 692 [2022-11-03 01:51:55,127 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 638 treesize of output 590 [2022-11-03 01:51:55,142 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 590 treesize of output 494 [2022-11-03 01:51:55,158 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 494 treesize of output 470 [2022-11-03 01:51:55,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:55,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541231620] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:51:55,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2065229773] [2022-11-03 01:51:55,629 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 01:51:55,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:51:55,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-03 01:51:55,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690638486] [2022-11-03 01:51:55,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:51:55,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 01:51:55,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:51:55,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 01:51:55,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=350, Unknown=3, NotChecked=78, Total=506 [2022-11-03 01:51:55,632 INFO L87 Difference]: Start difference. First operand 9795 states and 43808 transitions. Second operand has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 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 01:51:56,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:51:56,630 INFO L93 Difference]: Finished difference Result 12869 states and 53416 transitions. [2022-11-03 01:51:56,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-03 01:51:56,631 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 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 12 [2022-11-03 01:51:56,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:51:56,686 INFO L225 Difference]: With dead ends: 12869 [2022-11-03 01:51:56,686 INFO L226 Difference]: Without dead ends: 12869 [2022-11-03 01:51:56,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=136, Invalid=681, Unknown=3, NotChecked=110, Total=930 [2022-11-03 01:51:56,686 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 49 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 235 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:51:56,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 90 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 360 Invalid, 0 Unknown, 235 Unchecked, 0.3s Time] [2022-11-03 01:51:56,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12869 states. [2022-11-03 01:51:56,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12869 to 9787. [2022-11-03 01:51:56,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9787 states, 9427 states have (on average 4.641137159223507) internal successors, (43752), 9786 states have internal predecessors, (43752), 0 states have call successors, (0), 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 01:51:56,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9787 states to 9787 states and 43752 transitions. [2022-11-03 01:51:56,962 INFO L78 Accepts]: Start accepts. Automaton has 9787 states and 43752 transitions. Word has length 12 [2022-11-03 01:51:56,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:51:56,962 INFO L495 AbstractCegarLoop]: Abstraction has 9787 states and 43752 transitions. [2022-11-03 01:51:56,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 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 01:51:56,962 INFO L276 IsEmpty]: Start isEmpty. Operand 9787 states and 43752 transitions. [2022-11-03 01:51:56,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 01:51:56,964 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:51:56,964 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:51:56,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-11-03 01:51:57,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:51:57,178 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:51:57,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:51:57,179 INFO L85 PathProgramCache]: Analyzing trace with hash 974890509, now seen corresponding path program 2 times [2022-11-03 01:51:57,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:51:57,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399360775] [2022-11-03 01:51:57,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:51:57,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:51:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:51:57,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:57,845 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:51:57,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399360775] [2022-11-03 01:51:57,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399360775] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:51:57,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25480935] [2022-11-03 01:51:57,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:51:57,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:51:57,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:51:57,847 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:51:57,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-11-03 01:51:58,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:51:58,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:51:58,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 01:51:58,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:51:58,434 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 15 treesize of output 11 [2022-11-03 01:51:58,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:58,508 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 18 treesize of output 20 [2022-11-03 01:51:58,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:58,572 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 18 treesize of output 20 [2022-11-03 01:51:58,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:51:58,639 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 18 treesize of output 20 [2022-11-03 01:51:58,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:58,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:51:59,060 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:59,061 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 32 treesize of output 33 [2022-11-03 01:51:59,073 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:51:59,073 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 617 treesize of output 589 [2022-11-03 01:51:59,084 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 574 treesize of output 550 [2022-11-03 01:51:59,095 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 550 treesize of output 454 [2022-11-03 01:51:59,105 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 454 treesize of output 406 [2022-11-03 01:51:59,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:51:59,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25480935] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:51:59,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [156211158] [2022-11-03 01:51:59,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 01:51:59,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:51:59,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-03 01:51:59,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881361305] [2022-11-03 01:51:59,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:51:59,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 01:51:59,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:51:59,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 01:51:59,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=536, Unknown=9, NotChecked=0, Total=650 [2022-11-03 01:51:59,840 INFO L87 Difference]: Start difference. First operand 9787 states and 43752 transitions. Second operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 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 01:52:00,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:00,099 INFO L93 Difference]: Finished difference Result 9783 states and 43728 transitions. [2022-11-03 01:52:00,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 01:52:00,100 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 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 12 [2022-11-03 01:52:00,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:00,143 INFO L225 Difference]: With dead ends: 9783 [2022-11-03 01:52:00,143 INFO L226 Difference]: Without dead ends: 9783 [2022-11-03 01:52:00,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=123, Invalid=624, Unknown=9, NotChecked=0, Total=756 [2022-11-03 01:52:00,144 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 15 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:00,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 81 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 154 Unchecked, 0.1s Time] [2022-11-03 01:52:00,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9783 states. [2022-11-03 01:52:00,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9783 to 9783. [2022-11-03 01:52:00,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9783 states, 9423 states have (on average 4.640560331104743) internal successors, (43728), 9782 states have internal predecessors, (43728), 0 states have call successors, (0), 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 01:52:00,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9783 states to 9783 states and 43728 transitions. [2022-11-03 01:52:00,381 INFO L78 Accepts]: Start accepts. Automaton has 9783 states and 43728 transitions. Word has length 12 [2022-11-03 01:52:00,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:00,381 INFO L495 AbstractCegarLoop]: Abstraction has 9783 states and 43728 transitions. [2022-11-03 01:52:00,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 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 01:52:00,381 INFO L276 IsEmpty]: Start isEmpty. Operand 9783 states and 43728 transitions. [2022-11-03 01:52:00,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 01:52:00,383 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:00,383 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:52:00,417 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-11-03 01:52:00,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-11-03 01:52:00,602 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting thread3Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:52:00,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:00,603 INFO L85 PathProgramCache]: Analyzing trace with hash 974890513, now seen corresponding path program 1 times [2022-11-03 01:52:00,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:00,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734133972] [2022-11-03 01:52:00,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:00,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:01,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:52:01,233 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:01,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734133972] [2022-11-03 01:52:01,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734133972] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:52:01,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708389538] [2022-11-03 01:52:01,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:01,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:01,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:52:01,239 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:52:01,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-11-03 01:52:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:01,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 01:52:01,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:52:02,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:52:02,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:52:02,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708389538] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:52:02,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:52:02,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2022-11-03 01:52:02,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174712280] [2022-11-03 01:52:02,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:52:02,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:52:02,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:02,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:52:02,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:52:02,708 INFO L87 Difference]: Start difference. First operand 9783 states and 43728 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 01:52:02,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:02,883 INFO L93 Difference]: Finished difference Result 10572 states and 45401 transitions. [2022-11-03 01:52:02,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:52:02,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 12 [2022-11-03 01:52:02,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:02,946 INFO L225 Difference]: With dead ends: 10572 [2022-11-03 01:52:02,947 INFO L226 Difference]: Without dead ends: 10572 [2022-11-03 01:52:02,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:52:02,947 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 34 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:02,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 8 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 76 Unchecked, 0.1s Time] [2022-11-03 01:52:02,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10572 states. [2022-11-03 01:52:03,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10572 to 8981. [2022-11-03 01:52:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8981 states, 8681 states have (on average 4.649925123833659) internal successors, (40366), 8980 states have internal predecessors, (40366), 0 states have call successors, (0), 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 01:52:03,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8981 states to 8981 states and 40366 transitions. [2022-11-03 01:52:03,189 INFO L78 Accepts]: Start accepts. Automaton has 8981 states and 40366 transitions. Word has length 12 [2022-11-03 01:52:03,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:03,189 INFO L495 AbstractCegarLoop]: Abstraction has 8981 states and 40366 transitions. [2022-11-03 01:52:03,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 01:52:03,189 INFO L276 IsEmpty]: Start isEmpty. Operand 8981 states and 40366 transitions. [2022-11-03 01:52:03,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 01:52:03,190 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:03,190 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:52:03,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-11-03 01:52:03,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-11-03 01:52:03,391 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:52:03,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:03,391 INFO L85 PathProgramCache]: Analyzing trace with hash 974890516, now seen corresponding path program 1 times [2022-11-03 01:52:03,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:03,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3012862] [2022-11-03 01:52:03,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:03,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:03,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:52:03,946 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:03,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3012862] [2022-11-03 01:52:03,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3012862] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:52:03,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836850041] [2022-11-03 01:52:03,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:03,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:03,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:52:03,951 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:52:03,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-11-03 01:52:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:04,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 01:52:04,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:52:04,460 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 15 treesize of output 11 [2022-11-03 01:52:04,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:52:04,541 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 20 treesize of output 22 [2022-11-03 01:52:04,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:52:04,634 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 20 treesize of output 22 [2022-11-03 01:52:04,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:52:04,714 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 20 treesize of output 22 [2022-11-03 01:52:04,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:52:04,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:52:05,297 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:52:05,297 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 34 treesize of output 35 [2022-11-03 01:52:05,312 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:52:05,313 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 343 treesize of output 331 [2022-11-03 01:52:05,322 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 314 treesize of output 266 [2022-11-03 01:52:05,332 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 266 treesize of output 242 [2022-11-03 01:52:05,340 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 242 treesize of output 230 [2022-11-03 01:52:05,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:52:05,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836850041] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:52:05,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [489235961] [2022-11-03 01:52:05,737 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 01:52:05,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:52:05,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-03 01:52:05,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856357041] [2022-11-03 01:52:05,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:52:05,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 01:52:05,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:05,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 01:52:05,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=557, Unknown=4, NotChecked=0, Total=650 [2022-11-03 01:52:05,739 INFO L87 Difference]: Start difference. First operand 8981 states and 40366 transitions. Second operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 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 01:52:06,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:06,693 INFO L93 Difference]: Finished difference Result 9049 states and 40760 transitions. [2022-11-03 01:52:06,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 01:52:06,693 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 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 12 [2022-11-03 01:52:06,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:06,734 INFO L225 Difference]: With dead ends: 9049 [2022-11-03 01:52:06,734 INFO L226 Difference]: Without dead ends: 9049 [2022-11-03 01:52:06,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=158, Invalid=1028, Unknown=4, NotChecked=0, Total=1190 [2022-11-03 01:52:06,735 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 81 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 345 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:06,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 148 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 345 Unchecked, 0.2s Time] [2022-11-03 01:52:06,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9049 states. [2022-11-03 01:52:06,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9049 to 9021. [2022-11-03 01:52:06,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9021 states, 8721 states have (on average 4.656346749226006) internal successors, (40608), 9020 states have internal predecessors, (40608), 0 states have call successors, (0), 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 01:52:07,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9021 states to 9021 states and 40608 transitions. [2022-11-03 01:52:07,003 INFO L78 Accepts]: Start accepts. Automaton has 9021 states and 40608 transitions. Word has length 12 [2022-11-03 01:52:07,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:07,004 INFO L495 AbstractCegarLoop]: Abstraction has 9021 states and 40608 transitions. [2022-11-03 01:52:07,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 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 01:52:07,004 INFO L276 IsEmpty]: Start isEmpty. Operand 9021 states and 40608 transitions. [2022-11-03 01:52:07,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 01:52:07,006 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:07,006 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:52:07,033 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-11-03 01:52:07,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:07,207 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:52:07,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:07,207 INFO L85 PathProgramCache]: Analyzing trace with hash 974890517, now seen corresponding path program 1 times [2022-11-03 01:52:07,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:07,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132168061] [2022-11-03 01:52:07,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:07,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:07,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:52:07,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:07,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132168061] [2022-11-03 01:52:07,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132168061] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:52:07,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975118003] [2022-11-03 01:52:07,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:07,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:07,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:52:07,573 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:52:07,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-11-03 01:52:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:08,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:52:08,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:52:09,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:52:09,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:52:09,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975118003] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:52:09,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:52:09,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2022-11-03 01:52:09,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176711027] [2022-11-03 01:52:09,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:52:09,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:52:09,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:09,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:52:09,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:52:09,052 INFO L87 Difference]: Start difference. First operand 9021 states and 40608 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 01:52:09,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:09,284 INFO L93 Difference]: Finished difference Result 10604 states and 44789 transitions. [2022-11-03 01:52:09,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:52:09,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 12 [2022-11-03 01:52:09,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:09,348 INFO L225 Difference]: With dead ends: 10604 [2022-11-03 01:52:09,348 INFO L226 Difference]: Without dead ends: 10604 [2022-11-03 01:52:09,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:52:09,349 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 70 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:09,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 10 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 103 Unchecked, 0.1s Time] [2022-11-03 01:52:09,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10604 states. [2022-11-03 01:52:09,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10604 to 8219. [2022-11-03 01:52:09,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8219 states, 7979 states have (on average 4.665998245394159) internal successors, (37230), 8218 states have internal predecessors, (37230), 0 states have call successors, (0), 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 01:52:09,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8219 states to 8219 states and 37230 transitions. [2022-11-03 01:52:09,698 INFO L78 Accepts]: Start accepts. Automaton has 8219 states and 37230 transitions. Word has length 12 [2022-11-03 01:52:09,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:09,698 INFO L495 AbstractCegarLoop]: Abstraction has 8219 states and 37230 transitions. [2022-11-03 01:52:09,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 01:52:09,699 INFO L276 IsEmpty]: Start isEmpty. Operand 8219 states and 37230 transitions. [2022-11-03 01:52:09,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 01:52:09,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:09,701 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:52:09,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-11-03 01:52:09,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2022-11-03 01:52:09,914 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:52:09,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:09,914 INFO L85 PathProgramCache]: Analyzing trace with hash 974890518, now seen corresponding path program 1 times [2022-11-03 01:52:09,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:09,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406631085] [2022-11-03 01:52:09,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:09,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:10,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:52:10,067 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:10,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406631085] [2022-11-03 01:52:10,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406631085] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:52:10,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:52:10,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:52:10,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312598993] [2022-11-03 01:52:10,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:52:10,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:52:10,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:10,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:52:10,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:52:10,069 INFO L87 Difference]: Start difference. First operand 8219 states and 37230 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 01:52:10,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:10,230 INFO L93 Difference]: Finished difference Result 7417 states and 33852 transitions. [2022-11-03 01:52:10,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:52:10,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 12 [2022-11-03 01:52:10,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:10,275 INFO L225 Difference]: With dead ends: 7417 [2022-11-03 01:52:10,275 INFO L226 Difference]: Without dead ends: 7417 [2022-11-03 01:52:10,276 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 01:52:10,276 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:10,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 3 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:52:10,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7417 states. [2022-11-03 01:52:10,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7417 to 6635. [2022-11-03 01:52:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6635 states, 6455 states have (on average 4.377691711851278) internal successors, (28258), 6634 states have internal predecessors, (28258), 0 states have call successors, (0), 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 01:52:10,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6635 states to 6635 states and 28258 transitions. [2022-11-03 01:52:10,446 INFO L78 Accepts]: Start accepts. Automaton has 6635 states and 28258 transitions. Word has length 12 [2022-11-03 01:52:10,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:10,446 INFO L495 AbstractCegarLoop]: Abstraction has 6635 states and 28258 transitions. [2022-11-03 01:52:10,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 01:52:10,446 INFO L276 IsEmpty]: Start isEmpty. Operand 6635 states and 28258 transitions. [2022-11-03 01:52:10,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 01:52:10,447 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:10,447 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:52:10,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-11-03 01:52:10,448 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:52:10,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:10,448 INFO L85 PathProgramCache]: Analyzing trace with hash 66117366, now seen corresponding path program 1 times [2022-11-03 01:52:10,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:10,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947494402] [2022-11-03 01:52:10,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:10,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:10,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:52:10,522 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:10,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947494402] [2022-11-03 01:52:10,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947494402] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:52:10,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139079560] [2022-11-03 01:52:10,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:10,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:10,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:52:10,527 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:52:10,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-11-03 01:52:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:10,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 01:52:10,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:52:11,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:52:11,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:52:11,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:52:11,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139079560] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 01:52:11,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:52:11,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2022-11-03 01:52:11,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298006405] [2022-11-03 01:52:11,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:52:11,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:52:11,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:11,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:52:11,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 WARNING: YOUR LOGFILE WAS TOO LONG, SOME LINES IN THE MIDDLE WERE REMOVED. [2022-11-03 01:53:53,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-03 01:53:53,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609528147] [2022-11-03 01:53:53,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:53:53,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 01:53:53,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:53,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 01:53:53,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=704, Unknown=4, NotChecked=0, Total=812 [2022-11-03 01:53:53,339 INFO L87 Difference]: Start difference. First operand 12276 states and 54637 transitions. Second operand has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 0 states have call successors, (0), 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 01:53:55,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:55,308 INFO L93 Difference]: Finished difference Result 14431 states and 62672 transitions. [2022-11-03 01:53:55,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 01:53:55,309 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 0 states have call successors, (0), 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 14 [2022-11-03 01:53:55,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:55,377 INFO L225 Difference]: With dead ends: 14431 [2022-11-03 01:53:55,377 INFO L226 Difference]: Without dead ends: 14431 [2022-11-03 01:53:55,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=216, Invalid=1500, Unknown=6, NotChecked=0, Total=1722 [2022-11-03 01:53:55,378 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 344 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 827 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:55,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 182 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 591 Invalid, 0 Unknown, 827 Unchecked, 0.7s Time] [2022-11-03 01:53:55,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14431 states. [2022-11-03 01:53:55,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14431 to 12948. [2022-11-03 01:53:55,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12948 states, 12828 states have (on average 4.525958840037418) internal successors, (58059), 12947 states have internal predecessors, (58059), 0 states have call successors, (0), 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 01:53:55,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12948 states to 12948 states and 58059 transitions. [2022-11-03 01:53:55,792 INFO L78 Accepts]: Start accepts. Automaton has 12948 states and 58059 transitions. Word has length 14 [2022-11-03 01:53:55,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:55,792 INFO L495 AbstractCegarLoop]: Abstraction has 12948 states and 58059 transitions. [2022-11-03 01:53:55,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 0 states have call successors, (0), 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 01:53:55,793 INFO L276 IsEmpty]: Start isEmpty. Operand 12948 states and 58059 transitions. [2022-11-03 01:53:55,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:53:55,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:55,795 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:55,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-11-03 01:53:56,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable86 [2022-11-03 01:53:56,002 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:53:56,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:56,003 INFO L85 PathProgramCache]: Analyzing trace with hash -323800038, now seen corresponding path program 1 times [2022-11-03 01:53:56,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:56,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509901202] [2022-11-03 01:53:56,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:56,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:56,097 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 01:53:56,097 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:56,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509901202] [2022-11-03 01:53:56,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509901202] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:56,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:56,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:53:56,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374430908] [2022-11-03 01:53:56,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:56,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:53:56,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:56,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:53:56,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:53:56,099 INFO L87 Difference]: Start difference. First operand 12948 states and 58059 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 01:53:56,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:56,318 INFO L93 Difference]: Finished difference Result 15799 states and 67706 transitions. [2022-11-03 01:53:56,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:53:56,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 14 [2022-11-03 01:53:56,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:56,390 INFO L225 Difference]: With dead ends: 15799 [2022-11-03 01:53:56,390 INFO L226 Difference]: Without dead ends: 15799 [2022-11-03 01:53:56,390 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 01:53:56,390 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 18 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:56,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 7 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:53:56,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15799 states. [2022-11-03 01:53:56,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15799 to 13169. [2022-11-03 01:53:56,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13169 states, 13049 states have (on average 4.515901601655299) internal successors, (58928), 13168 states have internal predecessors, (58928), 0 states have call successors, (0), 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 01:53:56,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13169 states to 13169 states and 58928 transitions. [2022-11-03 01:53:56,760 INFO L78 Accepts]: Start accepts. Automaton has 13169 states and 58928 transitions. Word has length 14 [2022-11-03 01:53:56,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:56,760 INFO L495 AbstractCegarLoop]: Abstraction has 13169 states and 58928 transitions. [2022-11-03 01:53:56,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 01:53:56,761 INFO L276 IsEmpty]: Start isEmpty. Operand 13169 states and 58928 transitions. [2022-11-03 01:53:56,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:53:56,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:56,763 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:56,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2022-11-03 01:53:56,764 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:53:56,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:56,764 INFO L85 PathProgramCache]: Analyzing trace with hash -323800040, now seen corresponding path program 1 times [2022-11-03 01:53:56,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:56,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581724834] [2022-11-03 01:53:56,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:56,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:56,849 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 01:53:56,849 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:56,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581724834] [2022-11-03 01:53:56,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581724834] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:56,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:56,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:53:56,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938885118] [2022-11-03 01:53:56,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:56,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:53:56,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:56,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:53:56,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:53:56,850 INFO L87 Difference]: Start difference. First operand 13169 states and 58928 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 01:53:57,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:57,075 INFO L93 Difference]: Finished difference Result 15306 states and 65775 transitions. [2022-11-03 01:53:57,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:53:57,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 14 [2022-11-03 01:53:57,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:57,148 INFO L225 Difference]: With dead ends: 15306 [2022-11-03 01:53:57,149 INFO L226 Difference]: Without dead ends: 15302 [2022-11-03 01:53:57,149 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 01:53:57,149 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:57,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 7 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:53:57,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15302 states. [2022-11-03 01:53:57,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15302 to 10163. [2022-11-03 01:53:57,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10163 states, 10043 states have (on average 4.2243353579607685) internal successors, (42425), 10162 states have internal predecessors, (42425), 0 states have call successors, (0), 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 01:53:57,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10163 states to 10163 states and 42425 transitions. [2022-11-03 01:53:57,586 INFO L78 Accepts]: Start accepts. Automaton has 10163 states and 42425 transitions. Word has length 14 [2022-11-03 01:53:57,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:57,586 INFO L495 AbstractCegarLoop]: Abstraction has 10163 states and 42425 transitions. [2022-11-03 01:53:57,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 01:53:57,587 INFO L276 IsEmpty]: Start isEmpty. Operand 10163 states and 42425 transitions. [2022-11-03 01:53:57,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:53:57,589 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:57,589 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:57,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2022-11-03 01:53:57,589 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:53:57,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:57,591 INFO L85 PathProgramCache]: Analyzing trace with hash -326447795, now seen corresponding path program 3 times [2022-11-03 01:53:57,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:57,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203854626] [2022-11-03 01:53:57,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:57,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:57,778 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:53:57,778 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:57,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203854626] [2022-11-03 01:53:57,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203854626] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:53:57,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048862508] [2022-11-03 01:53:57,779 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:53:57,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:57,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:57,780 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:53:57,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-11-03 01:53:58,285 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:53:58,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:53:58,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-03 01:53:58,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:53:58,429 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:53:58,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:53:58,539 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:53:58,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048862508] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:53:58,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1208833519] [2022-11-03 01:53:58,540 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 01:53:58,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:53:58,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-11-03 01:53:58,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349025795] [2022-11-03 01:53:58,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:53:58,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 01:53:58,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:58,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 01:53:58,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2022-11-03 01:53:58,542 INFO L87 Difference]: Start difference. First operand 10163 states and 42425 transitions. Second operand has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 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 01:53:59,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:59,948 INFO L93 Difference]: Finished difference Result 12346 states and 48985 transitions. [2022-11-03 01:53:59,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 01:53:59,948 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 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 14 [2022-11-03 01:53:59,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:59,998 INFO L225 Difference]: With dead ends: 12346 [2022-11-03 01:53:59,998 INFO L226 Difference]: Without dead ends: 12346 [2022-11-03 01:53:59,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=366, Invalid=1040, Unknown=0, NotChecked=0, Total=1406 [2022-11-03 01:53:59,999 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 921 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:59,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 53 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-03 01:54:00,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12346 states. [2022-11-03 01:54:00,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12346 to 10545. [2022-11-03 01:54:00,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10545 states, 10425 states have (on average 4.209400479616307) internal successors, (43883), 10544 states have internal predecessors, (43883), 0 states have call successors, (0), 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 01:54:00,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10545 states to 10545 states and 43883 transitions. [2022-11-03 01:54:00,262 INFO L78 Accepts]: Start accepts. Automaton has 10545 states and 43883 transitions. Word has length 14 [2022-11-03 01:54:00,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:00,262 INFO L495 AbstractCegarLoop]: Abstraction has 10545 states and 43883 transitions. [2022-11-03 01:54:00,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 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 01:54:00,262 INFO L276 IsEmpty]: Start isEmpty. Operand 10545 states and 43883 transitions. [2022-11-03 01:54:00,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:54:00,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:00,265 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:00,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2022-11-03 01:54:00,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable89 [2022-11-03 01:54:00,465 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:54:00,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:00,466 INFO L85 PathProgramCache]: Analyzing trace with hash 367530428, now seen corresponding path program 1 times [2022-11-03 01:54:00,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:00,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567413555] [2022-11-03 01:54:00,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:00,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:01,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:01,060 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:54:01,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567413555] [2022-11-03 01:54:01,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567413555] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:54:01,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817093180] [2022-11-03 01:54:01,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:01,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:01,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:54:01,063 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:54:01,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-11-03 01:54:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:01,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 01:54:01,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:54:01,833 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 15 treesize of output 11 [2022-11-03 01:54:01,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:01,906 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 18 treesize of output 20 [2022-11-03 01:54:01,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:01,997 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 18 treesize of output 20 [2022-11-03 01:54:02,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:02,094 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 18 treesize of output 20 [2022-11-03 01:54:02,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:02,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:54:02,646 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:54:02,646 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 32 treesize of output 33 [2022-11-03 01:54:02,657 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:54:02,658 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 309 treesize of output 297 [2022-11-03 01:54:02,670 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 282 treesize of output 258 [2022-11-03 01:54:02,679 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 258 treesize of output 210 [2022-11-03 01:54:02,688 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 210 treesize of output 198 [2022-11-03 01:54:03,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:03,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817093180] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:54:03,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [22720432] [2022-11-03 01:54:03,084 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 01:54:03,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:54:03,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-03 01:54:03,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399601972] [2022-11-03 01:54:03,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:54:03,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 01:54:03,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:03,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 01:54:03,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=556, Unknown=3, NotChecked=0, Total=650 [2022-11-03 01:54:03,085 INFO L87 Difference]: Start difference. First operand 10545 states and 43883 transitions. Second operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 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 01:54:03,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:03,980 INFO L93 Difference]: Finished difference Result 11204 states and 45836 transitions. [2022-11-03 01:54:03,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 01:54:03,980 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 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 14 [2022-11-03 01:54:03,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:04,024 INFO L225 Difference]: With dead ends: 11204 [2022-11-03 01:54:04,024 INFO L226 Difference]: Without dead ends: 11204 [2022-11-03 01:54:04,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=156, Invalid=963, Unknown=3, NotChecked=0, Total=1122 [2022-11-03 01:54:04,025 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 44 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 235 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:04,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 93 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 314 Invalid, 0 Unknown, 235 Unchecked, 0.3s Time] [2022-11-03 01:54:04,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11204 states. [2022-11-03 01:54:04,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11204 to 10547. [2022-11-03 01:54:04,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10547 states, 10427 states have (on average 4.209839838879831) internal successors, (43896), 10546 states have internal predecessors, (43896), 0 states have call successors, (0), 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 01:54:04,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10547 states to 10547 states and 43896 transitions. [2022-11-03 01:54:04,283 INFO L78 Accepts]: Start accepts. Automaton has 10547 states and 43896 transitions. Word has length 14 [2022-11-03 01:54:04,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:04,283 INFO L495 AbstractCegarLoop]: Abstraction has 10547 states and 43896 transitions. [2022-11-03 01:54:04,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 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 01:54:04,283 INFO L276 IsEmpty]: Start isEmpty. Operand 10547 states and 43896 transitions. [2022-11-03 01:54:04,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:54:04,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:04,286 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:04,316 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2022-11-03 01:54:04,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,70 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:04,487 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:54:04,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:04,487 INFO L85 PathProgramCache]: Analyzing trace with hash 367639238, now seen corresponding path program 2 times [2022-11-03 01:54:04,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:04,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527679978] [2022-11-03 01:54:04,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:04,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:05,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:05,156 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:54:05,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527679978] [2022-11-03 01:54:05,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527679978] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:54:05,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774828992] [2022-11-03 01:54:05,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:54:05,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:05,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:54:05,158 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:54:05,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-11-03 01:54:05,710 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:54:05,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:54:05,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 01:54:05,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:54:05,808 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 15 treesize of output 11 [2022-11-03 01:54:05,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:05,894 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 18 treesize of output 20 [2022-11-03 01:54:05,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:05,977 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 18 treesize of output 20 [2022-11-03 01:54:06,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:06,057 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 18 treesize of output 20 [2022-11-03 01:54:06,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:06,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:54:06,669 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:54:06,670 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 32 treesize of output 33 [2022-11-03 01:54:06,682 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:54:06,682 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 617 treesize of output 589 [2022-11-03 01:54:06,693 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 574 treesize of output 526 [2022-11-03 01:54:06,705 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 275 treesize of output 251 [2022-11-03 01:54:06,716 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 502 treesize of output 406 [2022-11-03 01:54:07,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:07,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774828992] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:54:07,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1219061322] [2022-11-03 01:54:07,481 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 01:54:07,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:54:07,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-03 01:54:07,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905291696] [2022-11-03 01:54:07,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:54:07,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 01:54:07,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:07,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 01:54:07,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=561, Unknown=4, NotChecked=0, Total=650 [2022-11-03 01:54:07,483 INFO L87 Difference]: Start difference. First operand 10547 states and 43896 transitions. Second operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 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 01:54:08,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:08,295 INFO L93 Difference]: Finished difference Result 11219 states and 45908 transitions. [2022-11-03 01:54:08,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 01:54:08,296 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 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 14 [2022-11-03 01:54:08,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:08,339 INFO L225 Difference]: With dead ends: 11219 [2022-11-03 01:54:08,339 INFO L226 Difference]: Without dead ends: 11219 [2022-11-03 01:54:08,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=150, Invalid=968, Unknown=4, NotChecked=0, Total=1122 [2022-11-03 01:54:08,340 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 46 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 372 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:08,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 85 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 290 Invalid, 0 Unknown, 372 Unchecked, 0.3s Time] [2022-11-03 01:54:08,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11219 states. [2022-11-03 01:54:08,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11219 to 10549. [2022-11-03 01:54:08,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10549 states, 10429 states have (on average 4.21027902962892) internal successors, (43909), 10548 states have internal predecessors, (43909), 0 states have call successors, (0), 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 01:54:08,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10549 states to 10549 states and 43909 transitions. [2022-11-03 01:54:08,599 INFO L78 Accepts]: Start accepts. Automaton has 10549 states and 43909 transitions. Word has length 14 [2022-11-03 01:54:08,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:08,599 INFO L495 AbstractCegarLoop]: Abstraction has 10549 states and 43909 transitions. [2022-11-03 01:54:08,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 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 01:54:08,600 INFO L276 IsEmpty]: Start isEmpty. Operand 10549 states and 43909 transitions. [2022-11-03 01:54:08,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:54:08,602 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:08,602 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:08,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2022-11-03 01:54:08,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,71 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:08,803 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:54:08,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:08,803 INFO L85 PathProgramCache]: Analyzing trace with hash 379661348, now seen corresponding path program 3 times [2022-11-03 01:54:08,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:08,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774257595] [2022-11-03 01:54:08,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:08,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:09,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:09,331 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:54:09,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774257595] [2022-11-03 01:54:09,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774257595] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:54:09,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116348000] [2022-11-03 01:54:09,332 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:54:09,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:09,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:54:09,333 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:54:09,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-11-03 01:54:09,879 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:54:09,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:54:09,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 01:54:09,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:54:09,970 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 15 treesize of output 11 [2022-11-03 01:54:10,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:10,044 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 18 treesize of output 20 [2022-11-03 01:54:10,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:10,119 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 18 treesize of output 20 [2022-11-03 01:54:10,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:10,211 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 18 treesize of output 20 [2022-11-03 01:54:10,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:10,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:54:10,773 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:54:10,773 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 32 treesize of output 33 [2022-11-03 01:54:10,784 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:54:10,784 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 309 treesize of output 297 [2022-11-03 01:54:10,791 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 282 treesize of output 234 [2022-11-03 01:54:10,799 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 234 treesize of output 222 [2022-11-03 01:54:10,806 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 222 treesize of output 198 [2022-11-03 01:54:11,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:11,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116348000] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:54:11,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1897364955] [2022-11-03 01:54:11,140 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 01:54:11,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:54:11,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-03 01:54:11,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841396805] [2022-11-03 01:54:11,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:54:11,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 01:54:11,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:11,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 01:54:11,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=556, Unknown=6, NotChecked=0, Total=650 [2022-11-03 01:54:11,142 INFO L87 Difference]: Start difference. First operand 10549 states and 43909 transitions. Second operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 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 01:54:11,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:11,877 INFO L93 Difference]: Finished difference Result 11237 states and 45992 transitions. [2022-11-03 01:54:11,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 01:54:11,878 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 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 14 [2022-11-03 01:54:11,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:11,922 INFO L225 Difference]: With dead ends: 11237 [2022-11-03 01:54:11,923 INFO L226 Difference]: Without dead ends: 11237 [2022-11-03 01:54:11,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=147, Invalid=969, Unknown=6, NotChecked=0, Total=1122 [2022-11-03 01:54:11,923 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 44 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:11,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 146 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 229 Invalid, 0 Unknown, 153 Unchecked, 0.2s Time] [2022-11-03 01:54:11,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11237 states. [2022-11-03 01:54:12,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11237 to 10553. [2022-11-03 01:54:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10553 states, 10433 states have (on average 4.210581807725487) internal successors, (43929), 10552 states have internal predecessors, (43929), 0 states have call successors, (0), 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 01:54:12,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10553 states to 10553 states and 43929 transitions. [2022-11-03 01:54:12,178 INFO L78 Accepts]: Start accepts. Automaton has 10553 states and 43929 transitions. Word has length 14 [2022-11-03 01:54:12,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:12,178 INFO L495 AbstractCegarLoop]: Abstraction has 10553 states and 43929 transitions. [2022-11-03 01:54:12,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 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 01:54:12,251 INFO L276 IsEmpty]: Start isEmpty. Operand 10553 states and 43929 transitions. [2022-11-03 01:54:12,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:54:12,254 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:12,254 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:12,282 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2022-11-03 01:54:12,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,72 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:12,454 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:54:12,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:12,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1215347618, now seen corresponding path program 4 times [2022-11-03 01:54:12,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:12,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601083265] [2022-11-03 01:54:12,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:12,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:13,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:13,085 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:54:13,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601083265] [2022-11-03 01:54:13,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601083265] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:54:13,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773963915] [2022-11-03 01:54:13,085 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:54:13,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:13,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:54:13,086 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:54:13,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-11-03 01:54:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:13,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 01:54:13,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:54:13,702 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 15 treesize of output 11 [2022-11-03 01:54:13,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:13,782 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 18 treesize of output 20 [2022-11-03 01:54:13,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:13,845 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 18 treesize of output 20 [2022-11-03 01:54:13,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:13,931 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 18 treesize of output 20 [2022-11-03 01:54:14,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:14,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:54:14,375 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:54:14,375 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 32 treesize of output 33 [2022-11-03 01:54:14,387 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:54:14,387 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 309 treesize of output 297 [2022-11-03 01:54:14,395 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 282 treesize of output 258 [2022-11-03 01:54:14,402 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 258 treesize of output 210 [2022-11-03 01:54:14,413 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 110 treesize of output 98 [2022-11-03 01:54:14,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:14,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773963915] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:54:14,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1685865716] [2022-11-03 01:54:14,986 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 01:54:14,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:54:14,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-03 01:54:14,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519457331] [2022-11-03 01:54:14,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:54:14,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 01:54:14,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:14,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 01:54:14,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=542, Unknown=9, NotChecked=0, Total=650 [2022-11-03 01:54:14,987 INFO L87 Difference]: Start difference. First operand 10553 states and 43929 transitions. Second operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 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 01:54:15,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:15,428 INFO L93 Difference]: Finished difference Result 11235 states and 45973 transitions. [2022-11-03 01:54:15,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 01:54:15,429 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 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 14 [2022-11-03 01:54:15,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:15,473 INFO L225 Difference]: With dead ends: 11235 [2022-11-03 01:54:15,473 INFO L226 Difference]: Without dead ends: 11235 [2022-11-03 01:54:15,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=630, Unknown=9, NotChecked=0, Total=756 [2022-11-03 01:54:15,473 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 39 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:15,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 78 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 325 Invalid, 0 Unknown, 190 Unchecked, 0.3s Time] [2022-11-03 01:54:15,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11235 states. [2022-11-03 01:54:15,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11235 to 10556. [2022-11-03 01:54:15,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10556 states, 10436 states have (on average 4.2104254503641245) internal successors, (43940), 10555 states have internal predecessors, (43940), 0 states have call successors, (0), 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 01:54:15,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10556 states to 10556 states and 43940 transitions. [2022-11-03 01:54:15,725 INFO L78 Accepts]: Start accepts. Automaton has 10556 states and 43940 transitions. Word has length 14 [2022-11-03 01:54:15,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:15,725 INFO L495 AbstractCegarLoop]: Abstraction has 10556 states and 43940 transitions. [2022-11-03 01:54:15,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 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 01:54:15,726 INFO L276 IsEmpty]: Start isEmpty. Operand 10556 states and 43940 transitions. [2022-11-03 01:54:15,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:54:15,728 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:15,728 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:15,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Forceful destruction successful, exit code 0 [2022-11-03 01:54:15,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,73 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:15,929 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:54:15,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:15,929 INFO L85 PathProgramCache]: Analyzing trace with hash 566771383, now seen corresponding path program 1 times [2022-11-03 01:54:15,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:15,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574243470] [2022-11-03 01:54:15,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:15,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:16,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:16,083 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:54:16,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574243470] [2022-11-03 01:54:16,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574243470] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:54:16,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485598581] [2022-11-03 01:54:16,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:16,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:16,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:54:16,087 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:54:16,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-11-03 01:54:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:16,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-03 01:54:16,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:54:16,978 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 107 treesize of output 91 [2022-11-03 01:54:17,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:17,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:54:17,032 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 12 treesize of output 4 [2022-11-03 01:54:17,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:17,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485598581] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:54:17,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [462172176] [2022-11-03 01:54:17,147 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 01:54:17,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:54:17,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-11-03 01:54:17,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528161829] [2022-11-03 01:54:17,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:54:17,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 01:54:17,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:17,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 01:54:17,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2022-11-03 01:54:17,148 INFO L87 Difference]: Start difference. First operand 10556 states and 43940 transitions. Second operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 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 01:54:18,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:18,723 INFO L93 Difference]: Finished difference Result 11663 states and 47108 transitions. [2022-11-03 01:54:18,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-03 01:54:18,724 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 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 14 [2022-11-03 01:54:18,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:18,767 INFO L225 Difference]: With dead ends: 11663 [2022-11-03 01:54:18,767 INFO L226 Difference]: Without dead ends: 11647 [2022-11-03 01:54:18,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=604, Invalid=1466, Unknown=0, NotChecked=0, Total=2070 [2022-11-03 01:54:18,768 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 606 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:18,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 129 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1304 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-03 01:54:18,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11647 states. [2022-11-03 01:54:18,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11647 to 10621. [2022-11-03 01:54:18,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10621 states, 10501 states have (on average 4.211408437291687) internal successors, (44224), 10620 states have internal predecessors, (44224), 0 states have call successors, (0), 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 01:54:19,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10621 states to 10621 states and 44224 transitions. [2022-11-03 01:54:19,022 INFO L78 Accepts]: Start accepts. Automaton has 10621 states and 44224 transitions. Word has length 14 [2022-11-03 01:54:19,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:19,023 INFO L495 AbstractCegarLoop]: Abstraction has 10621 states and 44224 transitions. [2022-11-03 01:54:19,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 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 01:54:19,023 INFO L276 IsEmpty]: Start isEmpty. Operand 10621 states and 44224 transitions. [2022-11-03 01:54:19,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:54:19,025 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:19,026 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:19,053 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Forceful destruction successful, exit code 0 [2022-11-03 01:54:19,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 74 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable94 [2022-11-03 01:54:19,226 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:54:19,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:19,226 INFO L85 PathProgramCache]: Analyzing trace with hash 566766609, now seen corresponding path program 1 times [2022-11-03 01:54:19,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:19,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170364791] [2022-11-03 01:54:19,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:19,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:19,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:19,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:54:19,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170364791] [2022-11-03 01:54:19,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170364791] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:54:19,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920255863] [2022-11-03 01:54:19,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:19,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:19,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:54:19,751 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:54:19,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-11-03 01:54:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:20,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-03 01:54:20,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:54:20,491 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 13 treesize of output 9 [2022-11-03 01:54:20,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:20,535 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 16 treesize of output 18 [2022-11-03 01:54:20,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:20,585 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 16 treesize of output 18 [2022-11-03 01:54:20,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:20,624 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 16 treesize of output 18 [2022-11-03 01:54:20,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:20,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:54:21,040 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_4203 (Array Int Int)) (v_ArrVal_4204 (Array Int Int)) (v_ArrVal_4205 (Array Int Int))) (or (< 0 ~M~0) (< ~M~0 0) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_4203) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4204) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_4205) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296))) is different from false [2022-11-03 01:54:21,051 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:54:21,051 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 33 treesize of output 34 [2022-11-03 01:54:21,061 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:54:21,062 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 325 treesize of output 313 [2022-11-03 01:54:21,069 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 296 treesize of output 240 [2022-11-03 01:54:21,076 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 240 treesize of output 212 [2022-11-03 01:54:21,085 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 112 treesize of output 98 [2022-11-03 01:54:21,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 01:54:21,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920255863] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:54:21,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1951584760] [2022-11-03 01:54:21,273 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 01:54:21,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:54:21,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-11-03 01:54:21,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348817044] [2022-11-03 01:54:21,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:54:21,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-03 01:54:21,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:21,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-03 01:54:21,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=683, Unknown=13, NotChecked=54, Total=870 [2022-11-03 01:54:21,281 INFO L87 Difference]: Start difference. First operand 10621 states and 44224 transitions. Second operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:54:25,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:25,099 INFO L93 Difference]: Finished difference Result 23932 states and 95898 transitions. [2022-11-03 01:54:25,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-03 01:54:25,100 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-03 01:54:25,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:25,205 INFO L225 Difference]: With dead ends: 23932 [2022-11-03 01:54:25,205 INFO L226 Difference]: Without dead ends: 23932 [2022-11-03 01:54:25,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=646, Invalid=1895, Unknown=13, NotChecked=98, Total=2652 [2022-11-03 01:54:25,206 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 856 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 2683 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 2976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 230 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:25,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 194 Invalid, 2976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2683 Invalid, 0 Unknown, 230 Unchecked, 2.5s Time] [2022-11-03 01:54:25,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23932 states. [2022-11-03 01:54:25,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23932 to 10837. [2022-11-03 01:54:25,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10837 states, 10717 states have (on average 4.27246430904171) internal successors, (45788), 10836 states have internal predecessors, (45788), 0 states have call successors, (0), 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 01:54:25,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10837 states to 10837 states and 45788 transitions. [2022-11-03 01:54:25,614 INFO L78 Accepts]: Start accepts. Automaton has 10837 states and 45788 transitions. Word has length 14 [2022-11-03 01:54:25,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:25,614 INFO L495 AbstractCegarLoop]: Abstraction has 10837 states and 45788 transitions. [2022-11-03 01:54:25,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:54:25,615 INFO L276 IsEmpty]: Start isEmpty. Operand 10837 states and 45788 transitions. [2022-11-03 01:54:25,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:54:25,617 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:25,617 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:25,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forceful destruction successful, exit code 0 [2022-11-03 01:54:25,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95,75 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:25,818 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:54:25,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:25,818 INFO L85 PathProgramCache]: Analyzing trace with hash 556048483, now seen corresponding path program 2 times [2022-11-03 01:54:25,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:25,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535408096] [2022-11-03 01:54:25,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:25,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:25,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:25,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:54:25,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535408096] [2022-11-03 01:54:25,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535408096] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:54:25,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845658320] [2022-11-03 01:54:25,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:54:25,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:25,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:54:25,967 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:54:25,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-11-03 01:54:26,546 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:54:26,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:54:26,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-03 01:54:26,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:54:26,691 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 107 treesize of output 91 [2022-11-03 01:54:26,729 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:26,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:54:26,768 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 12 treesize of output 4 [2022-11-03 01:54:26,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:26,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845658320] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:54:26,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [401945456] [2022-11-03 01:54:26,862 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 01:54:26,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:54:26,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-11-03 01:54:26,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052441638] [2022-11-03 01:54:26,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:54:26,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 01:54:26,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:26,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 01:54:26,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-11-03 01:54:26,863 INFO L87 Difference]: Start difference. First operand 10837 states and 45788 transitions. Second operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 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 01:54:28,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:28,411 INFO L93 Difference]: Finished difference Result 12175 states and 49900 transitions. [2022-11-03 01:54:28,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-03 01:54:28,411 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 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 14 [2022-11-03 01:54:28,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:28,460 INFO L225 Difference]: With dead ends: 12175 [2022-11-03 01:54:28,460 INFO L226 Difference]: Without dead ends: 12143 [2022-11-03 01:54:28,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=541, Invalid=1351, Unknown=0, NotChecked=0, Total=1892 [2022-11-03 01:54:28,461 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 597 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:28,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 122 Invalid, 1294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1249 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-03 01:54:28,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12143 states. [2022-11-03 01:54:28,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12143 to 11019. [2022-11-03 01:54:28,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11019 states, 10899 states have (on average 4.283879254977521) internal successors, (46690), 11018 states have internal predecessors, (46690), 0 states have call successors, (0), 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 01:54:28,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11019 states to 11019 states and 46690 transitions. [2022-11-03 01:54:28,765 INFO L78 Accepts]: Start accepts. Automaton has 11019 states and 46690 transitions. Word has length 14 [2022-11-03 01:54:28,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:28,765 INFO L495 AbstractCegarLoop]: Abstraction has 11019 states and 46690 transitions. [2022-11-03 01:54:28,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 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 01:54:28,766 INFO L276 IsEmpty]: Start isEmpty. Operand 11019 states and 46690 transitions. [2022-11-03 01:54:28,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:54:28,768 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:28,769 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:28,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2022-11-03 01:54:28,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96,76 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:28,969 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:54:28,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:28,970 INFO L85 PathProgramCache]: Analyzing trace with hash 555931303, now seen corresponding path program 3 times [2022-11-03 01:54:28,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:28,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493386716] [2022-11-03 01:54:28,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:28,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:29,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:29,118 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:54:29,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493386716] [2022-11-03 01:54:29,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493386716] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:54:29,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589176897] [2022-11-03 01:54:29,119 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:54:29,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:29,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:54:29,120 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:54:29,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-11-03 01:54:29,694 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:54:29,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:54:29,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-03 01:54:29,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:54:29,834 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 107 treesize of output 91 [2022-11-03 01:54:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:29,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:54:29,905 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 12 treesize of output 4 [2022-11-03 01:54:30,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:30,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589176897] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:54:30,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [384352046] [2022-11-03 01:54:30,062 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 01:54:30,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:54:30,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-11-03 01:54:30,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976341556] [2022-11-03 01:54:30,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:54:30,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 01:54:30,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:30,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 01:54:30,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2022-11-03 01:54:30,064 INFO L87 Difference]: Start difference. First operand 11019 states and 46690 transitions. Second operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 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 01:54:32,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:32,319 INFO L93 Difference]: Finished difference Result 12515 states and 50646 transitions. [2022-11-03 01:54:32,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-03 01:54:32,320 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 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 14 [2022-11-03 01:54:32,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:32,369 INFO L225 Difference]: With dead ends: 12515 [2022-11-03 01:54:32,369 INFO L226 Difference]: Without dead ends: 12499 [2022-11-03 01:54:32,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=837, Invalid=2025, Unknown=0, NotChecked=0, Total=2862 [2022-11-03 01:54:32,369 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 677 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:32,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 131 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-03 01:54:32,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12499 states. [2022-11-03 01:54:32,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12499 to 10920. [2022-11-03 01:54:32,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10920 states, 10800 states have (on average 4.275185185185185) internal successors, (46172), 10919 states have internal predecessors, (46172), 0 states have call successors, (0), 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 01:54:32,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10920 states to 10920 states and 46172 transitions. [2022-11-03 01:54:32,641 INFO L78 Accepts]: Start accepts. Automaton has 10920 states and 46172 transitions. Word has length 14 [2022-11-03 01:54:32,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:32,642 INFO L495 AbstractCegarLoop]: Abstraction has 10920 states and 46172 transitions. [2022-11-03 01:54:32,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 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 01:54:32,642 INFO L276 IsEmpty]: Start isEmpty. Operand 10920 states and 46172 transitions. [2022-11-03 01:54:32,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:54:32,645 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:32,645 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:32,673 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Forceful destruction successful, exit code 0 [2022-11-03 01:54:32,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97,77 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:32,845 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:54:32,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:32,846 INFO L85 PathProgramCache]: Analyzing trace with hash 555926529, now seen corresponding path program 2 times [2022-11-03 01:54:32,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:32,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348256981] [2022-11-03 01:54:32,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:32,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:33,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:33,437 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:54:33,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348256981] [2022-11-03 01:54:33,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348256981] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:54:33,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016787585] [2022-11-03 01:54:33,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:54:33,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:33,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:54:33,443 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:54:33,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-11-03 01:54:34,143 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:54:34,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:54:34,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 01:54:34,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:54:34,239 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 15 treesize of output 11 [2022-11-03 01:54:34,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:34,318 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 18 treesize of output 20 [2022-11-03 01:54:34,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:34,398 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 18 treesize of output 20 [2022-11-03 01:54:34,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:34,471 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 18 treesize of output 20 [2022-11-03 01:54:34,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:34,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:54:35,083 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:54:35,084 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 32 treesize of output 33 [2022-11-03 01:54:35,096 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:54:35,097 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 309 treesize of output 297 [2022-11-03 01:54:35,105 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 282 treesize of output 258 [2022-11-03 01:54:35,114 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 258 treesize of output 210 [2022-11-03 01:54:35,124 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 110 treesize of output 98 [2022-11-03 01:54:35,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:35,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016787585] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:54:35,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2096237278] [2022-11-03 01:54:35,839 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 01:54:35,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:54:35,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 26 [2022-11-03 01:54:35,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450866806] [2022-11-03 01:54:35,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:54:35,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-03 01:54:35,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:35,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-03 01:54:35,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=669, Unknown=6, NotChecked=0, Total=756 [2022-11-03 01:54:35,841 INFO L87 Difference]: Start difference. First operand 10920 states and 46172 transitions. Second operand has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 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 01:54:36,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:36,932 INFO L93 Difference]: Finished difference Result 11614 states and 48195 transitions. [2022-11-03 01:54:36,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 01:54:36,932 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 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 14 [2022-11-03 01:54:36,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:36,979 INFO L225 Difference]: With dead ends: 11614 [2022-11-03 01:54:36,980 INFO L226 Difference]: Without dead ends: 11614 [2022-11-03 01:54:36,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=158, Invalid=1242, Unknown=6, NotChecked=0, Total=1406 [2022-11-03 01:54:36,980 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 49 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 228 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:36,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 250 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 477 Invalid, 0 Unknown, 228 Unchecked, 0.4s Time] [2022-11-03 01:54:36,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11614 states. [2022-11-03 01:54:37,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11614 to 10924. [2022-11-03 01:54:37,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10924 states, 10804 states have (on average 4.275083302480563) internal successors, (46188), 10923 states have internal predecessors, (46188), 0 states have call successors, (0), 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 01:54:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10924 states to 10924 states and 46188 transitions. [2022-11-03 01:54:37,256 INFO L78 Accepts]: Start accepts. Automaton has 10924 states and 46188 transitions. Word has length 14 [2022-11-03 01:54:37,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:37,256 INFO L495 AbstractCegarLoop]: Abstraction has 10924 states and 46188 transitions. [2022-11-03 01:54:37,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 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 01:54:37,257 INFO L276 IsEmpty]: Start isEmpty. Operand 10924 states and 46188 transitions. [2022-11-03 01:54:37,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:54:37,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:37,261 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:37,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Forceful destruction successful, exit code 0 [2022-11-03 01:54:37,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98,78 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:37,461 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:54:37,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:37,462 INFO L85 PathProgramCache]: Analyzing trace with hash 555900489, now seen corresponding path program 3 times [2022-11-03 01:54:37,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:37,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715583770] [2022-11-03 01:54:37,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:37,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:37,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:37,929 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:54:37,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715583770] [2022-11-03 01:54:37,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715583770] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:54:37,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851196226] [2022-11-03 01:54:37,930 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:54:37,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:37,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:54:37,931 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:54:37,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-11-03 01:54:38,536 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:54:38,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:54:38,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-03 01:54:38,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:54:38,609 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 13 treesize of output 9 [2022-11-03 01:54:38,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:38,664 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 16 treesize of output 18 [2022-11-03 01:54:38,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:38,711 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 16 treesize of output 18 [2022-11-03 01:54:38,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:38,753 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 16 treesize of output 18 [2022-11-03 01:54:38,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:38,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:54:39,182 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_4405 (Array Int Int)) (v_ArrVal_4406 (Array Int Int)) (v_ArrVal_4407 (Array Int Int))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_4405) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4406) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_4407) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (< 0 ~M~0) (< ~M~0 0))) is different from false [2022-11-03 01:54:39,193 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:54:39,193 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 33 treesize of output 34 [2022-11-03 01:54:39,205 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:54:39,206 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 649 treesize of output 619 [2022-11-03 01:54:39,216 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 602 treesize of output 490 [2022-11-03 01:54:39,227 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 490 treesize of output 434 [2022-11-03 01:54:39,237 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 434 treesize of output 406 [2022-11-03 01:54:39,725 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 01:54:39,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851196226] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:54:39,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1064858873] [2022-11-03 01:54:39,726 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 01:54:39,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:54:39,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-11-03 01:54:39,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721748517] [2022-11-03 01:54:39,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:54:39,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-03 01:54:39,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:39,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-03 01:54:39,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=690, Unknown=14, NotChecked=54, Total=870 [2022-11-03 01:54:39,728 INFO L87 Difference]: Start difference. First operand 10924 states and 46188 transitions. Second operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:54:42,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:42,301 INFO L93 Difference]: Finished difference Result 20407 states and 81694 transitions. [2022-11-03 01:54:42,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 01:54:42,302 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-03 01:54:42,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:42,387 INFO L225 Difference]: With dead ends: 20407 [2022-11-03 01:54:42,387 INFO L226 Difference]: Without dead ends: 20407 [2022-11-03 01:54:42,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=500, Invalid=1560, Unknown=14, NotChecked=88, Total=2162 [2022-11-03 01:54:42,388 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 737 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 1522 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 185 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:42,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 116 Invalid, 1754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1522 Invalid, 0 Unknown, 185 Unchecked, 1.6s Time] [2022-11-03 01:54:42,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20407 states. [2022-11-03 01:54:42,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20407 to 11233. [2022-11-03 01:54:42,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11233 states, 11113 states have (on average 4.330873751462251) internal successors, (48129), 11232 states have internal predecessors, (48129), 0 states have call successors, (0), 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 01:54:42,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11233 states to 11233 states and 48129 transitions. [2022-11-03 01:54:42,759 INFO L78 Accepts]: Start accepts. Automaton has 11233 states and 48129 transitions. Word has length 14 [2022-11-03 01:54:42,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:42,759 INFO L495 AbstractCegarLoop]: Abstraction has 11233 states and 48129 transitions. [2022-11-03 01:54:42,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:54:42,759 INFO L276 IsEmpty]: Start isEmpty. Operand 11233 states and 48129 transitions. [2022-11-03 01:54:42,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:54:42,762 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:42,762 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:42,789 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Forceful destruction successful, exit code 0 [2022-11-03 01:54:42,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 79 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable99 [2022-11-03 01:54:42,963 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:54:42,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:42,963 INFO L85 PathProgramCache]: Analyzing trace with hash 500406583, now seen corresponding path program 4 times [2022-11-03 01:54:42,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:42,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172532223] [2022-11-03 01:54:42,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:42,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:43,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:43,115 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:54:43,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172532223] [2022-11-03 01:54:43,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172532223] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:54:43,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324980363] [2022-11-03 01:54:43,115 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:54:43,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:43,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:54:43,117 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:54:43,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2022-11-03 01:54:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:43,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-03 01:54:43,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:54:43,866 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 107 treesize of output 91 [2022-11-03 01:54:43,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:43,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:54:43,969 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 63 treesize of output 31 [2022-11-03 01:54:44,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:44,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324980363] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:54:44,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1795403832] [2022-11-03 01:54:44,045 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 01:54:44,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:54:44,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-11-03 01:54:44,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878566431] [2022-11-03 01:54:44,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:54:44,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-03 01:54:44,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:44,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-03 01:54:44,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2022-11-03 01:54:44,047 INFO L87 Difference]: Start difference. First operand 11233 states and 48129 transitions. Second operand has 21 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 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 01:54:45,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:45,419 INFO L93 Difference]: Finished difference Result 11822 states and 49718 transitions. [2022-11-03 01:54:45,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-03 01:54:45,419 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 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 14 [2022-11-03 01:54:45,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:45,468 INFO L225 Difference]: With dead ends: 11822 [2022-11-03 01:54:45,468 INFO L226 Difference]: Without dead ends: 11760 [2022-11-03 01:54:45,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=455, Invalid=1185, Unknown=0, NotChecked=0, Total=1640 [2022-11-03 01:54:45,469 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 500 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:45,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 116 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-03 01:54:45,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11760 states. [2022-11-03 01:54:45,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11760 to 11260. [2022-11-03 01:54:45,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11260 states, 11140 states have (on average 4.324506283662478) internal successors, (48175), 11259 states have internal predecessors, (48175), 0 states have call successors, (0), 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 01:54:45,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11260 states to 11260 states and 48175 transitions. [2022-11-03 01:54:45,741 INFO L78 Accepts]: Start accepts. Automaton has 11260 states and 48175 transitions. Word has length 14 [2022-11-03 01:54:45,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:45,741 INFO L495 AbstractCegarLoop]: Abstraction has 11260 states and 48175 transitions. [2022-11-03 01:54:45,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 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 01:54:45,741 INFO L276 IsEmpty]: Start isEmpty. Operand 11260 states and 48175 transitions. [2022-11-03 01:54:45,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:54:45,744 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:45,744 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:45,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Forceful destruction successful, exit code 0 [2022-11-03 01:54:45,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2022-11-03 01:54:45,944 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:54:45,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:45,945 INFO L85 PathProgramCache]: Analyzing trace with hash 495818769, now seen corresponding path program 4 times [2022-11-03 01:54:45,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:45,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481797498] [2022-11-03 01:54:45,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:45,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:46,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:46,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:54:46,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481797498] [2022-11-03 01:54:46,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481797498] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:54:46,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825467235] [2022-11-03 01:54:46,408 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:54:46,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:46,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:54:46,410 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:54:46,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2022-11-03 01:54:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:47,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-03 01:54:47,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:54:47,134 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 13 treesize of output 9 [2022-11-03 01:54:47,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,196 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 16 treesize of output 18 [2022-11-03 01:54:47,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,245 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 16 treesize of output 18 [2022-11-03 01:54:47,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,286 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 16 treesize of output 18 [2022-11-03 01:54:47,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:47,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:54:47,689 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_4506 (Array Int Int)) (v_ArrVal_4507 (Array Int Int)) (v_ArrVal_4508 (Array Int Int))) (or (< 0 ~M~0) (< ~M~0 0) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_4506) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4507) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_4508) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296))) is different from false [2022-11-03 01:54:47,701 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:54:47,702 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 33 treesize of output 34 [2022-11-03 01:54:47,714 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:54:47,714 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 649 treesize of output 619 [2022-11-03 01:54:47,728 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 301 treesize of output 273 [2022-11-03 01:54:47,739 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 574 treesize of output 462 [2022-11-03 01:54:47,750 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 462 treesize of output 406 [2022-11-03 01:54:48,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 01:54:48,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825467235] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:54:48,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [71873314] [2022-11-03 01:54:48,447 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 01:54:48,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:54:48,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-11-03 01:54:48,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166395623] [2022-11-03 01:54:48,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:54:48,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-03 01:54:48,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:48,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-03 01:54:48,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=698, Unknown=10, NotChecked=54, Total=870 [2022-11-03 01:54:48,450 INFO L87 Difference]: Start difference. First operand 11260 states and 48175 transitions. Second operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:54:51,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:51,004 INFO L93 Difference]: Finished difference Result 12751 states and 52516 transitions. [2022-11-03 01:54:51,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 01:54:51,005 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-03 01:54:51,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:51,056 INFO L225 Difference]: With dead ends: 12751 [2022-11-03 01:54:51,057 INFO L226 Difference]: Without dead ends: 12751 [2022-11-03 01:54:51,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=401, Invalid=1315, Unknown=10, NotChecked=80, Total=1806 [2022-11-03 01:54:51,057 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 400 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 1914 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 2225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 277 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:51,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 126 Invalid, 2225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1914 Invalid, 0 Unknown, 277 Unchecked, 1.7s Time] [2022-11-03 01:54:51,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12751 states. [2022-11-03 01:54:51,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12751 to 11494. [2022-11-03 01:54:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11494 states, 11374 states have (on average 4.284068929136628) internal successors, (48727), 11493 states have internal predecessors, (48727), 0 states have call successors, (0), 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 01:54:51,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11494 states to 11494 states and 48727 transitions. [2022-11-03 01:54:51,348 INFO L78 Accepts]: Start accepts. Automaton has 11494 states and 48727 transitions. Word has length 14 [2022-11-03 01:54:51,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:51,349 INFO L495 AbstractCegarLoop]: Abstraction has 11494 states and 48727 transitions. [2022-11-03 01:54:51,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:54:51,349 INFO L276 IsEmpty]: Start isEmpty. Operand 11494 states and 48727 transitions. [2022-11-03 01:54:51,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:54:51,351 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:51,352 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:51,386 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Forceful destruction successful, exit code 0 [2022-11-03 01:54:51,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 81 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable101 [2022-11-03 01:54:51,552 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:54:51,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:51,553 INFO L85 PathProgramCache]: Analyzing trace with hash 488125003, now seen corresponding path program 5 times [2022-11-03 01:54:51,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:51,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886451346] [2022-11-03 01:54:51,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:51,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:51,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:51,722 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:54:51,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886451346] [2022-11-03 01:54:51,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886451346] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:54:51,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649167169] [2022-11-03 01:54:51,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:54:51,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:51,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:54:51,724 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:54:51,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2022-11-03 01:54:52,371 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:54:52,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:54:52,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-03 01:54:52,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:54:52,491 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 107 treesize of output 91 [2022-11-03 01:54:52,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:52,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:54:52,586 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 12 treesize of output 4 [2022-11-03 01:54:52,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:52,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649167169] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:54:52,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2002650101] [2022-11-03 01:54:52,684 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 01:54:52,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:54:52,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-11-03 01:54:52,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761639087] [2022-11-03 01:54:52,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:54:52,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 01:54:52,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:52,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 01:54:52,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2022-11-03 01:54:52,687 INFO L87 Difference]: Start difference. First operand 11494 states and 48727 transitions. Second operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 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 01:54:54,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:54,667 INFO L93 Difference]: Finished difference Result 13134 states and 53433 transitions. [2022-11-03 01:54:54,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-03 01:54:54,668 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 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 14 [2022-11-03 01:54:54,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:54,719 INFO L225 Difference]: With dead ends: 13134 [2022-11-03 01:54:54,719 INFO L226 Difference]: Without dead ends: 13102 [2022-11-03 01:54:54,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=673, Invalid=1679, Unknown=0, NotChecked=0, Total=2352 [2022-11-03 01:54:54,720 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 645 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 1564 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:54,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 137 Invalid, 1599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1564 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-03 01:54:54,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13102 states. [2022-11-03 01:54:54,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13102 to 11488. [2022-11-03 01:54:54,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11488 states, 11368 states have (on average 4.2838669950738915) internal successors, (48699), 11487 states have internal predecessors, (48699), 0 states have call successors, (0), 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 01:54:55,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11488 states to 11488 states and 48699 transitions. [2022-11-03 01:54:55,009 INFO L78 Accepts]: Start accepts. Automaton has 11488 states and 48699 transitions. Word has length 14 [2022-11-03 01:54:55,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:55,009 INFO L495 AbstractCegarLoop]: Abstraction has 11488 states and 48699 transitions. [2022-11-03 01:54:55,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 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 01:54:55,009 INFO L276 IsEmpty]: Start isEmpty. Operand 11488 states and 48699 transitions. [2022-11-03 01:54:55,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:54:55,012 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:55,012 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:55,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Forceful destruction successful, exit code 0 [2022-11-03 01:54:55,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 82 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2022-11-03 01:54:55,213 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:54:55,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:55,213 INFO L85 PathProgramCache]: Analyzing trace with hash 488007823, now seen corresponding path program 6 times [2022-11-03 01:54:55,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:55,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406509953] [2022-11-03 01:54:55,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:55,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:55,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:55,366 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:54:55,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406509953] [2022-11-03 01:54:55,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406509953] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:54:55,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723707484] [2022-11-03 01:54:55,367 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:54:55,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:55,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:54:55,368 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:54:55,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2022-11-03 01:54:56,013 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:54:56,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:54:56,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-03 01:54:56,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:54:56,154 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 107 treesize of output 91 [2022-11-03 01:54:56,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:56,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:54:56,207 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 12 treesize of output 4 [2022-11-03 01:54:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:56,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723707484] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:54:56,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1032580894] [2022-11-03 01:54:56,318 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 01:54:56,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:54:56,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-11-03 01:54:56,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854489629] [2022-11-03 01:54:56,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:54:56,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 01:54:56,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:56,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 01:54:56,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2022-11-03 01:54:56,320 INFO L87 Difference]: Start difference. First operand 11488 states and 48699 transitions. Second operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 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 01:54:58,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:58,629 INFO L93 Difference]: Finished difference Result 13074 states and 53017 transitions. [2022-11-03 01:54:58,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-03 01:54:58,630 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 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 14 [2022-11-03 01:54:58,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:58,680 INFO L225 Difference]: With dead ends: 13074 [2022-11-03 01:54:58,680 INFO L226 Difference]: Without dead ends: 13058 [2022-11-03 01:54:58,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=843, Invalid=2127, Unknown=0, NotChecked=0, Total=2970 [2022-11-03 01:54:58,681 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 697 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 1842 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 1885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:58,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 160 Invalid, 1885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1842 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-03 01:54:58,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13058 states. [2022-11-03 01:54:58,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13058 to 11373. [2022-11-03 01:54:58,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11373 states, 11253 states have (on average 4.27841464498356) internal successors, (48145), 11372 states have internal predecessors, (48145), 0 states have call successors, (0), 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 01:54:58,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11373 states to 11373 states and 48145 transitions. [2022-11-03 01:54:58,958 INFO L78 Accepts]: Start accepts. Automaton has 11373 states and 48145 transitions. Word has length 14 [2022-11-03 01:54:58,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:58,959 INFO L495 AbstractCegarLoop]: Abstraction has 11373 states and 48145 transitions. [2022-11-03 01:54:58,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 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 01:54:58,959 INFO L276 IsEmpty]: Start isEmpty. Operand 11373 states and 48145 transitions. [2022-11-03 01:54:58,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:54:58,961 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:58,962 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:58,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Forceful destruction successful, exit code 0 [2022-11-03 01:54:59,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2022-11-03 01:54:59,162 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:54:59,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:59,163 INFO L85 PathProgramCache]: Analyzing trace with hash 487977009, now seen corresponding path program 5 times [2022-11-03 01:54:59,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:59,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233714586] [2022-11-03 01:54:59,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:59,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:59,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:59,664 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:54:59,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233714586] [2022-11-03 01:54:59,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233714586] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:54:59,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335336960] [2022-11-03 01:54:59,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:54:59,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:59,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:54:59,666 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:54:59,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2022-11-03 01:55:00,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:55:00,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:55:00,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 01:55:00,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:55:00,415 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 15 treesize of output 11 [2022-11-03 01:55:00,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:00,490 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 18 treesize of output 20 [2022-11-03 01:55:00,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:00,574 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 18 treesize of output 20 [2022-11-03 01:55:00,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:00,646 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 18 treesize of output 20 [2022-11-03 01:55:00,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:00,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:55:01,209 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:55:01,209 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 32 treesize of output 33 [2022-11-03 01:55:01,221 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:55:01,221 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 1233 treesize of output 1173 [2022-11-03 01:55:01,233 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 1158 treesize of output 1062 [2022-11-03 01:55:01,249 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 531 treesize of output 483 [2022-11-03 01:55:01,264 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 1014 treesize of output 822 [2022-11-03 01:55:02,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:02,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335336960] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:55:02,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1247150557] [2022-11-03 01:55:02,920 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 01:55:02,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:55:02,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 26 [2022-11-03 01:55:02,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427281685] [2022-11-03 01:55:02,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:55:02,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-03 01:55:02,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:02,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-03 01:55:02,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=671, Unknown=2, NotChecked=0, Total=756 [2022-11-03 01:55:02,921 INFO L87 Difference]: Start difference. First operand 11373 states and 48145 transitions. Second operand has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 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 01:55:03,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:03,813 INFO L93 Difference]: Finished difference Result 11399 states and 48255 transitions. [2022-11-03 01:55:03,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 01:55:03,814 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 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 14 [2022-11-03 01:55:03,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:03,859 INFO L225 Difference]: With dead ends: 11399 [2022-11-03 01:55:03,859 INFO L226 Difference]: Without dead ends: 11399 [2022-11-03 01:55:03,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=169, Invalid=1311, Unknown=2, NotChecked=0, Total=1482 [2022-11-03 01:55:03,860 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:03,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 184 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 231 Invalid, 0 Unknown, 149 Unchecked, 0.2s Time] [2022-11-03 01:55:03,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11399 states. [2022-11-03 01:55:04,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11399 to 11375. [2022-11-03 01:55:04,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11375 states, 11255 states have (on average 4.278365171035095) internal successors, (48153), 11374 states have internal predecessors, (48153), 0 states have call successors, (0), 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 01:55:04,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11375 states to 11375 states and 48153 transitions. [2022-11-03 01:55:04,259 INFO L78 Accepts]: Start accepts. Automaton has 11375 states and 48153 transitions. Word has length 14 [2022-11-03 01:55:04,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:04,262 INFO L495 AbstractCegarLoop]: Abstraction has 11375 states and 48153 transitions. [2022-11-03 01:55:04,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 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 01:55:04,263 INFO L276 IsEmpty]: Start isEmpty. Operand 11375 states and 48153 transitions. [2022-11-03 01:55:04,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:55:04,266 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:04,266 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:04,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Forceful destruction successful, exit code 0 [2022-11-03 01:55:04,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 84 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable104 [2022-11-03 01:55:04,467 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:55:04,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:04,469 INFO L85 PathProgramCache]: Analyzing trace with hash 923122132, now seen corresponding path program 5 times [2022-11-03 01:55:04,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:04,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217531157] [2022-11-03 01:55:04,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:04,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:05,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:05,082 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:05,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217531157] [2022-11-03 01:55:05,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217531157] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:55:05,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110342279] [2022-11-03 01:55:05,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:55:05,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:55:05,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:55:05,086 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:55:05,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2022-11-03 01:55:05,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:55:05,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:55:05,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 01:55:05,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:55:05,858 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 15 treesize of output 11 [2022-11-03 01:55:05,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:05,937 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 18 treesize of output 20 [2022-11-03 01:55:06,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:06,056 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 18 treesize of output 20 [2022-11-03 01:55:06,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:06,135 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 18 treesize of output 20 [2022-11-03 01:55:06,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:06,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:55:06,579 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:55:06,579 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 32 treesize of output 33 [2022-11-03 01:55:06,595 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:55:06,596 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 309 treesize of output 297 [2022-11-03 01:55:06,603 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 282 treesize of output 270 [2022-11-03 01:55:06,612 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 270 treesize of output 246 [2022-11-03 01:55:06,620 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 246 treesize of output 198 [2022-11-03 01:55:07,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:07,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110342279] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:55:07,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [619551359] [2022-11-03 01:55:07,090 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 01:55:07,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:55:07,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-03 01:55:07,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274041527] [2022-11-03 01:55:07,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:55:07,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 01:55:07,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:07,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 01:55:07,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=545, Unknown=6, NotChecked=0, Total=650 [2022-11-03 01:55:07,092 INFO L87 Difference]: Start difference. First operand 11375 states and 48153 transitions. Second operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 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 01:55:07,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:07,448 INFO L93 Difference]: Finished difference Result 12040 states and 50116 transitions. [2022-11-03 01:55:07,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 01:55:07,449 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 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 14 [2022-11-03 01:55:07,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:07,500 INFO L225 Difference]: With dead ends: 12040 [2022-11-03 01:55:07,500 INFO L226 Difference]: Without dead ends: 12040 [2022-11-03 01:55:07,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=117, Invalid=633, Unknown=6, NotChecked=0, Total=756 [2022-11-03 01:55:07,500 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 59 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 336 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:07,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 79 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 196 Invalid, 0 Unknown, 336 Unchecked, 0.2s Time] [2022-11-03 01:55:07,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12040 states. [2022-11-03 01:55:07,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12040 to 11355. [2022-11-03 01:55:07,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11355 states, 11235 states have (on average 4.277525589675123) internal successors, (48058), 11354 states have internal predecessors, (48058), 0 states have call successors, (0), 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 01:55:07,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11355 states to 11355 states and 48058 transitions. [2022-11-03 01:55:07,780 INFO L78 Accepts]: Start accepts. Automaton has 11355 states and 48058 transitions. Word has length 14 [2022-11-03 01:55:07,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:07,780 INFO L495 AbstractCegarLoop]: Abstraction has 11355 states and 48058 transitions. [2022-11-03 01:55:07,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 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 01:55:07,780 INFO L276 IsEmpty]: Start isEmpty. Operand 11355 states and 48058 transitions. [2022-11-03 01:55:07,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:55:07,783 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:07,783 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:07,816 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Forceful destruction successful, exit code 0 [2022-11-03 01:55:07,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 85 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable105 [2022-11-03 01:55:07,984 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:55:07,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:07,984 INFO L85 PathProgramCache]: Analyzing trace with hash -596430490, now seen corresponding path program 1 times [2022-11-03 01:55:07,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:07,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151338782] [2022-11-03 01:55:07,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:07,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:09,483 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 01:55:09,483 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:09,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151338782] [2022-11-03 01:55:09,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151338782] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:55:09,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754606134] [2022-11-03 01:55:09,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:09,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:55:09,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:55:09,489 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:55:09,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2022-11-03 01:55:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:10,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-03 01:55:10,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:55:10,308 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 16 treesize of output 12 [2022-11-03 01:55:10,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 01:55:10,453 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:55:10,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 01:55:10,541 INFO L356 Elim1Store]: treesize reduction 64, result has 28.9 percent of original size [2022-11-03 01:55:10,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 47 [2022-11-03 01:55:10,644 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:55:10,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2022-11-03 01:55:10,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:10,759 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 50 treesize of output 44 [2022-11-03 01:55:10,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:10,876 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 50 treesize of output 44 [2022-11-03 01:55:11,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:11,005 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 50 treesize of output 44 [2022-11-03 01:55:11,262 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 01:55:11,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:55:11,358 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4783 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_4783) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 4294967296)) is different from false [2022-11-03 01:55:11,369 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4782 (Array Int Int)) (v_ArrVal_4783 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4782) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_4783) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 4294967296)) is different from false [2022-11-03 01:55:12,117 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:55:12,117 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 5 case distinctions, treesize of input 64 treesize of output 85 [2022-11-03 01:55:12,161 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:55:12,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 665 treesize of output 657 [2022-11-03 01:55:12,176 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 574 treesize of output 478 [2022-11-03 01:55:12,193 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 478 treesize of output 454 [2022-11-03 01:55:12,211 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 454 treesize of output 406 [2022-11-03 01:55:12,995 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 01:55:12,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754606134] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:55:12,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1401785652] [2022-11-03 01:55:12,996 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 01:55:12,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:55:12,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-03 01:55:12,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442667994] [2022-11-03 01:55:12,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:55:12,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 01:55:12,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:12,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 01:55:12,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=728, Unknown=12, NotChecked=114, Total=992 [2022-11-03 01:55:12,998 INFO L87 Difference]: Start difference. First operand 11355 states and 48058 transitions. Second operand has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:55:17,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:17,804 INFO L93 Difference]: Finished difference Result 23797 states and 96724 transitions. [2022-11-03 01:55:17,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-03 01:55:17,805 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:55:17,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:17,914 INFO L225 Difference]: With dead ends: 23797 [2022-11-03 01:55:17,914 INFO L226 Difference]: Without dead ends: 23797 [2022-11-03 01:55:17,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=377, Invalid=1863, Unknown=24, NotChecked=186, Total=2450 [2022-11-03 01:55:17,915 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 341 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 2033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 606 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:17,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 146 Invalid, 2033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1398 Invalid, 0 Unknown, 606 Unchecked, 1.8s Time] [2022-11-03 01:55:17,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23797 states. [2022-11-03 01:55:18,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23797 to 10351. [2022-11-03 01:55:18,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10351 states, 10231 states have (on average 4.228814387645391) internal successors, (43265), 10350 states have internal predecessors, (43265), 0 states have call successors, (0), 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 01:55:18,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10351 states to 10351 states and 43265 transitions. [2022-11-03 01:55:18,322 INFO L78 Accepts]: Start accepts. Automaton has 10351 states and 43265 transitions. Word has length 15 [2022-11-03 01:55:18,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:18,322 INFO L495 AbstractCegarLoop]: Abstraction has 10351 states and 43265 transitions. [2022-11-03 01:55:18,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:55:18,323 INFO L276 IsEmpty]: Start isEmpty. Operand 10351 states and 43265 transitions. [2022-11-03 01:55:18,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:55:18,325 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:18,325 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:18,356 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Forceful destruction successful, exit code 0 [2022-11-03 01:55:18,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106,86 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:55:18,526 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:55:18,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:18,526 INFO L85 PathProgramCache]: Analyzing trace with hash 561317826, now seen corresponding path program 4 times [2022-11-03 01:55:18,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:18,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237513054] [2022-11-03 01:55:18,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:18,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:20,338 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:20,338 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:20,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237513054] [2022-11-03 01:55:20,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237513054] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:55:20,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286721026] [2022-11-03 01:55:20,339 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:55:20,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:55:20,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:55:20,340 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:55:20,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2022-11-03 01:55:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:21,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-03 01:55:21,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:55:21,170 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 16 treesize of output 12 [2022-11-03 01:55:21,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-11-03 01:55:21,321 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:55:21,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-03 01:55:21,443 INFO L356 Elim1Store]: treesize reduction 48, result has 48.9 percent of original size [2022-11-03 01:55:21,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 66 [2022-11-03 01:55:21,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:21,628 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 45 treesize of output 41 [2022-11-03 01:55:21,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:21,774 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 45 treesize of output 41 [2022-11-03 01:55:21,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:21,899 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 45 treesize of output 41 [2022-11-03 01:55:22,198 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:22,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:55:23,299 INFO L356 Elim1Store]: treesize reduction 66, result has 55.4 percent of original size [2022-11-03 01:55:23,299 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 4 case distinctions, treesize of input 56 treesize of output 103 [2022-11-03 01:55:23,353 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:55:23,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1366 treesize of output 1354 [2022-11-03 01:55:23,380 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 1214 treesize of output 1102 [2022-11-03 01:55:23,410 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 1102 treesize of output 1046 [2022-11-03 01:55:23,444 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 1046 treesize of output 822 [2022-11-03 01:55:27,355 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:27,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286721026] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:55:27,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [223134864] [2022-11-03 01:55:27,355 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 01:55:27,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:55:27,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-03 01:55:27,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199203283] [2022-11-03 01:55:27,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:55:27,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 01:55:27,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:27,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 01:55:27,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1004, Unknown=38, NotChecked=0, Total=1190 [2022-11-03 01:55:27,357 INFO L87 Difference]: Start difference. First operand 10351 states and 43265 transitions. Second operand has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:55:28,764 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1))) (and (or (forall ((v_ArrVal_4852 (Array Int Int)) (v_ArrVal_4853 (Array Int Int)) (v_ArrVal_4854 (Array Int Int)) (|v_thread3Thread1of1ForFork1_~i~2#1_237| Int)) (or (not (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_237| 1) c_~N~0)) (< |v_thread3Thread1of1ForFork1_~i~2#1_237| 0) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_4852) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4853) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_4854) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_237| 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (forall ((v_ArrVal_4852 (Array Int Int)) (v_ArrVal_4853 (Array Int Int)) (v_ArrVal_4854 (Array Int Int)) (v_ArrVal_4850 Int) (|v_thread3Thread1of1ForFork1_~i~2#1_237| Int)) (or (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse0 .cse1 v_ArrVal_4850)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_4852) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4853) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_4854) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_237| 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (< 2147483647 v_ArrVal_4850) (not (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_237| 1) c_~N~0)) (< |v_thread3Thread1of1ForFork1_~i~2#1_237| 0))) (< .cse2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (forall ((v_ArrVal_4848 Int) (v_ArrVal_4852 (Array Int Int)) (v_ArrVal_4853 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_372| Int) (v_ArrVal_4854 (Array Int Int)) (v_ArrVal_4850 Int) (|v_thread3Thread1of1ForFork1_~i~2#1_237| Int)) (or (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store .cse0 .cse1 v_ArrVal_4848) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_372| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_4850)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_4852) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4853) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_4854) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_237| 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (< 2147483647 v_ArrVal_4848) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_372| .cse2)) (< 2147483647 v_ArrVal_4850) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_372| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_237| 1) c_~N~0)) (< |v_thread3Thread1of1ForFork1_~i~2#1_237| 0))))) is different from false [2022-11-03 01:55:30,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:30,657 INFO L93 Difference]: Finished difference Result 12396 states and 51873 transitions. [2022-11-03 01:55:30,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-03 01:55:30,658 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:55:30,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:30,708 INFO L225 Difference]: With dead ends: 12396 [2022-11-03 01:55:30,708 INFO L226 Difference]: Without dead ends: 12396 [2022-11-03 01:55:30,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=338, Invalid=2370, Unknown=52, NotChecked=102, Total=2862 [2022-11-03 01:55:30,709 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 179 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 2053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1202 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:30,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 405 Invalid, 2053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 838 Invalid, 0 Unknown, 1202 Unchecked, 1.0s Time] [2022-11-03 01:55:30,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2022-11-03 01:55:30,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 11269. [2022-11-03 01:55:30,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11269 states, 11149 states have (on average 4.32325769127276) internal successors, (48200), 11268 states have internal predecessors, (48200), 0 states have call successors, (0), 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 01:55:30,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11269 states to 11269 states and 48200 transitions. [2022-11-03 01:55:30,985 INFO L78 Accepts]: Start accepts. Automaton has 11269 states and 48200 transitions. Word has length 15 [2022-11-03 01:55:30,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:30,985 INFO L495 AbstractCegarLoop]: Abstraction has 11269 states and 48200 transitions. [2022-11-03 01:55:30,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:55:30,986 INFO L276 IsEmpty]: Start isEmpty. Operand 11269 states and 48200 transitions. [2022-11-03 01:55:30,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:55:30,989 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:30,989 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:31,017 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Ended with exit code 0 [2022-11-03 01:55:31,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 87 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable107 [2022-11-03 01:55:31,189 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:55:31,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:31,190 INFO L85 PathProgramCache]: Analyzing trace with hash 561317833, now seen corresponding path program 3 times [2022-11-03 01:55:31,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:31,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637260986] [2022-11-03 01:55:31,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:31,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:32,755 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:32,755 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:32,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637260986] [2022-11-03 01:55:32,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637260986] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:55:32,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044485870] [2022-11-03 01:55:32,755 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:55:32,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:55:32,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:55:32,756 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:55:32,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2022-11-03 01:55:33,459 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:55:33,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:55:33,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-03 01:55:33,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:55:33,570 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 16 treesize of output 12 [2022-11-03 01:55:33,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-11-03 01:55:33,703 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:55:33,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2022-11-03 01:55:33,828 INFO L356 Elim1Store]: treesize reduction 48, result has 48.9 percent of original size [2022-11-03 01:55:33,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 72 [2022-11-03 01:55:34,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:34,011 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 53 treesize of output 49 [2022-11-03 01:55:34,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:34,135 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 53 treesize of output 49 [2022-11-03 01:55:34,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:34,256 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 53 treesize of output 49 [2022-11-03 01:55:34,542 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:34,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:55:34,685 WARN L833 $PredicateComparison]: unable to prove that (or (not (< (+ c_~M~0 1) c_~N~0)) (forall ((v_ArrVal_4925 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_4925) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0) 4)) 9223372039002259456)))) is different from false [2022-11-03 01:55:34,703 WARN L833 $PredicateComparison]: unable to prove that (or (not (< (+ c_~M~0 1) c_~N~0)) (forall ((v_ArrVal_4924 (Array Int Int)) (v_ArrVal_4925 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4924) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_4925) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0) 4)) 9223372039002259456)))) is different from false [2022-11-03 01:55:35,264 INFO L356 Elim1Store]: treesize reduction 66, result has 55.4 percent of original size [2022-11-03 01:55:35,264 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 4 case distinctions, treesize of input 58 treesize of output 105 [2022-11-03 01:55:35,333 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:55:35,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 428 treesize of output 470 [2022-11-03 01:55:35,358 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 328 treesize of output 272 [2022-11-03 01:55:35,381 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 272 treesize of output 258 [2022-11-03 01:55:35,402 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 258 treesize of output 230 [2022-11-03 01:55:36,382 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:36,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044485870] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:55:36,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1577539782] [2022-11-03 01:55:36,383 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 01:55:36,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:55:36,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-03 01:55:36,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199322136] [2022-11-03 01:55:36,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:55:36,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 01:55:36,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:36,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 01:55:36,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=887, Unknown=17, NotChecked=126, Total=1190 [2022-11-03 01:55:36,384 INFO L87 Difference]: Start difference. First operand 11269 states and 48200 transitions. Second operand has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:55:37,294 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_4922 Int) (~M~0 Int) (v_ArrVal_4920 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_382| Int) (v_ArrVal_4923 (Array Int Int)) (v_ArrVal_4924 (Array Int Int)) (v_ArrVal_4925 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store .cse0 .cse1 v_ArrVal_4920) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_382| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_4922)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_4923) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4924) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_4925) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (< (+ v_ArrVal_4920 2147483648) 0) (< (+ v_ArrVal_4922 2147483648) 0) (< ~M~0 0) (not (< (+ ~M~0 1) c_~N~0)) (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_382| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_382| .cse2)))) (or (< .cse2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((v_ArrVal_4922 Int) (~M~0 Int) (v_ArrVal_4923 (Array Int Int)) (v_ArrVal_4924 (Array Int Int)) (v_ArrVal_4925 (Array Int Int))) (or (< (+ v_ArrVal_4922 2147483648) 0) (< ~M~0 0) (not (< (+ ~M~0 1) c_~N~0)) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse0 .cse1 v_ArrVal_4922)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_4923) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4924) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_4925) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))))) (or (forall ((~M~0 Int) (v_ArrVal_4923 (Array Int Int)) (v_ArrVal_4924 (Array Int Int)) (v_ArrVal_4925 (Array Int Int))) (or (< ~M~0 0) (not (< (+ ~M~0 1) c_~N~0)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_4923) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4924) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_4925) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)))) is different from false [2022-11-03 01:55:40,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:40,718 INFO L93 Difference]: Finished difference Result 17685 states and 77591 transitions. [2022-11-03 01:55:40,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-03 01:55:40,719 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:55:40,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:40,798 INFO L225 Difference]: With dead ends: 17685 [2022-11-03 01:55:40,799 INFO L226 Difference]: Without dead ends: 17685 [2022-11-03 01:55:40,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=381, Invalid=2057, Unknown=24, NotChecked=294, Total=2756 [2022-11-03 01:55:40,799 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 483 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 2141 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 4608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2418 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:40,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 361 Invalid, 4608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2141 Invalid, 0 Unknown, 2418 Unchecked, 2.4s Time] [2022-11-03 01:55:40,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17685 states. [2022-11-03 01:55:41,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17685 to 13923. [2022-11-03 01:55:41,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13923 states, 13803 states have (on average 4.532927624429472) internal successors, (62568), 13922 states have internal predecessors, (62568), 0 states have call successors, (0), 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 01:55:41,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13923 states to 13923 states and 62568 transitions. [2022-11-03 01:55:41,213 INFO L78 Accepts]: Start accepts. Automaton has 13923 states and 62568 transitions. Word has length 15 [2022-11-03 01:55:41,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:41,213 INFO L495 AbstractCegarLoop]: Abstraction has 13923 states and 62568 transitions. [2022-11-03 01:55:41,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:55:41,213 INFO L276 IsEmpty]: Start isEmpty. Operand 13923 states and 62568 transitions. [2022-11-03 01:55:41,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:55:41,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:41,216 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:41,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Forceful destruction successful, exit code 0 [2022-11-03 01:55:41,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,88 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:55:41,417 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:55:41,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:41,417 INFO L85 PathProgramCache]: Analyzing trace with hash 193508847, now seen corresponding path program 1 times [2022-11-03 01:55:41,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:41,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805004842] [2022-11-03 01:55:41,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:41,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:42,928 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 01:55:42,929 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:42,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805004842] [2022-11-03 01:55:42,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805004842] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:55:42,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562147271] [2022-11-03 01:55:42,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:42,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:55:42,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:55:42,930 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:55:42,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2022-11-03 01:55:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:43,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-03 01:55:43,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:55:43,765 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 11 treesize of output 7 [2022-11-03 01:55:43,839 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-11-03 01:55:43,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2022-11-03 01:55:43,921 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:55:43,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2022-11-03 01:55:44,008 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:55:44,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2022-11-03 01:55:44,111 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:55:44,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 64 [2022-11-03 01:55:44,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:44,219 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 60 treesize of output 54 [2022-11-03 01:55:44,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:44,337 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 60 treesize of output 54 [2022-11-03 01:55:44,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:44,477 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 60 treesize of output 54 [2022-11-03 01:55:44,646 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 01:55:44,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:55:44,738 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4998 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_4998) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 9223372039002259456))) is different from false [2022-11-03 01:55:44,755 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4997 (Array Int Int)) (v_ArrVal_4998 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4997) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_4998) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) 9223372039002259456))) is different from false [2022-11-03 01:55:45,544 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:55:45,544 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 5 case distinctions, treesize of input 66 treesize of output 87 [2022-11-03 01:55:45,583 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:55:45,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 399 treesize of output 407 [2022-11-03 01:55:45,599 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 157 treesize of output 133 [2022-11-03 01:55:45,613 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 290 treesize of output 278 [2022-11-03 01:55:45,628 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 278 treesize of output 230 [2022-11-03 01:55:46,115 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 01:55:46,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562147271] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:55:46,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [315063476] [2022-11-03 01:55:46,116 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 01:55:46,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:55:46,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-03 01:55:46,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009522907] [2022-11-03 01:55:46,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:55:46,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 01:55:46,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:46,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 01:55:46,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=731, Unknown=12, NotChecked=114, Total=992 [2022-11-03 01:55:46,117 INFO L87 Difference]: Start difference. First operand 13923 states and 62568 transitions. Second operand has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:55:50,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:50,832 INFO L93 Difference]: Finished difference Result 31758 states and 137043 transitions. [2022-11-03 01:55:50,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-03 01:55:50,833 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:55:50,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:50,962 INFO L225 Difference]: With dead ends: 31758 [2022-11-03 01:55:50,963 INFO L226 Difference]: Without dead ends: 31758 [2022-11-03 01:55:50,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=365, Invalid=1967, Unknown=28, NotChecked=190, Total=2550 [2022-11-03 01:55:50,963 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 343 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 1673 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 2389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 689 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:50,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 167 Invalid, 2389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1673 Invalid, 0 Unknown, 689 Unchecked, 1.9s Time] [2022-11-03 01:55:50,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31758 states. [2022-11-03 01:55:51,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31758 to 15166. [2022-11-03 01:55:51,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15166 states, 15046 states have (on average 4.477203243386946) internal successors, (67364), 15165 states have internal predecessors, (67364), 0 states have call successors, (0), 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 01:55:51,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15166 states to 15166 states and 67364 transitions. [2022-11-03 01:55:51,601 INFO L78 Accepts]: Start accepts. Automaton has 15166 states and 67364 transitions. Word has length 15 [2022-11-03 01:55:51,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:51,601 INFO L495 AbstractCegarLoop]: Abstraction has 15166 states and 67364 transitions. [2022-11-03 01:55:51,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:55:51,601 INFO L276 IsEmpty]: Start isEmpty. Operand 15166 states and 67364 transitions. [2022-11-03 01:55:51,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:55:51,604 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:51,604 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:51,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Forceful destruction successful, exit code 0 [2022-11-03 01:55:51,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109,89 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:55:51,805 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:55:51,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:51,807 INFO L85 PathProgramCache]: Analyzing trace with hash 142681186, now seen corresponding path program 4 times [2022-11-03 01:55:51,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:51,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921412894] [2022-11-03 01:55:51,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:51,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:52,090 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:52,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921412894] [2022-11-03 01:55:52,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921412894] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:55:52,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315412049] [2022-11-03 01:55:52,090 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:55:52,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:55:52,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:55:52,091 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:55:52,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2022-11-03 01:55:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:52,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 01:55:52,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:55:52,806 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 13 treesize of output 9 [2022-11-03 01:55:52,845 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 01:55:52,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-11-03 01:55:52,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:52,878 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 18 treesize of output 20 [2022-11-03 01:55:52,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:52,907 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 18 treesize of output 20 [2022-11-03 01:55:52,963 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:52,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:55:53,045 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5056 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5056) c_~A~0.base) (+ c_~A~0.offset 8)) 9223372039002259456))) is different from false [2022-11-03 01:55:53,053 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5055 (Array Int Int)) (v_ArrVal_5056 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5055) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5056) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2022-11-03 01:55:53,059 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5055 (Array Int Int)) (v_ArrVal_5056 (Array Int Int)) (v_ArrVal_5054 Int)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_5054)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5055) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5056) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-03 01:55:53,079 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-03 01:55:53,079 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 2 case distinctions, treesize of input 36 treesize of output 42 [2022-11-03 01:55:53,087 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:55:53,087 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 159 treesize of output 149 [2022-11-03 01:55:53,091 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 134 treesize of output 126 [2022-11-03 01:55:53,094 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 126 treesize of output 110 [2022-11-03 01:55:53,184 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-03 01:55:53,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315412049] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:55:53,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1214446700] [2022-11-03 01:55:53,184 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 01:55:53,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:55:53,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-11-03 01:55:53,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316689609] [2022-11-03 01:55:53,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:55:53,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-03 01:55:53,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:53,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-03 01:55:53,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=483, Unknown=3, NotChecked=138, Total=702 [2022-11-03 01:55:53,186 INFO L87 Difference]: Start difference. First operand 15166 states and 67364 transitions. Second operand has 27 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 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 01:55:54,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:54,796 INFO L93 Difference]: Finished difference Result 20243 states and 85789 transitions. [2022-11-03 01:55:54,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 01:55:54,797 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:55:54,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:54,868 INFO L225 Difference]: With dead ends: 20243 [2022-11-03 01:55:54,868 INFO L226 Difference]: Without dead ends: 20243 [2022-11-03 01:55:54,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=870, Unknown=3, NotChecked=192, Total=1260 [2022-11-03 01:55:54,869 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 313 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 1837 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 2326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 452 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:54,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 168 Invalid, 2326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1837 Invalid, 0 Unknown, 452 Unchecked, 1.2s Time] [2022-11-03 01:55:54,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20243 states. [2022-11-03 01:55:55,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20243 to 15376. [2022-11-03 01:55:55,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15376 states, 15256 states have (on average 4.480859989512323) internal successors, (68360), 15375 states have internal predecessors, (68360), 0 states have call successors, (0), 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 01:55:55,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15376 states to 15376 states and 68360 transitions. [2022-11-03 01:55:55,247 INFO L78 Accepts]: Start accepts. Automaton has 15376 states and 68360 transitions. Word has length 15 [2022-11-03 01:55:55,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:55,248 INFO L495 AbstractCegarLoop]: Abstraction has 15376 states and 68360 transitions. [2022-11-03 01:55:55,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 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 01:55:55,248 INFO L276 IsEmpty]: Start isEmpty. Operand 15376 states and 68360 transitions. [2022-11-03 01:55:55,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:55:55,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:55,251 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:55,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Forceful destruction successful, exit code 0 [2022-11-03 01:55:55,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,90 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:55:55,452 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:55:55,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:55,452 INFO L85 PathProgramCache]: Analyzing trace with hash 142681227, now seen corresponding path program 2 times [2022-11-03 01:55:55,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:55,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580207077] [2022-11-03 01:55:55,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:55,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:55,791 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:55,791 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:55,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580207077] [2022-11-03 01:55:55,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580207077] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:55:55,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923903525] [2022-11-03 01:55:55,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:55:55,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:55:55,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:55:55,793 INFO L229 MonitoredProcess]: Starting monitored process 91 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:55:55,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2022-11-03 01:55:56,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 01:55:56,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:55:56,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 01:55:56,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:55:56,603 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 13 treesize of output 9 [2022-11-03 01:55:56,643 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-03 01:55:56,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-11-03 01:55:56,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:56,702 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 20 treesize of output 22 [2022-11-03 01:55:56,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:55:56,744 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 20 treesize of output 22 [2022-11-03 01:55:56,881 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:56,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:55:57,005 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_5114 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5114) c_~A~0.base) (+ c_~A~0.offset 8)) 4294967296)) (not (< 2 c_~M~0))) is different from false [2022-11-03 01:55:57,131 INFO L356 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-03 01:55:57,131 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 2 case distinctions, treesize of input 34 treesize of output 49 [2022-11-03 01:55:57,140 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:55:57,140 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 151 treesize of output 141 [2022-11-03 01:55:57,145 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 118 treesize of output 102 [2022-11-03 01:55:57,152 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 55 treesize of output 47 [2022-11-03 01:55:57,335 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:55:57,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923903525] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:55:57,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1779417037] [2022-11-03 01:55:57,336 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 01:55:57,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:55:57,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-03 01:55:57,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514304528] [2022-11-03 01:55:57,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:55:57,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 01:55:57,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:57,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 01:55:57,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=828, Unknown=2, NotChecked=58, Total=992 [2022-11-03 01:55:57,337 INFO L87 Difference]: Start difference. First operand 15376 states and 68360 transitions. Second operand has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:56:02,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:02,737 INFO L93 Difference]: Finished difference Result 20797 states and 87249 transitions. [2022-11-03 01:56:02,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-03 01:56:02,737 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:56:02,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:02,810 INFO L225 Difference]: With dead ends: 20797 [2022-11-03 01:56:02,810 INFO L226 Difference]: Without dead ends: 20797 [2022-11-03 01:56:02,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 14 SyntacticMatches, 16 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=776, Invalid=3782, Unknown=2, NotChecked=132, Total=4692 [2022-11-03 01:56:02,811 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 1233 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 3244 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1233 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 3749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 3244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 374 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:02,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1233 Valid, 287 Invalid, 3749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 3244 Invalid, 0 Unknown, 374 Unchecked, 2.4s Time] [2022-11-03 01:56:02,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20797 states. [2022-11-03 01:56:03,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20797 to 15376. [2022-11-03 01:56:03,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15376 states, 15256 states have (on average 4.47535395909806) internal successors, (68276), 15375 states have internal predecessors, (68276), 0 states have call successors, (0), 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 01:56:03,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15376 states to 15376 states and 68276 transitions. [2022-11-03 01:56:03,183 INFO L78 Accepts]: Start accepts. Automaton has 15376 states and 68276 transitions. Word has length 15 [2022-11-03 01:56:03,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:03,183 INFO L495 AbstractCegarLoop]: Abstraction has 15376 states and 68276 transitions. [2022-11-03 01:56:03,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:56:03,183 INFO L276 IsEmpty]: Start isEmpty. Operand 15376 states and 68276 transitions. [2022-11-03 01:56:03,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:56:03,186 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:03,186 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2022-11-03 01:56:03,217 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Forceful destruction successful, exit code 0 [2022-11-03 01:56:03,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 91 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable111 [2022-11-03 01:56:03,386 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:56:03,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:03,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1062360653, now seen corresponding path program 4 times [2022-11-03 01:56:03,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:03,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067856254] [2022-11-03 01:56:03,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:03,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:03,735 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:03,735 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:03,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067856254] [2022-11-03 01:56:03,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067856254] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:56:03,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574125546] [2022-11-03 01:56:03,735 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:56:03,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:03,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:56:03,736 INFO L229 MonitoredProcess]: Starting monitored process 92 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:56:03,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2022-11-03 01:56:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:04,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 01:56:04,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:56:04,463 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 13 treesize of output 9 [2022-11-03 01:56:04,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:04,491 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 18 treesize of output 20 [2022-11-03 01:56:04,581 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:04,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:56:04,689 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5165 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5165) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-03 01:56:04,697 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:56:04,697 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 26 treesize of output 27 [2022-11-03 01:56:04,703 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:56:04,703 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 43 treesize of output 39 [2022-11-03 01:56:04,734 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-03 01:56:04,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574125546] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:56:04,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [538012400] [2022-11-03 01:56:04,735 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 01:56:04,735 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:56:04,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-11-03 01:56:04,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003615474] [2022-11-03 01:56:04,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:56:04,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 01:56:04,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:04,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 01:56:04,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=530, Unknown=1, NotChecked=46, Total=650 [2022-11-03 01:56:04,736 INFO L87 Difference]: Start difference. First operand 15376 states and 68276 transitions. Second operand has 26 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:06,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:06,682 INFO L93 Difference]: Finished difference Result 21686 states and 91986 transitions. [2022-11-03 01:56:06,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-03 01:56:06,683 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:56:06,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:06,761 INFO L225 Difference]: With dead ends: 21686 [2022-11-03 01:56:06,761 INFO L226 Difference]: Without dead ends: 21686 [2022-11-03 01:56:06,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=198, Invalid=1287, Unknown=1, NotChecked=74, Total=1560 [2022-11-03 01:56:06,762 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 301 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 2733 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 2926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:06,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 237 Invalid, 2926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2733 Invalid, 0 Unknown, 156 Unchecked, 1.5s Time] [2022-11-03 01:56:06,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21686 states. [2022-11-03 01:56:07,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21686 to 15382. [2022-11-03 01:56:07,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15382 states, 15262 states have (on average 4.4747739483684965) internal successors, (68294), 15381 states have internal predecessors, (68294), 0 states have call successors, (0), 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 01:56:07,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15382 states to 15382 states and 68294 transitions. [2022-11-03 01:56:07,144 INFO L78 Accepts]: Start accepts. Automaton has 15382 states and 68294 transitions. Word has length 15 [2022-11-03 01:56:07,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:07,144 INFO L495 AbstractCegarLoop]: Abstraction has 15382 states and 68294 transitions. [2022-11-03 01:56:07,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:07,144 INFO L276 IsEmpty]: Start isEmpty. Operand 15382 states and 68294 transitions. [2022-11-03 01:56:07,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:56:07,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:07,147 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2022-11-03 01:56:07,174 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Forceful destruction successful, exit code 0 [2022-11-03 01:56:07,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 92 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable112 [2022-11-03 01:56:07,348 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:56:07,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:07,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1062360634, now seen corresponding path program 4 times [2022-11-03 01:56:07,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:07,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511515498] [2022-11-03 01:56:07,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:07,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:07,779 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:07,779 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:07,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511515498] [2022-11-03 01:56:07,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511515498] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:56:07,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206368077] [2022-11-03 01:56:07,780 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:56:07,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:07,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:56:07,781 INFO L229 MonitoredProcess]: Starting monitored process 93 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:56:07,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2022-11-03 01:56:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:08,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 01:56:08,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:56:08,511 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 13 treesize of output 9 [2022-11-03 01:56:08,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:08,540 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 16 treesize of output 18 [2022-11-03 01:56:08,668 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:08,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:56:08,792 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5216 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5216) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-03 01:56:08,799 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:56:08,799 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 24 treesize of output 25 [2022-11-03 01:56:08,805 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:56:08,805 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 37 treesize of output 33 [2022-11-03 01:56:08,919 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-03 01:56:08,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206368077] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:56:08,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2075069358] [2022-11-03 01:56:08,919 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 01:56:08,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:56:08,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-03 01:56:08,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280024515] [2022-11-03 01:56:08,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:56:08,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 01:56:08,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:08,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 01:56:08,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=841, Unknown=1, NotChecked=58, Total=992 [2022-11-03 01:56:08,921 INFO L87 Difference]: Start difference. First operand 15382 states and 68294 transitions. Second operand has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:56:11,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:11,416 INFO L93 Difference]: Finished difference Result 21683 states and 91980 transitions. [2022-11-03 01:56:11,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 01:56:11,416 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:56:11,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:11,494 INFO L225 Difference]: With dead ends: 21683 [2022-11-03 01:56:11,494 INFO L226 Difference]: Without dead ends: 21683 [2022-11-03 01:56:11,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=262, Invalid=2093, Unknown=1, NotChecked=94, Total=2450 [2022-11-03 01:56:11,495 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 303 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 3174 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 3409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 202 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:11,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 289 Invalid, 3409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3174 Invalid, 0 Unknown, 202 Unchecked, 1.7s Time] [2022-11-03 01:56:11,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21683 states. [2022-11-03 01:56:11,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21683 to 15382. [2022-11-03 01:56:11,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15382 states, 15262 states have (on average 4.4745773817324075) internal successors, (68291), 15381 states have internal predecessors, (68291), 0 states have call successors, (0), 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 01:56:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15382 states to 15382 states and 68291 transitions. [2022-11-03 01:56:11,871 INFO L78 Accepts]: Start accepts. Automaton has 15382 states and 68291 transitions. Word has length 15 [2022-11-03 01:56:11,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:11,871 INFO L495 AbstractCegarLoop]: Abstraction has 15382 states and 68291 transitions. [2022-11-03 01:56:11,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:56:11,871 INFO L276 IsEmpty]: Start isEmpty. Operand 15382 states and 68291 transitions. [2022-11-03 01:56:11,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:56:11,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:11,874 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:11,906 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Forceful destruction successful, exit code 0 [2022-11-03 01:56:12,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 93 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable113 [2022-11-03 01:56:12,075 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:56:12,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:12,075 INFO L85 PathProgramCache]: Analyzing trace with hash 836659409, now seen corresponding path program 6 times [2022-11-03 01:56:12,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:12,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872896945] [2022-11-03 01:56:12,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:12,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:12,796 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 01:56:12,796 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:12,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872896945] [2022-11-03 01:56:12,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872896945] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:56:12,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756980797] [2022-11-03 01:56:12,797 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:56:12,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:12,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:56:12,798 INFO L229 MonitoredProcess]: Starting monitored process 94 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:56:12,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2022-11-03 01:56:13,457 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:56:13,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:56:13,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 01:56:13,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:56:13,540 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 13 treesize of output 9 [2022-11-03 01:56:13,596 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-03 01:56:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-11-03 01:56:13,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:13,703 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 27 treesize of output 27 [2022-11-03 01:56:13,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:13,793 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 27 treesize of output 27 [2022-11-03 01:56:13,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:13,886 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 27 treesize of output 27 [2022-11-03 01:56:14,063 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:14,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:56:14,533 INFO L356 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-03 01:56:14,533 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 2 case distinctions, treesize of input 40 treesize of output 55 [2022-11-03 01:56:14,578 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:56:14,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 184 treesize of output 199 [2022-11-03 01:56:14,587 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 143 treesize of output 115 [2022-11-03 01:56:14,597 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 60 treesize of output 53 [2022-11-03 01:56:14,606 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 108 treesize of output 94 [2022-11-03 01:56:15,172 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 01:56:15,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756980797] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:56:15,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [616929426] [2022-11-03 01:56:15,173 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 01:56:15,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:56:15,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-03 01:56:15,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434318036] [2022-11-03 01:56:15,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:56:15,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 01:56:15,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:15,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 01:56:15,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=713, Unknown=6, NotChecked=0, Total=812 [2022-11-03 01:56:15,175 INFO L87 Difference]: Start difference. First operand 15382 states and 68291 transitions. Second operand has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:56:16,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:16,875 INFO L93 Difference]: Finished difference Result 19234 states and 83761 transitions. [2022-11-03 01:56:16,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 01:56:16,875 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:56:16,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:16,942 INFO L225 Difference]: With dead ends: 19234 [2022-11-03 01:56:16,942 INFO L226 Difference]: Without dead ends: 19234 [2022-11-03 01:56:16,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=216, Invalid=1582, Unknown=8, NotChecked=0, Total=1806 [2022-11-03 01:56:16,943 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 183 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 604 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:16,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 179 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 437 Invalid, 0 Unknown, 604 Unchecked, 0.4s Time] [2022-11-03 01:56:16,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19234 states. [2022-11-03 01:56:17,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19234 to 16903. [2022-11-03 01:56:17,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16903 states, 16783 states have (on average 4.583387952094381) internal successors, (76923), 16902 states have internal predecessors, (76923), 0 states have call successors, (0), 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 01:56:17,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16903 states to 16903 states and 76923 transitions. [2022-11-03 01:56:17,312 INFO L78 Accepts]: Start accepts. Automaton has 16903 states and 76923 transitions. Word has length 15 [2022-11-03 01:56:17,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:17,312 INFO L495 AbstractCegarLoop]: Abstraction has 16903 states and 76923 transitions. [2022-11-03 01:56:17,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:56:17,313 INFO L276 IsEmpty]: Start isEmpty. Operand 16903 states and 76923 transitions. [2022-11-03 01:56:17,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:56:17,315 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:17,315 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:17,348 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Forceful destruction successful, exit code 0 [2022-11-03 01:56:17,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 94 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable114 [2022-11-03 01:56:17,516 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:56:17,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:17,516 INFO L85 PathProgramCache]: Analyzing trace with hash 836768219, now seen corresponding path program 7 times [2022-11-03 01:56:17,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:17,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704062260] [2022-11-03 01:56:17,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:17,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:18,379 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 01:56:18,379 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:18,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704062260] [2022-11-03 01:56:18,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704062260] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:56:18,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31869147] [2022-11-03 01:56:18,379 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:56:18,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:18,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:56:18,380 INFO L229 MonitoredProcess]: Starting monitored process 95 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:56:18,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2022-11-03 01:56:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:19,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 01:56:19,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:56:19,125 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 13 treesize of output 9 [2022-11-03 01:56:19,181 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-03 01:56:19,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-11-03 01:56:19,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:19,295 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 27 treesize of output 27 [2022-11-03 01:56:19,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:19,374 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 27 treesize of output 27 [2022-11-03 01:56:19,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:19,470 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 27 treesize of output 27 [2022-11-03 01:56:19,646 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:19,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:56:20,114 INFO L356 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-03 01:56:20,114 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 2 case distinctions, treesize of input 40 treesize of output 55 [2022-11-03 01:56:20,136 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:56:20,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 346 treesize of output 352 [2022-11-03 01:56:20,146 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 296 treesize of output 240 [2022-11-03 01:56:20,158 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 120 treesize of output 106 [2022-11-03 01:56:20,169 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 226 treesize of output 198 [2022-11-03 01:56:20,709 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 01:56:20,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31869147] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:56:20,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1690162208] [2022-11-03 01:56:20,710 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 01:56:20,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:56:20,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-03 01:56:20,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714092772] [2022-11-03 01:56:20,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:56:20,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 01:56:20,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:20,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 01:56:20,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=711, Unknown=8, NotChecked=0, Total=812 [2022-11-03 01:56:20,711 INFO L87 Difference]: Start difference. First operand 16903 states and 76923 transitions. Second operand has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:56:22,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:22,736 INFO L93 Difference]: Finished difference Result 19600 states and 89454 transitions. [2022-11-03 01:56:22,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-03 01:56:22,736 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:56:22,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:22,808 INFO L225 Difference]: With dead ends: 19600 [2022-11-03 01:56:22,808 INFO L226 Difference]: Without dead ends: 19600 [2022-11-03 01:56:22,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=229, Invalid=1741, Unknown=10, NotChecked=0, Total=1980 [2022-11-03 01:56:22,809 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 120 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 524 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:22,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 214 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 775 Invalid, 0 Unknown, 524 Unchecked, 0.7s Time] [2022-11-03 01:56:22,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19600 states. [2022-11-03 01:56:23,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19600 to 17557. [2022-11-03 01:56:23,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17557 states, 17437 states have (on average 4.648104605149968) internal successors, (81049), 17556 states have internal predecessors, (81049), 0 states have call successors, (0), 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 01:56:23,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17557 states to 17557 states and 81049 transitions. [2022-11-03 01:56:23,333 INFO L78 Accepts]: Start accepts. Automaton has 17557 states and 81049 transitions. Word has length 15 [2022-11-03 01:56:23,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:23,333 INFO L495 AbstractCegarLoop]: Abstraction has 17557 states and 81049 transitions. [2022-11-03 01:56:23,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:56:23,333 INFO L276 IsEmpty]: Start isEmpty. Operand 17557 states and 81049 transitions. [2022-11-03 01:56:23,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:56:23,337 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:23,337 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:23,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Forceful destruction successful, exit code 0 [2022-11-03 01:56:23,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 95 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable115 [2022-11-03 01:56:23,537 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:56:23,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:23,539 INFO L85 PathProgramCache]: Analyzing trace with hash 848790329, now seen corresponding path program 8 times [2022-11-03 01:56:23,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:23,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159918019] [2022-11-03 01:56:23,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:23,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:24,141 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 01:56:24,142 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:24,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159918019] [2022-11-03 01:56:24,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159918019] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:56:24,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690205806] [2022-11-03 01:56:24,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:56:24,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:24,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:56:24,143 INFO L229 MonitoredProcess]: Starting monitored process 96 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:56:24,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2022-11-03 01:56:24,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 01:56:24,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:56:24,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 01:56:24,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:56:25,024 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 13 treesize of output 9 [2022-11-03 01:56:25,079 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-03 01:56:25,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-11-03 01:56:25,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:25,184 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 27 treesize of output 27 [2022-11-03 01:56:25,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:25,257 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 27 treesize of output 27 [2022-11-03 01:56:25,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:25,340 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 27 treesize of output 27 [2022-11-03 01:56:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:25,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:56:25,870 INFO L356 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-03 01:56:25,870 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 2 case distinctions, treesize of input 40 treesize of output 55 [2022-11-03 01:56:25,894 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:56:25,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2614 treesize of output 2494 [2022-11-03 01:56:25,916 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 2438 treesize of output 2214 [2022-11-03 01:56:25,938 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 2214 treesize of output 2102 [2022-11-03 01:56:25,962 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 2102 treesize of output 1654 [2022-11-03 01:56:27,933 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 01:56:27,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690205806] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:56:27,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [23437522] [2022-11-03 01:56:27,933 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 01:56:27,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:56:27,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-03 01:56:27,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389916309] [2022-11-03 01:56:27,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:56:27,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 01:56:27,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:27,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 01:56:27,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=690, Unknown=4, NotChecked=0, Total=812 [2022-11-03 01:56:27,935 INFO L87 Difference]: Start difference. First operand 17557 states and 81049 transitions. Second operand has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:56:28,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:28,667 INFO L93 Difference]: Finished difference Result 19320 states and 87037 transitions. [2022-11-03 01:56:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 01:56:28,667 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:56:28,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:28,736 INFO L225 Difference]: With dead ends: 19320 [2022-11-03 01:56:28,736 INFO L226 Difference]: Without dead ends: 19320 [2022-11-03 01:56:28,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=146, Invalid=839, Unknown=7, NotChecked=0, Total=992 [2022-11-03 01:56:28,736 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 122 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 682 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:28,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 174 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 534 Invalid, 0 Unknown, 682 Unchecked, 0.4s Time] [2022-11-03 01:56:28,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19320 states. [2022-11-03 01:56:29,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19320 to 17709. [2022-11-03 01:56:29,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17709 states, 17589 states have (on average 4.664563079197226) internal successors, (82045), 17708 states have internal predecessors, (82045), 0 states have call successors, (0), 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 01:56:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17709 states to 17709 states and 82045 transitions. [2022-11-03 01:56:29,322 INFO L78 Accepts]: Start accepts. Automaton has 17709 states and 82045 transitions. Word has length 15 [2022-11-03 01:56:29,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:29,322 INFO L495 AbstractCegarLoop]: Abstraction has 17709 states and 82045 transitions. [2022-11-03 01:56:29,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:56:29,322 INFO L276 IsEmpty]: Start isEmpty. Operand 17709 states and 82045 transitions. [2022-11-03 01:56:29,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:56:29,325 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:29,325 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:29,332 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Forceful destruction successful, exit code 0 [2022-11-03 01:56:29,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable116 [2022-11-03 01:56:29,526 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:56:29,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:29,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1206210873, now seen corresponding path program 2 times [2022-11-03 01:56:29,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:29,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580950636] [2022-11-03 01:56:29,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:29,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:29,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:29,922 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:29,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580950636] [2022-11-03 01:56:29,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580950636] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:56:29,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377861875] [2022-11-03 01:56:29,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:56:29,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:29,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:56:29,925 INFO L229 MonitoredProcess]: Starting monitored process 97 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:56:29,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2022-11-03 01:56:30,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 01:56:30,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:56:30,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-03 01:56:30,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:56:30,800 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 15 treesize of output 11 [2022-11-03 01:56:30,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:30,864 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 20 treesize of output 22 [2022-11-03 01:56:30,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:30,921 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 20 treesize of output 22 [2022-11-03 01:56:31,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:31,018 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 20 treesize of output 22 [2022-11-03 01:56:31,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:31,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:56:31,519 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:56:31,520 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 34 treesize of output 35 [2022-11-03 01:56:31,530 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:56:31,530 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 343 treesize of output 331 [2022-11-03 01:56:31,550 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 314 treesize of output 266 [2022-11-03 01:56:31,560 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 133 treesize of output 121 [2022-11-03 01:56:31,568 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 254 treesize of output 230 [2022-11-03 01:56:32,024 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:32,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377861875] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:56:32,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [673313917] [2022-11-03 01:56:32,025 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 01:56:32,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:56:32,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-03 01:56:32,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143399102] [2022-11-03 01:56:32,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:56:32,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 01:56:32,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:32,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 01:56:32,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=880, Unknown=8, NotChecked=0, Total=992 [2022-11-03 01:56:32,027 INFO L87 Difference]: Start difference. First operand 17709 states and 82045 transitions. Second operand has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:56:33,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:33,092 INFO L93 Difference]: Finished difference Result 17840 states and 82612 transitions. [2022-11-03 01:56:33,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-03 01:56:33,093 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:56:33,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:33,155 INFO L225 Difference]: With dead ends: 17840 [2022-11-03 01:56:33,155 INFO L226 Difference]: Without dead ends: 17840 [2022-11-03 01:56:33,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=235, Invalid=1919, Unknown=8, NotChecked=0, Total=2162 [2022-11-03 01:56:33,156 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 28 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 301 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:33,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 178 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 314 Invalid, 0 Unknown, 301 Unchecked, 0.2s Time] [2022-11-03 01:56:33,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17840 states. [2022-11-03 01:56:33,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17840 to 17773. [2022-11-03 01:56:33,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17773 states, 17653 states have (on average 4.666005778054721) internal successors, (82369), 17772 states have internal predecessors, (82369), 0 states have call successors, (0), 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 01:56:33,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17773 states to 17773 states and 82369 transitions. [2022-11-03 01:56:33,620 INFO L78 Accepts]: Start accepts. Automaton has 17773 states and 82369 transitions. Word has length 15 [2022-11-03 01:56:33,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:33,620 INFO L495 AbstractCegarLoop]: Abstraction has 17773 states and 82369 transitions. [2022-11-03 01:56:33,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:56:33,620 INFO L276 IsEmpty]: Start isEmpty. Operand 17773 states and 82369 transitions. [2022-11-03 01:56:33,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:56:33,623 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:33,623 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:33,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Forceful destruction successful, exit code 0 [2022-11-03 01:56:33,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117,97 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:33,824 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:56:33,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:33,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1206210892, now seen corresponding path program 2 times [2022-11-03 01:56:33,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:33,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773377997] [2022-11-03 01:56:33,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:33,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:34,389 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:34,389 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:34,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773377997] [2022-11-03 01:56:34,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773377997] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:56:34,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018122300] [2022-11-03 01:56:34,390 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:56:34,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:34,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:56:34,391 INFO L229 MonitoredProcess]: Starting monitored process 98 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:56:34,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2022-11-03 01:56:35,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 01:56:35,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:56:35,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-03 01:56:35,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:56:35,227 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 15 treesize of output 11 [2022-11-03 01:56:35,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:35,289 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 18 treesize of output 20 [2022-11-03 01:56:35,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:35,352 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 18 treesize of output 20 [2022-11-03 01:56:35,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:35,448 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 18 treesize of output 20 [2022-11-03 01:56:35,580 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:35,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:56:35,962 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:56:35,962 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 32 treesize of output 33 [2022-11-03 01:56:35,971 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:56:35,972 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 309 treesize of output 297 [2022-11-03 01:56:35,980 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 146 treesize of output 134 [2022-11-03 01:56:35,987 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 270 treesize of output 222 [2022-11-03 01:56:35,993 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 222 treesize of output 198 [2022-11-03 01:56:36,593 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:36,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018122300] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:56:36,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [186497487] [2022-11-03 01:56:36,593 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 01:56:36,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:56:36,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-03 01:56:36,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671654327] [2022-11-03 01:56:36,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:56:36,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 01:56:36,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:36,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 01:56:36,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=875, Unknown=13, NotChecked=0, Total=992 [2022-11-03 01:56:36,595 INFO L87 Difference]: Start difference. First operand 17773 states and 82369 transitions. Second operand has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:56:37,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:37,886 INFO L93 Difference]: Finished difference Result 19327 states and 88415 transitions. [2022-11-03 01:56:37,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-03 01:56:37,887 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:56:37,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:37,958 INFO L225 Difference]: With dead ends: 19327 [2022-11-03 01:56:37,958 INFO L226 Difference]: Without dead ends: 19327 [2022-11-03 01:56:37,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=243, Invalid=2000, Unknown=13, NotChecked=0, Total=2256 [2022-11-03 01:56:37,959 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 76 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 431 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:37,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 232 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 622 Invalid, 0 Unknown, 431 Unchecked, 0.4s Time] [2022-11-03 01:56:37,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19327 states. [2022-11-03 01:56:38,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19327 to 18148. [2022-11-03 01:56:38,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18148 states, 18028 states have (on average 4.680774351009541) internal successors, (84385), 18147 states have internal predecessors, (84385), 0 states have call successors, (0), 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 01:56:38,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18148 states to 18148 states and 84385 transitions. [2022-11-03 01:56:38,580 INFO L78 Accepts]: Start accepts. Automaton has 18148 states and 84385 transitions. Word has length 15 [2022-11-03 01:56:38,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:38,580 INFO L495 AbstractCegarLoop]: Abstraction has 18148 states and 84385 transitions. [2022-11-03 01:56:38,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:56:38,580 INFO L276 IsEmpty]: Start isEmpty. Operand 18148 states and 84385 transitions. [2022-11-03 01:56:38,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:56:38,585 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:38,585 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:38,612 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Forceful destruction successful, exit code 0 [2022-11-03 01:56:38,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 98 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable118 [2022-11-03 01:56:38,786 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:56:38,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:38,786 INFO L85 PathProgramCache]: Analyzing trace with hash -746218637, now seen corresponding path program 9 times [2022-11-03 01:56:38,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:38,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960505740] [2022-11-03 01:56:38,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:38,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:39,602 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 01:56:39,602 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:39,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960505740] [2022-11-03 01:56:39,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960505740] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:56:39,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272048872] [2022-11-03 01:56:39,602 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:56:39,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:39,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:56:39,603 INFO L229 MonitoredProcess]: Starting monitored process 99 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:56:39,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2022-11-03 01:56:40,292 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:56:40,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:56:40,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 01:56:40,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:56:40,365 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 13 treesize of output 9 [2022-11-03 01:56:40,418 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-03 01:56:40,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-11-03 01:56:40,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:40,605 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 27 treesize of output 27 [2022-11-03 01:56:40,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:40,677 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 27 treesize of output 27 [2022-11-03 01:56:40,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:40,780 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 27 treesize of output 27 [2022-11-03 01:56:40,925 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:40,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:56:41,300 INFO L356 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-03 01:56:41,300 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 2 case distinctions, treesize of input 40 treesize of output 55 [2022-11-03 01:56:41,322 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:56:41,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 346 treesize of output 352 [2022-11-03 01:56:41,332 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 296 treesize of output 240 [2022-11-03 01:56:41,344 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 126 treesize of output 112 [2022-11-03 01:56:41,355 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 226 treesize of output 198 [2022-11-03 01:56:41,931 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 01:56:41,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272048872] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:56:41,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1950187368] [2022-11-03 01:56:41,931 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 01:56:41,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:56:41,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-03 01:56:41,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330049540] [2022-11-03 01:56:41,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:56:41,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 01:56:41,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:41,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 01:56:41,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=692, Unknown=4, NotChecked=0, Total=812 [2022-11-03 01:56:41,933 INFO L87 Difference]: Start difference. First operand 18148 states and 84385 transitions. Second operand has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:56:42,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:42,940 INFO L93 Difference]: Finished difference Result 21729 states and 101659 transitions. [2022-11-03 01:56:42,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 01:56:42,941 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:56:42,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:43,024 INFO L225 Difference]: With dead ends: 21729 [2022-11-03 01:56:43,025 INFO L226 Difference]: Without dead ends: 21729 [2022-11-03 01:56:43,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=156, Invalid=893, Unknown=7, NotChecked=0, Total=1056 [2022-11-03 01:56:43,025 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 158 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 443 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:43,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 148 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 639 Invalid, 0 Unknown, 443 Unchecked, 0.6s Time] [2022-11-03 01:56:43,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21729 states. [2022-11-03 01:56:43,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21729 to 20432. [2022-11-03 01:56:43,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20432 states, 20312 states have (on average 4.816660102402521) internal successors, (97836), 20431 states have internal predecessors, (97836), 0 states have call successors, (0), 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 01:56:43,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20432 states to 20432 states and 97836 transitions. [2022-11-03 01:56:43,797 INFO L78 Accepts]: Start accepts. Automaton has 20432 states and 97836 transitions. Word has length 15 [2022-11-03 01:56:43,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:43,798 INFO L495 AbstractCegarLoop]: Abstraction has 20432 states and 97836 transitions. [2022-11-03 01:56:43,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:56:43,798 INFO L276 IsEmpty]: Start isEmpty. Operand 20432 states and 97836 transitions. [2022-11-03 01:56:43,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:56:43,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:43,806 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:43,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Forceful destruction successful, exit code 0 [2022-11-03 01:56:44,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119,99 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:44,016 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:56:44,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:44,016 INFO L85 PathProgramCache]: Analyzing trace with hash -733777873, now seen corresponding path program 3 times [2022-11-03 01:56:44,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:44,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612801483] [2022-11-03 01:56:44,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:44,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:44,410 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:44,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:44,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612801483] [2022-11-03 01:56:44,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612801483] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:56:44,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838127619] [2022-11-03 01:56:44,411 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:56:44,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:44,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:56:44,412 INFO L229 MonitoredProcess]: Starting monitored process 100 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:56:44,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2022-11-03 01:56:45,123 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:56:45,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:56:45,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 01:56:45,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:56:45,214 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 13 treesize of output 9 [2022-11-03 01:56:45,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:45,254 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 18 treesize of output 20 [2022-11-03 01:56:45,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:45,297 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 18 treesize of output 20 [2022-11-03 01:56:45,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:45,365 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 18 treesize of output 20 [2022-11-03 01:56:45,418 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:45,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:56:45,489 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5623 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5623) c_~A~0.base) (+ c_~A~0.offset 8 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 9223372039002259456))) is different from false [2022-11-03 01:56:45,499 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5623 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5623) c_~A~0.base) (+ c_~A~0.offset 8)) 9223372039002259456))) is different from false [2022-11-03 01:56:45,504 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5622 (Array Int Int)) (v_ArrVal_5623 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5622) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5623) c_~A~0.base) (+ c_~A~0.offset 8)) 9223372039002259456))) is different from false [2022-11-03 01:56:45,514 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5622 (Array Int Int)) (v_ArrVal_5621 (Array Int Int)) (v_ArrVal_5623 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5621) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5622) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5623) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-11-03 01:56:45,525 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:56:45,525 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 32 treesize of output 33 [2022-11-03 01:56:45,533 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:56:45,534 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 311 treesize of output 301 [2022-11-03 01:56:45,540 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 286 treesize of output 254 [2022-11-03 01:56:45,550 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 127 treesize of output 119 [2022-11-03 01:56:45,557 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 246 treesize of output 230 [2022-11-03 01:56:45,987 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-03 01:56:45,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838127619] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:56:45,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [20655714] [2022-11-03 01:56:45,987 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 01:56:45,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:56:45,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2022-11-03 01:56:45,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562402816] [2022-11-03 01:56:45,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:56:45,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-03 01:56:45,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:45,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-03 01:56:45,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=487, Unknown=4, NotChecked=188, Total=756 [2022-11-03 01:56:45,989 INFO L87 Difference]: Start difference. First operand 20432 states and 97836 transitions. Second operand has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 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 01:56:48,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:48,405 INFO L93 Difference]: Finished difference Result 29006 states and 135837 transitions. [2022-11-03 01:56:48,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 01:56:48,405 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:56:48,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:48,524 INFO L225 Difference]: With dead ends: 29006 [2022-11-03 01:56:48,525 INFO L226 Difference]: Without dead ends: 29006 [2022-11-03 01:56:48,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=947, Unknown=4, NotChecked=268, Total=1406 [2022-11-03 01:56:48,525 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 555 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 2421 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 3295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 817 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:48,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 244 Invalid, 3295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2421 Invalid, 0 Unknown, 817 Unchecked, 1.7s Time] [2022-11-03 01:56:48,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29006 states. [2022-11-03 01:56:49,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29006 to 22860. [2022-11-03 01:56:49,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22860 states, 22740 states have (on average 4.920668425681618) internal successors, (111896), 22859 states have internal predecessors, (111896), 0 states have call successors, (0), 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 01:56:49,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22860 states to 22860 states and 111896 transitions. [2022-11-03 01:56:49,247 INFO L78 Accepts]: Start accepts. Automaton has 22860 states and 111896 transitions. Word has length 15 [2022-11-03 01:56:49,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:49,247 INFO L495 AbstractCegarLoop]: Abstraction has 22860 states and 111896 transitions. [2022-11-03 01:56:49,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 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 01:56:49,247 INFO L276 IsEmpty]: Start isEmpty. Operand 22860 states and 111896 transitions. [2022-11-03 01:56:49,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:56:49,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:49,252 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:49,275 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Ended with exit code 0 [2022-11-03 01:56:49,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,100 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:49,452 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:56:49,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:49,453 INFO L85 PathProgramCache]: Analyzing trace with hash -733777854, now seen corresponding path program 3 times [2022-11-03 01:56:49,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:49,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234557317] [2022-11-03 01:56:49,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:49,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:49,823 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:49,823 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:49,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234557317] [2022-11-03 01:56:49,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234557317] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:56:49,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577263833] [2022-11-03 01:56:49,824 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:56:49,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:49,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:56:49,825 INFO L229 MonitoredProcess]: Starting monitored process 101 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:56:49,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2022-11-03 01:56:50,520 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:56:50,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:56:50,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 01:56:50,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:56:50,619 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 13 treesize of output 9 [2022-11-03 01:56:50,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:50,864 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 16 treesize of output 18 [2022-11-03 01:56:50,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:50,904 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 16 treesize of output 18 [2022-11-03 01:56:50,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:56:50,978 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 16 treesize of output 18 [2022-11-03 01:56:51,061 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:56:51,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:56:51,147 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5680 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5680) c_~A~0.base) (+ c_~A~0.offset 8 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 4294967296)) is different from false [2022-11-03 01:56:51,157 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5680 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5680) c_~A~0.base) (+ c_~A~0.offset 8)) 4294967296)) is different from false [2022-11-03 01:56:51,162 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5679 (Array Int Int)) (v_ArrVal_5680 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5679) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5680) c_~A~0.base) (+ c_~A~0.offset 8)) 4294967296)) is different from false [2022-11-03 01:56:51,171 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5679 (Array Int Int)) (v_ArrVal_5678 (Array Int Int)) (v_ArrVal_5680 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5678) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5679) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5680) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-11-03 01:56:51,180 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:56:51,181 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 30 treesize of output 31 [2022-11-03 01:56:51,190 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:56:51,190 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 553 treesize of output 531 [2022-11-03 01:56:51,199 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 518 treesize of output 502 [2022-11-03 01:56:51,208 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 502 treesize of output 470 [2022-11-03 01:56:51,217 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 470 treesize of output 406 [2022-11-03 01:56:51,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-03 01:56:51,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577263833] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:56:51,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [182664182] [2022-11-03 01:56:51,932 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 01:56:51,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:56:51,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-03 01:56:51,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864436093] [2022-11-03 01:56:51,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:56:51,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 01:56:51,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:51,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 01:56:51,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=685, Unknown=4, NotChecked=220, Total=992 [2022-11-03 01:56:51,934 INFO L87 Difference]: Start difference. First operand 22860 states and 111896 transitions. Second operand has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:56:55,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:55,506 INFO L93 Difference]: Finished difference Result 27805 states and 130025 transitions. [2022-11-03 01:56:55,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 01:56:55,507 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:56:55,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:55,620 INFO L225 Difference]: With dead ends: 27805 [2022-11-03 01:56:55,620 INFO L226 Difference]: Without dead ends: 27805 [2022-11-03 01:56:55,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=226, Invalid=1508, Unknown=4, NotChecked=332, Total=2070 [2022-11-03 01:56:55,621 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 631 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 3324 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 4521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1134 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:55,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 330 Invalid, 4521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3324 Invalid, 0 Unknown, 1134 Unchecked, 2.2s Time] [2022-11-03 01:56:55,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27805 states. [2022-11-03 01:56:56,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27805 to 22454. [2022-11-03 01:56:56,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22454 states, 22334 states have (on average 4.865183128861825) internal successors, (108659), 22453 states have internal predecessors, (108659), 0 states have call successors, (0), 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 01:56:56,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22454 states to 22454 states and 108659 transitions. [2022-11-03 01:56:56,326 INFO L78 Accepts]: Start accepts. Automaton has 22454 states and 108659 transitions. Word has length 15 [2022-11-03 01:56:56,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:56,326 INFO L495 AbstractCegarLoop]: Abstraction has 22454 states and 108659 transitions. [2022-11-03 01:56:56,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:56:56,326 INFO L276 IsEmpty]: Start isEmpty. Operand 22454 states and 108659 transitions. [2022-11-03 01:56:56,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:56:56,331 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:56,332 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:56,358 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Ended with exit code 0 [2022-11-03 01:56:56,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121,101 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:56,532 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:56:56,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:56,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1447867263, now seen corresponding path program 1 times [2022-11-03 01:56:56,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:56,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500941758] [2022-11-03 01:56:56,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:56,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:56,656 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 01:56:56,656 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:56,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500941758] [2022-11-03 01:56:56,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500941758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:56,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:56,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:56:56,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41459725] [2022-11-03 01:56:56,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:56,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:56:56,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:56,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:56:56,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:56:56,657 INFO L87 Difference]: Start difference. First operand 22454 states and 108659 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:57,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:57,111 INFO L93 Difference]: Finished difference Result 21917 states and 106392 transitions. [2022-11-03 01:56:57,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:56:57,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:56:57,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:57,200 INFO L225 Difference]: With dead ends: 21917 [2022-11-03 01:56:57,200 INFO L226 Difference]: Without dead ends: 21917 [2022-11-03 01:56:57,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:56:57,200 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 87 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:57,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 9 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:57,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21917 states. [2022-11-03 01:56:57,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21917 to 21917. [2022-11-03 01:56:57,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21917 states, 21812 states have (on average 4.877682009902806) internal successors, (106392), 21916 states have internal predecessors, (106392), 0 states have call successors, (0), 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 01:56:57,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21917 states to 21917 states and 106392 transitions. [2022-11-03 01:56:57,979 INFO L78 Accepts]: Start accepts. Automaton has 21917 states and 106392 transitions. Word has length 15 [2022-11-03 01:56:57,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:57,979 INFO L495 AbstractCegarLoop]: Abstraction has 21917 states and 106392 transitions. [2022-11-03 01:56:57,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:57,980 INFO L276 IsEmpty]: Start isEmpty. Operand 21917 states and 106392 transitions. [2022-11-03 01:56:57,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:56:57,984 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:57,984 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:57,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2022-11-03 01:56:57,984 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:56:57,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:57,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1447867265, now seen corresponding path program 1 times [2022-11-03 01:56:57,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:57,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28768084] [2022-11-03 01:56:57,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:57,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:58,111 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 01:56:58,111 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:58,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28768084] [2022-11-03 01:56:58,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28768084] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:56:58,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:56:58,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:56:58,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101550403] [2022-11-03 01:56:58,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:56:58,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:56:58,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:58,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:56:58,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:56:58,112 INFO L87 Difference]: Start difference. First operand 21917 states and 106392 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:58,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:58,361 INFO L93 Difference]: Finished difference Result 21380 states and 104125 transitions. [2022-11-03 01:56:58,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:56:58,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:56:58,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:58,447 INFO L225 Difference]: With dead ends: 21380 [2022-11-03 01:56:58,447 INFO L226 Difference]: Without dead ends: 21376 [2022-11-03 01:56:58,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:56:58,448 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 101 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:58,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 7 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:56:58,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21376 states. [2022-11-03 01:56:59,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21376 to 20443. [2022-11-03 01:56:59,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20443 states, 20353 states have (on average 4.9438903355770645) internal successors, (100623), 20442 states have internal predecessors, (100623), 0 states have call successors, (0), 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 01:56:59,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20443 states to 20443 states and 100623 transitions. [2022-11-03 01:56:59,315 INFO L78 Accepts]: Start accepts. Automaton has 20443 states and 100623 transitions. Word has length 15 [2022-11-03 01:56:59,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:59,315 INFO L495 AbstractCegarLoop]: Abstraction has 20443 states and 100623 transitions. [2022-11-03 01:56:59,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:59,316 INFO L276 IsEmpty]: Start isEmpty. Operand 20443 states and 100623 transitions. [2022-11-03 01:56:59,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:56:59,322 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:59,322 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:59,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2022-11-03 01:56:59,322 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:56:59,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:59,322 INFO L85 PathProgramCache]: Analyzing trace with hash -240860348, now seen corresponding path program 6 times [2022-11-03 01:56:59,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:59,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298244008] [2022-11-03 01:56:59,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:59,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:00,279 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 01:57:00,279 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:00,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298244008] [2022-11-03 01:57:00,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298244008] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:57:00,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668044136] [2022-11-03 01:57:00,280 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:57:00,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:00,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:57:00,281 INFO L229 MonitoredProcess]: Starting monitored process 102 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:57:00,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2022-11-03 01:57:00,986 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:57:00,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:57:00,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-03 01:57:00,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:57:01,055 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 13 treesize of output 9 [2022-11-03 01:57:01,094 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 01:57:01,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 01:57:01,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:01,142 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 16 treesize of output 18 [2022-11-03 01:57:01,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:01,185 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 16 treesize of output 18 [2022-11-03 01:57:01,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:01,256 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 16 treesize of output 18 [2022-11-03 01:57:01,380 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 01:57:01,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:57:01,636 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5791 (Array Int Int)) (~M~0 Int) (v_ArrVal_5789 (Array Int Int)) (v_ArrVal_5790 (Array Int Int))) (or (< 0 ~M~0) (< ~M~0 0) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5789) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5790) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5791) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296))) is different from false [2022-11-03 01:57:01,650 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5791 (Array Int Int)) (~M~0 Int) (v_ArrVal_5787 Int) (v_ArrVal_5789 (Array Int Int)) (v_ArrVal_5790 (Array Int Int))) (or (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_5787)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5789) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5790) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5791) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (< 0 ~M~0) (< ~M~0 0))) is different from false [2022-11-03 01:57:01,674 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-03 01:57:01,675 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 2 case distinctions, treesize of input 40 treesize of output 46 [2022-11-03 01:57:01,685 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:57:01,686 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 649 treesize of output 619 [2022-11-03 01:57:01,696 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 301 treesize of output 273 [2022-11-03 01:57:01,705 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 574 treesize of output 462 [2022-11-03 01:57:01,714 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 462 treesize of output 406 [2022-11-03 01:57:01,913 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-03 01:57:01,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668044136] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:57:01,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1121171314] [2022-11-03 01:57:01,913 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 01:57:01,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:57:01,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2022-11-03 01:57:01,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786243841] [2022-11-03 01:57:01,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:57:01,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-03 01:57:01,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:01,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-03 01:57:01,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=886, Unknown=3, NotChecked=122, Total=1122 [2022-11-03 01:57:01,915 INFO L87 Difference]: Start difference. First operand 20443 states and 100623 transitions. Second operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 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 01:57:02,579 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (<= .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_ArrVal_5791 (Array Int Int)) (~M~0 Int) (v_ArrVal_5787 Int) (v_ArrVal_5789 (Array Int Int)) (v_ArrVal_5790 (Array Int Int))) (or (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse1 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_5787)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5789) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5790) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5791) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (< 0 ~M~0) (< ~M~0 0))) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= (select .cse1 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647))) is different from false [2022-11-03 01:57:10,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:10,933 INFO L93 Difference]: Finished difference Result 48577 states and 216223 transitions. [2022-11-03 01:57:10,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-11-03 01:57:10,933 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:57:10,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:11,138 INFO L225 Difference]: With dead ends: 48577 [2022-11-03 01:57:11,138 INFO L226 Difference]: Without dead ends: 48577 [2022-11-03 01:57:11,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 88 ConstructedPredicates, 3 IntricatePredicates, 3 DeprecatedPredicates, 2119 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1680, Invalid=5810, Unknown=4, NotChecked=516, Total=8010 [2022-11-03 01:57:11,139 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 1032 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 4261 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 5596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 4261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1197 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:11,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 272 Invalid, 5596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 4261 Invalid, 0 Unknown, 1197 Unchecked, 3.7s Time] [2022-11-03 01:57:11,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48577 states. [2022-11-03 01:57:12,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48577 to 23309. [2022-11-03 01:57:12,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23309 states, 23219 states have (on average 4.820965588526637) internal successors, (111938), 23308 states have internal predecessors, (111938), 0 states have call successors, (0), 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 01:57:12,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23309 states to 23309 states and 111938 transitions. [2022-11-03 01:57:12,387 INFO L78 Accepts]: Start accepts. Automaton has 23309 states and 111938 transitions. Word has length 15 [2022-11-03 01:57:12,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:12,387 INFO L495 AbstractCegarLoop]: Abstraction has 23309 states and 111938 transitions. [2022-11-03 01:57:12,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 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 01:57:12,388 INFO L276 IsEmpty]: Start isEmpty. Operand 23309 states and 111938 transitions. [2022-11-03 01:57:12,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:57:12,395 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:12,395 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:12,432 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Ended with exit code 0 [2022-11-03 01:57:12,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable124 [2022-11-03 01:57:12,618 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:57:12,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:12,619 INFO L85 PathProgramCache]: Analyzing trace with hash -240886388, now seen corresponding path program 7 times [2022-11-03 01:57:12,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:12,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349521552] [2022-11-03 01:57:12,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:12,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:12,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:13,212 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 01:57:13,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:13,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349521552] [2022-11-03 01:57:13,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349521552] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:57:13,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696419965] [2022-11-03 01:57:13,212 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:57:13,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:13,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:57:13,213 INFO L229 MonitoredProcess]: Starting monitored process 103 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:57:13,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2022-11-03 01:57:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:13,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-03 01:57:13,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:57:14,041 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 13 treesize of output 9 [2022-11-03 01:57:14,088 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 01:57:14,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 01:57:14,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:14,139 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 16 treesize of output 18 [2022-11-03 01:57:14,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:14,180 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 16 treesize of output 18 [2022-11-03 01:57:14,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:14,255 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 16 treesize of output 18 [2022-11-03 01:57:14,384 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 01:57:14,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:57:14,668 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5850 (Array Int Int)) (~M~0 Int) (v_ArrVal_5848 (Array Int Int)) (v_ArrVal_5849 (Array Int Int))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5848) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5849) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5850) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (< 0 ~M~0) (< ~M~0 0))) is different from false [2022-11-03 01:57:14,680 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5846 Int) (v_ArrVal_5850 (Array Int Int)) (~M~0 Int) (v_ArrVal_5848 (Array Int Int)) (v_ArrVal_5849 (Array Int Int))) (or (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_5846)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5848) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5849) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5850) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (< 0 ~M~0) (< ~M~0 0))) is different from false [2022-11-03 01:57:14,702 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-11-03 01:57:14,703 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 2 case distinctions, treesize of input 40 treesize of output 46 [2022-11-03 01:57:14,712 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:57:14,713 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 325 treesize of output 313 [2022-11-03 01:57:14,719 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 296 treesize of output 268 [2022-11-03 01:57:14,726 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 268 treesize of output 212 [2022-11-03 01:57:14,734 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 112 treesize of output 98 [2022-11-03 01:57:15,092 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-03 01:57:15,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696419965] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:57:15,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [263399655] [2022-11-03 01:57:15,093 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 01:57:15,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:57:15,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-03 01:57:15,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854119435] [2022-11-03 01:57:15,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:57:15,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 01:57:15,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:15,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 01:57:15,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=956, Unknown=4, NotChecked=126, Total=1190 [2022-11-03 01:57:15,094 INFO L87 Difference]: Start difference. First operand 23309 states and 111938 transitions. Second operand has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:57:15,703 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (not (= .cse0 4)) (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_ArrVal_5846 Int) (v_ArrVal_5850 (Array Int Int)) (~M~0 Int) (v_ArrVal_5848 (Array Int Int)) (v_ArrVal_5849 (Array Int Int))) (or (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse2 .cse0 v_ArrVal_5846)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5848) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5849) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_5850) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (< 0 ~M~0) (< ~M~0 0))) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (select .cse2 4) 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= (select .cse2 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) is different from false [2022-11-03 01:57:21,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:21,160 INFO L93 Difference]: Finished difference Result 41220 states and 182753 transitions. [2022-11-03 01:57:21,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-03 01:57:21,161 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:57:21,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:21,334 INFO L225 Difference]: With dead ends: 41220 [2022-11-03 01:57:21,334 INFO L226 Difference]: Without dead ends: 41220 [2022-11-03 01:57:21,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=578, Invalid=3211, Unknown=5, NotChecked=366, Total=4160 [2022-11-03 01:57:21,335 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 587 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 4094 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 4962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 4094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 815 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:21,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 301 Invalid, 4962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 4094 Invalid, 0 Unknown, 815 Unchecked, 2.9s Time] [2022-11-03 01:57:21,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41220 states. [2022-11-03 01:57:22,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41220 to 23854. [2022-11-03 01:57:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23854 states, 23764 states have (on average 4.861344891432418) internal successors, (115525), 23853 states have internal predecessors, (115525), 0 states have call successors, (0), 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 01:57:22,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23854 states to 23854 states and 115525 transitions. [2022-11-03 01:57:22,262 INFO L78 Accepts]: Start accepts. Automaton has 23854 states and 115525 transitions. Word has length 15 [2022-11-03 01:57:22,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:22,263 INFO L495 AbstractCegarLoop]: Abstraction has 23854 states and 115525 transitions. [2022-11-03 01:57:22,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:57:22,263 INFO L276 IsEmpty]: Start isEmpty. Operand 23854 states and 115525 transitions. [2022-11-03 01:57:22,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:57:22,269 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:22,270 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:22,304 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Ended with exit code 0 [2022-11-03 01:57:22,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 103 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable125 [2022-11-03 01:57:22,494 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:57:22,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:22,495 INFO L85 PathProgramCache]: Analyzing trace with hash -6767691, now seen corresponding path program 10 times [2022-11-03 01:57:22,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:22,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246180331] [2022-11-03 01:57:22,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:22,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:23,634 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 01:57:23,634 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:23,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246180331] [2022-11-03 01:57:23,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246180331] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:57:23,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288673268] [2022-11-03 01:57:23,635 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:57:23,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:23,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:57:23,636 INFO L229 MonitoredProcess]: Starting monitored process 104 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:57:23,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2022-11-03 01:57:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:24,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 01:57:24,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:57:24,440 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 13 treesize of output 9 [2022-11-03 01:57:24,488 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-03 01:57:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-11-03 01:57:24,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:24,600 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 27 treesize of output 27 [2022-11-03 01:57:24,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:24,696 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 27 treesize of output 27 [2022-11-03 01:57:24,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:24,780 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 27 treesize of output 27 [2022-11-03 01:57:24,929 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:24,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:57:25,323 INFO L356 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-03 01:57:25,324 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 2 case distinctions, treesize of input 40 treesize of output 55 [2022-11-03 01:57:25,346 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:57:25,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 346 treesize of output 352 [2022-11-03 01:57:25,356 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 296 treesize of output 268 [2022-11-03 01:57:25,367 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 268 treesize of output 212 [2022-11-03 01:57:25,380 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 112 treesize of output 98 [2022-11-03 01:57:25,948 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 01:57:25,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288673268] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:57:25,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2115800288] [2022-11-03 01:57:25,949 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 01:57:25,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:57:25,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-03 01:57:25,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370478469] [2022-11-03 01:57:25,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:57:25,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 01:57:25,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:25,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 01:57:25,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=700, Unknown=6, NotChecked=0, Total=812 [2022-11-03 01:57:25,950 INFO L87 Difference]: Start difference. First operand 23854 states and 115525 transitions. Second operand has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:57:26,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:26,683 INFO L93 Difference]: Finished difference Result 24119 states and 117106 transitions. [2022-11-03 01:57:26,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 01:57:26,683 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:57:26,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:26,778 INFO L225 Difference]: With dead ends: 24119 [2022-11-03 01:57:26,778 INFO L226 Difference]: Without dead ends: 24119 [2022-11-03 01:57:26,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=141, Invalid=843, Unknown=8, NotChecked=0, Total=992 [2022-11-03 01:57:26,778 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 344 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:26,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 190 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 174 Invalid, 0 Unknown, 344 Unchecked, 0.2s Time] [2022-11-03 01:57:26,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24119 states. [2022-11-03 01:57:27,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24119 to 24094. [2022-11-03 01:57:27,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24094 states, 24004 states have (on average 4.873812697883686) internal successors, (116991), 24093 states have internal predecessors, (116991), 0 states have call successors, (0), 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 01:57:27,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24094 states to 24094 states and 116991 transitions. [2022-11-03 01:57:27,355 INFO L78 Accepts]: Start accepts. Automaton has 24094 states and 116991 transitions. Word has length 15 [2022-11-03 01:57:27,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:27,356 INFO L495 AbstractCegarLoop]: Abstraction has 24094 states and 116991 transitions. [2022-11-03 01:57:27,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:57:27,356 INFO L276 IsEmpty]: Start isEmpty. Operand 24094 states and 116991 transitions. [2022-11-03 01:57:27,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:57:27,362 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:27,362 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:27,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Forceful destruction successful, exit code 0 [2022-11-03 01:57:27,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126,104 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:27,563 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:57:27,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:27,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1353541624, now seen corresponding path program 4 times [2022-11-03 01:57:27,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:27,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785985910] [2022-11-03 01:57:27,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:27,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:27,871 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:27,872 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:27,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785985910] [2022-11-03 01:57:27,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785985910] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:57:27,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698162599] [2022-11-03 01:57:27,872 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:57:27,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:27,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:57:27,874 INFO L229 MonitoredProcess]: Starting monitored process 105 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:57:27,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2022-11-03 01:57:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:28,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 01:57:28,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:57:28,713 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:28,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:57:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:28,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698162599] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:57:28,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1922492144] [2022-11-03 01:57:28,816 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 01:57:28,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:57:28,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-11-03 01:57:28,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948128159] [2022-11-03 01:57:28,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:57:28,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-03 01:57:28,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:28,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-03 01:57:28,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2022-11-03 01:57:28,819 INFO L87 Difference]: Start difference. First operand 24094 states and 116991 transitions. Second operand has 24 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 23 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:57:30,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:30,210 INFO L93 Difference]: Finished difference Result 24644 states and 114956 transitions. [2022-11-03 01:57:30,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-03 01:57:30,211 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 23 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:57:30,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:30,317 INFO L225 Difference]: With dead ends: 24644 [2022-11-03 01:57:30,317 INFO L226 Difference]: Without dead ends: 24628 [2022-11-03 01:57:30,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=464, Invalid=1176, Unknown=0, NotChecked=0, Total=1640 [2022-11-03 01:57:30,318 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 676 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:30,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 145 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1415 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-03 01:57:30,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24628 states. [2022-11-03 01:57:30,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24628 to 21944. [2022-11-03 01:57:30,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21944 states, 21854 states have (on average 4.792257710258991) internal successors, (104730), 21943 states have internal predecessors, (104730), 0 states have call successors, (0), 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 01:57:31,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21944 states to 21944 states and 104730 transitions. [2022-11-03 01:57:31,059 INFO L78 Accepts]: Start accepts. Automaton has 21944 states and 104730 transitions. Word has length 15 [2022-11-03 01:57:31,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:31,059 INFO L495 AbstractCegarLoop]: Abstraction has 21944 states and 104730 transitions. [2022-11-03 01:57:31,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 23 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:57:31,059 INFO L276 IsEmpty]: Start isEmpty. Operand 21944 states and 104730 transitions. [2022-11-03 01:57:31,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:57:31,065 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:31,065 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:31,090 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Forceful destruction successful, exit code 0 [2022-11-03 01:57:31,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127,105 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:31,270 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:57:31,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:31,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1392251113, now seen corresponding path program 11 times [2022-11-03 01:57:31,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:31,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237608436] [2022-11-03 01:57:31,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:31,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:32,051 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 01:57:32,051 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:32,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237608436] [2022-11-03 01:57:32,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237608436] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:57:32,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012294569] [2022-11-03 01:57:32,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:57:32,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:32,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:57:32,052 INFO L229 MonitoredProcess]: Starting monitored process 106 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:57:32,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2022-11-03 01:57:32,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 01:57:32,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:57:32,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 01:57:32,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:57:32,919 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 13 treesize of output 9 [2022-11-03 01:57:32,976 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-03 01:57:32,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-11-03 01:57:33,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:33,061 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 27 treesize of output 27 [2022-11-03 01:57:33,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:33,172 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 27 treesize of output 27 [2022-11-03 01:57:33,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:33,243 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 27 treesize of output 27 [2022-11-03 01:57:33,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:33,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:57:33,769 INFO L356 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-11-03 01:57:33,769 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 2 case distinctions, treesize of input 40 treesize of output 55 [2022-11-03 01:57:33,794 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:57:33,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 184 treesize of output 199 [2022-11-03 01:57:33,804 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 143 treesize of output 115 [2022-11-03 01:57:33,814 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 60 treesize of output 53 [2022-11-03 01:57:33,823 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 108 treesize of output 94 [2022-11-03 01:57:34,237 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 01:57:34,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012294569] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:57:34,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [155328575] [2022-11-03 01:57:34,237 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 01:57:34,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:57:34,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-03 01:57:34,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133809708] [2022-11-03 01:57:34,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:57:34,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 01:57:34,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:34,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 01:57:34,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=692, Unknown=4, NotChecked=0, Total=812 [2022-11-03 01:57:34,239 INFO L87 Difference]: Start difference. First operand 21944 states and 104730 transitions. Second operand has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:57:35,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:35,130 INFO L93 Difference]: Finished difference Result 23068 states and 108166 transitions. [2022-11-03 01:57:35,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 01:57:35,130 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:57:35,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:35,220 INFO L225 Difference]: With dead ends: 23068 [2022-11-03 01:57:35,220 INFO L226 Difference]: Without dead ends: 23068 [2022-11-03 01:57:35,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=145, Invalid=905, Unknown=6, NotChecked=0, Total=1056 [2022-11-03 01:57:35,221 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 79 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 307 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:35,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 193 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 450 Invalid, 0 Unknown, 307 Unchecked, 0.4s Time] [2022-11-03 01:57:35,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23068 states. [2022-11-03 01:57:35,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23068 to 21999. [2022-11-03 01:57:35,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21999 states, 21909 states have (on average 4.79465060020996) internal successors, (105046), 21998 states have internal predecessors, (105046), 0 states have call successors, (0), 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 01:57:35,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21999 states to 21999 states and 105046 transitions. [2022-11-03 01:57:35,764 INFO L78 Accepts]: Start accepts. Automaton has 21999 states and 105046 transitions. Word has length 15 [2022-11-03 01:57:35,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:35,764 INFO L495 AbstractCegarLoop]: Abstraction has 21999 states and 105046 transitions. [2022-11-03 01:57:35,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:57:35,764 INFO L276 IsEmpty]: Start isEmpty. Operand 21999 states and 105046 transitions. [2022-11-03 01:57:35,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:57:35,770 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:35,771 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:35,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Forceful destruction successful, exit code 0 [2022-11-03 01:57:35,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 106 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable128 [2022-11-03 01:57:35,971 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:57:35,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:35,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1288088019, now seen corresponding path program 1 times [2022-11-03 01:57:35,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:35,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103537693] [2022-11-03 01:57:35,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:35,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:36,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:36,563 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:36,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103537693] [2022-11-03 01:57:36,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103537693] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:57:36,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149225440] [2022-11-03 01:57:36,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:36,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:36,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:57:36,564 INFO L229 MonitoredProcess]: Starting monitored process 107 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:57:36,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2022-11-03 01:57:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:37,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 01:57:37,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:57:37,371 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 15 treesize of output 11 [2022-11-03 01:57:37,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:37,438 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 18 treesize of output 20 [2022-11-03 01:57:37,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:37,510 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 18 treesize of output 20 [2022-11-03 01:57:37,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:37,588 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 18 treesize of output 20 [2022-11-03 01:57:37,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:37,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:57:38,083 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:57:38,083 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 32 treesize of output 33 [2022-11-03 01:57:38,094 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:57:38,095 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 1233 treesize of output 1173 [2022-11-03 01:57:38,111 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 579 treesize of output 531 [2022-11-03 01:57:38,124 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 1110 treesize of output 1014 [2022-11-03 01:57:38,137 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 1014 treesize of output 822 [2022-11-03 01:57:39,423 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:39,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149225440] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:57:39,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [586676305] [2022-11-03 01:57:39,424 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 01:57:39,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:57:39,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-03 01:57:39,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352673781] [2022-11-03 01:57:39,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:57:39,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 01:57:39,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:39,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 01:57:39,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=558, Unknown=4, NotChecked=0, Total=650 [2022-11-03 01:57:39,425 INFO L87 Difference]: Start difference. First operand 21999 states and 105046 transitions. Second operand has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:57:40,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:40,227 INFO L93 Difference]: Finished difference Result 22651 states and 107051 transitions. [2022-11-03 01:57:40,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 01:57:40,228 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:57:40,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:40,323 INFO L225 Difference]: With dead ends: 22651 [2022-11-03 01:57:40,323 INFO L226 Difference]: Without dead ends: 22651 [2022-11-03 01:57:40,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=147, Invalid=971, Unknown=4, NotChecked=0, Total=1122 [2022-11-03 01:57:40,323 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 51 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:40,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 139 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 303 Invalid, 0 Unknown, 221 Unchecked, 0.2s Time] [2022-11-03 01:57:40,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22651 states. [2022-11-03 01:57:40,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22651 to 22003. [2022-11-03 01:57:40,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22003 states, 21913 states have (on average 4.79468808469858) internal successors, (105066), 22002 states have internal predecessors, (105066), 0 states have call successors, (0), 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 01:57:41,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22003 states to 22003 states and 105066 transitions. [2022-11-03 01:57:41,093 INFO L78 Accepts]: Start accepts. Automaton has 22003 states and 105066 transitions. Word has length 15 [2022-11-03 01:57:41,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:41,093 INFO L495 AbstractCegarLoop]: Abstraction has 22003 states and 105066 transitions. [2022-11-03 01:57:41,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:57:41,093 INFO L276 IsEmpty]: Start isEmpty. Operand 22003 states and 105066 transitions. [2022-11-03 01:57:41,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:57:41,101 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:41,101 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:41,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Forceful destruction successful, exit code 0 [2022-11-03 01:57:41,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129,107 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:41,326 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:57:41,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:41,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1287979209, now seen corresponding path program 2 times [2022-11-03 01:57:41,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:41,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758146805] [2022-11-03 01:57:41,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:41,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:41,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:41,762 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:41,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758146805] [2022-11-03 01:57:41,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758146805] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:57:41,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646468886] [2022-11-03 01:57:41,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:57:41,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:41,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:57:41,764 INFO L229 MonitoredProcess]: Starting monitored process 108 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:57:41,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2022-11-03 01:57:42,540 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:57:42,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:57:42,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 01:57:42,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:57:42,615 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 15 treesize of output 11 [2022-11-03 01:57:42,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:42,672 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 18 treesize of output 20 [2022-11-03 01:57:42,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:42,738 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 18 treesize of output 20 [2022-11-03 01:57:42,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:42,803 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 18 treesize of output 20 [2022-11-03 01:57:42,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:42,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:57:43,212 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:57:43,212 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 32 treesize of output 33 [2022-11-03 01:57:43,222 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:57:43,222 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 309 treesize of output 297 [2022-11-03 01:57:43,231 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 141 treesize of output 117 [2022-11-03 01:57:43,237 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 258 treesize of output 210 [2022-11-03 01:57:43,243 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 210 treesize of output 198 [2022-11-03 01:57:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:43,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646468886] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:57:43,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2054568953] [2022-11-03 01:57:43,855 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 01:57:43,855 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:57:43,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-03 01:57:43,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117802110] [2022-11-03 01:57:43,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:57:43,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 01:57:43,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:43,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 01:57:43,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=541, Unknown=4, NotChecked=0, Total=650 [2022-11-03 01:57:43,857 INFO L87 Difference]: Start difference. First operand 22003 states and 105066 transitions. Second operand has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:57:44,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:44,150 INFO L93 Difference]: Finished difference Result 22037 states and 105206 transitions. [2022-11-03 01:57:44,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 01:57:44,151 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:57:44,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:44,242 INFO L225 Difference]: With dead ends: 22037 [2022-11-03 01:57:44,243 INFO L226 Difference]: Without dead ends: 22037 [2022-11-03 01:57:44,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=629, Unknown=4, NotChecked=0, Total=756 [2022-11-03 01:57:44,243 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 11 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:44,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 77 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 166 Unchecked, 0.1s Time] [2022-11-03 01:57:44,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22037 states. [2022-11-03 01:57:44,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22037 to 22007. [2022-11-03 01:57:44,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22007 states, 21917 states have (on average 4.79472555550486) internal successors, (105086), 22006 states have internal predecessors, (105086), 0 states have call successors, (0), 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 01:57:45,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22007 states to 22007 states and 105086 transitions. [2022-11-03 01:57:45,039 INFO L78 Accepts]: Start accepts. Automaton has 22007 states and 105086 transitions. Word has length 15 [2022-11-03 01:57:45,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:45,039 INFO L495 AbstractCegarLoop]: Abstraction has 22007 states and 105086 transitions. [2022-11-03 01:57:45,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:57:45,039 INFO L276 IsEmpty]: Start isEmpty. Operand 22007 states and 105086 transitions. [2022-11-03 01:57:45,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:57:45,046 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:45,047 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:45,054 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Forceful destruction successful, exit code 0 [2022-11-03 01:57:45,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,108 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:45,247 INFO L420 AbstractCegarLoop]: === Iteration 132 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:57:45,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:45,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1275957099, now seen corresponding path program 3 times [2022-11-03 01:57:45,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:45,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181896879] [2022-11-03 01:57:45,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:45,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:45,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:45,811 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:45,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181896879] [2022-11-03 01:57:45,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181896879] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:57:45,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067325893] [2022-11-03 01:57:45,811 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:57:45,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:45,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:57:45,812 INFO L229 MonitoredProcess]: Starting monitored process 109 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:57:45,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2022-11-03 01:57:46,572 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:57:46,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:57:46,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 01:57:46,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:57:46,648 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 15 treesize of output 11 [2022-11-03 01:57:46,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:46,715 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 18 treesize of output 20 [2022-11-03 01:57:46,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:46,792 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 18 treesize of output 20 [2022-11-03 01:57:46,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:46,872 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 18 treesize of output 20 [2022-11-03 01:57:47,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:47,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:57:47,433 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:57:47,433 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 32 treesize of output 33 [2022-11-03 01:57:47,445 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:57:47,445 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 309 treesize of output 297 [2022-11-03 01:57:47,455 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 282 treesize of output 258 [2022-11-03 01:57:47,462 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 258 treesize of output 210 [2022-11-03 01:57:47,470 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 111 treesize of output 99 [2022-11-03 01:57:48,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:48,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067325893] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:57:48,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [609359120] [2022-11-03 01:57:48,067 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 01:57:48,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:57:48,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-03 01:57:48,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006412208] [2022-11-03 01:57:48,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:57:48,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 01:57:48,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:48,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 01:57:48,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=556, Unknown=6, NotChecked=0, Total=650 [2022-11-03 01:57:48,068 INFO L87 Difference]: Start difference. First operand 22007 states and 105086 transitions. Second operand has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:57:48,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:48,965 INFO L93 Difference]: Finished difference Result 22683 states and 107179 transitions. [2022-11-03 01:57:48,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 01:57:48,966 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:57:48,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:49,070 INFO L225 Difference]: With dead ends: 22683 [2022-11-03 01:57:49,070 INFO L226 Difference]: Without dead ends: 22683 [2022-11-03 01:57:49,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=147, Invalid=969, Unknown=6, NotChecked=0, Total=1122 [2022-11-03 01:57:49,071 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 42 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 252 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:49,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 191 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 293 Invalid, 0 Unknown, 252 Unchecked, 0.3s Time] [2022-11-03 01:57:49,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22683 states. [2022-11-03 01:57:49,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22683 to 22010. [2022-11-03 01:57:49,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22010 states, 21920 states have (on average 4.794662408759124) internal successors, (105099), 22009 states have internal predecessors, (105099), 0 states have call successors, (0), 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 01:57:49,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22010 states to 22010 states and 105099 transitions. [2022-11-03 01:57:49,893 INFO L78 Accepts]: Start accepts. Automaton has 22010 states and 105099 transitions. Word has length 15 [2022-11-03 01:57:49,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:49,893 INFO L495 AbstractCegarLoop]: Abstraction has 22010 states and 105099 transitions. [2022-11-03 01:57:49,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:57:49,894 INFO L276 IsEmpty]: Start isEmpty. Operand 22010 states and 105099 transitions. [2022-11-03 01:57:49,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:57:49,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:49,901 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:49,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Forceful destruction successful, exit code 0 [2022-11-03 01:57:50,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131,109 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:50,102 INFO L420 AbstractCegarLoop]: === Iteration 133 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:57:50,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:50,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1102722434, now seen corresponding path program 1 times [2022-11-03 01:57:50,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:50,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994656486] [2022-11-03 01:57:50,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:50,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:50,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:50,588 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:50,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994656486] [2022-11-03 01:57:50,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994656486] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:57:50,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419976771] [2022-11-03 01:57:50,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:50,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:50,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:57:50,589 INFO L229 MonitoredProcess]: Starting monitored process 110 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:57:50,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2022-11-03 01:57:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:51,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 01:57:51,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:57:51,437 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 15 treesize of output 11 [2022-11-03 01:57:51,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,519 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 18 treesize of output 20 [2022-11-03 01:57:51,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,595 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 18 treesize of output 20 [2022-11-03 01:57:51,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,687 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 18 treesize of output 20 [2022-11-03 01:57:51,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:51,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:57:52,470 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:57:52,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 32 treesize of output 33 [2022-11-03 01:57:52,482 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:57:52,482 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 309 treesize of output 297 [2022-11-03 01:57:52,490 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 282 treesize of output 234 [2022-11-03 01:57:52,500 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 122 treesize of output 110 [2022-11-03 01:57:52,508 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 222 treesize of output 198 [2022-11-03 01:57:52,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:52,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419976771] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:57:52,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [634576396] [2022-11-03 01:57:52,996 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 01:57:52,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:57:52,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-03 01:57:52,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202241663] [2022-11-03 01:57:52,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:57:52,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 01:57:52,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:52,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 01:57:52,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=558, Unknown=4, NotChecked=0, Total=650 [2022-11-03 01:57:52,998 INFO L87 Difference]: Start difference. First operand 22010 states and 105099 transitions. Second operand has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:57:53,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:53,784 INFO L93 Difference]: Finished difference Result 22720 states and 107410 transitions. [2022-11-03 01:57:53,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 01:57:53,784 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:57:53,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:53,875 INFO L225 Difference]: With dead ends: 22720 [2022-11-03 01:57:53,875 INFO L226 Difference]: Without dead ends: 22720 [2022-11-03 01:57:53,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=147, Invalid=971, Unknown=4, NotChecked=0, Total=1122 [2022-11-03 01:57:53,876 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:53,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 173 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 294 Invalid, 0 Unknown, 212 Unchecked, 0.2s Time] [2022-11-03 01:57:53,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22720 states. [2022-11-03 01:57:54,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22720 to 22022. [2022-11-03 01:57:54,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22022 states, 21932 states have (on average 4.794957140251687) internal successors, (105163), 22021 states have internal predecessors, (105163), 0 states have call successors, (0), 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 01:57:54,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22022 states to 22022 states and 105163 transitions. [2022-11-03 01:57:54,648 INFO L78 Accepts]: Start accepts. Automaton has 22022 states and 105163 transitions. Word has length 15 [2022-11-03 01:57:54,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:54,648 INFO L495 AbstractCegarLoop]: Abstraction has 22022 states and 105163 transitions. [2022-11-03 01:57:54,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:57:54,648 INFO L276 IsEmpty]: Start isEmpty. Operand 22022 states and 105163 transitions. [2022-11-03 01:57:54,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:57:54,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:54,656 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:54,679 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Forceful destruction successful, exit code 0 [2022-11-03 01:57:54,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132,110 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:54,856 INFO L420 AbstractCegarLoop]: === Iteration 134 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:57:54,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:54,857 INFO L85 PathProgramCache]: Analyzing trace with hash 985500017, now seen corresponding path program 4 times [2022-11-03 01:57:54,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:54,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127092190] [2022-11-03 01:57:54,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:54,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:55,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:55,425 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:55,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127092190] [2022-11-03 01:57:55,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127092190] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:57:55,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230241548] [2022-11-03 01:57:55,425 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:57:55,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:55,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:57:55,426 INFO L229 MonitoredProcess]: Starting monitored process 111 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:57:55,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2022-11-03 01:57:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:56,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 01:57:56,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:57:56,285 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 15 treesize of output 11 [2022-11-03 01:57:56,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:56,346 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 18 treesize of output 20 [2022-11-03 01:57:56,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:56,407 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 18 treesize of output 20 [2022-11-03 01:57:56,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:56,646 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 18 treesize of output 20 [2022-11-03 01:57:56,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:56,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:57:57,047 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:57:57,047 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 32 treesize of output 33 [2022-11-03 01:57:57,056 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:57:57,057 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 155 treesize of output 151 [2022-11-03 01:57:57,063 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 70 treesize of output 64 [2022-11-03 01:57:57,069 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 130 treesize of output 106 [2022-11-03 01:57:57,074 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 106 treesize of output 94 [2022-11-03 01:57:57,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:57,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230241548] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:57:57,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [580312594] [2022-11-03 01:57:57,311 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 01:57:57,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:57:57,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-03 01:57:57,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081551188] [2022-11-03 01:57:57,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:57:57,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 01:57:57,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:57,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 01:57:57,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=536, Unknown=9, NotChecked=0, Total=650 [2022-11-03 01:57:57,312 INFO L87 Difference]: Start difference. First operand 22022 states and 105163 transitions. Second operand has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:57:57,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:57,674 INFO L93 Difference]: Finished difference Result 22688 states and 107199 transitions. [2022-11-03 01:57:57,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 01:57:57,674 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:57:57,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:57,763 INFO L225 Difference]: With dead ends: 22688 [2022-11-03 01:57:57,764 INFO L226 Difference]: Without dead ends: 22688 [2022-11-03 01:57:57,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=624, Unknown=9, NotChecked=0, Total=756 [2022-11-03 01:57:57,764 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 33 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:57,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 67 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 172 Unchecked, 0.1s Time] [2022-11-03 01:57:57,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22688 states. [2022-11-03 01:57:58,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22688 to 22022. [2022-11-03 01:57:58,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22022 states, 21932 states have (on average 4.794957140251687) internal successors, (105163), 22021 states have internal predecessors, (105163), 0 states have call successors, (0), 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 01:57:58,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22022 states to 22022 states and 105163 transitions. [2022-11-03 01:57:58,540 INFO L78 Accepts]: Start accepts. Automaton has 22022 states and 105163 transitions. Word has length 15 [2022-11-03 01:57:58,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:58,540 INFO L495 AbstractCegarLoop]: Abstraction has 22022 states and 105163 transitions. [2022-11-03 01:57:58,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:57:58,540 INFO L276 IsEmpty]: Start isEmpty. Operand 22022 states and 105163 transitions. [2022-11-03 01:57:58,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:57:58,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:58,547 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:58,576 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Ended with exit code 0 [2022-11-03 01:57:58,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 111 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable133 [2022-11-03 01:57:58,748 INFO L420 AbstractCegarLoop]: === Iteration 135 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:57:58,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:58,749 INFO L85 PathProgramCache]: Analyzing trace with hash 978869117, now seen corresponding path program 5 times [2022-11-03 01:57:58,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:58,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631667434] [2022-11-03 01:57:58,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:58,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:59,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:57:59,400 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:59,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631667434] [2022-11-03 01:57:59,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631667434] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:57:59,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328766954] [2022-11-03 01:57:59,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:57:59,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:59,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:57:59,401 INFO L229 MonitoredProcess]: Starting monitored process 112 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:57:59,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2022-11-03 01:58:00,236 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:58:00,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:58:00,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 01:58:00,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:58:00,318 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 15 treesize of output 11 [2022-11-03 01:58:00,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:00,394 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 18 treesize of output 20 [2022-11-03 01:58:00,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:00,475 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 18 treesize of output 20 [2022-11-03 01:58:00,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:00,580 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 18 treesize of output 20 [2022-11-03 01:58:00,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:58:00,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:58:01,350 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:58:01,350 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 32 treesize of output 33 [2022-11-03 01:58:01,362 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:58:01,363 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 617 treesize of output 589 [2022-11-03 01:58:01,376 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 287 treesize of output 263 [2022-11-03 01:58:01,386 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 550 treesize of output 454 [2022-11-03 01:58:01,402 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 454 treesize of output 406 [2022-11-03 01:58:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:58:01,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328766954] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:58:01,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [428646053] [2022-11-03 01:58:01,796 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 01:58:01,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:58:01,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-03 01:58:01,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112495668] [2022-11-03 01:58:01,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:58:01,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 01:58:01,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:58:01,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 01:58:01,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=561, Unknown=4, NotChecked=0, Total=650 [2022-11-03 01:58:01,798 INFO L87 Difference]: Start difference. First operand 22022 states and 105163 transitions. Second operand has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:58:02,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:02,614 INFO L93 Difference]: Finished difference Result 22063 states and 105319 transitions. [2022-11-03 01:58:02,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 01:58:02,614 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:58:02,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:02,716 INFO L225 Difference]: With dead ends: 22063 [2022-11-03 01:58:02,716 INFO L226 Difference]: Without dead ends: 22063 [2022-11-03 01:58:02,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=150, Invalid=968, Unknown=4, NotChecked=0, Total=1122 [2022-11-03 01:58:02,717 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 25 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:02,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 93 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 170 Invalid, 0 Unknown, 130 Unchecked, 0.2s Time] [2022-11-03 01:58:02,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22063 states. [2022-11-03 01:58:03,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22063 to 22026. [2022-11-03 01:58:03,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22026 states, 21936 states have (on average 4.795176878191102) internal successors, (105187), 22025 states have internal predecessors, (105187), 0 states have call successors, (0), 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 01:58:03,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22026 states to 22026 states and 105187 transitions. [2022-11-03 01:58:03,514 INFO L78 Accepts]: Start accepts. Automaton has 22026 states and 105187 transitions. Word has length 15 [2022-11-03 01:58:03,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:03,514 INFO L495 AbstractCegarLoop]: Abstraction has 22026 states and 105187 transitions. [2022-11-03 01:58:03,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:58:03,515 INFO L276 IsEmpty]: Start isEmpty. Operand 22026 states and 105187 transitions. [2022-11-03 01:58:03,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:58:03,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:03,521 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:03,551 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Ended with exit code 0 [2022-11-03 01:58:03,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134,112 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:58:03,722 INFO L420 AbstractCegarLoop]: === Iteration 136 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:58:03,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:03,723 INFO L85 PathProgramCache]: Analyzing trace with hash 978934217, now seen corresponding path program 6 times [2022-11-03 01:58:03,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:03,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417768185] [2022-11-03 01:58:03,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:03,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:04,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:58:04,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:58:04,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417768185] [2022-11-03 01:58:04,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417768185] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:58:04,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930799924] [2022-11-03 01:58:04,409 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:58:04,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:58:04,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:58:04,410 INFO L229 MonitoredProcess]: Starting monitored process 113 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:58:04,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2022-11-03 01:58:05,270 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:58:05,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:58:05,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-03 01:58:05,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:58:05,280 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 18 treesize of output 16 [2022-11-03 01:58:05,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 01:58:05,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 01:58:05,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 01:58:05,801 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 18 treesize of output 20 [2022-11-03 01:58:05,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:58:05,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:58:06,314 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:58:06,314 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 32 treesize of output 33 [2022-11-03 01:58:06,326 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:58:06,326 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 155 treesize of output 151 [2022-11-03 01:58:06,334 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 136 treesize of output 112 [2022-11-03 01:58:06,343 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 58 treesize of output 52 [2022-11-03 01:58:06,351 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 106 treesize of output 94 [2022-11-03 01:58:06,756 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:58:06,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930799924] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:58:06,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [778304840] [2022-11-03 01:58:06,757 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 01:58:06,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:58:06,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-03 01:58:06,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210770612] [2022-11-03 01:58:06,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:58:06,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 01:58:06,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:58:06,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 01:58:06,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=545, Unknown=6, NotChecked=0, Total=650 [2022-11-03 01:58:06,760 INFO L87 Difference]: Start difference. First operand 22026 states and 105187 transitions. Second operand has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:58:07,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:07,426 INFO L93 Difference]: Finished difference Result 22667 states and 107129 transitions. [2022-11-03 01:58:07,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 01:58:07,426 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:58:07,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:07,555 INFO L225 Difference]: With dead ends: 22667 [2022-11-03 01:58:07,556 INFO L226 Difference]: Without dead ends: 22667 [2022-11-03 01:58:07,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=117, Invalid=633, Unknown=6, NotChecked=0, Total=756 [2022-11-03 01:58:07,556 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 33 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:07,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 99 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 351 Invalid, 0 Unknown, 273 Unchecked, 0.3s Time] [2022-11-03 01:58:07,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22667 states. [2022-11-03 01:58:08,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22667 to 22022. [2022-11-03 01:58:08,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22022 states, 21932 states have (on average 4.794957140251687) internal successors, (105163), 22021 states have internal predecessors, (105163), 0 states have call successors, (0), 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 01:58:08,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22022 states to 22022 states and 105163 transitions. [2022-11-03 01:58:08,399 INFO L78 Accepts]: Start accepts. Automaton has 22022 states and 105163 transitions. Word has length 15 [2022-11-03 01:58:08,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:08,399 INFO L495 AbstractCegarLoop]: Abstraction has 22022 states and 105163 transitions. [2022-11-03 01:58:08,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:58:08,399 INFO L276 IsEmpty]: Start isEmpty. Operand 22022 states and 105163 transitions. [2022-11-03 01:58:08,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:58:08,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:08,407 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:08,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Forceful destruction successful, exit code 0 [2022-11-03 01:58:08,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 113 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable135 [2022-11-03 01:58:08,607 INFO L420 AbstractCegarLoop]: === Iteration 137 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:58:08,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:08,608 INFO L85 PathProgramCache]: Analyzing trace with hash 991607172, now seen corresponding path program 2 times [2022-11-03 01:58:08,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:08,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119537654] [2022-11-03 01:58:08,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:08,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:09,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:58:09,199 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:58:09,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119537654] [2022-11-03 01:58:09,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119537654] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:58:09,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778054705] [2022-11-03 01:58:09,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:58:09,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:58:09,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:58:09,201 INFO L229 MonitoredProcess]: Starting monitored process 114 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:58:09,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2022-11-03 01:58:10,081 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:58:10,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:58:10,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 01:58:10,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:58:10,159 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 15 treesize of output 11 [2022-11-03 01:58:10,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:10,229 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 18 treesize of output 20 [2022-11-03 01:58:10,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:10,305 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 18 treesize of output 20 [2022-11-03 01:58:10,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:10,399 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 18 treesize of output 20 [2022-11-03 01:58:10,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:58:10,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:58:11,061 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:58:11,061 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 32 treesize of output 33 [2022-11-03 01:58:11,075 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:58:11,075 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 1233 treesize of output 1173 [2022-11-03 01:58:11,089 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 1158 treesize of output 1110 [2022-11-03 01:58:11,106 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 555 treesize of output 459 [2022-11-03 01:58:11,121 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 1014 treesize of output 822 [2022-11-03 01:58:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:58:13,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778054705] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:58:13,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1401672270] [2022-11-03 01:58:13,304 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 01:58:13,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:58:13,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-03 01:58:13,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242938674] [2022-11-03 01:58:13,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:58:13,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 01:58:13,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:58:13,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 01:58:13,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=539, Unknown=6, NotChecked=0, Total=650 [2022-11-03 01:58:13,306 INFO L87 Difference]: Start difference. First operand 22022 states and 105163 transitions. Second operand has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:58:13,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:13,819 INFO L93 Difference]: Finished difference Result 22690 states and 107243 transitions. [2022-11-03 01:58:13,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 01:58:13,820 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:58:13,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:13,924 INFO L225 Difference]: With dead ends: 22690 [2022-11-03 01:58:13,924 INFO L226 Difference]: Without dead ends: 22690 [2022-11-03 01:58:13,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=123, Invalid=627, Unknown=6, NotChecked=0, Total=756 [2022-11-03 01:58:13,925 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 35 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 202 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:13,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 78 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 259 Invalid, 0 Unknown, 202 Unchecked, 0.3s Time] [2022-11-03 01:58:13,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22690 states. [2022-11-03 01:58:14,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22690 to 22022. [2022-11-03 01:58:14,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22022 states, 21932 states have (on average 4.794957140251687) internal successors, (105163), 22021 states have internal predecessors, (105163), 0 states have call successors, (0), 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 01:58:14,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22022 states to 22022 states and 105163 transitions. [2022-11-03 01:58:14,599 INFO L78 Accepts]: Start accepts. Automaton has 22022 states and 105163 transitions. Word has length 15 [2022-11-03 01:58:14,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:14,599 INFO L495 AbstractCegarLoop]: Abstraction has 22022 states and 105163 transitions. [2022-11-03 01:58:14,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:58:14,599 INFO L276 IsEmpty]: Start isEmpty. Operand 22022 states and 105163 transitions. [2022-11-03 01:58:14,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:58:14,606 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:14,606 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:14,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Forceful destruction successful, exit code 0 [2022-11-03 01:58:14,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 114 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable136 [2022-11-03 01:58:14,806 INFO L420 AbstractCegarLoop]: === Iteration 138 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:58:14,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:14,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1892357546, now seen corresponding path program 1 times [2022-11-03 01:58:14,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:14,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652100768] [2022-11-03 01:58:14,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:14,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:15,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:58:15,476 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:58:15,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652100768] [2022-11-03 01:58:15,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652100768] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:58:15,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047529712] [2022-11-03 01:58:15,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:15,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:58:15,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:58:15,478 INFO L229 MonitoredProcess]: Starting monitored process 115 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:58:15,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2022-11-03 01:58:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:16,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-03 01:58:16,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:58:16,578 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 13 treesize of output 9 [2022-11-03 01:58:16,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:16,626 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 16 treesize of output 18 [2022-11-03 01:58:16,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:16,672 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 16 treesize of output 18 [2022-11-03 01:58:16,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:16,710 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 16 treesize of output 18 [2022-11-03 01:58:16,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:58:16,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:58:17,136 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6496 (Array Int Int)) (v_ArrVal_6495 (Array Int Int)) (~M~0 Int) (v_ArrVal_6494 (Array Int Int))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_6494) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_6495) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_6496) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (< 0 ~M~0) (< ~M~0 0))) is different from false [2022-11-03 01:58:17,147 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:58:17,147 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 33 treesize of output 34 [2022-11-03 01:58:17,158 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:58:17,158 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 163 treesize of output 160 [2022-11-03 01:58:17,163 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 143 treesize of output 115 [2022-11-03 01:58:17,169 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 115 treesize of output 101 [2022-11-03 01:58:17,176 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 53 treesize of output 46 [2022-11-03 01:58:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 01:58:17,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047529712] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:58:17,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1197130734] [2022-11-03 01:58:17,298 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 01:58:17,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:58:17,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-11-03 01:58:17,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404962061] [2022-11-03 01:58:17,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:58:17,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-03 01:58:17,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:58:17,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-03 01:58:17,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=689, Unknown=13, NotChecked=54, Total=870 [2022-11-03 01:58:17,302 INFO L87 Difference]: Start difference. First operand 22022 states and 105163 transitions. Second operand has 30 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 29 states have internal predecessors, (43), 0 states have call successors, (0), 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 01:58:23,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:23,711 INFO L93 Difference]: Finished difference Result 55588 states and 240717 transitions. [2022-11-03 01:58:23,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-03 01:58:23,712 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 29 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:58:23,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:24,009 INFO L225 Difference]: With dead ends: 55588 [2022-11-03 01:58:24,009 INFO L226 Difference]: Without dead ends: 55588 [2022-11-03 01:58:24,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1558 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1045, Invalid=4496, Unknown=13, NotChecked=146, Total=5700 [2022-11-03 01:58:24,010 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 864 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 3200 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 4067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 3200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 787 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:24,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 263 Invalid, 4067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 3200 Invalid, 0 Unknown, 787 Unchecked, 3.5s Time] [2022-11-03 01:58:24,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55588 states. [2022-11-03 01:58:25,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55588 to 21916. [2022-11-03 01:58:25,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21916 states, 21826 states have (on average 4.756666361220563) internal successors, (103819), 21915 states have internal predecessors, (103819), 0 states have call successors, (0), 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 01:58:25,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21916 states to 21916 states and 103819 transitions. [2022-11-03 01:58:25,220 INFO L78 Accepts]: Start accepts. Automaton has 21916 states and 103819 transitions. Word has length 15 [2022-11-03 01:58:25,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:25,221 INFO L495 AbstractCegarLoop]: Abstraction has 21916 states and 103819 transitions. [2022-11-03 01:58:25,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 29 states have internal predecessors, (43), 0 states have call successors, (0), 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 01:58:25,221 INFO L276 IsEmpty]: Start isEmpty. Operand 21916 states and 103819 transitions. [2022-11-03 01:58:25,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:58:25,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:25,228 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:25,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Forceful destruction successful, exit code 0 [2022-11-03 01:58:25,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137,115 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:58:25,428 INFO L420 AbstractCegarLoop]: === Iteration 139 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:58:25,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:25,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1960307066, now seen corresponding path program 2 times [2022-11-03 01:58:25,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:25,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747456369] [2022-11-03 01:58:25,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:25,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:26,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:58:26,162 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:58:26,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747456369] [2022-11-03 01:58:26,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747456369] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:58:26,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996563089] [2022-11-03 01:58:26,163 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:58:26,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:58:26,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:58:26,164 INFO L229 MonitoredProcess]: Starting monitored process 116 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:58:26,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2022-11-03 01:58:27,053 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:58:27,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:58:27,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 01:58:27,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:58:27,139 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 15 treesize of output 11 [2022-11-03 01:58:27,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:27,222 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 18 treesize of output 20 [2022-11-03 01:58:27,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:27,306 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 18 treesize of output 20 [2022-11-03 01:58:27,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:58:27,380 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 18 treesize of output 20 [2022-11-03 01:58:27,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:58:27,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:58:27,985 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:58:27,986 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 32 treesize of output 33 [2022-11-03 01:58:27,996 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:58:27,997 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 155 treesize of output 151 [2022-11-03 01:58:28,003 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 136 treesize of output 112 [2022-11-03 01:58:28,009 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 112 treesize of output 100 [2022-11-03 01:58:28,017 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 52 treesize of output 46 [2022-11-03 01:58:28,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:58:28,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996563089] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:58:28,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [260312234] [2022-11-03 01:58:28,417 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 01:58:28,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:58:28,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 26 [2022-11-03 01:58:28,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737480543] [2022-11-03 01:58:28,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:58:28,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-03 01:58:28,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:58:28,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-03 01:58:28,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=673, Unknown=3, NotChecked=0, Total=756 [2022-11-03 01:58:28,418 INFO L87 Difference]: Start difference. First operand 21916 states and 103819 transitions. Second operand has 28 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:58:29,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:29,402 INFO L93 Difference]: Finished difference Result 21980 states and 104042 transitions. [2022-11-03 01:58:29,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 01:58:29,403 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 01:58:29,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:29,505 INFO L225 Difference]: With dead ends: 21980 [2022-11-03 01:58:29,505 INFO L226 Difference]: Without dead ends: 21980 [2022-11-03 01:58:29,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=164, Invalid=1315, Unknown=3, NotChecked=0, Total=1482 [2022-11-03 01:58:29,505 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:29,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 170 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 100 Unchecked, 0.1s Time] [2022-11-03 01:58:29,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21980 states. [2022-11-03 01:58:30,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21980 to 21928. [2022-11-03 01:58:30,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21928 states, 21838 states have (on average 4.755609488048356) internal successors, (103853), 21927 states have internal predecessors, (103853), 0 states have call successors, (0), 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 01:58:30,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21928 states to 21928 states and 103853 transitions. [2022-11-03 01:58:30,289 INFO L78 Accepts]: Start accepts. Automaton has 21928 states and 103853 transitions. Word has length 15 [2022-11-03 01:58:30,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:30,290 INFO L495 AbstractCegarLoop]: Abstraction has 21928 states and 103853 transitions. [2022-11-03 01:58:30,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 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 01:58:30,290 INFO L276 IsEmpty]: Start isEmpty. Operand 21928 states and 103853 transitions. [2022-11-03 01:58:30,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:58:30,296 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:30,296 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:30,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Forceful destruction successful, exit code 0 [2022-11-03 01:58:30,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138,116 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:58:30,497 INFO L420 AbstractCegarLoop]: === Iteration 140 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:58:30,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:30,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1809480464, now seen corresponding path program 8 times [2022-11-03 01:58:30,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:30,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702570274] [2022-11-03 01:58:30,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:30,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:30,681 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:58:30,682 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:58:30,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702570274] [2022-11-03 01:58:30,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702570274] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:58:30,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492637236] [2022-11-03 01:58:30,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:58:30,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:58:30,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:58:30,684 INFO L229 MonitoredProcess]: Starting monitored process 117 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:58:30,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2022-11-03 01:58:31,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:58:31,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:58:31,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-03 01:58:31,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:58:31,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:58:31,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:58:31,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:58:31,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492637236] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:58:31,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [124304497] [2022-11-03 01:58:31,850 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 01:58:31,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:58:31,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-11-03 01:58:31,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286802731] [2022-11-03 01:58:31,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:58:31,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-03 01:58:31,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:58:31,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-03 01:58:31,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2022-11-03 01:58:31,851 INFO L87 Difference]: Start difference. First operand 21928 states and 103853 transitions. Second operand has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 01:58:33,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:33,005 INFO L93 Difference]: Finished difference Result 22401 states and 104912 transitions. [2022-11-03 01:58:33,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 01:58:33,005 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 15 [2022-11-03 01:58:33,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:33,112 INFO L225 Difference]: With dead ends: 22401 [2022-11-03 01:58:33,112 INFO L226 Difference]: Without dead ends: 22401 [2022-11-03 01:58:33,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=524, Unknown=0, NotChecked=0, Total=756 [2022-11-03 01:58:33,112 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 492 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:33,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 66 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 01:58:33,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22401 states. [2022-11-03 01:58:33,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22401 to 21755. [2022-11-03 01:58:33,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21755 states, 21665 states have (on average 4.7384721901684745) internal successors, (102659), 21754 states have internal predecessors, (102659), 0 states have call successors, (0), 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 01:58:33,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21755 states to 21755 states and 102659 transitions. [2022-11-03 01:58:33,707 INFO L78 Accepts]: Start accepts. Automaton has 21755 states and 102659 transitions. Word has length 15 [2022-11-03 01:58:33,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:33,707 INFO L495 AbstractCegarLoop]: Abstraction has 21755 states and 102659 transitions. [2022-11-03 01:58:33,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 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 01:58:33,707 INFO L276 IsEmpty]: Start isEmpty. Operand 21755 states and 102659 transitions. [2022-11-03 01:58:33,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:58:33,713 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:33,713 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:33,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Forceful destruction successful, exit code 0 [2022-11-03 01:58:33,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 117 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb03e868-866c-4172-b7ba-055c5caa37a3/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable139 [2022-11-03 01:58:33,914 INFO L420 AbstractCegarLoop]: === Iteration 141 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 78 more)] === [2022-11-03 01:58:33,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:33,915 INFO L85 PathProgramCache]: Analyzing trace with hash -2053853154, now seen corresponding path program 3 times [2022-11-03 01:58:33,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:33,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201231072] [2022-11-03 01:58:33,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:33,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat