./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh --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 c870162e8691a06e8bb6a8083be9eaf3f7ddc94357fb302a6e1fdd1b7aa873f8 --- 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-2329fc7 [2022-12-14 07:18:22,151 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 07:18:22,153 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 07:18:22,172 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 07:18:22,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 07:18:22,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 07:18:22,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 07:18:22,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 07:18:22,177 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 07:18:22,178 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 07:18:22,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 07:18:22,180 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 07:18:22,180 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 07:18:22,181 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 07:18:22,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 07:18:22,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 07:18:22,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 07:18:22,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 07:18:22,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 07:18:22,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 07:18:22,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 07:18:22,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 07:18:22,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 07:18:22,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 07:18:22,195 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 07:18:22,196 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 07:18:22,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 07:18:22,197 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 07:18:22,197 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 07:18:22,198 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 07:18:22,198 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 07:18:22,199 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 07:18:22,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 07:18:22,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 07:18:22,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 07:18:22,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 07:18:22,202 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 07:18:22,202 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 07:18:22,202 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 07:18:22,203 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 07:18:22,203 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 07:18:22,204 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-12-14 07:18:22,224 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 07:18:22,224 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 07:18:22,225 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 07:18:22,225 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 07:18:22,225 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 07:18:22,225 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 07:18:22,226 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 07:18:22,226 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 07:18:22,226 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 07:18:22,226 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 07:18:22,226 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 07:18:22,226 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 07:18:22,227 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 07:18:22,227 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 07:18:22,227 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 07:18:22,227 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 07:18:22,227 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 07:18:22,227 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 07:18:22,228 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 07:18:22,228 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 07:18:22,228 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 07:18:22,229 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 07:18:22,229 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 07:18:22,229 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 07:18:22,229 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 07:18:22,229 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 07:18:22,229 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 07:18:22,229 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 07:18:22,230 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 07:18:22,230 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 07:18:22,230 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 07:18:22,230 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 07:18:22,230 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 07:18:22,230 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 07:18:22,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:18:22,231 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 07:18:22,231 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 07:18:22,231 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 07:18:22,231 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 07:18:22,231 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 07:18:22,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 07:18:22,232 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 07:18:22,232 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 07:18:22,232 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_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/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_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh 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 -> c870162e8691a06e8bb6a8083be9eaf3f7ddc94357fb302a6e1fdd1b7aa873f8 [2022-12-14 07:18:22,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 07:18:22,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 07:18:22,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 07:18:22,453 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 07:18:22,453 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 07:18:22,454 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2022-12-14 07:18:24,974 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 07:18:25,142 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 07:18:25,142 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2022-12-14 07:18:25,148 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/data/b59ed24dc/b16f256a496f4c5698fd922d024d4295/FLAGdac7c1fc2 [2022-12-14 07:18:25,532 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/data/b59ed24dc/b16f256a496f4c5698fd922d024d4295 [2022-12-14 07:18:25,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 07:18:25,535 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 07:18:25,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 07:18:25,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 07:18:25,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 07:18:25,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:18:25" (1/1) ... [2022-12-14 07:18:25,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ed471d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:18:25, skipping insertion in model container [2022-12-14 07:18:25,541 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:18:25" (1/1) ... [2022-12-14 07:18:25,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 07:18:25,564 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 07:18:25,722 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c[2755,2768] [2022-12-14 07:18:25,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:18:25,738 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 07:18:25,754 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c[2755,2768] [2022-12-14 07:18:25,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:18:25,768 INFO L208 MainTranslator]: Completed translation [2022-12-14 07:18:25,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:18:25 WrapperNode [2022-12-14 07:18:25,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 07:18:25,769 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 07:18:25,770 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 07:18:25,770 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 07:18:25,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:18:25" (1/1) ... [2022-12-14 07:18:25,782 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:18:25" (1/1) ... [2022-12-14 07:18:25,813 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 395 [2022-12-14 07:18:25,813 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 07:18:25,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 07:18:25,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 07:18:25,814 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 07:18:25,823 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:18:25" (1/1) ... [2022-12-14 07:18:25,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:18:25" (1/1) ... [2022-12-14 07:18:25,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:18:25" (1/1) ... [2022-12-14 07:18:25,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:18:25" (1/1) ... [2022-12-14 07:18:25,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:18:25" (1/1) ... [2022-12-14 07:18:25,843 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:18:25" (1/1) ... [2022-12-14 07:18:25,846 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:18:25" (1/1) ... [2022-12-14 07:18:25,847 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:18:25" (1/1) ... [2022-12-14 07:18:25,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 07:18:25,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 07:18:25,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 07:18:25,852 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 07:18:25,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:18:25" (1/1) ... [2022-12-14 07:18:25,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:18:25,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:18:25,880 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 07:18:25,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 07:18:25,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 07:18:25,909 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-14 07:18:25,909 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-14 07:18:25,909 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-14 07:18:25,910 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-14 07:18:25,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 07:18:25,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 07:18:25,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 07:18:25,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 07:18:25,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 07:18:25,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 07:18:25,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 07:18:25,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 07:18:25,912 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 07:18:25,999 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 07:18:26,001 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 07:18:26,487 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 07:18:26,506 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 07:18:26,506 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-14 07:18:26,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:18:26 BoogieIcfgContainer [2022-12-14 07:18:26,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 07:18:26,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 07:18:26,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 07:18:26,514 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 07:18:26,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:18:25" (1/3) ... [2022-12-14 07:18:26,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72704c34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:18:26, skipping insertion in model container [2022-12-14 07:18:26,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:18:25" (2/3) ... [2022-12-14 07:18:26,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72704c34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:18:26, skipping insertion in model container [2022-12-14 07:18:26,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:18:26" (3/3) ... [2022-12-14 07:18:26,517 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2022-12-14 07:18:26,526 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 07:18:26,533 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 07:18:26,533 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2022-12-14 07:18:26,533 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 07:18:26,645 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-14 07:18:26,681 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 07:18:26,691 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 546 places, 583 transitions, 1182 flow [2022-12-14 07:18:26,693 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 546 places, 583 transitions, 1182 flow [2022-12-14 07:18:26,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 546 places, 583 transitions, 1182 flow [2022-12-14 07:18:26,860 INFO L130 PetriNetUnfolder]: 44/581 cut-off events. [2022-12-14 07:18:26,860 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-14 07:18:26,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 581 events. 44/581 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1852 event pairs, 0 based on Foata normal form. 0/483 useless extension candidates. Maximal degree in co-relation 455. Up to 2 conditions per place. [2022-12-14 07:18:26,901 INFO L119 LiptonReduction]: Number of co-enabled transitions 105228 [2022-12-14 07:19:10,173 INFO L134 LiptonReduction]: Checked pairs total: 104282 [2022-12-14 07:19:10,173 INFO L136 LiptonReduction]: Total number of compositions: 819 [2022-12-14 07:19:10,178 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 75 transitions, 166 flow [2022-12-14 07:19:10,230 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1855 states, 1125 states have (on average 4.116444444444444) internal successors, (4631), 1854 states have internal predecessors, (4631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:10,244 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 07:19:10,248 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;@1eee0418, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 07:19:10,248 INFO L358 AbstractCegarLoop]: Starting to check reachability of 108 error locations. [2022-12-14 07:19:10,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 1855 states, 1125 states have (on average 4.116444444444444) internal successors, (4631), 1854 states have internal predecessors, (4631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:10,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 07:19:10,256 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:10,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 07:19:10,257 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:10,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:10,260 INFO L85 PathProgramCache]: Analyzing trace with hash 82723, now seen corresponding path program 1 times [2022-12-14 07:19:10,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:10,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471532093] [2022-12-14 07:19:10,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:10,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:10,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:10,491 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:10,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471532093] [2022-12-14 07:19:10,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471532093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:19:10,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:19:10,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 07:19:10,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133396882] [2022-12-14 07:19:10,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:19:10,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:19:10,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:10,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:19:10,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:19:10,515 INFO L87 Difference]: Start difference. First operand has 1855 states, 1125 states have (on average 4.116444444444444) internal successors, (4631), 1854 states have internal predecessors, (4631), 0 states have call successors, (0), 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-12-14 07:19:10,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:10,732 INFO L93 Difference]: Finished difference Result 1467 states and 3651 transitions. [2022-12-14 07:19:10,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:19:10,734 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-12-14 07:19:10,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:10,754 INFO L225 Difference]: With dead ends: 1467 [2022-12-14 07:19:10,755 INFO L226 Difference]: Without dead ends: 1467 [2022-12-14 07:19:10,755 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-12-14 07:19:10,758 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 45 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:10,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:19:10,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2022-12-14 07:19:10,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 736. [2022-12-14 07:19:10,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 483 states have (on average 3.7867494824016563) internal successors, (1829), 735 states have internal predecessors, (1829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1829 transitions. [2022-12-14 07:19:10,832 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1829 transitions. Word has length 2 [2022-12-14 07:19:10,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:10,832 INFO L495 AbstractCegarLoop]: Abstraction has 736 states and 1829 transitions. [2022-12-14 07:19:10,832 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-12-14 07:19:10,832 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1829 transitions. [2022-12-14 07:19:10,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 07:19:10,833 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:10,833 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 07:19:10,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 07:19:10,833 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:10,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:10,834 INFO L85 PathProgramCache]: Analyzing trace with hash 2568520, now seen corresponding path program 1 times [2022-12-14 07:19:10,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:10,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887446861] [2022-12-14 07:19:10,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:10,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:10,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:10,894 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:10,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887446861] [2022-12-14 07:19:10,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887446861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:19:10,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:19:10,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 07:19:10,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499174674] [2022-12-14 07:19:10,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:19:10,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:19:10,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:10,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:19:10,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:19:10,897 INFO L87 Difference]: Start difference. First operand 736 states and 1829 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-12-14 07:19:10,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:10,985 INFO L93 Difference]: Finished difference Result 735 states and 1828 transitions. [2022-12-14 07:19:10,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:19:10,986 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-12-14 07:19:10,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:10,989 INFO L225 Difference]: With dead ends: 735 [2022-12-14 07:19:10,989 INFO L226 Difference]: Without dead ends: 735 [2022-12-14 07:19:10,989 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-12-14 07:19:10,990 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:10,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:19:10,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2022-12-14 07:19:11,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2022-12-14 07:19:11,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 483 states have (on average 3.7846790890269153) internal successors, (1828), 734 states have internal predecessors, (1828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:11,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1828 transitions. [2022-12-14 07:19:11,012 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1828 transitions. Word has length 3 [2022-12-14 07:19:11,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:11,012 INFO L495 AbstractCegarLoop]: Abstraction has 735 states and 1828 transitions. [2022-12-14 07:19:11,012 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-12-14 07:19:11,012 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1828 transitions. [2022-12-14 07:19:11,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 07:19:11,012 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:11,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 07:19:11,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 07:19:11,012 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:11,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:11,013 INFO L85 PathProgramCache]: Analyzing trace with hash 2568521, now seen corresponding path program 1 times [2022-12-14 07:19:11,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:11,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053420509] [2022-12-14 07:19:11,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:11,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:11,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-12-14 07:19:11,065 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:11,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053420509] [2022-12-14 07:19:11,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053420509] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:19:11,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722189087] [2022-12-14 07:19:11,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:11,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:11,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:19:11,067 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:19:11,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 07:19:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:11,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:19:11,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:19:11,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:11,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:19:11,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:11,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722189087] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:19:11,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1887081716] [2022-12-14 07:19:11,218 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:337) 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-12-14 07:19:11,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:19:11,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2022-12-14 07:19:11,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100828928] [2022-12-14 07:19:11,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:19:11,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 07:19:11,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:11,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 07:19:11,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 07:19:11,221 INFO L87 Difference]: Start difference. First operand 735 states and 1828 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-12-14 07:19:11,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:11,622 INFO L93 Difference]: Finished difference Result 3662 states and 9122 transitions. [2022-12-14 07:19:11,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:19:11,623 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-12-14 07:19:11,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:11,638 INFO L225 Difference]: With dead ends: 3662 [2022-12-14 07:19:11,639 INFO L226 Difference]: Without dead ends: 3662 [2022-12-14 07:19:11,639 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-12-14 07:19:11,639 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 270 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:11,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 5 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 07:19:11,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2022-12-14 07:19:11,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 738. [2022-12-14 07:19:11,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 486 states have (on average 3.7736625514403292) internal successors, (1834), 737 states have internal predecessors, (1834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:11,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1834 transitions. [2022-12-14 07:19:11,669 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1834 transitions. Word has length 3 [2022-12-14 07:19:11,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:11,670 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 1834 transitions. [2022-12-14 07:19:11,670 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-12-14 07:19:11,670 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1834 transitions. [2022-12-14 07:19:11,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 07:19:11,670 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:11,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 07:19:11,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 07:19:11,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:11,871 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:11,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:11,871 INFO L85 PathProgramCache]: Analyzing trace with hash 79706940, now seen corresponding path program 1 times [2022-12-14 07:19:11,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:11,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945985675] [2022-12-14 07:19:11,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:11,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:11,919 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:11,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945985675] [2022-12-14 07:19:11,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945985675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:19:11,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:19:11,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 07:19:11,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173945640] [2022-12-14 07:19:11,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:19:11,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:19:11,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:11,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:19:11,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:19:11,921 INFO L87 Difference]: Start difference. First operand 738 states and 1834 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:12,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:12,014 INFO L93 Difference]: Finished difference Result 674 states and 1676 transitions. [2022-12-14 07:19:12,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:19:12,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-12-14 07:19:12,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:12,020 INFO L225 Difference]: With dead ends: 674 [2022-12-14 07:19:12,020 INFO L226 Difference]: Without dead ends: 674 [2022-12-14 07:19:12,020 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-12-14 07:19:12,021 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:12,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:19:12,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-12-14 07:19:12,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2022-12-14 07:19:12,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 450 states have (on average 3.7244444444444444) internal successors, (1676), 673 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:12,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1676 transitions. [2022-12-14 07:19:12,032 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1676 transitions. Word has length 4 [2022-12-14 07:19:12,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:12,032 INFO L495 AbstractCegarLoop]: Abstraction has 674 states and 1676 transitions. [2022-12-14 07:19:12,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:12,033 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1676 transitions. [2022-12-14 07:19:12,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 07:19:12,033 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:12,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 07:19:12,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 07:19:12,033 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err24ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:12,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:12,033 INFO L85 PathProgramCache]: Analyzing trace with hash 79706941, now seen corresponding path program 1 times [2022-12-14 07:19:12,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:12,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829704129] [2022-12-14 07:19:12,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:12,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:12,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:12,092 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:12,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829704129] [2022-12-14 07:19:12,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829704129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:19:12,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:19:12,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 07:19:12,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390978166] [2022-12-14 07:19:12,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:19:12,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:19:12,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:12,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:19:12,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:19:12,094 INFO L87 Difference]: Start difference. First operand 674 states and 1676 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:12,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:12,180 INFO L93 Difference]: Finished difference Result 610 states and 1518 transitions. [2022-12-14 07:19:12,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:19:12,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-12-14 07:19:12,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:12,184 INFO L225 Difference]: With dead ends: 610 [2022-12-14 07:19:12,184 INFO L226 Difference]: Without dead ends: 610 [2022-12-14 07:19:12,184 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-12-14 07:19:12,185 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:12,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:19:12,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-12-14 07:19:12,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2022-12-14 07:19:12,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 414 states have (on average 3.6666666666666665) internal successors, (1518), 609 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1518 transitions. [2022-12-14 07:19:12,195 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 1518 transitions. Word has length 4 [2022-12-14 07:19:12,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:12,195 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 1518 transitions. [2022-12-14 07:19:12,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:12,195 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 1518 transitions. [2022-12-14 07:19:12,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 07:19:12,195 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:12,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 07:19:12,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 07:19:12,195 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:12,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:12,196 INFO L85 PathProgramCache]: Analyzing trace with hash 79706879, now seen corresponding path program 1 times [2022-12-14 07:19:12,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:12,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212256219] [2022-12-14 07:19:12,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:12,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:12,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:12,275 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:12,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212256219] [2022-12-14 07:19:12,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212256219] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:19:12,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:19:12,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 07:19:12,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638872705] [2022-12-14 07:19:12,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:19:12,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:19:12,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:12,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:19:12,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:19:12,276 INFO L87 Difference]: Start difference. First operand 610 states and 1518 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:12,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:12,486 INFO L93 Difference]: Finished difference Result 765 states and 1854 transitions. [2022-12-14 07:19:12,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 07:19:12,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-12-14 07:19:12,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:12,490 INFO L225 Difference]: With dead ends: 765 [2022-12-14 07:19:12,490 INFO L226 Difference]: Without dead ends: 765 [2022-12-14 07:19:12,490 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-12-14 07:19:12,491 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 68 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:12,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 3 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:19:12,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2022-12-14 07:19:12,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 643. [2022-12-14 07:19:12,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 447 states have (on average 3.713646532438479) internal successors, (1660), 642 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:12,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1660 transitions. [2022-12-14 07:19:12,507 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1660 transitions. Word has length 4 [2022-12-14 07:19:12,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:12,508 INFO L495 AbstractCegarLoop]: Abstraction has 643 states and 1660 transitions. [2022-12-14 07:19:12,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:12,508 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1660 transitions. [2022-12-14 07:19:12,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 07:19:12,508 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:12,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 07:19:12,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 07:19:12,509 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:12,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:12,509 INFO L85 PathProgramCache]: Analyzing trace with hash 79706753, now seen corresponding path program 1 times [2022-12-14 07:19:12,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:12,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678337818] [2022-12-14 07:19:12,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:12,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:12,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:12,547 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:12,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678337818] [2022-12-14 07:19:12,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678337818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:19:12,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:19:12,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 07:19:12,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737888552] [2022-12-14 07:19:12,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:19:12,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:19:12,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:12,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:19:12,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:19:12,549 INFO L87 Difference]: Start difference. First operand 643 states and 1660 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:12,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:12,692 INFO L93 Difference]: Finished difference Result 1021 states and 2708 transitions. [2022-12-14 07:19:12,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:19:12,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-12-14 07:19:12,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:12,697 INFO L225 Difference]: With dead ends: 1021 [2022-12-14 07:19:12,698 INFO L226 Difference]: Without dead ends: 1021 [2022-12-14 07:19:12,698 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-12-14 07:19:12,699 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 36 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:12,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 2 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:19:12,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2022-12-14 07:19:12,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 739. [2022-12-14 07:19:12,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 543 states have (on average 4.138121546961326) internal successors, (2247), 738 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:12,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 2247 transitions. [2022-12-14 07:19:12,720 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 2247 transitions. Word has length 4 [2022-12-14 07:19:12,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:12,721 INFO L495 AbstractCegarLoop]: Abstraction has 739 states and 2247 transitions. [2022-12-14 07:19:12,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:12,721 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 2247 transitions. [2022-12-14 07:19:12,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 07:19:12,721 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:12,721 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 07:19:12,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 07:19:12,721 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:12,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:12,722 INFO L85 PathProgramCache]: Analyzing trace with hash 79706887, now seen corresponding path program 1 times [2022-12-14 07:19:12,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:12,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696472874] [2022-12-14 07:19:12,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:12,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:12,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:12,761 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:12,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696472874] [2022-12-14 07:19:12,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696472874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:19:12,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:19:12,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 07:19:12,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990026076] [2022-12-14 07:19:12,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:19:12,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:19:12,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:12,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:19:12,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:19:12,763 INFO L87 Difference]: Start difference. First operand 739 states and 2247 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:12,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:12,893 INFO L93 Difference]: Finished difference Result 1021 states and 2548 transitions. [2022-12-14 07:19:12,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:19:12,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-12-14 07:19:12,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:12,899 INFO L225 Difference]: With dead ends: 1021 [2022-12-14 07:19:12,899 INFO L226 Difference]: Without dead ends: 1019 [2022-12-14 07:19:12,899 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-12-14 07:19:12,900 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:12,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 2 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:19:12,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2022-12-14 07:19:12,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 737. [2022-12-14 07:19:12,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 541 states have (on average 3.852125693160813) internal successors, (2084), 736 states have internal predecessors, (2084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:12,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 2084 transitions. [2022-12-14 07:19:12,927 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 2084 transitions. Word has length 4 [2022-12-14 07:19:12,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:12,927 INFO L495 AbstractCegarLoop]: Abstraction has 737 states and 2084 transitions. [2022-12-14 07:19:12,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:12,927 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 2084 transitions. [2022-12-14 07:19:12,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 07:19:12,928 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:12,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 07:19:12,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 07:19:12,928 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:12,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:12,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1826409500, now seen corresponding path program 1 times [2022-12-14 07:19:12,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:12,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703814230] [2022-12-14 07:19:12,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:12,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:13,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:13,226 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:13,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703814230] [2022-12-14 07:19:13,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703814230] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:19:13,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070111376] [2022-12-14 07:19:13,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:13,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:13,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:19:13,228 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:19:13,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 07:19:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:13,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-14 07:19:13,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:19:13,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:19:13,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:19:13,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 07:19:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:13,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:19:13,490 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:19:13,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-12-14 07:19:13,498 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:19:13,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 31 [2022-12-14 07:19:13,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:13,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070111376] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:19:13,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [855960974] [2022-12-14 07:19:13,533 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:337) 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-12-14 07:19:13,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:19:13,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-14 07:19:13,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115373173] [2022-12-14 07:19:13,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:19:13,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 07:19:13,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:13,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 07:19:13,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=84, Unknown=2, NotChecked=0, Total=110 [2022-12-14 07:19:13,536 INFO L87 Difference]: Start difference. First operand 737 states and 2084 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:14,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:14,089 INFO L93 Difference]: Finished difference Result 1269 states and 3323 transitions. [2022-12-14 07:19:14,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 07:19:14,090 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 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-12-14 07:19:14,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:14,094 INFO L225 Difference]: With dead ends: 1269 [2022-12-14 07:19:14,094 INFO L226 Difference]: Without dead ends: 1269 [2022-12-14 07:19:14,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=204, Unknown=2, NotChecked=0, Total=272 [2022-12-14 07:19:14,095 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 204 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:14,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 11 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 07:19:14,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2022-12-14 07:19:14,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 799. [2022-12-14 07:19:14,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 603 states have (on average 3.9203980099502487) internal successors, (2364), 798 states have internal predecessors, (2364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:14,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 2364 transitions. [2022-12-14 07:19:14,111 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 2364 transitions. Word has length 5 [2022-12-14 07:19:14,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:14,111 INFO L495 AbstractCegarLoop]: Abstraction has 799 states and 2364 transitions. [2022-12-14 07:19:14,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:14,111 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 2364 transitions. [2022-12-14 07:19:14,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 07:19:14,112 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:14,112 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 07:19:14,117 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 07:19:14,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:14,313 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:14,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:14,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1826409554, now seen corresponding path program 1 times [2022-12-14 07:19:14,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:14,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301483674] [2022-12-14 07:19:14,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:14,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:14,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:14,601 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:14,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301483674] [2022-12-14 07:19:14,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301483674] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:19:14,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034150613] [2022-12-14 07:19:14,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:14,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:14,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:19:14,602 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:19:14,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 07:19:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:14,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-14 07:19:14,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:19:14,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:19:14,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:19:14,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 07:19:14,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:14,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:19:14,852 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:19:14,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-12-14 07:19:14,858 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:19:14,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-14 07:19:14,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:14,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034150613] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:19:14,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2122386619] [2022-12-14 07:19:14,883 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) 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-12-14 07:19:14,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:19:14,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-14 07:19:14,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909193239] [2022-12-14 07:19:14,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:19:14,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 07:19:14,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:14,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 07:19:14,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=84, Unknown=2, NotChecked=0, Total=110 [2022-12-14 07:19:14,884 INFO L87 Difference]: Start difference. First operand 799 states and 2364 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:15,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:15,444 INFO L93 Difference]: Finished difference Result 1232 states and 3201 transitions. [2022-12-14 07:19:15,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 07:19:15,445 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 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-12-14 07:19:15,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:15,455 INFO L225 Difference]: With dead ends: 1232 [2022-12-14 07:19:15,455 INFO L226 Difference]: Without dead ends: 1232 [2022-12-14 07:19:15,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=204, Unknown=2, NotChecked=0, Total=272 [2022-12-14 07:19:15,456 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 175 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:15,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 12 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 07:19:15,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2022-12-14 07:19:15,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 798. [2022-12-14 07:19:15,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 602 states have (on average 3.8172757475083055) internal successors, (2298), 797 states have internal predecessors, (2298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:15,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 2298 transitions. [2022-12-14 07:19:15,483 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 2298 transitions. Word has length 5 [2022-12-14 07:19:15,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:15,484 INFO L495 AbstractCegarLoop]: Abstraction has 798 states and 2298 transitions. [2022-12-14 07:19:15,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:15,484 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 2298 transitions. [2022-12-14 07:19:15,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 07:19:15,485 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:15,485 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 07:19:15,490 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 07:19:15,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 07:19:15,685 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:15,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:15,686 INFO L85 PathProgramCache]: Analyzing trace with hash -711212564, now seen corresponding path program 1 times [2022-12-14 07:19:15,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:15,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656818287] [2022-12-14 07:19:15,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:15,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:15,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:15,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:15,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656818287] [2022-12-14 07:19:15,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656818287] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:19:15,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:19:15,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 07:19:15,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411728729] [2022-12-14 07:19:15,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:19:15,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:19:15,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:15,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:19:15,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:19:15,750 INFO L87 Difference]: Start difference. First operand 798 states and 2298 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:15,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:15,933 INFO L93 Difference]: Finished difference Result 802 states and 2284 transitions. [2022-12-14 07:19:15,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 07:19:15,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 07:19:15,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:15,940 INFO L225 Difference]: With dead ends: 802 [2022-12-14 07:19:15,940 INFO L226 Difference]: Without dead ends: 802 [2022-12-14 07:19:15,940 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-12-14 07:19:15,940 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 42 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:15,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 5 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:19:15,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-12-14 07:19:15,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 786. [2022-12-14 07:19:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 590 states have (on average 3.8508474576271188) internal successors, (2272), 785 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:15,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 2272 transitions. [2022-12-14 07:19:15,961 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 2272 transitions. Word has length 6 [2022-12-14 07:19:15,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:15,961 INFO L495 AbstractCegarLoop]: Abstraction has 786 states and 2272 transitions. [2022-12-14 07:19:15,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:15,962 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 2272 transitions. [2022-12-14 07:19:15,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 07:19:15,962 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:15,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 07:19:15,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 07:19:15,963 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err25ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:15,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:15,963 INFO L85 PathProgramCache]: Analyzing trace with hash -711212497, now seen corresponding path program 1 times [2022-12-14 07:19:15,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:15,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908535738] [2022-12-14 07:19:15,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:15,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:16,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:16,003 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:16,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908535738] [2022-12-14 07:19:16,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908535738] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:19:16,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:19:16,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 07:19:16,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035423197] [2022-12-14 07:19:16,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:19:16,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:19:16,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:16,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:19:16,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:19:16,005 INFO L87 Difference]: Start difference. First operand 786 states and 2272 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:16,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:16,075 INFO L93 Difference]: Finished difference Result 688 states and 1981 transitions. [2022-12-14 07:19:16,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:19:16,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 07:19:16,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:16,079 INFO L225 Difference]: With dead ends: 688 [2022-12-14 07:19:16,080 INFO L226 Difference]: Without dead ends: 688 [2022-12-14 07:19:16,080 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-12-14 07:19:16,080 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:16,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:19:16,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2022-12-14 07:19:16,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 688. [2022-12-14 07:19:16,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 520 states have (on average 3.8096153846153844) internal successors, (1981), 687 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:16,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1981 transitions. [2022-12-14 07:19:16,095 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1981 transitions. Word has length 6 [2022-12-14 07:19:16,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:16,095 INFO L495 AbstractCegarLoop]: Abstraction has 688 states and 1981 transitions. [2022-12-14 07:19:16,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:16,096 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1981 transitions. [2022-12-14 07:19:16,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 07:19:16,096 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:16,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 07:19:16,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 07:19:16,096 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err24ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:16,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:16,097 INFO L85 PathProgramCache]: Analyzing trace with hash -711212495, now seen corresponding path program 1 times [2022-12-14 07:19:16,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:16,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407336656] [2022-12-14 07:19:16,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:16,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:16,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:16,138 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:16,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407336656] [2022-12-14 07:19:16,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407336656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:19:16,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:19:16,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 07:19:16,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73984378] [2022-12-14 07:19:16,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:19:16,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:19:16,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:16,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:19:16,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:19:16,139 INFO L87 Difference]: Start difference. First operand 688 states and 1981 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:16,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:16,213 INFO L93 Difference]: Finished difference Result 590 states and 1690 transitions. [2022-12-14 07:19:16,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:19:16,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 07:19:16,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:16,217 INFO L225 Difference]: With dead ends: 590 [2022-12-14 07:19:16,217 INFO L226 Difference]: Without dead ends: 590 [2022-12-14 07:19:16,218 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-12-14 07:19:16,218 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:16,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:19:16,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2022-12-14 07:19:16,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2022-12-14 07:19:16,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 450 states have (on average 3.7555555555555555) internal successors, (1690), 589 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:16,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 1690 transitions. [2022-12-14 07:19:16,228 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 1690 transitions. Word has length 6 [2022-12-14 07:19:16,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:16,228 INFO L495 AbstractCegarLoop]: Abstraction has 590 states and 1690 transitions. [2022-12-14 07:19:16,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:16,228 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 1690 transitions. [2022-12-14 07:19:16,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 07:19:16,228 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:16,229 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 07:19:16,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 07:19:16,229 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:16,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:16,229 INFO L85 PathProgramCache]: Analyzing trace with hash -711212494, now seen corresponding path program 1 times [2022-12-14 07:19:16,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:16,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609790679] [2022-12-14 07:19:16,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:16,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:16,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:16,257 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:16,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609790679] [2022-12-14 07:19:16,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609790679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:19:16,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:19:16,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 07:19:16,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652215739] [2022-12-14 07:19:16,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:19:16,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:19:16,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:16,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:19:16,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:19:16,258 INFO L87 Difference]: Start difference. First operand 590 states and 1690 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:16,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:16,352 INFO L93 Difference]: Finished difference Result 776 states and 2426 transitions. [2022-12-14 07:19:16,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:19:16,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 07:19:16,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:16,357 INFO L225 Difference]: With dead ends: 776 [2022-12-14 07:19:16,357 INFO L226 Difference]: Without dead ends: 776 [2022-12-14 07:19:16,357 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-12-14 07:19:16,358 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 29 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:16,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 2 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:19:16,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2022-12-14 07:19:16,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 636. [2022-12-14 07:19:16,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 496 states have (on average 4.342741935483871) internal successors, (2154), 635 states have internal predecessors, (2154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:16,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 2154 transitions. [2022-12-14 07:19:16,379 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 2154 transitions. Word has length 6 [2022-12-14 07:19:16,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:16,379 INFO L495 AbstractCegarLoop]: Abstraction has 636 states and 2154 transitions. [2022-12-14 07:19:16,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:16,379 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 2154 transitions. [2022-12-14 07:19:16,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 07:19:16,380 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:16,380 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 07:19:16,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 07:19:16,380 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:16,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:16,380 INFO L85 PathProgramCache]: Analyzing trace with hash -711212621, now seen corresponding path program 1 times [2022-12-14 07:19:16,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:16,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071699936] [2022-12-14 07:19:16,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:16,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:16,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:16,407 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:16,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071699936] [2022-12-14 07:19:16,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071699936] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:19:16,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:19:16,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 07:19:16,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98309100] [2022-12-14 07:19:16,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:19:16,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:19:16,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:16,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:19:16,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:19:16,408 INFO L87 Difference]: Start difference. First operand 636 states and 2154 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:16,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:16,510 INFO L93 Difference]: Finished difference Result 774 states and 2321 transitions. [2022-12-14 07:19:16,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:19:16,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 07:19:16,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:16,516 INFO L225 Difference]: With dead ends: 774 [2022-12-14 07:19:16,516 INFO L226 Difference]: Without dead ends: 763 [2022-12-14 07:19:16,516 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-12-14 07:19:16,517 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 27 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:16,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:19:16,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2022-12-14 07:19:16,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 623. [2022-12-14 07:19:16,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 483 states have (on average 4.213250517598344) internal successors, (2035), 622 states have internal predecessors, (2035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:16,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 2035 transitions. [2022-12-14 07:19:16,535 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 2035 transitions. Word has length 6 [2022-12-14 07:19:16,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:16,535 INFO L495 AbstractCegarLoop]: Abstraction has 623 states and 2035 transitions. [2022-12-14 07:19:16,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:16,535 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 2035 transitions. [2022-12-14 07:19:16,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 07:19:16,536 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:16,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 07:19:16,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 07:19:16,536 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:16,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:16,536 INFO L85 PathProgramCache]: Analyzing trace with hash -784122608, now seen corresponding path program 1 times [2022-12-14 07:19:16,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:16,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464970945] [2022-12-14 07:19:16,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:16,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:16,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:16,819 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:16,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464970945] [2022-12-14 07:19:16,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464970945] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:19:16,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742359657] [2022-12-14 07:19:16,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:16,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:16,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:19:16,820 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:19:16,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 07:19:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:16,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-14 07:19:16,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:19:16,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:19:17,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:19:17,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 07:19:17,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:19:17,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 07:19:17,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:17,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:19:17,125 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:19:17,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-12-14 07:19:17,133 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:19:17,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 119 [2022-12-14 07:19:17,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2022-12-14 07:19:17,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2022-12-14 07:19:17,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:17,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742359657] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:19:17,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2126493533] [2022-12-14 07:19:17,208 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:337) 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-12-14 07:19:17,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:19:17,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-14 07:19:17,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039589911] [2022-12-14 07:19:17,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:19:17,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 07:19:17,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:17,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 07:19:17,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=134, Unknown=9, NotChecked=0, Total=182 [2022-12-14 07:19:17,210 INFO L87 Difference]: Start difference. First operand 623 states and 2035 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-12-14 07:19:17,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:17,630 INFO L93 Difference]: Finished difference Result 1200 states and 3654 transitions. [2022-12-14 07:19:17,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:19:17,631 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-12-14 07:19:17,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:17,635 INFO L225 Difference]: With dead ends: 1200 [2022-12-14 07:19:17,635 INFO L226 Difference]: Without dead ends: 1200 [2022-12-14 07:19:17,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=228, Unknown=9, NotChecked=0, Total=306 [2022-12-14 07:19:17,635 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 201 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:17,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 8 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:19:17,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2022-12-14 07:19:17,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 674. [2022-12-14 07:19:17,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 534 states have (on average 4.2677902621722845) internal successors, (2279), 673 states have internal predecessors, (2279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:17,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 2279 transitions. [2022-12-14 07:19:17,661 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 2279 transitions. Word has length 6 [2022-12-14 07:19:17,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:17,661 INFO L495 AbstractCegarLoop]: Abstraction has 674 states and 2279 transitions. [2022-12-14 07:19:17,661 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-12-14 07:19:17,661 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 2279 transitions. [2022-12-14 07:19:17,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 07:19:17,662 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:17,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 07:19:17,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 07:19:17,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 07:19:17,862 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:17,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:17,863 INFO L85 PathProgramCache]: Analyzing trace with hash -784122662, now seen corresponding path program 1 times [2022-12-14 07:19:17,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:17,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163842654] [2022-12-14 07:19:17,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:17,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:18,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:18,183 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:18,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163842654] [2022-12-14 07:19:18,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163842654] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:19:18,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282578060] [2022-12-14 07:19:18,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:18,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:18,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:19:18,184 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:19:18,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 07:19:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:18,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-14 07:19:18,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:19:18,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:19:18,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:19:18,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 07:19:18,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:19:18,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 07:19:18,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:18,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:19:18,426 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_296 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_296) c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) 9223372039002259456))) is different from false [2022-12-14 07:19:18,480 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:19:18,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-12-14 07:19:18,488 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:19:18,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 71 [2022-12-14 07:19:18,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-12-14 07:19:18,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-12-14 07:19:18,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:18,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282578060] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:19:18,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [443264528] [2022-12-14 07:19:18,545 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:337) 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-12-14 07:19:18,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:19:18,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-14 07:19:18,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307545917] [2022-12-14 07:19:18,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:19:18,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 07:19:18,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:18,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 07:19:18,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=126, Unknown=3, NotChecked=22, Total=182 [2022-12-14 07:19:18,547 INFO L87 Difference]: Start difference. First operand 674 states and 2279 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-12-14 07:19:19,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:19,235 INFO L93 Difference]: Finished difference Result 2293 states and 7009 transitions. [2022-12-14 07:19:19,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 07:19:19,235 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-12-14 07:19:19,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:19,244 INFO L225 Difference]: With dead ends: 2293 [2022-12-14 07:19:19,244 INFO L226 Difference]: Without dead ends: 2293 [2022-12-14 07:19:19,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=267, Unknown=3, NotChecked=34, Total=380 [2022-12-14 07:19:19,245 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 321 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:19,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 10 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 380 Invalid, 0 Unknown, 111 Unchecked, 0.4s Time] [2022-12-14 07:19:19,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2293 states. [2022-12-14 07:19:19,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2293 to 649. [2022-12-14 07:19:19,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 509 states have (on average 4.237721021611002) internal successors, (2157), 648 states have internal predecessors, (2157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:19,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 2157 transitions. [2022-12-14 07:19:19,269 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 2157 transitions. Word has length 6 [2022-12-14 07:19:19,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:19,269 INFO L495 AbstractCegarLoop]: Abstraction has 649 states and 2157 transitions. [2022-12-14 07:19:19,269 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-12-14 07:19:19,269 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 2157 transitions. [2022-12-14 07:19:19,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 07:19:19,269 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:19,270 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1] [2022-12-14 07:19:19,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-14 07:19:19,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 07:19:19,471 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:19,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:19,472 INFO L85 PathProgramCache]: Analyzing trace with hash -786553756, now seen corresponding path program 2 times [2022-12-14 07:19:19,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:19,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366248032] [2022-12-14 07:19:19,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:19,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:19,538 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:19,538 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:19,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366248032] [2022-12-14 07:19:19,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366248032] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:19:19,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475834855] [2022-12-14 07:19:19,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:19:19,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:19,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:19:19,540 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:19:19,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 07:19:19,654 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 07:19:19,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:19:19,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 07:19:19,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:19:19,665 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 07:19:19,665 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:19:19,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475834855] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:19:19,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 07:19:19,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2022-12-14 07:19:19,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029860930] [2022-12-14 07:19:19,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:19:19,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:19:19,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:19,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:19:19,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-14 07:19:19,666 INFO L87 Difference]: Start difference. First operand 649 states and 2157 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-12-14 07:19:19,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:19,728 INFO L93 Difference]: Finished difference Result 648 states and 2156 transitions. [2022-12-14 07:19:19,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:19:19,728 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-12-14 07:19:19,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:19,731 INFO L225 Difference]: With dead ends: 648 [2022-12-14 07:19:19,731 INFO L226 Difference]: Without dead ends: 648 [2022-12-14 07:19:19,731 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-12-14 07:19:19,732 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:19,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:19:19,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2022-12-14 07:19:19,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 645. [2022-12-14 07:19:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 506 states have (on average 4.24901185770751) internal successors, (2150), 644 states have internal predecessors, (2150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:19,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 2150 transitions. [2022-12-14 07:19:19,749 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 2150 transitions. Word has length 6 [2022-12-14 07:19:19,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:19,749 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 2150 transitions. [2022-12-14 07:19:19,749 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-12-14 07:19:19,749 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 2150 transitions. [2022-12-14 07:19:19,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 07:19:19,750 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:19,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:19:19,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 07:19:19,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 07:19:19,952 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:19,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:19,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1462221340, now seen corresponding path program 1 times [2022-12-14 07:19:19,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:19,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664293297] [2022-12-14 07:19:19,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:19,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:20,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-12-14 07:19:20,076 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:20,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664293297] [2022-12-14 07:19:20,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664293297] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:19:20,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363025016] [2022-12-14 07:19:20,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:20,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:20,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:19:20,078 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:19:20,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 07:19:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:20,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:19:20,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:19:20,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 129 [2022-12-14 07:19:20,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 07:19:20,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:19:20,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363025016] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:19:20,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 07:19:20,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2022-12-14 07:19:20,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406704479] [2022-12-14 07:19:20,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:19:20,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 07:19:20,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:20,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 07:19:20,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-14 07:19:20,293 INFO L87 Difference]: Start difference. First operand 645 states and 2150 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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-12-14 07:19:20,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:20,440 INFO L93 Difference]: Finished difference Result 613 states and 1943 transitions. [2022-12-14 07:19:20,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 07:19:20,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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-12-14 07:19:20,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:20,443 INFO L225 Difference]: With dead ends: 613 [2022-12-14 07:19:20,443 INFO L226 Difference]: Without dead ends: 613 [2022-12-14 07:19:20,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-12-14 07:19:20,444 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 90 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:20,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 0 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:19:20,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2022-12-14 07:19:20,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 571. [2022-12-14 07:19:20,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 455 states have (on average 4.085714285714285) internal successors, (1859), 570 states have internal predecessors, (1859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:20,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 1859 transitions. [2022-12-14 07:19:20,452 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 1859 transitions. Word has length 7 [2022-12-14 07:19:20,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:20,453 INFO L495 AbstractCegarLoop]: Abstraction has 571 states and 1859 transitions. [2022-12-14 07:19:20,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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-12-14 07:19:20,453 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1859 transitions. [2022-12-14 07:19:20,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 07:19:20,453 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:20,453 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:19:20,459 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 07:19:20,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:20,655 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:20,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:20,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1462220874, now seen corresponding path program 1 times [2022-12-14 07:19:20,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:20,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000844358] [2022-12-14 07:19:20,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:20,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:20,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 07:19:20,773 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:20,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000844358] [2022-12-14 07:19:20,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000844358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:19:20,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:19:20,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 07:19:20,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725301346] [2022-12-14 07:19:20,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:19:20,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:19:20,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:20,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:19:20,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:19:20,778 INFO L87 Difference]: Start difference. First operand 571 states and 1859 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-12-14 07:19:20,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:20,902 INFO L93 Difference]: Finished difference Result 547 states and 1768 transitions. [2022-12-14 07:19:20,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:19:20,902 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-12-14 07:19:20,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:20,904 INFO L225 Difference]: With dead ends: 547 [2022-12-14 07:19:20,904 INFO L226 Difference]: Without dead ends: 547 [2022-12-14 07:19:20,904 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-12-14 07:19:20,905 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:20,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 0 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:19:20,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-12-14 07:19:20,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2022-12-14 07:19:20,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 440 states have (on average 4.0181818181818185) internal successors, (1768), 546 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:20,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1768 transitions. [2022-12-14 07:19:20,913 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1768 transitions. Word has length 7 [2022-12-14 07:19:20,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:20,913 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 1768 transitions. [2022-12-14 07:19:20,913 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-12-14 07:19:20,913 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1768 transitions. [2022-12-14 07:19:20,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 07:19:20,913 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:20,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:19:20,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-14 07:19:20,913 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:20,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:20,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1461982609, now seen corresponding path program 1 times [2022-12-14 07:19:20,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:20,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688666804] [2022-12-14 07:19:20,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:20,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:21,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:21,197 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:21,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688666804] [2022-12-14 07:19:21,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688666804] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:19:21,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998453508] [2022-12-14 07:19:21,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:21,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:21,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:19:21,198 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:19:21,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 07:19:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:21,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-14 07:19:21,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:19:21,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:19:21,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:19:21,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 07:19:21,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:19:21,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 07:19:21,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:21,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:19:21,453 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_407 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_407) c_~A~0.base) (+ c_~A~0.offset (* c_~j~0 4))) 9223372039002259456))) is different from false [2022-12-14 07:19:21,500 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:19:21,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-12-14 07:19:21,507 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:19:21,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 137 [2022-12-14 07:19:21,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2022-12-14 07:19:21,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 110 [2022-12-14 07:19:21,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:21,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998453508] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:19:21,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [26641698] [2022-12-14 07:19:21,564 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:337) 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-12-14 07:19:21,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:19:21,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-14 07:19:21,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284938325] [2022-12-14 07:19:21,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:19:21,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 07:19:21,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:21,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 07:19:21,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=124, Unknown=3, NotChecked=22, Total=182 [2022-12-14 07:19:21,567 INFO L87 Difference]: Start difference. First operand 547 states and 1768 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-12-14 07:19:22,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:22,240 INFO L93 Difference]: Finished difference Result 1268 states and 3692 transitions. [2022-12-14 07:19:22,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 07:19:22,241 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 7 [2022-12-14 07:19:22,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:22,244 INFO L225 Difference]: With dead ends: 1268 [2022-12-14 07:19:22,244 INFO L226 Difference]: Without dead ends: 1268 [2022-12-14 07:19:22,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=265, Unknown=3, NotChecked=34, Total=380 [2022-12-14 07:19:22,244 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 384 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:22,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 0 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 473 Invalid, 0 Unknown, 66 Unchecked, 0.5s Time] [2022-12-14 07:19:22,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2022-12-14 07:19:22,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 547. [2022-12-14 07:19:22,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 440 states have (on average 3.809090909090909) internal successors, (1676), 546 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:22,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1676 transitions. [2022-12-14 07:19:22,259 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1676 transitions. Word has length 7 [2022-12-14 07:19:22,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:22,259 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 1676 transitions. [2022-12-14 07:19:22,259 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-12-14 07:19:22,259 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1676 transitions. [2022-12-14 07:19:22,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 07:19:22,259 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:22,259 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:19:22,264 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 07:19:22,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:22,461 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:22,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:22,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1461982686, now seen corresponding path program 1 times [2022-12-14 07:19:22,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:22,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104560534] [2022-12-14 07:19:22,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:22,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:22,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:22,713 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:22,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104560534] [2022-12-14 07:19:22,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104560534] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:19:22,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790678218] [2022-12-14 07:19:22,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:22,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:22,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:19:22,714 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:19:22,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 07:19:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:22,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-14 07:19:22,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:19:22,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:19:22,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:19:22,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 07:19:22,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:19:22,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 07:19:22,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:22,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:19:22,996 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_440) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_441) |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-12-14 07:19:23,005 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:19:23,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-12-14 07:19:23,012 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:19:23,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 61 [2022-12-14 07:19:23,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2022-12-14 07:19:23,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-12-14 07:19:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 07:19:23,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790678218] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:19:23,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [335726658] [2022-12-14 07:19:23,061 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:337) 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-12-14 07:19:23,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:19:23,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-14 07:19:23,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261461668] [2022-12-14 07:19:23,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:19:23,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 07:19:23,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:23,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 07:19:23,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=125, Unknown=3, NotChecked=22, Total=182 [2022-12-14 07:19:23,063 INFO L87 Difference]: Start difference. First operand 547 states and 1676 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-12-14 07:19:23,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:23,661 INFO L93 Difference]: Finished difference Result 1176 states and 3420 transitions. [2022-12-14 07:19:23,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 07:19:23,662 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 7 [2022-12-14 07:19:23,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:23,665 INFO L225 Difference]: With dead ends: 1176 [2022-12-14 07:19:23,665 INFO L226 Difference]: Without dead ends: 1176 [2022-12-14 07:19:23,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=269, Unknown=3, NotChecked=34, Total=380 [2022-12-14 07:19:23,665 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 268 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:23,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 0 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 525 Invalid, 0 Unknown, 58 Unchecked, 0.4s Time] [2022-12-14 07:19:23,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2022-12-14 07:19:23,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 547. [2022-12-14 07:19:23,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 440 states have (on average 3.7045454545454546) internal successors, (1630), 546 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:23,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1630 transitions. [2022-12-14 07:19:23,675 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1630 transitions. Word has length 7 [2022-12-14 07:19:23,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:23,675 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 1630 transitions. [2022-12-14 07:19:23,676 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-12-14 07:19:23,676 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1630 transitions. [2022-12-14 07:19:23,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 07:19:23,676 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:23,676 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:19:23,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-14 07:19:23,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-14 07:19:23,876 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:23,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:23,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1915766451, now seen corresponding path program 1 times [2022-12-14 07:19:23,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:23,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612586209] [2022-12-14 07:19:23,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:23,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:23,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:23,979 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:23,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612586209] [2022-12-14 07:19:23,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612586209] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:19:23,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495350653] [2022-12-14 07:19:23,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:23,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:23,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:19:23,980 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:19:23,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 07:19:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:24,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 07:19:24,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:19:24,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:24,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:19:24,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:24,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495350653] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:19:24,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1603545381] [2022-12-14 07:19:24,197 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) 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-12-14 07:19:24,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:19:24,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-14 07:19:24,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261840291] [2022-12-14 07:19:24,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:19:24,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 07:19:24,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:24,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 07:19:24,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-12-14 07:19:24,198 INFO L87 Difference]: Start difference. First operand 547 states and 1630 transitions. Second operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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-12-14 07:19:24,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:24,571 INFO L93 Difference]: Finished difference Result 849 states and 2368 transitions. [2022-12-14 07:19:24,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 07:19:24,572 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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 8 [2022-12-14 07:19:24,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:24,575 INFO L225 Difference]: With dead ends: 849 [2022-12-14 07:19:24,575 INFO L226 Difference]: Without dead ends: 843 [2022-12-14 07:19:24,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-12-14 07:19:24,576 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 170 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:24,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 0 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:19:24,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-12-14 07:19:24,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 711. [2022-12-14 07:19:24,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 604 states have (on average 3.524834437086093) internal successors, (2129), 710 states have internal predecessors, (2129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:24,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 2129 transitions. [2022-12-14 07:19:24,585 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 2129 transitions. Word has length 8 [2022-12-14 07:19:24,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:24,585 INFO L495 AbstractCegarLoop]: Abstraction has 711 states and 2129 transitions. [2022-12-14 07:19:24,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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-12-14 07:19:24,585 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 2129 transitions. [2022-12-14 07:19:24,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 07:19:24,585 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:24,585 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:19:24,590 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 07:19:24,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-14 07:19:24,786 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:24,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:24,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1923173129, now seen corresponding path program 1 times [2022-12-14 07:19:24,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:24,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512005694] [2022-12-14 07:19:24,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:24,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:24,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:24,950 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:24,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512005694] [2022-12-14 07:19:24,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512005694] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:19:24,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984394969] [2022-12-14 07:19:24,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:24,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:24,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:19:24,951 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:19:24,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 07:19:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:25,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 07:19:25,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:19:25,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 138 [2022-12-14 07:19:25,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 321 treesize of output 305 [2022-12-14 07:19:25,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:25,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:19:26,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 809 treesize of output 745 [2022-12-14 07:19:27,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:27,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984394969] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:19:27,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [745881373] [2022-12-14 07:19:27,007 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:337) 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-12-14 07:19:27,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:19:27,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-14 07:19:27,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142195580] [2022-12-14 07:19:27,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:19:27,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 07:19:27,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:27,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 07:19:27,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-12-14 07:19:27,008 INFO L87 Difference]: Start difference. First operand 711 states and 2129 transitions. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:27,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:27,347 INFO L93 Difference]: Finished difference Result 681 states and 1933 transitions. [2022-12-14 07:19:27,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 07:19:27,347 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 07:19:27,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:27,350 INFO L225 Difference]: With dead ends: 681 [2022-12-14 07:19:27,350 INFO L226 Difference]: Without dead ends: 681 [2022-12-14 07:19:27,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-12-14 07:19:27,351 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 164 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:27,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 0 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:19:27,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2022-12-14 07:19:27,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 649. [2022-12-14 07:19:27,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 542 states have (on average 3.514760147601476) internal successors, (1905), 648 states have internal predecessors, (1905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:27,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1905 transitions. [2022-12-14 07:19:27,364 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1905 transitions. Word has length 8 [2022-12-14 07:19:27,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:27,364 INFO L495 AbstractCegarLoop]: Abstraction has 649 states and 1905 transitions. [2022-12-14 07:19:27,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:27,364 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1905 transitions. [2022-12-14 07:19:27,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 07:19:27,365 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:27,365 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:19:27,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-14 07:19:27,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:27,566 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:27,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:27,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1923173059, now seen corresponding path program 1 times [2022-12-14 07:19:27,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:27,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621713424] [2022-12-14 07:19:27,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:27,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:27,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 07:19:27,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:27,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621713424] [2022-12-14 07:19:27,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621713424] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:19:27,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:19:27,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 07:19:27,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455758798] [2022-12-14 07:19:27,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:19:27,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:19:27,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:27,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:19:27,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:19:27,833 INFO L87 Difference]: Start difference. First operand 649 states and 1905 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-12-14 07:19:27,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:27,893 INFO L93 Difference]: Finished difference Result 543 states and 1582 transitions. [2022-12-14 07:19:27,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:19:27,893 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 8 [2022-12-14 07:19:27,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:27,896 INFO L225 Difference]: With dead ends: 543 [2022-12-14 07:19:27,896 INFO L226 Difference]: Without dead ends: 543 [2022-12-14 07:19:27,896 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-12-14 07:19:27,896 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:27,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 0 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:19:27,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-12-14 07:19:27,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2022-12-14 07:19:27,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 460 states have (on average 3.4391304347826086) internal successors, (1582), 542 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:27,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 1582 transitions. [2022-12-14 07:19:27,904 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 1582 transitions. Word has length 8 [2022-12-14 07:19:27,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:27,904 INFO L495 AbstractCegarLoop]: Abstraction has 543 states and 1582 transitions. [2022-12-14 07:19:27,904 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-12-14 07:19:27,904 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 1582 transitions. [2022-12-14 07:19:27,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 07:19:27,904 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:27,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:19:27,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-14 07:19:27,905 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:27,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:27,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1923173186, now seen corresponding path program 1 times [2022-12-14 07:19:27,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:27,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37350502] [2022-12-14 07:19:27,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:27,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:28,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 07:19:28,195 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:28,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37350502] [2022-12-14 07:19:28,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37350502] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:19:28,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874164623] [2022-12-14 07:19:28,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:28,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:28,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:19:28,196 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:19:28,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 07:19:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:28,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:19:28,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:19:28,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 350 treesize of output 305 [2022-12-14 07:19:28,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 142 [2022-12-14 07:19:28,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 07:19:28,894 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:19:28,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874164623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:19:28,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 07:19:28,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2022-12-14 07:19:28,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486873634] [2022-12-14 07:19:28,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:19:28,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:19:28,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:28,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:19:28,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:19:28,895 INFO L87 Difference]: Start difference. First operand 543 states and 1582 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-12-14 07:19:28,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:28,962 INFO L93 Difference]: Finished difference Result 483 states and 1395 transitions. [2022-12-14 07:19:28,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:19:28,963 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 8 [2022-12-14 07:19:28,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:28,964 INFO L225 Difference]: With dead ends: 483 [2022-12-14 07:19:28,964 INFO L226 Difference]: Without dead ends: 455 [2022-12-14 07:19:28,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:19:28,965 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:28,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:19:28,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-12-14 07:19:28,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2022-12-14 07:19:28,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 384 states have (on average 3.4609375) internal successors, (1329), 454 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:28,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1329 transitions. [2022-12-14 07:19:28,975 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1329 transitions. Word has length 8 [2022-12-14 07:19:28,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:28,975 INFO L495 AbstractCegarLoop]: Abstraction has 455 states and 1329 transitions. [2022-12-14 07:19:28,975 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-12-14 07:19:28,975 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1329 transitions. [2022-12-14 07:19:28,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 07:19:28,975 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:28,975 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:19:28,981 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 07:19:29,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-14 07:19:29,176 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:29,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:29,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1914849783, now seen corresponding path program 1 times [2022-12-14 07:19:29,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:29,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920066406] [2022-12-14 07:19:29,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:29,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:29,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 07:19:29,384 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:29,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920066406] [2022-12-14 07:19:29,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920066406] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:19:29,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790911488] [2022-12-14 07:19:29,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:29,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:29,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:19:29,385 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:19:29,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 07:19:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:29,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 07:19:29,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:19:29,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 22 [2022-12-14 07:19:29,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 07:19:29,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:19:30,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 407 treesize of output 367 [2022-12-14 07:19:30,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 07:19:30,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790911488] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 07:19:30,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 07:19:30,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 8 [2022-12-14 07:19:30,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161608630] [2022-12-14 07:19:30,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:19:30,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:19:30,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:30,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:19:30,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-14 07:19:30,104 INFO L87 Difference]: Start difference. First operand 455 states and 1329 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-12-14 07:19:30,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:30,281 INFO L93 Difference]: Finished difference Result 770 states and 2139 transitions. [2022-12-14 07:19:30,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 07:19:30,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-12-14 07:19:30,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:30,283 INFO L225 Difference]: With dead ends: 770 [2022-12-14 07:19:30,283 INFO L226 Difference]: Without dead ends: 770 [2022-12-14 07:19:30,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-14 07:19:30,284 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:30,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:19:30,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-12-14 07:19:30,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 525. [2022-12-14 07:19:30,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 454 states have (on average 3.616740088105727) internal successors, (1642), 524 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:30,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 1642 transitions. [2022-12-14 07:19:30,294 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 1642 transitions. Word has length 8 [2022-12-14 07:19:30,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:30,294 INFO L495 AbstractCegarLoop]: Abstraction has 525 states and 1642 transitions. [2022-12-14 07:19:30,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-12-14 07:19:30,294 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 1642 transitions. [2022-12-14 07:19:30,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 07:19:30,295 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:30,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:19:30,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-14 07:19:30,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-14 07:19:30,496 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:30,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:30,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1914849649, now seen corresponding path program 1 times [2022-12-14 07:19:30,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:30,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021073814] [2022-12-14 07:19:30,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:30,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:30,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 07:19:30,676 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:30,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021073814] [2022-12-14 07:19:30,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021073814] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:19:30,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:19:30,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:19:30,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459127582] [2022-12-14 07:19:30,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:19:30,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:19:30,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:30,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:19:30,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:19:30,677 INFO L87 Difference]: Start difference. First operand 525 states and 1642 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-12-14 07:19:30,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:30,836 INFO L93 Difference]: Finished difference Result 750 states and 2065 transitions. [2022-12-14 07:19:30,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 07:19:30,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-12-14 07:19:30,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:30,838 INFO L225 Difference]: With dead ends: 750 [2022-12-14 07:19:30,838 INFO L226 Difference]: Without dead ends: 713 [2022-12-14 07:19:30,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:19:30,839 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:30,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:19:30,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2022-12-14 07:19:30,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 492. [2022-12-14 07:19:30,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 421 states have (on average 3.6318289786223277) internal successors, (1529), 491 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:30,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1529 transitions. [2022-12-14 07:19:30,847 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1529 transitions. Word has length 8 [2022-12-14 07:19:30,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:30,847 INFO L495 AbstractCegarLoop]: Abstraction has 492 states and 1529 transitions. [2022-12-14 07:19:30,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-12-14 07:19:30,847 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1529 transitions. [2022-12-14 07:19:30,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 07:19:30,847 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:30,847 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:19:30,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-14 07:19:30,848 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:30,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:30,848 INFO L85 PathProgramCache]: Analyzing trace with hash 765949345, now seen corresponding path program 1 times [2022-12-14 07:19:30,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:30,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342338601] [2022-12-14 07:19:30,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:30,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:31,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 07:19:31,080 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:31,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342338601] [2022-12-14 07:19:31,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342338601] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:19:31,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792134763] [2022-12-14 07:19:31,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:31,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:31,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:19:31,081 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:19:31,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 07:19:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:31,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-14 07:19:31,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:19:31,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:19:31,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2022-12-14 07:19:31,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-12-14 07:19:31,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:31,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:19:31,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 427 treesize of output 387 [2022-12-14 07:19:31,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2022-12-14 07:19:32,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:32,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792134763] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:19:32,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1502439187] [2022-12-14 07:19:32,231 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:337) 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-12-14 07:19:32,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:19:32,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2022-12-14 07:19:32,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978983350] [2022-12-14 07:19:32,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:19:32,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 07:19:32,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:32,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 07:19:32,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=272, Unknown=4, NotChecked=0, Total=342 [2022-12-14 07:19:32,232 INFO L87 Difference]: Start difference. First operand 492 states and 1529 transitions. Second operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 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-12-14 07:19:32,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:32,758 INFO L93 Difference]: Finished difference Result 577 states and 1639 transitions. [2022-12-14 07:19:32,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 07:19:32,758 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 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-12-14 07:19:32,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:32,759 INFO L225 Difference]: With dead ends: 577 [2022-12-14 07:19:32,759 INFO L226 Difference]: Without dead ends: 577 [2022-12-14 07:19:32,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=260, Invalid=665, Unknown=5, NotChecked=0, Total=930 [2022-12-14 07:19:32,760 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 589 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 53 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:32,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 0 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 275 Invalid, 3 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:19:32,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2022-12-14 07:19:32,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 453. [2022-12-14 07:19:32,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 394 states have (on average 3.5736040609137056) internal successors, (1408), 452 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:32,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 1408 transitions. [2022-12-14 07:19:32,770 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 1408 transitions. Word has length 9 [2022-12-14 07:19:32,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:32,770 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 1408 transitions. [2022-12-14 07:19:32,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 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-12-14 07:19:32,770 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 1408 transitions. [2022-12-14 07:19:32,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 07:19:32,771 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:32,771 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:19:32,776 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 07:19:32,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-14 07:19:32,972 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:32,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:32,973 INFO L85 PathProgramCache]: Analyzing trace with hash 765949479, now seen corresponding path program 1 times [2022-12-14 07:19:32,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:32,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213082065] [2022-12-14 07:19:32,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:32,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:33,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 07:19:33,202 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:33,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213082065] [2022-12-14 07:19:33,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213082065] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:19:33,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261768291] [2022-12-14 07:19:33,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:33,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:33,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:19:33,203 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:19:33,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 07:19:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:33,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-14 07:19:33,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:19:33,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:19:33,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2022-12-14 07:19:33,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2022-12-14 07:19:33,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:33,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:19:33,691 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_643 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_643) c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) 4294967295)) is different from false [2022-12-14 07:19:33,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 423 treesize of output 383 [2022-12-14 07:19:33,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-14 07:19:34,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:34,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261768291] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:19:34,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [926485159] [2022-12-14 07:19:34,154 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:337) 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-12-14 07:19:34,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:19:34,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2022-12-14 07:19:34,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40351122] [2022-12-14 07:19:34,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:19:34,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 07:19:34,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:34,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 07:19:34,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=191, Unknown=1, NotChecked=28, Total=272 [2022-12-14 07:19:34,155 INFO L87 Difference]: Start difference. First operand 453 states and 1408 transitions. Second operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 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-12-14 07:19:35,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:35,345 INFO L93 Difference]: Finished difference Result 1309 states and 3484 transitions. [2022-12-14 07:19:35,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 07:19:35,345 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 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-12-14 07:19:35,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:35,348 INFO L225 Difference]: With dead ends: 1309 [2022-12-14 07:19:35,348 INFO L226 Difference]: Without dead ends: 1285 [2022-12-14 07:19:35,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=317, Invalid=876, Unknown=1, NotChecked=66, Total=1260 [2022-12-14 07:19:35,348 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 714 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:35,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 0 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 464 Invalid, 0 Unknown, 89 Unchecked, 0.6s Time] [2022-12-14 07:19:35,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2022-12-14 07:19:35,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 429. [2022-12-14 07:19:35,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 370 states have (on average 3.6864864864864866) internal successors, (1364), 428 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:35,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1364 transitions. [2022-12-14 07:19:35,357 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 1364 transitions. Word has length 9 [2022-12-14 07:19:35,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:35,357 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 1364 transitions. [2022-12-14 07:19:35,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 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-12-14 07:19:35,357 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1364 transitions. [2022-12-14 07:19:35,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 07:19:35,358 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:35,358 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:19:35,363 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-14 07:19:35,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:35,559 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:35,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:35,560 INFO L85 PathProgramCache]: Analyzing trace with hash -829311054, now seen corresponding path program 2 times [2022-12-14 07:19:35,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:35,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357115169] [2022-12-14 07:19:35,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:35,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:35,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:35,830 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:35,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357115169] [2022-12-14 07:19:35,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357115169] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:19:35,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623658041] [2022-12-14 07:19:35,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:19:35,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:35,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:19:35,831 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:19:35,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 07:19:35,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 07:19:35,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:19:35,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-14 07:19:35,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:19:36,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 07:19:36,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:19:36,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 07:19:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:36,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:19:36,289 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:19:36,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-12-14 07:19:36,296 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:19:36,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 37 [2022-12-14 07:19:36,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-12-14 07:19:36,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:36,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623658041] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:19:36,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1076105605] [2022-12-14 07:19:36,395 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:337) 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-12-14 07:19:36,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:19:36,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-14 07:19:36,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484262990] [2022-12-14 07:19:36,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:19:36,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 07:19:36,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:36,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 07:19:36,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2022-12-14 07:19:36,397 INFO L87 Difference]: Start difference. First operand 429 states and 1364 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-12-14 07:19:39,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:39,130 INFO L93 Difference]: Finished difference Result 1341 states and 3814 transitions. [2022-12-14 07:19:39,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-14 07:19:39,131 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-12-14 07:19:39,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:39,133 INFO L225 Difference]: With dead ends: 1341 [2022-12-14 07:19:39,133 INFO L226 Difference]: Without dead ends: 1341 [2022-12-14 07:19:39,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=460, Invalid=2192, Unknown=0, NotChecked=0, Total=2652 [2022-12-14 07:19:39,134 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 352 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:39,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 0 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 07:19:39,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2022-12-14 07:19:39,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 707. [2022-12-14 07:19:39,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 648 states have (on average 4.047839506172839) internal successors, (2623), 706 states have internal predecessors, (2623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:39,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 2623 transitions. [2022-12-14 07:19:39,147 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 2623 transitions. Word has length 9 [2022-12-14 07:19:39,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:39,147 INFO L495 AbstractCegarLoop]: Abstraction has 707 states and 2623 transitions. [2022-12-14 07:19:39,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-12-14 07:19:39,147 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 2623 transitions. [2022-12-14 07:19:39,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 07:19:39,147 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:39,147 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:19:39,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 07:19:39,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-14 07:19:39,348 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:39,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:39,349 INFO L85 PathProgramCache]: Analyzing trace with hash -829311108, now seen corresponding path program 1 times [2022-12-14 07:19:39,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:39,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870886707] [2022-12-14 07:19:39,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:39,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:39,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:39,669 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:39,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870886707] [2022-12-14 07:19:39,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870886707] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:19:39,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210644658] [2022-12-14 07:19:39,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:39,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:39,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:19:39,670 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:19:39,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 07:19:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:39,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-14 07:19:39,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:19:39,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:19:39,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:19:39,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 07:19:39,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:39,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:19:40,047 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:19:40,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-12-14 07:19:40,053 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:19:40,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2022-12-14 07:19:40,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:40,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210644658] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:19:40,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1409843169] [2022-12-14 07:19:40,099 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:337) 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-12-14 07:19:40,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:19:40,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-14 07:19:40,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872706504] [2022-12-14 07:19:40,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:19:40,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 07:19:40,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:40,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 07:19:40,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=326, Unknown=5, NotChecked=0, Total=380 [2022-12-14 07:19:40,100 INFO L87 Difference]: Start difference. First operand 707 states and 2623 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-12-14 07:19:40,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:40,575 INFO L93 Difference]: Finished difference Result 945 states and 3144 transitions. [2022-12-14 07:19:40,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 07:19:40,575 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-12-14 07:19:40,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:40,578 INFO L225 Difference]: With dead ends: 945 [2022-12-14 07:19:40,579 INFO L226 Difference]: Without dead ends: 945 [2022-12-14 07:19:40,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=633, Unknown=5, NotChecked=0, Total=756 [2022-12-14 07:19:40,580 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 131 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:40,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 0 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:19:40,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2022-12-14 07:19:40,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 717. [2022-12-14 07:19:40,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 658 states have (on average 4.031914893617022) internal successors, (2653), 716 states have internal predecessors, (2653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:40,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 2653 transitions. [2022-12-14 07:19:40,599 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 2653 transitions. Word has length 9 [2022-12-14 07:19:40,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:40,599 INFO L495 AbstractCegarLoop]: Abstraction has 717 states and 2653 transitions. [2022-12-14 07:19:40,599 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-12-14 07:19:40,599 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 2653 transitions. [2022-12-14 07:19:40,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 07:19:40,600 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:40,600 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:19:40,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-14 07:19:40,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:40,801 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:40,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:40,801 INFO L85 PathProgramCache]: Analyzing trace with hash -836717732, now seen corresponding path program 2 times [2022-12-14 07:19:40,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:40,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67270957] [2022-12-14 07:19:40,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:40,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:41,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:41,224 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:41,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67270957] [2022-12-14 07:19:41,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67270957] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:19:41,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558249735] [2022-12-14 07:19:41,224 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:19:41,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:41,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:19:41,225 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:19:41,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-14 07:19:41,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 07:19:41,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:19:41,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 07:19:41,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:19:41,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 07:19:41,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:19:41,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 07:19:41,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:19:41,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 07:19:42,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:42,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:19:43,218 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:19:43,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 58 [2022-12-14 07:19:43,230 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:19:43,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 191 treesize of output 189 [2022-12-14 07:19:43,240 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:19:43,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 148 [2022-12-14 07:19:43,249 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:19:43,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 69 [2022-12-14 07:19:43,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:43,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558249735] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:19:43,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1437572103] [2022-12-14 07:19:43,420 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:337) 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-12-14 07:19:43,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:19:43,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-14 07:19:43,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009175371] [2022-12-14 07:19:43,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:19:43,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 07:19:43,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:43,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 07:19:43,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=310, Unknown=3, NotChecked=0, Total=380 [2022-12-14 07:19:43,421 INFO L87 Difference]: Start difference. First operand 717 states and 2653 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-12-14 07:19:49,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:49,288 INFO L93 Difference]: Finished difference Result 1488 states and 5248 transitions. [2022-12-14 07:19:49,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 07:19:49,288 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-12-14 07:19:49,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:49,291 INFO L225 Difference]: With dead ends: 1488 [2022-12-14 07:19:49,291 INFO L226 Difference]: Without dead ends: 1488 [2022-12-14 07:19:49,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=217, Invalid=771, Unknown=4, NotChecked=0, Total=992 [2022-12-14 07:19:49,292 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 588 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 41 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:49,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 0 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 761 Invalid, 3 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 07:19:49,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2022-12-14 07:19:49,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 980. [2022-12-14 07:19:49,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 921 states have (on average 4.489685124864278) internal successors, (4135), 979 states have internal predecessors, (4135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:49,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 4135 transitions. [2022-12-14 07:19:49,308 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 4135 transitions. Word has length 9 [2022-12-14 07:19:49,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:49,308 INFO L495 AbstractCegarLoop]: Abstraction has 980 states and 4135 transitions. [2022-12-14 07:19:49,308 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-12-14 07:19:49,308 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 4135 transitions. [2022-12-14 07:19:49,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 07:19:49,308 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:49,308 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:19:49,313 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-14 07:19:49,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:49,509 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:49,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:49,510 INFO L85 PathProgramCache]: Analyzing trace with hash -836717657, now seen corresponding path program 1 times [2022-12-14 07:19:49,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:49,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046727852] [2022-12-14 07:19:49,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:49,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:49,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:19:49,867 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:49,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046727852] [2022-12-14 07:19:49,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046727852] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:19:49,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412016425] [2022-12-14 07:19:49,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:49,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:49,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:19:49,868 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:19:49,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-14 07:19:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:50,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-14 07:19:50,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:19:50,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 578 treesize of output 546 [2022-12-14 07:19:50,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:19:50,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:19:51,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 803 treesize of output 739 [2022-12-14 07:19:51,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:19:51,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412016425] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:19:51,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1137611720] [2022-12-14 07:19:51,565 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:337) 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-12-14 07:19:51,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:19:51,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-12-14 07:19:51,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100153970] [2022-12-14 07:19:51,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:19:51,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 07:19:51,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:51,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 07:19:51,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-14 07:19:51,566 INFO L87 Difference]: Start difference. First operand 980 states and 4135 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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-12-14 07:19:51,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:51,827 INFO L93 Difference]: Finished difference Result 1296 states and 4928 transitions. [2022-12-14 07:19:51,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 07:19:51,828 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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 9 [2022-12-14 07:19:51,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:51,831 INFO L225 Difference]: With dead ends: 1296 [2022-12-14 07:19:51,831 INFO L226 Difference]: Without dead ends: 1296 [2022-12-14 07:19:51,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-12-14 07:19:51,832 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 145 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:51,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 0 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:19:51,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2022-12-14 07:19:51,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1028. [2022-12-14 07:19:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 969 states have (on average 4.381836945304437) internal successors, (4246), 1027 states have internal predecessors, (4246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:51,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 4246 transitions. [2022-12-14 07:19:51,847 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 4246 transitions. Word has length 9 [2022-12-14 07:19:51,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:51,847 INFO L495 AbstractCegarLoop]: Abstraction has 1028 states and 4246 transitions. [2022-12-14 07:19:51,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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-12-14 07:19:51,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 4246 transitions. [2022-12-14 07:19:51,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 07:19:51,848 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:51,848 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:19:51,852 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-14 07:19:52,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:52,049 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:52,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:52,050 INFO L85 PathProgramCache]: Analyzing trace with hash -836717655, now seen corresponding path program 1 times [2022-12-14 07:19:52,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:52,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608037085] [2022-12-14 07:19:52,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:52,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:52,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:52,388 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:52,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608037085] [2022-12-14 07:19:52,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608037085] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:19:52,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268714791] [2022-12-14 07:19:52,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:52,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:52,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:19:52,390 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:19:52,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-14 07:19:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:52,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-14 07:19:52,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:19:52,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:19:52,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:19:52,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 07:19:52,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:19:52,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 07:19:53,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:53,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:19:54,522 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_819 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_819) c_~A~0.base)) (.cse2 (* c_~j~0 4))) (let ((.cse0 (select .cse1 (+ c_~A~0.offset .cse2)))) (or (not (<= 0 (+ 9223372039002259455 .cse0))) (not (<= .cse0 4294967295)) (< (select .cse1 (+ c_~A~0.offset .cse2 4)) 4294967296) (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))))))) is different from false [2022-12-14 07:19:54,552 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_818 (Array Int Int)) (v_ArrVal_819 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_818) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse0 2147483648) 0) (< 2147483647 .cse0) (< (select .cse1 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296))))) is different from false [2022-12-14 07:19:54,560 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:19:54,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 56 [2022-12-14 07:19:54,570 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:19:54,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 181 treesize of output 179 [2022-12-14 07:19:54,577 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:19:54,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 156 treesize of output 140 [2022-12-14 07:19:54,584 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:19:54,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 65 [2022-12-14 07:19:54,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 07:19:54,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268714791] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:19:54,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1358789396] [2022-12-14 07:19:54,705 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:337) 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-12-14 07:19:54,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:19:54,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-14 07:19:54,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710316337] [2022-12-14 07:19:54,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:19:54,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 07:19:54,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:54,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 07:19:54,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=256, Unknown=2, NotChecked=66, Total=380 [2022-12-14 07:19:54,707 INFO L87 Difference]: Start difference. First operand 1028 states and 4246 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-12-14 07:19:55,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:55,699 INFO L93 Difference]: Finished difference Result 1220 states and 4463 transitions. [2022-12-14 07:19:55,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 07:19:55,700 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-12-14 07:19:55,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:55,703 INFO L225 Difference]: With dead ends: 1220 [2022-12-14 07:19:55,703 INFO L226 Difference]: Without dead ends: 1220 [2022-12-14 07:19:55,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=491, Unknown=2, NotChecked=94, Total=702 [2022-12-14 07:19:55,704 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 306 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:55,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 0 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 931 Invalid, 0 Unknown, 177 Unchecked, 0.7s Time] [2022-12-14 07:19:55,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2022-12-14 07:19:55,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1028. [2022-12-14 07:19:55,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 969 states have (on average 4.1155830753353975) internal successors, (3988), 1027 states have internal predecessors, (3988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:55,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 3988 transitions. [2022-12-14 07:19:55,718 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 3988 transitions. Word has length 9 [2022-12-14 07:19:55,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:55,719 INFO L495 AbstractCegarLoop]: Abstraction has 1028 states and 3988 transitions. [2022-12-14 07:19:55,719 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-12-14 07:19:55,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 3988 transitions. [2022-12-14 07:19:55,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 07:19:55,719 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:55,719 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:19:55,724 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-14 07:19:55,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-14 07:19:55,920 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:55,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:55,921 INFO L85 PathProgramCache]: Analyzing trace with hash -828394207, now seen corresponding path program 1 times [2022-12-14 07:19:55,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:55,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093722726] [2022-12-14 07:19:55,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:55,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:56,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:19:56,132 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:56,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093722726] [2022-12-14 07:19:56,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093722726] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:19:56,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741851470] [2022-12-14 07:19:56,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:56,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:56,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:19:56,134 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:19:56,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-14 07:19:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:56,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-14 07:19:56,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:19:56,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2022-12-14 07:19:56,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:19:56,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:19:56,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 405 treesize of output 365 [2022-12-14 07:19:56,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:19:56,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741851470] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:19:56,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [683584607] [2022-12-14 07:19:56,851 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:337) 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-12-14 07:19:56,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:19:56,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-14 07:19:56,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201602020] [2022-12-14 07:19:56,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:19:56,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 07:19:56,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:56,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 07:19:56,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-14 07:19:56,852 INFO L87 Difference]: Start difference. First operand 1028 states and 3988 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:57,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:19:57,156 INFO L93 Difference]: Finished difference Result 1817 states and 6461 transitions. [2022-12-14 07:19:57,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 07:19:57,157 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 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-12-14 07:19:57,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:19:57,160 INFO L225 Difference]: With dead ends: 1817 [2022-12-14 07:19:57,160 INFO L226 Difference]: Without dead ends: 1817 [2022-12-14 07:19:57,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-12-14 07:19:57,160 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 146 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:19:57,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 0 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:19:57,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2022-12-14 07:19:57,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1230. [2022-12-14 07:19:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1171 states have (on average 4.241673783091375) internal successors, (4967), 1229 states have internal predecessors, (4967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:57,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 4967 transitions. [2022-12-14 07:19:57,180 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 4967 transitions. Word has length 9 [2022-12-14 07:19:57,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:19:57,181 INFO L495 AbstractCegarLoop]: Abstraction has 1230 states and 4967 transitions. [2022-12-14 07:19:57,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:19:57,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 4967 transitions. [2022-12-14 07:19:57,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 07:19:57,181 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:19:57,181 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:19:57,186 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-14 07:19:57,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-14 07:19:57,382 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:19:57,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:19:57,383 INFO L85 PathProgramCache]: Analyzing trace with hash -828394201, now seen corresponding path program 1 times [2022-12-14 07:19:57,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:19:57,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107166673] [2022-12-14 07:19:57,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:57,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:19:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:57,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:19:57,597 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:19:57,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107166673] [2022-12-14 07:19:57,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107166673] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:19:57,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023889007] [2022-12-14 07:19:57,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:19:57,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:19:57,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:19:57,599 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:19:57,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-14 07:19:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:19:57,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 07:19:57,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:19:58,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:19:58,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:19:58,468 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:19:58,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 503 treesize of output 443 [2022-12-14 07:19:58,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:19:58,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023889007] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:19:58,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1767374223] [2022-12-14 07:19:58,782 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) 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-12-14 07:19:58,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:19:58,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 5] total 16 [2022-12-14 07:19:58,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344369253] [2022-12-14 07:19:58,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:19:58,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 07:19:58,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:19:58,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 07:19:58,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-12-14 07:19:58,784 INFO L87 Difference]: Start difference. First operand 1230 states and 4967 transitions. Second operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 17 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-12-14 07:20:00,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:20:00,895 INFO L93 Difference]: Finished difference Result 2960 states and 9013 transitions. [2022-12-14 07:20:00,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-14 07:20:00,896 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.5625) internal successors, (25), 17 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 9 [2022-12-14 07:20:00,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:20:00,901 INFO L225 Difference]: With dead ends: 2960 [2022-12-14 07:20:00,901 INFO L226 Difference]: Without dead ends: 2960 [2022-12-14 07:20:00,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=604, Invalid=2152, Unknown=0, NotChecked=0, Total=2756 [2022-12-14 07:20:00,901 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 865 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:20:00,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 0 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 07:20:00,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2022-12-14 07:20:00,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1252. [2022-12-14 07:20:00,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 1193 states have (on average 4.091366303436714) internal successors, (4881), 1251 states have internal predecessors, (4881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:20:00,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 4881 transitions. [2022-12-14 07:20:00,931 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 4881 transitions. Word has length 9 [2022-12-14 07:20:00,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:20:00,932 INFO L495 AbstractCegarLoop]: Abstraction has 1252 states and 4881 transitions. [2022-12-14 07:20:00,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.5625) internal successors, (25), 17 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-12-14 07:20:00,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 4881 transitions. [2022-12-14 07:20:00,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 07:20:00,932 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:20:00,933 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:20:00,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-14 07:20:01,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:20:01,133 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:20:01,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:20:01,133 INFO L85 PathProgramCache]: Analyzing trace with hash 54131066, now seen corresponding path program 1 times [2022-12-14 07:20:01,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:20:01,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158501114] [2022-12-14 07:20:01,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:20:01,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:20:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:20:01,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:20:01,475 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:20:01,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158501114] [2022-12-14 07:20:01,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158501114] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:20:01,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194155868] [2022-12-14 07:20:01,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:20:01,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:20:01,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:20:01,476 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:20:01,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-14 07:20:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:20:01,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 07:20:01,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:20:01,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:20:01,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:20:01,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 07:20:01,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:20:01,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 07:20:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:20:01,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:20:01,975 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:20:01,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-12-14 07:20:01,980 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:20:01,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 67 [2022-12-14 07:20:01,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-12-14 07:20:01,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-12-14 07:20:02,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:20:02,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194155868] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:20:02,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1450008338] [2022-12-14 07:20:02,054 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:337) 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-12-14 07:20:02,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:20:02,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-14 07:20:02,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480850350] [2022-12-14 07:20:02,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:20:02,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 07:20:02,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:20:02,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 07:20:02,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=443, Unknown=6, NotChecked=0, Total=506 [2022-12-14 07:20:02,055 INFO L87 Difference]: Start difference. First operand 1252 states and 4881 transitions. Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 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-12-14 07:20:04,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:20:04,471 INFO L93 Difference]: Finished difference Result 3066 states and 9504 transitions. [2022-12-14 07:20:04,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 07:20:04,472 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 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-12-14 07:20:04,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:20:04,477 INFO L225 Difference]: With dead ends: 3066 [2022-12-14 07:20:04,477 INFO L226 Difference]: Without dead ends: 3066 [2022-12-14 07:20:04,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=336, Invalid=1637, Unknown=7, NotChecked=0, Total=1980 [2022-12-14 07:20:04,478 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 618 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:20:04,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 0 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 07:20:04,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3066 states. [2022-12-14 07:20:04,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3066 to 1345. [2022-12-14 07:20:04,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 1286 states have (on average 4.078538102643857) internal successors, (5245), 1344 states have internal predecessors, (5245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:20:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 5245 transitions. [2022-12-14 07:20:04,510 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 5245 transitions. Word has length 10 [2022-12-14 07:20:04,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:20:04,510 INFO L495 AbstractCegarLoop]: Abstraction has 1345 states and 5245 transitions. [2022-12-14 07:20:04,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 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-12-14 07:20:04,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 5245 transitions. [2022-12-14 07:20:04,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 07:20:04,511 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:20:04,511 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:20:04,516 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-14 07:20:04,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-14 07:20:04,712 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:20:04,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:20:04,713 INFO L85 PathProgramCache]: Analyzing trace with hash 54131012, now seen corresponding path program 1 times [2022-12-14 07:20:04,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:20:04,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895531795] [2022-12-14 07:20:04,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:20:04,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:20:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:20:05,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:20:05,014 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:20:05,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895531795] [2022-12-14 07:20:05,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895531795] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:20:05,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124217878] [2022-12-14 07:20:05,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:20:05,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:20:05,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:20:05,015 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:20:05,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-14 07:20:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:20:05,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 07:20:05,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:20:05,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:20:05,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:20:05,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 07:20:05,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:20:05,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 07:20:05,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:20:05,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:20:05,501 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:20:05,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-14 07:20:05,507 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:20:05,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 77 [2022-12-14 07:20:05,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2022-12-14 07:20:05,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-12-14 07:20:05,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:20:05,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124217878] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:20:05,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [635073877] [2022-12-14 07:20:05,599 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:337) 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-12-14 07:20:05,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:20:05,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-14 07:20:05,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616542417] [2022-12-14 07:20:05,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:20:05,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 07:20:05,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:20:05,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 07:20:05,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=429, Unknown=12, NotChecked=0, Total=506 [2022-12-14 07:20:05,601 INFO L87 Difference]: Start difference. First operand 1345 states and 5245 transitions. Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 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-12-14 07:20:06,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:20:06,366 INFO L93 Difference]: Finished difference Result 2280 states and 7723 transitions. [2022-12-14 07:20:06,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 07:20:06,366 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 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-12-14 07:20:06,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:20:06,370 INFO L225 Difference]: With dead ends: 2280 [2022-12-14 07:20:06,370 INFO L226 Difference]: Without dead ends: 2280 [2022-12-14 07:20:06,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=773, Unknown=14, NotChecked=0, Total=930 [2022-12-14 07:20:06,371 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 285 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:20:06,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 0 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 07:20:06,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2280 states. [2022-12-14 07:20:06,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 1447. [2022-12-14 07:20:06,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1388 states have (on average 4.001440922190202) internal successors, (5554), 1446 states have internal predecessors, (5554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:20:06,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 5554 transitions. [2022-12-14 07:20:06,394 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 5554 transitions. Word has length 10 [2022-12-14 07:20:06,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:20:06,394 INFO L495 AbstractCegarLoop]: Abstraction has 1447 states and 5554 transitions. [2022-12-14 07:20:06,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 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-12-14 07:20:06,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 5554 transitions. [2022-12-14 07:20:06,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 07:20:06,395 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:20:06,395 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:20:06,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-14 07:20:06,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-14 07:20:06,595 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:20:06,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:20:06,596 INFO L85 PathProgramCache]: Analyzing trace with hash 61158146, now seen corresponding path program 2 times [2022-12-14 07:20:06,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:20:06,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898976069] [2022-12-14 07:20:06,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:20:06,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:20:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:20:06,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:20:06,847 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:20:06,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898976069] [2022-12-14 07:20:06,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898976069] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:20:06,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756809210] [2022-12-14 07:20:06,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:20:06,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:20:06,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:20:06,848 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:20:06,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-14 07:20:07,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 07:20:07,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:20:07,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-14 07:20:07,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:20:07,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 07:20:07,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:20:07,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 07:20:07,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:20:07,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 07:20:07,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:20:07,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:20:07,479 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:20:07,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-14 07:20:07,491 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:20:07,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 145 [2022-12-14 07:20:07,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 106 [2022-12-14 07:20:07,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2022-12-14 07:20:07,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:20:07,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756809210] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:20:07,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [83476552] [2022-12-14 07:20:07,651 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:337) 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-12-14 07:20:07,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:20:07,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-14 07:20:07,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720077542] [2022-12-14 07:20:07,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:20:07,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 07:20:07,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:20:07,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 07:20:07,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=440, Unknown=1, NotChecked=0, Total=506 [2022-12-14 07:20:07,653 INFO L87 Difference]: Start difference. First operand 1447 states and 5554 transitions. Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 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-12-14 07:20:11,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:20:11,331 INFO L93 Difference]: Finished difference Result 3371 states and 10364 transitions. [2022-12-14 07:20:11,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-14 07:20:11,332 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 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-12-14 07:20:11,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:20:11,337 INFO L225 Difference]: With dead ends: 3371 [2022-12-14 07:20:11,338 INFO L226 Difference]: Without dead ends: 3371 [2022-12-14 07:20:11,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=479, Invalid=2273, Unknown=4, NotChecked=0, Total=2756 [2022-12-14 07:20:11,338 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1248 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 119 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1248 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-14 07:20:11,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1248 Valid, 0 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1082 Invalid, 2 Unknown, 0 Unchecked, 1.8s Time] [2022-12-14 07:20:11,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states. [2022-12-14 07:20:11,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3371 to 1474. [2022-12-14 07:20:11,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1415 states have (on average 3.9618374558303886) internal successors, (5606), 1473 states have internal predecessors, (5606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:20:11,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 5606 transitions. [2022-12-14 07:20:11,369 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 5606 transitions. Word has length 10 [2022-12-14 07:20:11,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:20:11,369 INFO L495 AbstractCegarLoop]: Abstraction has 1474 states and 5606 transitions. [2022-12-14 07:20:11,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 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-12-14 07:20:11,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 5606 transitions. [2022-12-14 07:20:11,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 07:20:11,369 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:20:11,370 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:20:11,374 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-14 07:20:11,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-14 07:20:11,570 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:20:11,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:20:11,571 INFO L85 PathProgramCache]: Analyzing trace with hash 61158092, now seen corresponding path program 2 times [2022-12-14 07:20:11,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:20:11,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818892882] [2022-12-14 07:20:11,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:20:11,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:20:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:20:11,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:20:11,842 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:20:11,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818892882] [2022-12-14 07:20:11,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818892882] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:20:11,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561512989] [2022-12-14 07:20:11,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:20:11,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:20:11,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:20:11,844 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:20:11,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-14 07:20:12,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 07:20:12,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:20:12,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-14 07:20:12,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:20:12,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 07:20:12,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:20:12,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 07:20:12,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:20:12,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 07:20:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:20:12,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:20:12,524 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:20:12,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2022-12-14 07:20:12,532 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:20:12,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 85 [2022-12-14 07:20:12,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2022-12-14 07:20:12,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2022-12-14 07:20:12,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:20:12,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561512989] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:20:12,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [337721686] [2022-12-14 07:20:12,728 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:337) 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-12-14 07:20:12,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:20:12,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-14 07:20:12,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454349011] [2022-12-14 07:20:12,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:20:12,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 07:20:12,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:20:12,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 07:20:12,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=438, Unknown=3, NotChecked=0, Total=506 [2022-12-14 07:20:12,730 INFO L87 Difference]: Start difference. First operand 1474 states and 5606 transitions. Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 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-12-14 07:20:16,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:20:16,812 INFO L93 Difference]: Finished difference Result 3095 states and 9350 transitions. [2022-12-14 07:20:16,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-14 07:20:16,812 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 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-12-14 07:20:16,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:20:16,818 INFO L225 Difference]: With dead ends: 3095 [2022-12-14 07:20:16,818 INFO L226 Difference]: Without dead ends: 3095 [2022-12-14 07:20:16,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=479, Invalid=2269, Unknown=8, NotChecked=0, Total=2756 [2022-12-14 07:20:16,819 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1046 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 115 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:20:16,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 0 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1375 Invalid, 5 Unknown, 0 Unchecked, 2.1s Time] [2022-12-14 07:20:16,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3095 states. [2022-12-14 07:20:16,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3095 to 1489. [2022-12-14 07:20:16,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1489 states, 1430 states have (on average 3.8734265734265736) internal successors, (5539), 1488 states have internal predecessors, (5539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:20:16,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 5539 transitions. [2022-12-14 07:20:16,848 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 5539 transitions. Word has length 10 [2022-12-14 07:20:16,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:20:16,848 INFO L495 AbstractCegarLoop]: Abstraction has 1489 states and 5539 transitions. [2022-12-14 07:20:16,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 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-12-14 07:20:16,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 5539 transitions. [2022-12-14 07:20:16,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 07:20:16,848 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:20:16,848 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 07:20:16,853 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-14 07:20:17,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-12-14 07:20:17,049 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting thread2Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:20:17,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:20:17,050 INFO L85 PathProgramCache]: Analyzing trace with hash -168439549, now seen corresponding path program 1 times [2022-12-14 07:20:17,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:20:17,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977133951] [2022-12-14 07:20:17,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:20:17,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:20:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:20:17,152 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 07:20:17,152 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:20:17,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977133951] [2022-12-14 07:20:17,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977133951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:20:17,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:20:17,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 07:20:17,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932265350] [2022-12-14 07:20:17,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:20:17,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:20:17,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:20:17,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:20:17,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:20:17,154 INFO L87 Difference]: Start difference. First operand 1489 states and 5539 transitions. Second operand has 3 states, 2 states have (on average 4.5) 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-12-14 07:20:17,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:20:17,200 INFO L93 Difference]: Finished difference Result 1355 states and 5025 transitions. [2022-12-14 07:20:17,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:20:17,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) 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-12-14 07:20:17,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:20:17,203 INFO L225 Difference]: With dead ends: 1355 [2022-12-14 07:20:17,203 INFO L226 Difference]: Without dead ends: 1355 [2022-12-14 07:20:17,203 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-12-14 07:20:17,203 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:20:17,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:20:17,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-12-14 07:20:17,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1355. [2022-12-14 07:20:17,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 1306 states have (on average 3.847626339969372) internal successors, (5025), 1354 states have internal predecessors, (5025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:20:17,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 5025 transitions. [2022-12-14 07:20:17,221 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 5025 transitions. Word has length 10 [2022-12-14 07:20:17,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:20:17,221 INFO L495 AbstractCegarLoop]: Abstraction has 1355 states and 5025 transitions. [2022-12-14 07:20:17,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) 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-12-14 07:20:17,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 5025 transitions. [2022-12-14 07:20:17,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 07:20:17,221 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:20:17,221 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 07:20:17,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-14 07:20:17,222 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:20:17,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:20:17,222 INFO L85 PathProgramCache]: Analyzing trace with hash -168439593, now seen corresponding path program 2 times [2022-12-14 07:20:17,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:20:17,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973212538] [2022-12-14 07:20:17,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:20:17,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:20:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:20:17,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:20:17,397 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:20:17,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973212538] [2022-12-14 07:20:17,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973212538] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:20:17,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363622792] [2022-12-14 07:20:17,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:20:17,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:20:17,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:20:17,398 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:20:17,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-14 07:20:17,635 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 07:20:17,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:20:17,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 07:20:17,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:20:18,586 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:20:18,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 671 treesize of output 571 [2022-12-14 07:20:18,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:20:18,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:20:20,712 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 07:20:20,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 997 treesize of output 853 [2022-12-14 07:20:21,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:20:21,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363622792] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:20:21,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [577588487] [2022-12-14 07:20:21,499 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:337) 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-12-14 07:20:21,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:20:21,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-14 07:20:21,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165039181] [2022-12-14 07:20:21,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:20:21,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 07:20:21,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:20:21,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 07:20:21,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-12-14 07:20:21,500 INFO L87 Difference]: Start difference. First operand 1355 states and 5025 transitions. Second operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 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-12-14 07:20:21,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:20:21,970 INFO L93 Difference]: Finished difference Result 1407 states and 4831 transitions. [2022-12-14 07:20:21,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 07:20:21,970 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 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 10 [2022-12-14 07:20:21,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:20:21,973 INFO L225 Difference]: With dead ends: 1407 [2022-12-14 07:20:21,973 INFO L226 Difference]: Without dead ends: 1393 [2022-12-14 07:20:21,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2022-12-14 07:20:21,974 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 260 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:20:21,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 0 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 07:20:21,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2022-12-14 07:20:21,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1263. [2022-12-14 07:20:21,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 1214 states have (on average 3.7224052718286655) internal successors, (4519), 1262 states have internal predecessors, (4519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:20:21,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 4519 transitions. [2022-12-14 07:20:21,991 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 4519 transitions. Word has length 10 [2022-12-14 07:20:21,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:20:21,991 INFO L495 AbstractCegarLoop]: Abstraction has 1263 states and 4519 transitions. [2022-12-14 07:20:21,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 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-12-14 07:20:21,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 4519 transitions. [2022-12-14 07:20:21,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 07:20:21,992 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:20:21,992 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:20:21,997 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-12-14 07:20:22,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-12-14 07:20:22,193 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:20:22,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:20:22,194 INFO L85 PathProgramCache]: Analyzing trace with hash 86328463, now seen corresponding path program 1 times [2022-12-14 07:20:22,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:20:22,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638949582] [2022-12-14 07:20:22,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:20:22,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:20:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:20:22,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:20:22,391 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:20:22,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638949582] [2022-12-14 07:20:22,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638949582] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:20:22,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851333157] [2022-12-14 07:20:22,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:20:22,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:20:22,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:20:22,392 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:20:22,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-14 07:20:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:20:22,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 07:20:22,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:20:22,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:20:22,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2022-12-14 07:20:22,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-12-14 07:20:22,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:20:22,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:20:23,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 410 treesize of output 370 [2022-12-14 07:20:23,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:20:23,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851333157] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:20:23,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1890222522] [2022-12-14 07:20:23,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:337) 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-12-14 07:20:23,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:20:23,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-14 07:20:23,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181769036] [2022-12-14 07:20:23,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:20:23,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 07:20:23,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:20:23,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 07:20:23,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-12-14 07:20:23,448 INFO L87 Difference]: Start difference. First operand 1263 states and 4519 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-12-14 07:20:23,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:20:23,940 INFO L93 Difference]: Finished difference Result 1773 states and 5794 transitions. [2022-12-14 07:20:23,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 07:20:23,940 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 10 [2022-12-14 07:20:23,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:20:23,943 INFO L225 Difference]: With dead ends: 1773 [2022-12-14 07:20:23,943 INFO L226 Difference]: Without dead ends: 1773 [2022-12-14 07:20:23,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2022-12-14 07:20:23,944 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 333 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:20:23,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 0 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:20:23,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2022-12-14 07:20:23,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1376. [2022-12-14 07:20:23,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1327 states have (on average 3.709118311981914) internal successors, (4922), 1375 states have internal predecessors, (4922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:20:23,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 4922 transitions. [2022-12-14 07:20:23,964 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 4922 transitions. Word has length 10 [2022-12-14 07:20:23,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:20:23,964 INFO L495 AbstractCegarLoop]: Abstraction has 1376 states and 4922 transitions. [2022-12-14 07:20:23,964 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-12-14 07:20:23,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 4922 transitions. [2022-12-14 07:20:23,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 07:20:23,965 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:20:23,965 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:20:23,971 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-12-14 07:20:24,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:20:24,165 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:20:24,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:20:24,166 INFO L85 PathProgramCache]: Analyzing trace with hash 86328469, now seen corresponding path program 1 times [2022-12-14 07:20:24,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:20:24,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633807819] [2022-12-14 07:20:24,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:20:24,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:20:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:20:24,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:20:24,419 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:20:24,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633807819] [2022-12-14 07:20:24,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633807819] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:20:24,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135103265] [2022-12-14 07:20:24,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:20:24,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:20:24,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:20:24,421 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:20:24,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-14 07:20:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:20:24,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 07:20:24,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:20:24,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:20:24,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2022-12-14 07:20:24,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:20:24,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:20:25,099 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset (* c_~i~0 4)))) (and (forall ((v_~i~0_238 Int) (v_ArrVal_1152 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1152) c_~A~0.base))) (let ((.cse0 (select .cse1 (+ c_~A~0.offset (* v_~i~0_238 4))))) (or (< 0 .cse0) (<= c_~N~0 v_~i~0_238) (< 0 (+ 2147483649 (select .cse1 .cse2) .cse0)) (< .cse0 0))))) (forall ((v_~i~0_237 Int) (v_ArrVal_1152 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1152) c_~A~0.base))) (let ((.cse4 (select .cse3 (+ c_~A~0.offset (* v_~i~0_237 4))))) (or (< 0 (+ 2147483649 (select .cse3 .cse2) .cse4)) (not (< v_~i~0_237 c_~N~0)) (<= .cse4 0) (not (<= .cse4 4294967295)))))))) is different from false [2022-12-14 07:20:25,332 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:20:25,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 621 treesize of output 561 [2022-12-14 07:20:25,363 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:20:25,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 152 [2022-12-14 07:20:25,395 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:20:25,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 128 [2022-12-14 07:20:26,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:20:26,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135103265] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:20:26,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1241670079] [2022-12-14 07:20:26,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:337) 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-12-14 07:20:26,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:20:26,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-14 07:20:26,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998373766] [2022-12-14 07:20:26,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:20:26,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 07:20:26,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:20:26,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 07:20:26,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=192, Unknown=1, NotChecked=28, Total=272 [2022-12-14 07:20:26,117 INFO L87 Difference]: Start difference. First operand 1376 states and 4922 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 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-12-14 07:20:26,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:20:26,678 INFO L93 Difference]: Finished difference Result 1957 states and 6262 transitions. [2022-12-14 07:20:26,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 07:20:26,679 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 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 10 [2022-12-14 07:20:26,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:20:26,682 INFO L225 Difference]: With dead ends: 1957 [2022-12-14 07:20:26,682 INFO L226 Difference]: Without dead ends: 1957 [2022-12-14 07:20:26,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=412, Unknown=1, NotChecked=44, Total=600 [2022-12-14 07:20:26,682 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 305 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:20:26,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 0 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 373 Invalid, 0 Unknown, 108 Unchecked, 0.4s Time] [2022-12-14 07:20:26,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2022-12-14 07:20:26,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 1219. [2022-12-14 07:20:26,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 1170 states have (on average 3.700854700854701) internal successors, (4330), 1218 states have internal predecessors, (4330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:20:26,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 4330 transitions. [2022-12-14 07:20:26,703 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 4330 transitions. Word has length 10 [2022-12-14 07:20:26,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:20:26,703 INFO L495 AbstractCegarLoop]: Abstraction has 1219 states and 4330 transitions. [2022-12-14 07:20:26,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 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-12-14 07:20:26,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 4330 transitions. [2022-12-14 07:20:26,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 07:20:26,704 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:20:26,704 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 07:20:26,709 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-14 07:20:26,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:20:26,905 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:20:26,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:20:26,906 INFO L85 PathProgramCache]: Analyzing trace with hash 238143921, now seen corresponding path program 3 times [2022-12-14 07:20:26,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:20:26,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330604150] [2022-12-14 07:20:26,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:20:26,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:20:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:20:27,490 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:20:27,490 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:20:27,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330604150] [2022-12-14 07:20:27,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330604150] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:20:27,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886669536] [2022-12-14 07:20:27,491 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:20:27,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:20:27,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:20:27,492 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:20:27,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-14 07:20:27,708 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:20:27,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:20:27,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 07:20:27,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:20:27,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:20:27,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:20:27,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 07:20:27,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:20:27,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 07:20:29,028 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:20:29,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:20:32,666 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse22 (* c_~j~0 4))) (let ((.cse12 (not (<= c_~bag2~0 4294967295))) (.cse6 (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647))) (.cse7 (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648)))) (.cse11 (<= 0 c_~bag2~0)) (.cse2 (+ c_~A~0.offset 8 .cse22)) (.cse5 (+ c_~A~0.offset .cse22)) (.cse4 (+ c_~A~0.offset .cse22 4))) (and (forall ((v_ArrVal_1194 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1194) c_~A~0.base))) (let ((.cse0 (select .cse1 .cse5)) (.cse3 (select .cse1 .cse4))) (or (< 4294967295 .cse0) (not (<= 0 (+ .cse0 9223372039002259455))) (not (<= 0 (+ .cse0 c_~bag2~0 2147483648))) (< 0 (+ (select .cse1 .cse2) 9223372039002259456)) (not (<= (+ .cse0 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse0 c_~bag2~0 .cse3 2147483648))) (not (<= (+ .cse0 c_~bag2~0 .cse3) 2147483647)))))) (or .cse6 .cse7 (forall ((v_ArrVal_1194 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1194) c_~A~0.base))) (let ((.cse9 (select .cse10 .cse4)) (.cse8 (select .cse10 .cse5))) (or (not (<= .cse8 4294967295)) (< c_~bag2~0 (+ .cse9 1)) (not (<= 0 (+ .cse8 .cse9 2147483648))) (< 0 (+ (select .cse10 .cse2) 9223372039002259456)) (not (<= (+ .cse8 c_~bag2~0) 2147483647)))))) .cse11) (or .cse12 .cse6 .cse7 (and (forall ((v_ArrVal_1194 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1194) c_~A~0.base))) (let ((.cse14 (select .cse15 .cse4)) (.cse13 (select .cse15 .cse5))) (or (<= 0 .cse13) (not (<= 0 (+ .cse13 c_~bag2~0 2147483648))) (not (<= .cse14 4294967295)) (not (<= 0 (+ .cse13 .cse14 2147483648))) (not (<= (+ .cse13 .cse14) 2147483647)) (< (+ .cse13 c_~bag2~0 c_~sum2~0 2147483648) 0) (< 0 (+ (select .cse15 .cse2) 9223372039002259456)) (not (<= (+ .cse13 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_1194 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1194) c_~A~0.base))) (let ((.cse17 (select .cse18 .cse4)) (.cse16 (select .cse18 .cse5))) (or (not (<= 0 (+ .cse16 c_~bag2~0 2147483648))) (not (<= 0 (+ .cse16 .cse17 2147483648))) (not (<= (+ .cse16 .cse17) 2147483647)) (not (<= (+ .cse16 c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 .cse16)) (< 0 (+ (select .cse18 .cse2) 9223372039002259456)) (not (<= (+ .cse16 c_~bag2~0) 2147483647)))))))) (or .cse12 .cse6 .cse7 (not .cse11) (forall ((v_ArrVal_1194 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1194) c_~A~0.base))) (let ((.cse19 (select .cse21 .cse4)) (.cse20 (select .cse21 .cse5))) (or (< c_~bag2~0 (+ .cse19 1)) (not (<= 0 (+ .cse20 .cse19 2147483648))) (< 0 (+ (select .cse21 .cse2) 9223372039002259456)) (not (<= (+ .cse20 c_~bag2~0) 2147483647)))))))))) is different from false [2022-12-14 07:20:32,859 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1194 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1193) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1194) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse1 (select .cse2 .cse4)) (.cse0 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 .cse0) (< (+ .cse1 2147483648 .cse0) 0) (< 0 (+ (select .cse2 .cse3) 9223372039002259456)) (< .cse0 0) (< 2147483647 (+ .cse1 .cse0)))))) (forall ((v_ArrVal_1194 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1193) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1194) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse6 (select .cse7 .cse4)) (.cse5 (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ 2147483648 .cse5) 0) (< 2147483647 .cse5) (< (+ .cse6 2147483648 .cse5) 0) (< 0 (+ (select .cse7 .cse3) 9223372039002259456)) (< 2147483647 (+ .cse6 .cse5)))))) (forall ((v_ArrVal_1194 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1193) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1194) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse9 (select .cse10 .cse4)) (.cse8 (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ 2147483648 .cse8) 0) (< (+ .cse9 2147483648 .cse8) 0) (< 0 (+ (select .cse10 .cse3) 9223372039002259456)) (<= 0 .cse8) (< 2147483647 (+ .cse9 .cse8)))))) (forall ((v_ArrVal_1194 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1193) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1194) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse13 (select .cse12 .cse4)) (.cse11 (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= .cse11 2147483647)) (< 0 (+ (select .cse12 .cse3) 9223372039002259456)) (< 0 (+ .cse13 1)) (not (<= 0 (+ .cse13 2147483648 .cse11))))))))) is different from false [2022-12-14 07:20:32,902 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:20:32,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 692 treesize of output 393 [2022-12-14 07:20:32,928 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:20:32,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2072 treesize of output 1898 [2022-12-14 07:20:32,956 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:20:32,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1862 treesize of output 1822 [2022-12-14 07:20:32,984 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:20:32,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1822 treesize of output 1802 [2022-12-14 07:20:33,013 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:20:33,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1802 treesize of output 1762 [2022-12-14 07:20:33,043 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:20:33,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1762 treesize of output 1682 [2022-12-14 07:20:33,083 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:20:33,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1682 treesize of output 1650 [2022-12-14 07:20:33,111 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:20:33,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1650 treesize of output 1634 [2022-12-14 07:20:33,139 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:20:33,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1634 treesize of output 1554 [2022-12-14 07:20:33,167 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:20:33,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1554 treesize of output 1514 [2022-12-14 07:20:33,938 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-14 07:20:33,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886669536] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:20:33,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1458966766] [2022-12-14 07:20:33,939 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:337) 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-12-14 07:20:33,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:20:33,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-14 07:20:33,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32809373] [2022-12-14 07:20:33,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:20:33,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 07:20:33,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:20:33,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 07:20:33,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=491, Unknown=2, NotChecked=90, Total=650 [2022-12-14 07:20:33,941 INFO L87 Difference]: Start difference. First operand 1219 states and 4330 transitions. Second operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-12-14 07:20:39,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:20:39,296 INFO L93 Difference]: Finished difference Result 2069 states and 6626 transitions. [2022-12-14 07:20:39,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-14 07:20:39,297 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-12-14 07:20:39,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:20:39,301 INFO L225 Difference]: With dead ends: 2069 [2022-12-14 07:20:39,301 INFO L226 Difference]: Without dead ends: 2069 [2022-12-14 07:20:39,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=350, Invalid=2206, Unknown=2, NotChecked=198, Total=2756 [2022-12-14 07:20:39,302 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1116 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2393 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1116 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 480 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-14 07:20:39,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1116 Valid, 0 Invalid, 2934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2393 Invalid, 0 Unknown, 480 Unchecked, 1.8s Time] [2022-12-14 07:20:39,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2022-12-14 07:20:39,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1249. [2022-12-14 07:20:39,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1200 states have (on average 3.8691666666666666) internal successors, (4643), 1248 states have internal predecessors, (4643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:20:39,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 4643 transitions. [2022-12-14 07:20:39,323 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 4643 transitions. Word has length 11 [2022-12-14 07:20:39,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:20:39,323 INFO L495 AbstractCegarLoop]: Abstraction has 1249 states and 4643 transitions. [2022-12-14 07:20:39,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-12-14 07:20:39,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 4643 transitions. [2022-12-14 07:20:39,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 07:20:39,323 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:20:39,323 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 07:20:39,329 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-12-14 07:20:39,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:20:39,524 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:20:39,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:20:39,525 INFO L85 PathProgramCache]: Analyzing trace with hash 238143996, now seen corresponding path program 3 times [2022-12-14 07:20:39,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:20:39,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120589331] [2022-12-14 07:20:39,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:20:39,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:20:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:20:40,107 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:20:40,107 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:20:40,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120589331] [2022-12-14 07:20:40,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120589331] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:20:40,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603376198] [2022-12-14 07:20:40,108 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:20:40,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:20:40,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:20:40,109 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:20:40,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-14 07:20:40,329 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:20:40,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:20:40,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 07:20:40,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:20:40,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:20:40,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 07:20:40,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:20:40,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 07:20:40,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:20:40,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 07:20:41,361 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:20:41,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 664 treesize of output 576 [2022-12-14 07:20:41,750 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:20:41,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:20:44,142 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1237 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1237) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1238) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (<= 0 (+ .cse0 .cse1 2147483648))) (not (<= .cse0 2147483647)) (<= 0 (+ .cse1 2147483648)))))) is different from false [2022-12-14 07:20:44,157 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1237 (Array Int Int)) (v_ArrVal_1236 Int)) (let ((.cse2 (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~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1236)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1237) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1238) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse2 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse1 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= 0 (+ .cse0 2147483648)) (not (<= 0 (+ .cse0 .cse1 2147483648))) (not (<= .cse1 2147483647)))))) is different from false [2022-12-14 07:20:44,171 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:20:44,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 141 treesize of output 86 [2022-12-14 07:20:44,183 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:20:44,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 223 treesize of output 215 [2022-12-14 07:20:44,192 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:20:44,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 190 treesize of output 166 [2022-12-14 07:20:44,202 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:20:44,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 129 [2022-12-14 07:20:44,434 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-12-14 07:20:44,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603376198] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:20:44,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2061989290] [2022-12-14 07:20:44,435 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:337) 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-12-14 07:20:44,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:20:44,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-12-14 07:20:44,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783260654] [2022-12-14 07:20:44,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:20:44,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 07:20:44,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:20:44,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 07:20:44,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=430, Unknown=3, NotChecked=86, Total=600 [2022-12-14 07:20:44,437 INFO L87 Difference]: Start difference. First operand 1249 states and 4643 transitions. Second operand has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:21:01,867 WARN L233 SmtUtils]: Spent 16.29s on a formula simplification. DAG size of input: 89 DAG size of output: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:21:12,478 WARN L233 SmtUtils]: Spent 10.34s on a formula simplification. DAG size of input: 100 DAG size of output: 93 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:21:20,821 WARN L233 SmtUtils]: Spent 8.13s on a formula simplification. DAG size of input: 77 DAG size of output: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:21:27,199 WARN L233 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 88 DAG size of output: 88 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:21:27,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:21:27,688 INFO L93 Difference]: Finished difference Result 2113 states and 6507 transitions. [2022-12-14 07:21:27,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-14 07:21:27,688 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 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-12-14 07:21:27,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:21:27,692 INFO L225 Difference]: With dead ends: 2113 [2022-12-14 07:21:27,692 INFO L226 Difference]: Without dead ends: 2113 [2022-12-14 07:21:27,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 42.5s TimeCoverageRelationStatistics Valid=496, Invalid=2161, Unknown=3, NotChecked=202, Total=2862 [2022-12-14 07:21:27,693 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1244 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1244 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 310 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:21:27,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1244 Valid, 0 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1075 Invalid, 0 Unknown, 310 Unchecked, 1.1s Time] [2022-12-14 07:21:27,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2022-12-14 07:21:27,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 1315. [2022-12-14 07:21:27,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1315 states, 1266 states have (on average 3.906003159557662) internal successors, (4945), 1314 states have internal predecessors, (4945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:21:27,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 4945 transitions. [2022-12-14 07:21:27,713 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 4945 transitions. Word has length 11 [2022-12-14 07:21:27,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:21:27,713 INFO L495 AbstractCegarLoop]: Abstraction has 1315 states and 4945 transitions. [2022-12-14 07:21:27,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:21:27,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 4945 transitions. [2022-12-14 07:21:27,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 07:21:27,714 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:21:27,714 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 07:21:27,719 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-12-14 07:21:27,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-12-14 07:21:27,915 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:21:27,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:21:27,916 INFO L85 PathProgramCache]: Analyzing trace with hash 238143998, now seen corresponding path program 2 times [2022-12-14 07:21:27,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:21:27,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988022086] [2022-12-14 07:21:27,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:21:27,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:21:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:21:28,407 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:21:28,407 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:21:28,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988022086] [2022-12-14 07:21:28,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988022086] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:21:28,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122632557] [2022-12-14 07:21:28,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:21:28,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:21:28,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:21:28,408 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:21:28,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-14 07:21:28,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 07:21:28,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:21:28,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-14 07:21:28,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:21:28,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 07:21:28,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:21:28,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 07:21:28,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:21:28,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 07:21:30,137 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:21:30,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:21:33,857 WARN L837 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse4 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse0 (not (< 2 c_~N~0)))) (and (or .cse0 (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1279 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1279) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1280) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (select .cse3 .cse5))) (or (< (+ .cse1 2147483648) 0) (< 2147483647 .cse1) (< 2147483647 (+ .cse1 .cse2)) (< (select .cse3 .cse4) 4294967296) (< (+ .cse1 2147483648 .cse2) 0)))))) (or .cse0 (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1279 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1279) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1280) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (select .cse8 .cse5))) (or (< 0 (+ .cse6 1)) (< 2147483647 .cse7) (< (select .cse8 .cse4) 4294967296) (< (+ .cse7 2147483648 .cse6) 0)))))) (or (and (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1279 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1279) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1280) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse9 (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse10 (select .cse11 .cse5))) (or (< .cse9 0) (< 2147483647 .cse9) (< 2147483647 (+ .cse9 .cse10)) (< (select .cse11 .cse4) 4294967296) (< (+ .cse9 2147483648 .cse10) 0))))) (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1279 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1279) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1280) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse12 (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse13 (select .cse14 .cse5))) (or (<= 0 .cse12) (< (+ .cse12 2147483648) 0) (< 2147483647 (+ .cse12 .cse13)) (< (select .cse14 .cse4) 4294967296) (< (+ .cse12 2147483648 .cse13) 0)))))) .cse0)))) is different from false [2022-12-14 07:21:33,900 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:21:33,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 696 treesize of output 397 [2022-12-14 07:21:33,935 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:21:33,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2400 treesize of output 2192 [2022-12-14 07:21:33,968 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:21:33,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2158 treesize of output 2118 [2022-12-14 07:21:34,001 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:21:34,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2118 treesize of output 2038 [2022-12-14 07:21:34,035 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:21:34,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2038 treesize of output 1958 [2022-12-14 07:21:34,081 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:21:34,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1958 treesize of output 1918 [2022-12-14 07:21:34,114 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:21:34,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1918 treesize of output 1838 [2022-12-14 07:21:34,146 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:21:34,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1838 treesize of output 1798 [2022-12-14 07:21:34,181 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:21:34,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1798 treesize of output 1766 [2022-12-14 07:21:34,214 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:21:34,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1766 treesize of output 1750 [2022-12-14 07:21:35,767 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-14 07:21:35,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122632557] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:21:35,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1022675154] [2022-12-14 07:21:35,767 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) 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-12-14 07:21:35,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:21:35,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-14 07:21:35,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888637659] [2022-12-14 07:21:35,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:21:35,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 07:21:35,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:21:35,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 07:21:35,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=516, Unknown=9, NotChecked=46, Total=650 [2022-12-14 07:21:35,769 INFO L87 Difference]: Start difference. First operand 1315 states and 4945 transitions. Second operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-12-14 07:21:48,771 WARN L233 SmtUtils]: Spent 11.76s on a formula simplification. DAG size of input: 191 DAG size of output: 173 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:21:56,995 WARN L233 SmtUtils]: Spent 7.36s on a formula simplification. DAG size of input: 184 DAG size of output: 171 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:22:18,089 WARN L233 SmtUtils]: Spent 20.23s on a formula simplification. DAG size of input: 195 DAG size of output: 177 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:22:29,421 WARN L233 SmtUtils]: Spent 11.17s on a formula simplification. DAG size of input: 169 DAG size of output: 162 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:22:44,066 WARN L233 SmtUtils]: Spent 14.01s on a formula simplification. DAG size of input: 192 DAG size of output: 174 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:23:10,868 WARN L233 SmtUtils]: Spent 26.59s on a formula simplification. DAG size of input: 177 DAG size of output: 165 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:23:43,315 WARN L233 SmtUtils]: Spent 30.16s on a formula simplification. DAG size of input: 180 DAG size of output: 168 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:23:46,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:23:46,492 INFO L93 Difference]: Finished difference Result 2265 states and 7543 transitions. [2022-12-14 07:23:46,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-14 07:23:46,493 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-12-14 07:23:46,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:23:46,497 INFO L225 Difference]: With dead ends: 2265 [2022-12-14 07:23:46,497 INFO L226 Difference]: Without dead ends: 2265 [2022-12-14 07:23:46,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 128.2s TimeCoverageRelationStatistics Valid=544, Invalid=2757, Unknown=9, NotChecked=112, Total=3422 [2022-12-14 07:23:46,498 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 2170 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2269 mSolverCounterSat, 79 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2170 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2269 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 224 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:23:46,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2170 Valid, 0 Invalid, 2573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2269 Invalid, 1 Unknown, 224 Unchecked, 3.4s Time] [2022-12-14 07:23:46,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2022-12-14 07:23:46,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 1513. [2022-12-14 07:23:46,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1464 states have (on average 4.14275956284153) internal successors, (6065), 1512 states have internal predecessors, (6065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:23:46,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 6065 transitions. [2022-12-14 07:23:46,531 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 6065 transitions. Word has length 11 [2022-12-14 07:23:46,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:23:46,531 INFO L495 AbstractCegarLoop]: Abstraction has 1513 states and 6065 transitions. [2022-12-14 07:23:46,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-12-14 07:23:46,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 6065 transitions. [2022-12-14 07:23:46,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 07:23:46,532 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:23:46,532 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 07:23:46,538 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-12-14 07:23:46,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-12-14 07:23:46,733 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:23:46,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:23:46,734 INFO L85 PathProgramCache]: Analyzing trace with hash 238143999, now seen corresponding path program 1 times [2022-12-14 07:23:46,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:23:46,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040565080] [2022-12-14 07:23:46,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:23:46,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:23:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:23:47,449 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:23:47,449 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:23:47,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040565080] [2022-12-14 07:23:47,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040565080] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:23:47,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338977229] [2022-12-14 07:23:47,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:23:47,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:23:47,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:23:47,450 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:23:47,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-14 07:23:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:23:47,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-14 07:23:47,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:23:47,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:23:47,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 07:23:47,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:23:47,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 07:23:47,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:23:47,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 07:23:49,459 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:23:49,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:23:52,468 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1323 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1323) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (select .cse3 .cse5)) (.cse2 (select .cse3 .cse4))) (or (< 2147483647 (+ .cse0 .cse1)) (< (+ .cse0 2147483648) 0) (<= (+ .cse2 .cse1) 2147483647) (< 0 .cse2))))) (forall ((v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1323 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1323) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (select .cse9 .cse4)) (.cse8 (select .cse9 .cse5))) (or (not (<= .cse6 0)) (not (<= (+ .cse7 .cse8) 2147483647)) (not (<= 0 (+ .cse7 2147483648))) (<= (+ .cse6 .cse8) 2147483647))))))) is different from false [2022-12-14 07:23:52,505 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse7 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 Int)) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse6 .cse7 v_ArrVal_1322)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1323) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (select .cse3 .cse5)) (.cse0 (select .cse3 .cse4))) (or (< 2147483647 (+ .cse0 .cse1)) (< (+ 2147483648 .cse1) 0) (< 0 .cse2) (<= (+ .cse2 .cse0) 2147483647))))) (forall ((v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 Int)) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse6 .cse7 v_ArrVal_1322)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1323) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse8 (select .cse11 .cse5)) (.cse9 (select .cse11 .cse4))) (or (not (<= .cse8 0)) (not (<= (+ .cse9 .cse10) 2147483647)) (not (<= 0 (+ 2147483648 .cse10))) (<= (+ .cse8 .cse9) 2147483647))))))) is different from false [2022-12-14 07:23:52,531 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:23:52,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 418 treesize of output 238 [2022-12-14 07:23:52,566 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:23:52,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 932 treesize of output 882 [2022-12-14 07:23:52,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 838 treesize of output 798 [2022-12-14 07:23:52,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 798 treesize of output 718 [2022-12-14 07:23:52,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 718 treesize of output 698 [2022-12-14 07:23:52,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 698 treesize of output 658 [2022-12-14 07:23:52,663 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:23:52,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 716 treesize of output 702 [2022-12-14 07:23:53,296 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-12-14 07:23:53,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338977229] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:23:53,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [481037807] [2022-12-14 07:23:53,296 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:337) 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-12-14 07:23:53,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:23:53,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-14 07:23:53,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172080691] [2022-12-14 07:23:53,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:23:53,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 07:23:53,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:23:53,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 07:23:53,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=481, Unknown=3, NotChecked=90, Total=650 [2022-12-14 07:23:53,298 INFO L87 Difference]: Start difference. First operand 1513 states and 6065 transitions. Second operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-12-14 07:23:58,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:23:58,644 INFO L93 Difference]: Finished difference Result 2067 states and 6959 transitions. [2022-12-14 07:23:58,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-14 07:23:58,644 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-12-14 07:23:58,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:23:58,648 INFO L225 Difference]: With dead ends: 2067 [2022-12-14 07:23:58,648 INFO L226 Difference]: Without dead ends: 2067 [2022-12-14 07:23:58,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=450, Invalid=2207, Unknown=3, NotChecked=202, Total=2862 [2022-12-14 07:23:58,649 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1446 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1514 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1446 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 347 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-14 07:23:58,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1446 Valid, 0 Invalid, 1925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1514 Invalid, 0 Unknown, 347 Unchecked, 1.8s Time] [2022-12-14 07:23:58,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2022-12-14 07:23:58,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1513. [2022-12-14 07:23:58,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1464 states have (on average 4.059426229508197) internal successors, (5943), 1512 states have internal predecessors, (5943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:23:58,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 5943 transitions. [2022-12-14 07:23:58,671 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 5943 transitions. Word has length 11 [2022-12-14 07:23:58,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:23:58,671 INFO L495 AbstractCegarLoop]: Abstraction has 1513 states and 5943 transitions. [2022-12-14 07:23:58,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-12-14 07:23:58,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 5943 transitions. [2022-12-14 07:23:58,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 07:23:58,672 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:23:58,672 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:23:58,677 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-12-14 07:23:58,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:23:58,872 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:23:58,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:23:58,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1348863954, now seen corresponding path program 1 times [2022-12-14 07:23:58,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:23:58,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133594174] [2022-12-14 07:23:58,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:23:58,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:23:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:23:58,999 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:23:58,999 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:23:59,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133594174] [2022-12-14 07:23:59,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133594174] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:23:59,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164537592] [2022-12-14 07:23:59,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:23:59,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:23:59,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:23:59,001 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:23:59,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-14 07:23:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:23:59,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 07:23:59,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:23:59,359 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:23:59,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:23:59,436 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:23:59,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164537592] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:23:59,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1934529333] [2022-12-14 07:23:59,436 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:337) 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-12-14 07:23:59,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:23:59,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-12-14 07:23:59,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403465231] [2022-12-14 07:23:59,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:23:59,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 07:23:59,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:23:59,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 07:23:59,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2022-12-14 07:23:59,438 INFO L87 Difference]: Start difference. First operand 1513 states and 5943 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-12-14 07:23:59,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:23:59,843 INFO L93 Difference]: Finished difference Result 1448 states and 5626 transitions. [2022-12-14 07:23:59,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 07:23:59,844 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 12 [2022-12-14 07:23:59,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:23:59,846 INFO L225 Difference]: With dead ends: 1448 [2022-12-14 07:23:59,846 INFO L226 Difference]: Without dead ends: 1269 [2022-12-14 07:23:59,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2022-12-14 07:23:59,847 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 147 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:23:59,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 0 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:23:59,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2022-12-14 07:23:59,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1269. [2022-12-14 07:23:59,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 1220 states have (on average 4.229508196721311) internal successors, (5160), 1268 states have internal predecessors, (5160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:23:59,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 5160 transitions. [2022-12-14 07:23:59,862 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 5160 transitions. Word has length 12 [2022-12-14 07:23:59,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:23:59,862 INFO L495 AbstractCegarLoop]: Abstraction has 1269 states and 5160 transitions. [2022-12-14 07:23:59,863 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-12-14 07:23:59,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 5160 transitions. [2022-12-14 07:23:59,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 07:23:59,863 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:23:59,863 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2022-12-14 07:23:59,868 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-12-14 07:24:00,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-12-14 07:24:00,065 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:24:00,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:24:00,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1207466718, now seen corresponding path program 4 times [2022-12-14 07:24:00,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:24:00,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104984045] [2022-12-14 07:24:00,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:24:00,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:24:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:24:00,542 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:24:00,542 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:24:00,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104984045] [2022-12-14 07:24:00,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104984045] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:24:00,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9485685] [2022-12-14 07:24:00,542 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:24:00,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:24:00,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:24:00,543 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:24:00,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-14 07:24:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:24:00,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 07:24:00,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:24:02,904 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-14 07:24:02,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 863 treesize of output 713 [2022-12-14 07:24:03,448 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:24:03,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:24:07,385 INFO L321 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2022-12-14 07:24:07,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1467 treesize of output 1029 [2022-12-14 07:24:08,582 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:24:08,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9485685] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:24:08,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [362738340] [2022-12-14 07:24:08,583 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:337) 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-12-14 07:24:08,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:24:08,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-14 07:24:08,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174117774] [2022-12-14 07:24:08,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:24:08,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 07:24:08,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:24:08,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 07:24:08,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2022-12-14 07:24:08,584 INFO L87 Difference]: Start difference. First operand 1269 states and 5160 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-12-14 07:24:09,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:24:09,911 INFO L93 Difference]: Finished difference Result 1073 states and 3503 transitions. [2022-12-14 07:24:09,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 07:24:09,911 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-12-14 07:24:09,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:24:09,913 INFO L225 Difference]: With dead ends: 1073 [2022-12-14 07:24:09,913 INFO L226 Difference]: Without dead ends: 1055 [2022-12-14 07:24:09,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=312, Invalid=1020, Unknown=0, NotChecked=0, Total=1332 [2022-12-14 07:24:09,913 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 587 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 07:24:09,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 0 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 07:24:09,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2022-12-14 07:24:09,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 915. [2022-12-14 07:24:09,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 866 states have (on average 3.602771362586605) internal successors, (3120), 914 states have internal predecessors, (3120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:24:09,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 3120 transitions. [2022-12-14 07:24:09,925 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 3120 transitions. Word has length 12 [2022-12-14 07:24:09,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:24:09,925 INFO L495 AbstractCegarLoop]: Abstraction has 915 states and 3120 transitions. [2022-12-14 07:24:09,926 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-12-14 07:24:09,926 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 3120 transitions. [2022-12-14 07:24:09,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 07:24:09,926 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:24:09,926 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:24:09,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-12-14 07:24:10,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:24:10,127 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:24:10,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:24:10,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1464058861, now seen corresponding path program 2 times [2022-12-14 07:24:10,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:24:10,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577487442] [2022-12-14 07:24:10,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:24:10,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:24:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:24:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:24:10,510 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:24:10,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577487442] [2022-12-14 07:24:10,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577487442] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:24:10,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817071956] [2022-12-14 07:24:10,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:24:10,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:24:10,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:24:10,512 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:24:10,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-14 07:24:10,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 07:24:10,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:24:10,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 07:24:10,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:24:10,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:24:10,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:24:10,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 07:24:10,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:24:10,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 07:24:10,973 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:24:10,975 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:24:10,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-12-14 07:24:10,991 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:24:10,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:24:11,072 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1431 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1431) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) is different from false [2022-12-14 07:24:11,077 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1430 Int) (v_ArrVal_1431 (Array Int Int))) (< (select (select (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~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1430)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1431) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) is different from false [2022-12-14 07:24:11,093 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-12-14 07:24:11,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-12-14 07:24:11,099 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:24:11,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 33 [2022-12-14 07:24:11,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 07:24:11,134 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-12-14 07:24:11,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817071956] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:24:11,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [913407264] [2022-12-14 07:24:11,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:337) 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-12-14 07:24:11,134 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:24:11,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-12-14 07:24:11,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725953362] [2022-12-14 07:24:11,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:24:11,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 07:24:11,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:24:11,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 07:24:11,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=366, Unknown=2, NotChecked=78, Total=506 [2022-12-14 07:24:11,135 INFO L87 Difference]: Start difference. First operand 915 states and 3120 transitions. Second operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 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-12-14 07:24:11,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:24:11,934 INFO L93 Difference]: Finished difference Result 1877 states and 5848 transitions. [2022-12-14 07:24:11,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 07:24:11,935 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 07:24:11,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:24:11,938 INFO L225 Difference]: With dead ends: 1877 [2022-12-14 07:24:11,938 INFO L226 Difference]: Without dead ends: 1877 [2022-12-14 07:24:11,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=202, Invalid=994, Unknown=2, NotChecked=134, Total=1332 [2022-12-14 07:24:11,938 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 224 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 222 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 07:24:11,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 0 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 594 Invalid, 0 Unknown, 222 Unchecked, 0.5s Time] [2022-12-14 07:24:11,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2022-12-14 07:24:11,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1064. [2022-12-14 07:24:11,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 1015 states have (on average 3.723152709359606) internal successors, (3779), 1063 states have internal predecessors, (3779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:24:11,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 3779 transitions. [2022-12-14 07:24:11,955 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 3779 transitions. Word has length 13 [2022-12-14 07:24:11,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:24:11,955 INFO L495 AbstractCegarLoop]: Abstraction has 1064 states and 3779 transitions. [2022-12-14 07:24:11,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 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-12-14 07:24:11,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 3779 transitions. [2022-12-14 07:24:11,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 07:24:11,955 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:24:11,955 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:24:11,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-12-14 07:24:12,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-12-14 07:24:12,156 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:24:12,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:24:12,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1464058855, now seen corresponding path program 1 times [2022-12-14 07:24:12,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:24:12,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513184125] [2022-12-14 07:24:12,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:24:12,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:24:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:24:12,481 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 07:24:12,481 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:24:12,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513184125] [2022-12-14 07:24:12,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513184125] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:24:12,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599719902] [2022-12-14 07:24:12,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:24:12,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:24:12,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:24:12,482 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:24:12,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-14 07:24:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:24:12,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 07:24:12,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:24:13,649 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 07:24:13,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:24:14,982 INFO L321 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-12-14 07:24:14,982 INFO L350 Elim1Store]: Elim1 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 345 treesize of output 1 [2022-12-14 07:24:14,983 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 07:24:14,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599719902] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:24:14,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1073271881] [2022-12-14 07:24:14,983 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:337) 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-12-14 07:24:14,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:24:14,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-14 07:24:14,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154823515] [2022-12-14 07:24:14,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:24:14,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 07:24:14,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:24:14,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 07:24:14,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-12-14 07:24:14,984 INFO L87 Difference]: Start difference. First operand 1064 states and 3779 transitions. Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 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-12-14 07:24:17,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 07:24:19,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 07:24:21,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:24:24,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:24:26,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:24:30,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 07:24:32,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:24:34,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:24:35,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:24:35,084 INFO L93 Difference]: Finished difference Result 2826 states and 8798 transitions. [2022-12-14 07:24:35,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-14 07:24:35,085 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 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 13 [2022-12-14 07:24:35,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:24:35,089 INFO L225 Difference]: With dead ends: 2826 [2022-12-14 07:24:35,089 INFO L226 Difference]: Without dead ends: 2826 [2022-12-14 07:24:35,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=410, Invalid=1396, Unknown=0, NotChecked=0, Total=1806 [2022-12-14 07:24:35,090 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 291 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 51 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:24:35,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 0 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1123 Invalid, 8 Unknown, 0 Unchecked, 18.2s Time] [2022-12-14 07:24:35,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2022-12-14 07:24:35,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 1353. [2022-12-14 07:24:35,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1304 states have (on average 3.7223926380368098) internal successors, (4854), 1352 states have internal predecessors, (4854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:24:35,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 4854 transitions. [2022-12-14 07:24:35,115 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 4854 transitions. Word has length 13 [2022-12-14 07:24:35,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:24:35,115 INFO L495 AbstractCegarLoop]: Abstraction has 1353 states and 4854 transitions. [2022-12-14 07:24:35,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 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-12-14 07:24:35,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 4854 transitions. [2022-12-14 07:24:35,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 07:24:35,115 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:24:35,115 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2022-12-14 07:24:35,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-12-14 07:24:35,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-12-14 07:24:35,317 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:24:35,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:24:35,317 INFO L85 PathProgramCache]: Analyzing trace with hash 78347423, now seen corresponding path program 2 times [2022-12-14 07:24:35,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:24:35,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985956219] [2022-12-14 07:24:35,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:24:35,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:24:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:24:35,730 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:24:35,730 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:24:35,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985956219] [2022-12-14 07:24:35,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985956219] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:24:35,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827080613] [2022-12-14 07:24:35,731 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:24:35,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:24:35,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:24:35,731 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:24:35,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-14 07:24:36,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 07:24:36,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:24:36,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-14 07:24:36,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:24:36,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:24:36,119 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 07:24:36,119 INFO L350 Elim1Store]: Elim1 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 32 [2022-12-14 07:24:36,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:24:36,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-14 07:24:36,393 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:24:36,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:24:37,259 INFO L321 Elim1Store]: treesize reduction 40, result has 62.6 percent of original size [2022-12-14 07:24:37,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 277 treesize of output 201 [2022-12-14 07:24:37,268 INFO L350 Elim1Store]: Elim1 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 207 treesize of output 188 [2022-12-14 07:24:37,282 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:24:37,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 157 [2022-12-14 07:24:37,313 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:24:37,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 170 [2022-12-14 07:24:37,343 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:24:37,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 195 treesize of output 189 [2022-12-14 07:24:37,363 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:24:37,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 132 [2022-12-14 07:24:39,605 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:24:39,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827080613] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:24:39,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [364724758] [2022-12-14 07:24:39,605 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:337) 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-12-14 07:24:39,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:24:39,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2022-12-14 07:24:39,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249969089] [2022-12-14 07:24:39,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:24:39,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-14 07:24:39,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:24:39,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-14 07:24:39,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=663, Unknown=1, NotChecked=0, Total=756 [2022-12-14 07:24:39,607 INFO L87 Difference]: Start difference. First operand 1353 states and 4854 transitions. Second operand has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 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-12-14 07:24:52,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:24:52,349 INFO L93 Difference]: Finished difference Result 3069 states and 9895 transitions. [2022-12-14 07:24:52,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-12-14 07:24:52,350 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 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 13 [2022-12-14 07:24:52,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:24:52,355 INFO L225 Difference]: With dead ends: 3069 [2022-12-14 07:24:52,355 INFO L226 Difference]: Without dead ends: 3069 [2022-12-14 07:24:52,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3048 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=1497, Invalid=8204, Unknown=1, NotChecked=0, Total=9702 [2022-12-14 07:24:52,356 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 581 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-12-14 07:24:52,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 0 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-12-14 07:24:52,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2022-12-14 07:24:52,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 1383. [2022-12-14 07:24:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1334 states have (on average 3.6446776611694154) internal successors, (4862), 1382 states have internal predecessors, (4862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:24:52,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 4862 transitions. [2022-12-14 07:24:52,379 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 4862 transitions. Word has length 13 [2022-12-14 07:24:52,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:24:52,379 INFO L495 AbstractCegarLoop]: Abstraction has 1383 states and 4862 transitions. [2022-12-14 07:24:52,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 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-12-14 07:24:52,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 4862 transitions. [2022-12-14 07:24:52,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 07:24:52,380 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:24:52,380 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2022-12-14 07:24:52,386 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-12-14 07:24:52,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-12-14 07:24:52,582 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:24:52,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:24:52,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1322661700, now seen corresponding path program 4 times [2022-12-14 07:24:52,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:24:52,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559370306] [2022-12-14 07:24:52,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:24:52,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:24:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:24:53,331 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:24:53,331 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:24:53,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559370306] [2022-12-14 07:24:53,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559370306] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:24:53,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292457933] [2022-12-14 07:24:53,332 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 07:24:53,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:24:53,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:24:53,333 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:24:53,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-14 07:24:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:24:53,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-14 07:24:53,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:24:53,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:24:53,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:24:53,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 07:24:53,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:24:53,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 07:24:56,539 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:24:56,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:25:05,415 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse45 (* c_~j~0 4))) (let ((.cse0 (not (<= c_~bag2~0 4294967295))) (.cse1 (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647))) (.cse27 (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648)))) (.cse7 (+ c_~A~0.offset 12 .cse45)) (.cse10 (+ c_~A~0.offset .cse45)) (.cse8 (+ c_~A~0.offset 8 .cse45)) (.cse9 (+ c_~A~0.offset .cse45 4))) (and (or .cse0 .cse1 (forall ((v_ArrVal_1550 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1550) c_~A~0.base))) (let ((.cse5 (select .cse6 .cse10))) (let ((.cse2 (+ c_~bag2~0 .cse5)) (.cse4 (select .cse6 .cse9)) (.cse3 (select .cse6 .cse8))) (or (< .cse2 (+ .cse3 .cse4 1)) (<= 0 .cse5) (not (<= 0 (+ .cse3 .cse4 2147483648))) (< 2147483647 .cse2) (< 0 (+ (select .cse6 .cse7) 9223372039002259456)) (not (<= 0 (+ c_~bag2~0 .cse5 c_~sum2~0 2147483648))) (not (<= .cse4 4294967295)) (not (<= (+ .cse5 .cse4) 2147483647)) (< .cse5 (+ .cse3 1)))))))) (forall ((v_ArrVal_1550 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1550) c_~A~0.base))) (let ((.cse13 (select .cse14 .cse8)) (.cse12 (select .cse14 .cse9)) (.cse11 (select .cse14 .cse10))) (or (not (<= (+ c_~bag2~0 .cse11 .cse12) 2147483647)) (not (<= (+ c_~bag2~0 .cse11) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse11 .cse13 .cse12 2147483648))) (< 0 (+ (select .cse14 .cse7) 9223372039002259456)) (not (<= (+ c_~bag2~0 .cse11 .cse13 .cse12) 2147483647)) (< 4294967295 .cse11) (not (<= 0 (+ 9223372039002259455 .cse11))) (not (<= 0 (+ c_~bag2~0 .cse11 .cse12 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse11 2147483648))))))) (or .cse0 .cse1 (forall ((v_ArrVal_1550 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1550) c_~A~0.base))) (let ((.cse18 (select .cse17 .cse8)) (.cse15 (select .cse17 .cse10)) (.cse16 (select .cse17 .cse9))) (or (not (<= (+ c_~bag2~0 .cse15 c_~sum2~0 .cse16) 2147483647)) (<= 0 .cse15) (< 2147483647 (+ c_~bag2~0 .cse15)) (not (<= 0 (+ c_~bag2~0 .cse15 c_~sum2~0 .cse16 2147483648))) (< 0 (+ (select .cse17 .cse7) 9223372039002259456)) (< (+ c_~bag2~0 .cse15 2147483648) 0) (< (+ .cse18 .cse16 2147483648) 0) (not (<= 0 (+ .cse15 .cse16 2147483648))) (not (<= 0 (+ c_~bag2~0 .cse15 c_~sum2~0 2147483648))) (< 2147483647 (+ .cse18 .cse16)) (not (<= (+ .cse15 .cse16) 2147483647))))))) (or .cse0 (and (forall ((v_ArrVal_1550 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1550) c_~A~0.base))) (let ((.cse20 (select .cse22 .cse10)) (.cse21 (select .cse22 .cse8)) (.cse19 (select .cse22 .cse9))) (or (< c_~bag2~0 (+ .cse19 1)) (< (+ .cse20 .cse21 .cse19 2147483648) 0) (< (+ c_~bag2~0 .cse20 c_~sum2~0 .cse19 2147483648) 0) (not (<= (+ c_~bag2~0 .cse20) 2147483647)) (< 2147483647 (+ c_~bag2~0 .cse20 c_~sum2~0 .cse19)) (not (<= .cse20 4294967295)) (< 0 (+ (select .cse22 .cse7) 9223372039002259456)) (not (<= 0 (+ .cse20 .cse19 2147483648))) (< 2147483647 (+ .cse20 .cse21 .cse19)))))) (forall ((v_ArrVal_1550 (Array Int Int))) (let ((.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1550) c_~A~0.base))) (let ((.cse25 (select .cse26 .cse8)) (.cse24 (select .cse26 .cse10)) (.cse23 (select .cse26 .cse9))) (or (< c_~bag2~0 (+ .cse23 1)) (not (<= (+ c_~bag2~0 .cse24) 2147483647)) (< c_~bag2~0 (+ .cse25 .cse23 1)) (not (<= .cse24 4294967295)) (< 0 (+ (select .cse26 .cse7) 9223372039002259456)) (not (<= 0 (+ .cse24 .cse25 .cse23 2147483648))) (not (<= 0 (+ .cse24 .cse23 2147483648)))))))) .cse1 .cse27) (or (and (forall ((v_ArrVal_1550 (Array Int Int))) (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1550) c_~A~0.base))) (let ((.cse31 (select .cse32 .cse10))) (let ((.cse28 (+ c_~bag2~0 .cse31)) (.cse30 (select .cse32 .cse9)) (.cse29 (select .cse32 .cse8))) (or (< .cse28 (+ .cse29 .cse30 1)) (not (<= .cse28 2147483647)) (not (<= 0 (+ .cse29 .cse30 2147483648))) (not (<= 0 .cse31)) (not (<= (+ c_~bag2~0 .cse31 c_~sum2~0) 2147483647)) (< 0 (+ (select .cse32 .cse7) 9223372039002259456)) (not (<= (+ .cse31 .cse30) 2147483647)) (< .cse31 (+ .cse29 1))))))) (forall ((v_ArrVal_1550 (Array Int Int))) (let ((.cse35 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1550) c_~A~0.base))) (let ((.cse36 (select .cse35 .cse8)) (.cse34 (select .cse35 .cse9)) (.cse33 (select .cse35 .cse10))) (or (not (<= (+ c_~bag2~0 .cse33 c_~sum2~0 .cse34) 2147483647)) (not (<= (+ c_~bag2~0 .cse33) 2147483647)) (not (<= 0 .cse33)) (not (<= (+ c_~bag2~0 .cse33 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse33 c_~sum2~0 .cse34 2147483648))) (< 0 (+ (select .cse35 .cse7) 9223372039002259456)) (< (+ .cse36 .cse34 2147483648) 0) (not (<= 0 (+ .cse33 .cse34 2147483648))) (< 4294967295 .cse36) (< 2147483647 (+ .cse36 .cse34)) (not (<= (+ .cse33 .cse34) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse33 2147483648)))))))) .cse27) (forall ((v_ArrVal_1550 (Array Int Int))) (let ((.cse39 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1550) c_~A~0.base))) (let ((.cse40 (select .cse39 .cse8)) (.cse38 (select .cse39 .cse9)) (.cse37 (select .cse39 .cse10))) (or (not (<= (+ c_~bag2~0 .cse37 c_~sum2~0 .cse38) 2147483647)) (not (<= (+ c_~bag2~0 .cse37 .cse38) 2147483647)) (< .cse38 1) (< 0 (+ (select .cse39 .cse7) 9223372039002259456)) (< (+ .cse40 .cse38 2147483648) 0) (not (<= 0 (+ c_~bag2~0 .cse37 c_~sum2~0 2147483648))) (< 2147483647 (+ .cse40 .cse38)) (< 4294967295 .cse37) (not (<= 0 (+ 9223372039002259455 .cse37))) (not (<= 0 (+ c_~bag2~0 .cse37 2147483648))))))) (forall ((v_ArrVal_1550 (Array Int Int))) (let ((.cse44 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1550) c_~A~0.base))) (let ((.cse42 (select .cse44 .cse9)) (.cse43 (select .cse44 .cse8)) (.cse41 (select .cse44 .cse10))) (or (not (<= (+ c_~bag2~0 .cse41 .cse42) 2147483647)) (not (<= 0 (+ .cse43 .cse42 2147483648))) (< .cse42 1) (not (<= (+ c_~bag2~0 .cse41 c_~sum2~0) 2147483647)) (< (+ c_~bag2~0 .cse41) (+ .cse43 1)) (< 0 (+ (select .cse44 .cse7) 9223372039002259456)) (not (<= 0 (+ c_~bag2~0 .cse41 c_~sum2~0 2147483648))) (< 4294967295 .cse41) (not (<= 0 (+ 9223372039002259455 .cse41))) (not (<= 0 (+ c_~bag2~0 .cse41 2147483648)))))))))) is different from false [2022-12-14 07:25:05,993 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1549) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1550) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse3 .cse6)) (.cse1 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (select .cse3 .cse5))) (or (not (<= (+ .cse0 .cse1) 2147483647)) (not (<= 0 (+ .cse0 2147483648 .cse2))) (not (<= 0 .cse1)) (< .cse1 (+ .cse0 .cse2 1)) (not (<= .cse1 2147483647)) (< .cse1 (+ .cse2 1)) (< 0 (+ (select .cse3 .cse4) 9223372039002259456)))))) (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1549) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1550) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse9 (select .cse10 .cse5)) (.cse7 (select .cse10 .cse6)) (.cse8 (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 (+ .cse7 .cse8)) (< 2147483647 (+ .cse7 .cse9)) (< (+ .cse7 2147483648 .cse9) 0) (< .cse7 1) (< (+ .cse8 2147483648) 0) (< 0 (+ (select .cse10 .cse4) 9223372039002259456)))))) (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1549) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1550) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse13 (select .cse14 .cse5)) (.cse12 (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse11 (select .cse14 .cse6))) (or (< (+ .cse11 .cse12 2147483648) 0) (< (+ .cse11 .cse12 2147483648 .cse13) 0) (< 2147483647 (+ .cse11 .cse12 .cse13)) (< 2147483647 .cse12) (< 0 (+ (select .cse14 .cse4) 9223372039002259456)) (< 0 (+ .cse11 1)))))) (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1549) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1550) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse16 (select .cse18 .cse6)) (.cse15 (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse17 (select .cse18 .cse5))) (or (< .cse15 0) (< (+ .cse16 .cse15 2147483648) 0) (< 2147483647 (+ .cse16 .cse15)) (< 2147483647 (+ .cse16 .cse17)) (< (+ .cse16 2147483648 .cse17) 0) (< 2147483647 .cse15) (< 4294967295 .cse17) (< 0 (+ (select .cse18 .cse4) 9223372039002259456)))))) (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (let ((.cse22 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1549) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1550) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse19 (select .cse22 .cse6)) (.cse21 (select .cse22 .cse5)) (.cse20 (select .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse19 .cse20 2147483648) 0) (< 2147483647 (+ .cse19 .cse20)) (< 2147483647 (+ .cse19 .cse21)) (<= 0 .cse20) (< (+ .cse19 2147483648 .cse21) 0) (< (+ .cse20 2147483648) 0) (< 0 (+ (select .cse22 .cse4) 9223372039002259456)))))) (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (let ((.cse26 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1549) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1550) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse23 (select .cse26 .cse6)) (.cse24 (select .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse25 (select .cse26 .cse5))) (or (< 2147483647 (+ .cse23 .cse24)) (<= 0 .cse24) (< (+ .cse23 2147483648 .cse25) 0) (< .cse24 (+ .cse23 .cse25 1)) (< .cse24 (+ .cse25 1)) (< 0 (+ (select .cse26 .cse4) 9223372039002259456)))))) (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (let ((.cse30 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1549) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1550) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse28 (select .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse29 (select .cse30 .cse5)) (.cse27 (select .cse30 .cse6))) (or (< (+ .cse27 .cse28 2147483648) 0) (< (+ .cse27 .cse28 2147483648 .cse29) 0) (< 2147483647 .cse28) (< 0 (+ (select .cse30 .cse4) 9223372039002259456)) (< 0 (+ .cse27 .cse29 1)) (< 0 (+ .cse27 1)))))) (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (let ((.cse34 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1549) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1550) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse31 (select .cse34 .cse6)) (.cse33 (select .cse34 .cse5)) (.cse32 (select .cse34 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse31 .cse32 2147483648) 0) (< 2147483647 (+ .cse31 .cse32)) (< (+ .cse31 .cse32 2147483648 .cse33) 0) (< 2147483647 (+ .cse31 .cse32 .cse33)) (< 2147483647 .cse32) (< (+ .cse32 2147483648) 0) (< 0 (+ (select .cse34 .cse4) 9223372039002259456)))))) (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (let ((.cse38 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1549) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1550) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse35 (select .cse38 .cse6)) (.cse37 (select .cse38 .cse5)) (.cse36 (select .cse38 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 2147483647 (+ .cse35 .cse36)) (< (+ .cse35 2147483648 .cse37) 0) (< .cse35 1) (< .cse36 (+ .cse37 1)) (< (+ .cse36 2147483648) 0) (< 0 (+ (select .cse38 .cse4) 9223372039002259456)))))))) is different from false [2022-12-14 07:25:06,078 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:25:06,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2589 treesize of output 1426 [2022-12-14 07:25:06,155 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:25:06,157 INFO L350 Elim1Store]: Elim1 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 7799 treesize of output 6965 [2022-12-14 07:25:06,251 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:25:06,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6919 treesize of output 6847 [2022-12-14 07:25:06,349 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:25:06,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6847 treesize of output 6811 [2022-12-14 07:25:06,445 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:25:06,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6811 treesize of output 6751 [2022-12-14 07:25:06,549 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:25:06,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6751 treesize of output 6675 [2022-12-14 07:25:06,644 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:25:06,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6675 treesize of output 6595 [2022-12-14 07:25:06,740 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:25:06,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6595 treesize of output 6435 [2022-12-14 07:25:06,840 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:25:06,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6435 treesize of output 6363 [2022-12-14 07:25:06,950 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:25:06,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6363 treesize of output 6327 [2022-12-14 07:25:07,045 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:25:07,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6327 treesize of output 6263 [2022-12-14 07:25:07,142 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:25:07,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6263 treesize of output 6111 [2022-12-14 07:25:07,246 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:25:07,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6111 treesize of output 5991 [2022-12-14 07:25:07,342 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:25:07,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5991 treesize of output 5863 [2022-12-14 07:25:07,440 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:25:07,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5863 treesize of output 5783 [2022-12-14 07:25:07,537 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:25:07,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5783 treesize of output 5711 [2022-12-14 07:25:07,645 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:25:07,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5711 treesize of output 5567 [2022-12-14 07:25:07,743 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:25:07,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5567 treesize of output 5407 [2022-12-14 07:25:07,841 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:25:07,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5407 treesize of output 5339 [2022-12-14 07:25:07,935 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:25:07,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5339 treesize of output 5305 [2022-12-14 07:25:11,718 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-12-14 07:25:11,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292457933] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:25:11,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1813604764] [2022-12-14 07:25:11,718 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:337) 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-12-14 07:25:11,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:25:11,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-14 07:25:11,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546944903] [2022-12-14 07:25:11,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:25:11,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 07:25:11,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:25:11,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 07:25:11,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=788, Unknown=2, NotChecked=114, Total=992 [2022-12-14 07:25:11,720 INFO L87 Difference]: Start difference. First operand 1383 states and 4862 transitions. Second operand has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 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-12-14 07:25:30,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:25:30,601 INFO L93 Difference]: Finished difference Result 3077 states and 10559 transitions. [2022-12-14 07:25:30,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-14 07:25:30,602 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 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 13 [2022-12-14 07:25:30,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:25:30,608 INFO L225 Difference]: With dead ends: 3077 [2022-12-14 07:25:30,608 INFO L226 Difference]: Without dead ends: 3077 [2022-12-14 07:25:30,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=426, Invalid=3120, Unknown=2, NotChecked=234, Total=3782 [2022-12-14 07:25:30,608 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1310 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3394 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1310 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 3394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 492 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-12-14 07:25:30,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1310 Valid, 0 Invalid, 3975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 3394 Invalid, 0 Unknown, 492 Unchecked, 4.6s Time] [2022-12-14 07:25:30,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3077 states. [2022-12-14 07:25:30,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3077 to 1827. [2022-12-14 07:25:30,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1827 states, 1778 states have (on average 3.9803149606299213) internal successors, (7077), 1826 states have internal predecessors, (7077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:25:30,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 7077 transitions. [2022-12-14 07:25:30,640 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 7077 transitions. Word has length 13 [2022-12-14 07:25:30,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:25:30,640 INFO L495 AbstractCegarLoop]: Abstraction has 1827 states and 7077 transitions. [2022-12-14 07:25:30,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 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-12-14 07:25:30,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 7077 transitions. [2022-12-14 07:25:30,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 07:25:30,641 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:25:30,641 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2022-12-14 07:25:30,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-12-14 07:25:30,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:25:30,842 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:25:30,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:25:30,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1322661625, now seen corresponding path program 5 times [2022-12-14 07:25:30,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:25:30,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034646935] [2022-12-14 07:25:30,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:25:30,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:25:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:25:32,373 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:25:32,374 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:25:32,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034646935] [2022-12-14 07:25:32,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034646935] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:25:32,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131005238] [2022-12-14 07:25:32,374 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:25:32,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:25:32,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:25:32,375 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:25:32,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-14 07:25:32,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 07:25:32,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:25:32,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-14 07:25:32,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:25:32,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 07:25:32,868 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 07:25:32,868 INFO L350 Elim1Store]: Elim1 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 32 [2022-12-14 07:25:32,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:25:32,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 07:25:33,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:25:33,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-14 07:25:35,251 INFO L321 Elim1Store]: treesize reduction 28, result has 9.7 percent of original size [2022-12-14 07:25:35,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 878 treesize of output 741 [2022-12-14 07:25:36,354 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:25:36,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:25:41,366 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse0 (not (< 3 c_~N~0)))) (and (or .cse0 (forall ((|ULTIMATE.start_create_fresh_int_array_~i~1#1| Int) (v_ArrVal_1596 Int) (v_ArrVal_1598 (Array Int Int)) (v_ArrVal_1597 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse7 (+ (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1596)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1597) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1598) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse3 (select .cse4 .cse6)) (.cse2 (select .cse4 .cse5)) (.cse1 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse1 2147483648) 0) (< 2147483647 (+ .cse1 .cse2)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< 0 (+ 2147483649 .cse3)) (< (+ .cse3 .cse2) (+ .cse1 1))))))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~i~1#1| Int) (v_ArrVal_1596 Int) (v_ArrVal_1598 (Array Int Int)) (v_ArrVal_1597 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse7 (+ (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1596)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1597) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1598) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse9 (select .cse11 .cse5)) (.cse8 (select .cse11 .cse6))) (or (< (+ .cse8 .cse9 2147483648) 0) (< (+ .cse10 2147483648) 0) (< 2147483647 (+ .cse10 .cse9)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< 0 (+ 2147483649 .cse8)))))) .cse0))) is different from false [2022-12-14 07:25:41,424 INFO L321 Elim1Store]: treesize reduction 40, result has 62.6 percent of original size [2022-12-14 07:25:41,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 457 treesize of output 286 [2022-12-14 07:25:41,433 INFO L350 Elim1Store]: Elim1 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 444 treesize of output 421 [2022-12-14 07:25:41,460 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:25:41,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 421 treesize of output 425 [2022-12-14 07:25:41,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 381 treesize of output 341 [2022-12-14 07:25:41,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 341 treesize of output 321 [2022-12-14 07:25:41,504 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:25:41,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 549 treesize of output 535 [2022-12-14 07:25:41,522 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:25:41,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 491 treesize of output 447 [2022-12-14 07:25:41,540 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:25:41,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 447 treesize of output 425 [2022-12-14 07:25:43,739 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-12-14 07:25:43,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131005238] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:25:43,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1877363456] [2022-12-14 07:25:43,739 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:337) 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-12-14 07:25:43,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:25:43,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-14 07:25:43,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343276003] [2022-12-14 07:25:43,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:25:43,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 07:25:43,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:25:43,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 07:25:43,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=829, Unknown=2, NotChecked=58, Total=992 [2022-12-14 07:25:43,740 INFO L87 Difference]: Start difference. First operand 1827 states and 7077 transitions. Second operand has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 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-12-14 07:25:55,508 WARN L233 SmtUtils]: Spent 10.77s on a formula simplification. DAG size of input: 191 DAG size of output: 147 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:26:08,975 WARN L233 SmtUtils]: Spent 12.76s on a formula simplification. DAG size of input: 202 DAG size of output: 157 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:26:15,903 WARN L233 SmtUtils]: Spent 6.68s on a formula simplification. DAG size of input: 169 DAG size of output: 143 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:26:31,532 WARN L233 SmtUtils]: Spent 14.78s on a formula simplification. DAG size of input: 180 DAG size of output: 153 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:26:39,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:26:39,861 INFO L93 Difference]: Finished difference Result 2681 states and 9153 transitions. [2022-12-14 07:26:39,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-14 07:26:39,861 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 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 13 [2022-12-14 07:26:39,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:26:39,866 INFO L225 Difference]: With dead ends: 2681 [2022-12-14 07:26:39,866 INFO L226 Difference]: Without dead ends: 2681 [2022-12-14 07:26:39,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 54.3s TimeCoverageRelationStatistics Valid=495, Invalid=2699, Unknown=2, NotChecked=110, Total=3306 [2022-12-14 07:26:39,867 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 2417 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2421 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2417 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 2421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 197 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:26:39,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2417 Valid, 0 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 2421 Invalid, 0 Unknown, 197 Unchecked, 3.2s Time] [2022-12-14 07:26:39,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2681 states. [2022-12-14 07:26:39,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2681 to 1901. [2022-12-14 07:26:39,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1901 states, 1852 states have (on average 4.029697624190065) internal successors, (7463), 1900 states have internal predecessors, (7463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:26:39,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 7463 transitions. [2022-12-14 07:26:39,894 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 7463 transitions. Word has length 13 [2022-12-14 07:26:39,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:26:39,894 INFO L495 AbstractCegarLoop]: Abstraction has 1901 states and 7463 transitions. [2022-12-14 07:26:39,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 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-12-14 07:26:39,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 7463 transitions. [2022-12-14 07:26:39,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 07:26:39,895 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:26:39,895 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2022-12-14 07:26:39,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-12-14 07:26:40,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:26:40,096 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2022-12-14 07:26:40,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:26:40,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1322661623, now seen corresponding path program 3 times [2022-12-14 07:26:40,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:26:40,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231179631] [2022-12-14 07:26:40,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:26:40,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:26:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:26:40,724 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:26:40,724 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:26:40,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231179631] [2022-12-14 07:26:40,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231179631] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:26:40,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559747869] [2022-12-14 07:26:40,724 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:26:40,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:26:40,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:26:40,725 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:26:40,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-14 07:26:41,011 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:26:41,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:26:41,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 07:26:41,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:26:41,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 07:26:41,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:41,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 07:26:41,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:26:41,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 07:26:44,811 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:26:44,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:26:56,808 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:26:56,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2605 treesize of output 1442 [2022-12-14 07:26:56,889 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:26:56,891 INFO L350 Elim1Store]: Elim1 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 4363 treesize of output 3877 [2022-12-14 07:26:56,957 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:26:56,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3833 treesize of output 3761 [2022-12-14 07:26:57,022 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:26:57,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3761 treesize of output 3725 [2022-12-14 07:26:57,088 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:26:57,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3725 treesize of output 3657 [2022-12-14 07:26:57,158 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:26:57,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3657 treesize of output 3623 [2022-12-14 07:26:57,225 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:26:57,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3623 treesize of output 3547 [2022-12-14 07:26:57,291 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:26:57,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3547 treesize of output 3487 [2022-12-14 07:26:57,360 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:26:57,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3487 treesize of output 3449 [2022-12-14 07:26:57,423 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:26:57,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3449 treesize of output 3377 [2022-12-14 07:26:57,486 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:26:57,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3377 treesize of output 3341 [2022-12-14 07:26:57,550 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:26:57,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3341 treesize of output 3269 [2022-12-14 07:26:57,613 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:26:57,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3269 treesize of output 3233 [2022-12-14 07:26:57,679 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:26:57,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3233 treesize of output 3169 [2022-12-14 07:26:57,748 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:26:57,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3169 treesize of output 3089 [2022-12-14 07:26:57,811 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:26:57,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3089 treesize of output 3049 [2022-12-14 07:26:57,884 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:26:57,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3049 treesize of output 3019 [2022-12-14 07:26:57,989 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:26:57,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3019 treesize of output 2939 [2022-12-14 07:26:58,094 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:26:58,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2939 treesize of output 2899 [2022-12-14 07:26:58,192 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:26:58,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2899 treesize of output 2867 [2022-12-14 07:27:00,940 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:27:00,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559747869] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:27:00,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1040377107] [2022-12-14 07:27:00,940 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:337) 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-12-14 07:27:00,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:27:00,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-14 07:27:00,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872327743] [2022-12-14 07:27:00,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:27:00,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 07:27:00,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:27:00,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 07:27:00,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=875, Unknown=1, NotChecked=0, Total=992 [2022-12-14 07:27:00,942 INFO L87 Difference]: Start difference. First operand 1901 states and 7463 transitions. Second operand has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 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-12-14 07:27:45,710 WARN L233 SmtUtils]: Spent 42.61s on a formula simplification. DAG size of input: 348 DAG size of output: 319 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:28:27,030 WARN L233 SmtUtils]: Spent 39.43s on a formula simplification. DAG size of input: 326 DAG size of output: 302 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:29:06,841 WARN L233 SmtUtils]: Spent 37.76s on a formula simplification. DAG size of input: 344 DAG size of output: 319 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:29:46,999 WARN L233 SmtUtils]: Spent 39.38s on a formula simplification. DAG size of input: 296 DAG size of output: 283 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:30:22,067 WARN L233 SmtUtils]: Spent 33.80s on a formula simplification. DAG size of input: 336 DAG size of output: 316 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:30:59,574 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2022-12-14 07:30:59,574 WARN L230 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-12-14 07:30:59,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-14 07:30:59,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 202.7s TimeCoverageRelationStatistics Valid=445, Invalid=2746, Unknown=1, NotChecked=0, Total=3192 [2022-12-14 07:30:59,575 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 767 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1527 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-12-14 07:30:59,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 0 Invalid, 1605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1527 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-12-14 07:30:59,581 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-12-14 07:30:59,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:30:59,777 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:184) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:230) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 55 more [2022-12-14 07:30:59,781 INFO L158 Benchmark]: Toolchain (without parser) took 754245.32ms. Allocated memory was 121.6MB in the beginning and 541.1MB in the end (delta: 419.4MB). Free memory was 76.4MB in the beginning and 413.6MB in the end (delta: -337.2MB). Peak memory consumption was 395.3MB. Max. memory is 16.1GB. [2022-12-14 07:30:59,782 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 94.4MB. Free memory was 65.9MB in the beginning and 65.8MB in the end (delta: 72.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 07:30:59,782 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.00ms. Allocated memory is still 121.6MB. Free memory was 76.4MB in the beginning and 90.8MB in the end (delta: -14.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-14 07:30:59,783 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.96ms. Allocated memory is still 121.6MB. Free memory was 90.8MB in the beginning and 87.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 07:30:59,783 INFO L158 Benchmark]: Boogie Preprocessor took 37.34ms. Allocated memory is still 121.6MB. Free memory was 87.9MB in the beginning and 85.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 07:30:59,783 INFO L158 Benchmark]: RCFGBuilder took 656.95ms. Allocated memory is still 121.6MB. Free memory was 85.8MB in the beginning and 93.5MB in the end (delta: -7.7MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2022-12-14 07:30:59,783 INFO L158 Benchmark]: TraceAbstraction took 753268.74ms. Allocated memory was 121.6MB in the beginning and 541.1MB in the end (delta: 419.4MB). Free memory was 92.9MB in the beginning and 413.6MB in the end (delta: -320.7MB). Peak memory consumption was 411.3MB. Max. memory is 16.1GB. [2022-12-14 07:30:59,784 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 94.4MB. Free memory was 65.9MB in the beginning and 65.8MB in the end (delta: 72.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.00ms. Allocated memory is still 121.6MB. Free memory was 76.4MB in the beginning and 90.8MB in the end (delta: -14.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.96ms. Allocated memory is still 121.6MB. Free memory was 90.8MB in the beginning and 87.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.34ms. Allocated memory is still 121.6MB. Free memory was 87.9MB in the beginning and 85.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 656.95ms. Allocated memory is still 121.6MB. Free memory was 85.8MB in the beginning and 93.5MB in the end (delta: -7.7MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. * TraceAbstraction took 753268.74ms. Allocated memory was 121.6MB in the beginning and 541.1MB in the end (delta: 419.4MB). Free memory was 92.9MB in the beginning and 413.6MB in the end (delta: -320.7MB). Peak memory consumption was 411.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 43.5s, 546 PlacesBefore, 78 PlacesAfterwards, 583 TransitionsBefore, 75 TransitionsAfterwards, 105228 CoEnabledTransitionPairs, 10 FixpointIterations, 119 TrivialSequentialCompositions, 556 ConcurrentSequentialCompositions, 11 TrivialYvCompositions, 93 ConcurrentYvCompositions, 40 ChoiceCompositions, 819 TotalNumberOfCompositions, 104282 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 102206, independent: 102111, independent conditional: 0, independent unconditional: 102111, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 74327, independent: 74301, independent conditional: 0, independent unconditional: 74301, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 74327, independent: 74301, independent conditional: 0, independent unconditional: 74301, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 89, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 102206, independent: 27810, independent conditional: 0, independent unconditional: 27810, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 74327, unknown conditional: 0, unknown unconditional: 74327] , Statistics on independence cache: Total cache size (in pairs): 391, Positive cache size: 382, Positive conditional cache size: 0, Positive unconditional cache size: 382, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh --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 c870162e8691a06e8bb6a8083be9eaf3f7ddc94357fb302a6e1fdd1b7aa873f8 --- 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-2329fc7 [2022-12-14 07:31:01,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 07:31:01,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 07:31:01,147 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 07:31:01,147 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 07:31:01,148 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 07:31:01,150 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 07:31:01,151 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 07:31:01,153 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 07:31:01,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 07:31:01,154 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 07:31:01,156 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 07:31:01,156 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 07:31:01,157 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 07:31:01,158 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 07:31:01,159 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 07:31:01,160 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 07:31:01,160 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 07:31:01,162 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 07:31:01,164 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 07:31:01,165 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 07:31:01,166 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 07:31:01,167 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 07:31:01,167 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 07:31:01,169 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 07:31:01,170 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 07:31:01,170 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 07:31:01,170 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 07:31:01,171 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 07:31:01,171 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 07:31:01,171 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 07:31:01,172 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 07:31:01,172 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 07:31:01,173 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 07:31:01,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 07:31:01,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 07:31:01,180 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 07:31:01,180 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 07:31:01,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 07:31:01,181 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 07:31:01,182 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 07:31:01,183 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Bitvector.epf [2022-12-14 07:31:01,205 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 07:31:01,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 07:31:01,206 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 07:31:01,206 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 07:31:01,207 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 07:31:01,207 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 07:31:01,207 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 07:31:01,207 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 07:31:01,207 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 07:31:01,208 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 07:31:01,208 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 07:31:01,208 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 07:31:01,209 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 07:31:01,209 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 07:31:01,209 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 07:31:01,209 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 07:31:01,209 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 07:31:01,210 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 07:31:01,210 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 07:31:01,210 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 07:31:01,210 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 07:31:01,210 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 07:31:01,210 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 07:31:01,211 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 07:31:01,211 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 07:31:01,211 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 07:31:01,211 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 07:31:01,211 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 07:31:01,212 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 07:31:01,212 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 07:31:01,212 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 07:31:01,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:31:01,212 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 07:31:01,213 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 07:31:01,213 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 07:31:01,213 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 07:31:01,213 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 07:31:01,213 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 07:31:01,213 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 07:31:01,214 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 07:31:01,214 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/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_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh 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 -> c870162e8691a06e8bb6a8083be9eaf3f7ddc94357fb302a6e1fdd1b7aa873f8 [2022-12-14 07:31:01,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 07:31:01,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 07:31:01,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 07:31:01,432 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 07:31:01,432 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 07:31:01,433 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2022-12-14 07:31:04,076 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 07:31:04,256 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 07:31:04,256 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2022-12-14 07:31:04,264 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/data/216e93631/62181e57991740178e22de8525610d50/FLAGe332c11f9 [2022-12-14 07:31:04,278 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/data/216e93631/62181e57991740178e22de8525610d50 [2022-12-14 07:31:04,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 07:31:04,282 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 07:31:04,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 07:31:04,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 07:31:04,287 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 07:31:04,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:31:04" (1/1) ... [2022-12-14 07:31:04,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a966e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:31:04, skipping insertion in model container [2022-12-14 07:31:04,289 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:31:04" (1/1) ... [2022-12-14 07:31:04,295 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 07:31:04,312 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 07:31:04,460 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c[2755,2768] [2022-12-14 07:31:04,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:31:04,485 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-12-14 07:31:04,490 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 07:31:04,504 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c[2755,2768] [2022-12-14 07:31:04,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:31:04,515 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 07:31:04,535 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c[2755,2768] [2022-12-14 07:31:04,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:31:04,555 INFO L208 MainTranslator]: Completed translation [2022-12-14 07:31:04,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:31:04 WrapperNode [2022-12-14 07:31:04,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 07:31:04,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 07:31:04,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 07:31:04,557 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 07:31:04,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:31:04" (1/1) ... [2022-12-14 07:31:04,573 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:31:04" (1/1) ... [2022-12-14 07:31:04,601 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 377 [2022-12-14 07:31:04,601 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 07:31:04,602 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 07:31:04,602 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 07:31:04,602 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 07:31:04,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:31:04" (1/1) ... [2022-12-14 07:31:04,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:31:04" (1/1) ... [2022-12-14 07:31:04,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:31:04" (1/1) ... [2022-12-14 07:31:04,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:31:04" (1/1) ... [2022-12-14 07:31:04,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:31:04" (1/1) ... [2022-12-14 07:31:04,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:31:04" (1/1) ... [2022-12-14 07:31:04,644 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:31:04" (1/1) ... [2022-12-14 07:31:04,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:31:04" (1/1) ... [2022-12-14 07:31:04,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 07:31:04,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 07:31:04,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 07:31:04,652 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 07:31:04,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:31:04" (1/1) ... [2022-12-14 07:31:04,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:31:04,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:31:04,687 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 07:31:04,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b83724f-d930-49fb-8f1b-4528397755a5/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 07:31:04,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 07:31:04,722 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-14 07:31:04,722 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-14 07:31:04,722 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-14 07:31:04,722 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-14 07:31:04,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 07:31:04,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 07:31:04,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 07:31:04,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-14 07:31:04,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 07:31:04,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 07:31:04,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 07:31:04,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-14 07:31:04,725 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 07:31:04,821 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 07:31:04,823 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 07:31:05,484 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 07:31:05,496 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 07:31:05,496 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-14 07:31:05,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:31:05 BoogieIcfgContainer [2022-12-14 07:31:05,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 07:31:05,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 07:31:05,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 07:31:05,502 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 07:31:05,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:31:04" (1/3) ... [2022-12-14 07:31:05,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d7600b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:31:05, skipping insertion in model container [2022-12-14 07:31:05,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:31:04" (2/3) ... [2022-12-14 07:31:05,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d7600b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:31:05, skipping insertion in model container [2022-12-14 07:31:05,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:31:05" (3/3) ... [2022-12-14 07:31:05,504 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2022-12-14 07:31:05,510 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 07:31:05,517 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 07:31:05,518 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2022-12-14 07:31:05,518 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 07:31:05,610 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-14 07:31:05,638 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 07:31:05,649 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 528 places, 565 transitions, 1146 flow [2022-12-14 07:31:05,651 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 528 places, 565 transitions, 1146 flow [2022-12-14 07:31:05,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 528 places, 565 transitions, 1146 flow [2022-12-14 07:31:05,798 INFO L130 PetriNetUnfolder]: 44/563 cut-off events. [2022-12-14 07:31:05,798 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-14 07:31:05,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 563 events. 44/563 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1821 event pairs, 0 based on Foata normal form. 0/465 useless extension candidates. Maximal degree in co-relation 447. Up to 2 conditions per place. [2022-12-14 07:31:05,845 INFO L119 LiptonReduction]: Number of co-enabled transitions 101588 [2022-12-14 07:32:12,047 WARN L233 SmtUtils]: Spent 11.04s on a formula simplification. DAG size of input: 200 DAG size of output: 193 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)