./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b68e155d55184c39a54e11a2c420443b840324481c8995060134516395f2d120 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 02:50:17,079 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:50:17,083 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:50:17,140 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:50:17,141 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:50:17,145 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:50:17,148 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:50:17,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:50:17,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:50:17,164 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:50:17,165 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:50:17,166 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:50:17,167 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:50:17,173 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:50:17,174 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:50:17,177 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:50:17,178 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:50:17,179 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:50:17,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:50:17,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:50:17,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:50:17,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:50:17,194 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:50:17,195 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:50:17,201 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:50:17,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:50:17,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:50:17,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:50:17,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:50:17,205 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:50:17,205 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:50:17,206 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:50:17,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:50:17,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:50:17,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:50:17,209 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:50:17,209 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:50:17,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:50:17,210 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:50:17,216 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:50:17,218 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:50:17,219 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-03 02:50:17,259 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:50:17,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:50:17,263 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:50:17,264 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:50:17,265 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:50:17,265 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:50:17,265 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:50:17,265 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:50:17,266 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:50:17,266 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:50:17,267 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:50:17,267 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:50:17,267 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:50:17,268 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:50:17,268 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:50:17,268 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:50:17,268 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:50:17,269 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:50:17,270 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:50:17,270 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:50:17,270 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 02:50:17,271 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:50:17,271 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:50:17,272 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:50:17,273 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:50:17,273 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:50:17,273 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:50:17,273 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-03 02:50:17,274 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:50:17,274 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:50:17,274 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:50:17,275 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:50:17,275 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:50:17,275 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:50:17,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:50:17,276 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:50:17,276 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:50:17,277 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:50:17,277 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:50:17,277 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:50:17,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:50:17,278 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:50:17,278 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:50:17,278 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_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b68e155d55184c39a54e11a2c420443b840324481c8995060134516395f2d120 [2022-11-03 02:50:17,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:50:17,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:50:17,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:50:17,663 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:50:17,664 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:50:17,665 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c [2022-11-03 02:50:17,756 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/data/4b652467d/88c60c453e22441a80d3122c647dc4f8/FLAG51a88f24f [2022-11-03 02:50:18,347 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:50:18,348 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c [2022-11-03 02:50:18,377 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/data/4b652467d/88c60c453e22441a80d3122c647dc4f8/FLAG51a88f24f [2022-11-03 02:50:18,674 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/data/4b652467d/88c60c453e22441a80d3122c647dc4f8 [2022-11-03 02:50:18,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:50:18,685 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:50:18,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:50:18,690 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:50:18,695 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:50:18,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:50:18" (1/1) ... [2022-11-03 02:50:18,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70ed3b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:50:18, skipping insertion in model container [2022-11-03 02:50:18,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:50:18" (1/1) ... [2022-11-03 02:50:18,708 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:50:18,747 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:50:19,060 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c[3097,3110] [2022-11-03 02:50:19,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:50:19,092 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:50:19,149 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c[3097,3110] [2022-11-03 02:50:19,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:50:19,192 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:50:19,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:50:19 WrapperNode [2022-11-03 02:50:19,193 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:50:19,195 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:50:19,195 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:50:19,196 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:50:19,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:50:19" (1/1) ... [2022-11-03 02:50:19,235 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:50:19" (1/1) ... [2022-11-03 02:50:19,302 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 17, calls inlined = 25, statements flattened = 341 [2022-11-03 02:50:19,302 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:50:19,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:50:19,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:50:19,305 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:50:19,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:50:19" (1/1) ... [2022-11-03 02:50:19,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:50:19" (1/1) ... [2022-11-03 02:50:19,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:50:19" (1/1) ... [2022-11-03 02:50:19,336 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:50:19" (1/1) ... [2022-11-03 02:50:19,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:50:19" (1/1) ... [2022-11-03 02:50:19,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:50:19" (1/1) ... [2022-11-03 02:50:19,365 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:50:19" (1/1) ... [2022-11-03 02:50:19,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:50:19" (1/1) ... [2022-11-03 02:50:19,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:50:19,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:50:19,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:50:19,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:50:19,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:50:19" (1/1) ... [2022-11-03 02:50:19,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:50:19,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:50:19,423 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:50:19,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:50:19,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:50:19,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:50:19,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:50:19,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 02:50:19,474 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-03 02:50:19,474 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-03 02:50:19,475 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-03 02:50:19,475 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-03 02:50:19,475 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-03 02:50:19,475 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-03 02:50:19,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:50:19,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 02:50:19,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:50:19,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:50:19,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:50:19,478 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 02:50:19,716 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:50:19,719 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:50:20,561 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:50:20,581 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:50:20,582 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-03 02:50:20,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:50:20 BoogieIcfgContainer [2022-11-03 02:50:20,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:50:20,588 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:50:20,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:50:20,594 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:50:20,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:50:18" (1/3) ... [2022-11-03 02:50:20,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36fb331e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:50:20, skipping insertion in model container [2022-11-03 02:50:20,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:50:19" (2/3) ... [2022-11-03 02:50:20,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36fb331e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:50:20, skipping insertion in model container [2022-11-03 02:50:20,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:50:20" (3/3) ... [2022-11-03 02:50:20,598 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-chromosome-subst.wvr.c [2022-11-03 02:50:20,608 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 02:50:20,619 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:50:20,620 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-11-03 02:50:20,620 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 02:50:20,866 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-03 02:50:20,925 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:50:20,942 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 440 places, 468 transitions, 960 flow [2022-11-03 02:50:20,945 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 440 places, 468 transitions, 960 flow [2022-11-03 02:50:20,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 440 places, 468 transitions, 960 flow [2022-11-03 02:50:21,220 INFO L130 PetriNetUnfolder]: 38/465 cut-off events. [2022-11-03 02:50:21,220 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-03 02:50:21,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 465 events. 38/465 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1015 event pairs, 0 based on Foata normal form. 0/397 useless extension candidates. Maximal degree in co-relation 346. Up to 2 conditions per place. [2022-11-03 02:50:21,297 INFO L118 LiptonReduction]: Number of co-enabled transitions 48384 [2022-11-03 02:50:55,933 INFO L133 LiptonReduction]: Checked pairs total: 49764 [2022-11-03 02:50:55,933 INFO L135 LiptonReduction]: Total number of compositions: 607 [2022-11-03 02:50:55,941 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 63 transitions, 150 flow [2022-11-03 02:50:56,176 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3771 states, 3037 states have (on average 4.225551531116233) internal successors, (12833), 3770 states have internal predecessors, (12833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:56,212 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:50:56,222 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;@2b30eb44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:50:56,223 INFO L358 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2022-11-03 02:50:56,238 INFO L276 IsEmpty]: Start isEmpty. Operand has 3771 states, 3037 states have (on average 4.225551531116233) internal successors, (12833), 3770 states have internal predecessors, (12833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:56,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-03 02:50:56,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:50:56,245 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-03 02:50:56,246 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-11-03 02:50:56,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:50:56,252 INFO L85 PathProgramCache]: Analyzing trace with hash 63566, now seen corresponding path program 1 times [2022-11-03 02:50:56,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:50:56,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925064746] [2022-11-03 02:50:56,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:50:56,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:50:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:50:56,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:50:56,673 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:50:56,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925064746] [2022-11-03 02:50:56,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925064746] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:50:56,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:50:56,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 02:50:56,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87512605] [2022-11-03 02:50:56,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:50:56,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:50:56,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:50:56,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:50:56,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:50:56,736 INFO L87 Difference]: Start difference. First operand has 3771 states, 3037 states have (on average 4.225551531116233) internal successors, (12833), 3770 states have internal predecessors, (12833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:57,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:50:57,103 INFO L93 Difference]: Finished difference Result 3995 states and 13491 transitions. [2022-11-03 02:50:57,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:50:57,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-11-03 02:50:57,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:50:57,207 INFO L225 Difference]: With dead ends: 3995 [2022-11-03 02:50:57,208 INFO L226 Difference]: Without dead ends: 3995 [2022-11-03 02:50:57,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:50:57,213 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:50:57,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:50:57,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3995 states. [2022-11-03 02:50:57,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3995 to 2004. [2022-11-03 02:50:57,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2004 states, 1705 states have (on average 3.961876832844575) internal successors, (6755), 2003 states have internal predecessors, (6755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:57,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 6755 transitions. [2022-11-03 02:50:57,418 INFO L78 Accepts]: Start accepts. Automaton has 2004 states and 6755 transitions. Word has length 2 [2022-11-03 02:50:57,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:50:57,419 INFO L495 AbstractCegarLoop]: Abstraction has 2004 states and 6755 transitions. [2022-11-03 02:50:57,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:57,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 6755 transitions. [2022-11-03 02:50:57,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 02:50:57,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:50:57,420 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 02:50:57,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:50:57,421 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-11-03 02:50:57,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:50:57,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1975708, now seen corresponding path program 1 times [2022-11-03 02:50:57,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:50:57,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328961207] [2022-11-03 02:50:57,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:50:57,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:50:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:50:57,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:50:57,515 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:50:57,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328961207] [2022-11-03 02:50:57,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328961207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:50:57,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:50:57,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:50:57,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169893625] [2022-11-03 02:50:57,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:50:57,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:50:57,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:50:57,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:50:57,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:50:57,520 INFO L87 Difference]: Start difference. First operand 2004 states and 6755 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:57,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:50:57,683 INFO L93 Difference]: Finished difference Result 2001 states and 6752 transitions. [2022-11-03 02:50:57,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:50:57,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 02:50:57,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:50:57,704 INFO L225 Difference]: With dead ends: 2001 [2022-11-03 02:50:57,704 INFO L226 Difference]: Without dead ends: 2001 [2022-11-03 02:50:57,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:50:57,708 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:50:57,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:50:57,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2022-11-03 02:50:57,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 2001. [2022-11-03 02:50:57,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2001 states, 1705 states have (on average 3.960117302052786) internal successors, (6752), 2000 states have internal predecessors, (6752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:57,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 6752 transitions. [2022-11-03 02:50:57,882 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 6752 transitions. Word has length 3 [2022-11-03 02:50:57,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:50:57,882 INFO L495 AbstractCegarLoop]: Abstraction has 2001 states and 6752 transitions. [2022-11-03 02:50:57,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:57,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 6752 transitions. [2022-11-03 02:50:57,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 02:50:57,884 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:50:57,884 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 02:50:57,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:50:57,886 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-11-03 02:50:57,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:50:57,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1975709, now seen corresponding path program 1 times [2022-11-03 02:50:57,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:50:57,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924700100] [2022-11-03 02:50:57,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:50:57,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:50:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:50:58,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:50:58,021 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:50:58,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924700100] [2022-11-03 02:50:58,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924700100] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:50:58,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278393752] [2022-11-03 02:50:58,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:50:58,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:50:58,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:50:58,025 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:50:58,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:50:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:50:58,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:50:58,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:50:58,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:50:58,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:50:58,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:50:58,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278393752] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:50:58,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [841962712] [2022-11-03 02:50:58,321 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:50:58,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:50:58,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2022-11-03 02:50:58,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280955599] [2022-11-03 02:50:58,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:50:58,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:50:58,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:50:58,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:50:58,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:50:58,340 INFO L87 Difference]: Start difference. First operand 2001 states and 6752 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:59,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:50:59,198 INFO L93 Difference]: Finished difference Result 9974 states and 33714 transitions. [2022-11-03 02:50:59,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:50:59,199 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 02:50:59,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:50:59,312 INFO L225 Difference]: With dead ends: 9974 [2022-11-03 02:50:59,313 INFO L226 Difference]: Without dead ends: 9974 [2022-11-03 02:50:59,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:50:59,314 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 273 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:50:59,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 0 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 02:50:59,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9974 states. [2022-11-03 02:50:59,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9974 to 2010. [2022-11-03 02:50:59,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2010 states, 1714 states have (on average 3.9498249708284714) internal successors, (6770), 2009 states have internal predecessors, (6770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:59,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 6770 transitions. [2022-11-03 02:50:59,588 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 6770 transitions. Word has length 3 [2022-11-03 02:50:59,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:50:59,588 INFO L495 AbstractCegarLoop]: Abstraction has 2010 states and 6770 transitions. [2022-11-03 02:50:59,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:59,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 6770 transitions. [2022-11-03 02:50:59,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 02:50:59,589 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:50:59,589 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1] [2022-11-03 02:50:59,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:50:59,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:50:59,815 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-11-03 02:50:59,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:50:59,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1266099249, now seen corresponding path program 2 times [2022-11-03 02:50:59,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:50:59,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988812582] [2022-11-03 02:50:59,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:50:59,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:50:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:51:00,186 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:51:00,187 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:51:00,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988812582] [2022-11-03 02:51:00,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988812582] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:51:00,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866979406] [2022-11-03 02:51:00,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:51:00,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:51:00,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:51:00,223 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:51:00,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 02:51:00,403 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 02:51:00,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:51:00,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 02:51:00,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:51:00,436 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:51:00,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:51:00,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866979406] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:51:00,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:51:00,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2022-11-03 02:51:00,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495935911] [2022-11-03 02:51:00,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:51:00,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:51:00,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:51:00,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:51:00,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:51:00,446 INFO L87 Difference]: Start difference. First operand 2010 states and 6770 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:00,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:51:00,587 INFO L93 Difference]: Finished difference Result 2007 states and 6767 transitions. [2022-11-03 02:51:00,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:51:00,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-03 02:51:00,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:51:00,611 INFO L225 Difference]: With dead ends: 2007 [2022-11-03 02:51:00,612 INFO L226 Difference]: Without dead ends: 2007 [2022-11-03 02:51:00,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:51:00,619 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:51:00,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:51:00,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2022-11-03 02:51:00,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 1995. [2022-11-03 02:51:00,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1995 states, 1702 states have (on average 3.961809635722679) internal successors, (6743), 1994 states have internal predecessors, (6743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:00,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 6743 transitions. [2022-11-03 02:51:00,819 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 6743 transitions. Word has length 6 [2022-11-03 02:51:00,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:51:00,820 INFO L495 AbstractCegarLoop]: Abstraction has 1995 states and 6743 transitions. [2022-11-03 02:51:00,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:00,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 6743 transitions. [2022-11-03 02:51:00,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 02:51:00,822 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:51:00,822 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:51:00,870 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:51:01,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:51:01,044 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-11-03 02:51:01,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:51:01,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1463162735, now seen corresponding path program 1 times [2022-11-03 02:51:01,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:51:01,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419139740] [2022-11-03 02:51:01,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:51:01,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:51:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:51:01,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:51:01,182 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:51:01,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419139740] [2022-11-03 02:51:01,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419139740] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:51:01,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:51:01,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:51:01,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561017504] [2022-11-03 02:51:01,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:51:01,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:51:01,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:51:01,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:51:01,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:51:01,185 INFO L87 Difference]: Start difference. First operand 1995 states and 6743 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:01,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:51:01,325 INFO L93 Difference]: Finished difference Result 1998 states and 6746 transitions. [2022-11-03 02:51:01,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:51:01,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 02:51:01,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:51:01,339 INFO L225 Difference]: With dead ends: 1998 [2022-11-03 02:51:01,339 INFO L226 Difference]: Without dead ends: 1998 [2022-11-03 02:51:01,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:51:01,340 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:51:01,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:51:01,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2022-11-03 02:51:01,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1998. [2022-11-03 02:51:01,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1998 states, 1705 states have (on average 3.956598240469208) internal successors, (6746), 1997 states have internal predecessors, (6746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:01,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 6746 transitions. [2022-11-03 02:51:01,418 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 6746 transitions. Word has length 8 [2022-11-03 02:51:01,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:51:01,418 INFO L495 AbstractCegarLoop]: Abstraction has 1998 states and 6746 transitions. [2022-11-03 02:51:01,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:01,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 6746 transitions. [2022-11-03 02:51:01,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:51:01,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:51:01,419 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:51:01,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 02:51:01,420 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-11-03 02:51:01,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:51:01,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1578535851, now seen corresponding path program 1 times [2022-11-03 02:51:01,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:51:01,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546317309] [2022-11-03 02:51:01,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:51:01,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:51:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:51:01,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:51:01,639 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:51:01,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546317309] [2022-11-03 02:51:01,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546317309] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:51:01,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607173369] [2022-11-03 02:51:01,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:51:01,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:51:01,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:51:01,642 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:51:01,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 02:51:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:51:01,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 02:51:01,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:51:01,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:51:01,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:51:01,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:51:01,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607173369] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:51:01,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1690344085] [2022-11-03 02:51:01,887 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:51:01,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:51:01,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-11-03 02:51:01,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857311568] [2022-11-03 02:51:01,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:51:01,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:51:01,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:51:01,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:51:01,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:51:01,892 INFO L87 Difference]: Start difference. First operand 1998 states and 6746 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:02,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:51:02,103 INFO L93 Difference]: Finished difference Result 2007 states and 6755 transitions. [2022-11-03 02:51:02,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:51:02,103 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 02:51:02,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:51:02,120 INFO L225 Difference]: With dead ends: 2007 [2022-11-03 02:51:02,120 INFO L226 Difference]: Without dead ends: 2007 [2022-11-03 02:51:02,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:51:02,122 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:51:02,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:51:02,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2022-11-03 02:51:02,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 2007. [2022-11-03 02:51:02,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2007 states, 1714 states have (on average 3.941073512252042) internal successors, (6755), 2006 states have internal predecessors, (6755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:02,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 6755 transitions. [2022-11-03 02:51:02,226 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 6755 transitions. Word has length 11 [2022-11-03 02:51:02,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:51:02,226 INFO L495 AbstractCegarLoop]: Abstraction has 2007 states and 6755 transitions. [2022-11-03 02:51:02,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:02,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 6755 transitions. [2022-11-03 02:51:02,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 02:51:02,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:51:02,228 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:51:02,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:51:02,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:51:02,451 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-11-03 02:51:02,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:51:02,451 INFO L85 PathProgramCache]: Analyzing trace with hash 618527505, now seen corresponding path program 2 times [2022-11-03 02:51:02,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:51:02,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582976793] [2022-11-03 02:51:02,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:51:02,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:51:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:51:02,807 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-03 02:51:02,807 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:51:02,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582976793] [2022-11-03 02:51:02,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582976793] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:51:02,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339059402] [2022-11-03 02:51:02,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:51:02,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:51:02,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:51:02,815 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:51:02,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 02:51:03,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:51:03,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:51:03,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 02:51:03,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:51:03,334 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-03 02:51:03,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:51:03,431 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-03 02:51:03,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339059402] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:51:03,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1312344329] [2022-11-03 02:51:03,432 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:51:03,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:51:03,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-11-03 02:51:03,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295708300] [2022-11-03 02:51:03,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:51:03,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 02:51:03,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:51:03,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 02:51:03,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2022-11-03 02:51:03,434 INFO L87 Difference]: Start difference. First operand 2007 states and 6755 transitions. Second operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:03,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:51:03,755 INFO L93 Difference]: Finished difference Result 2010 states and 6758 transitions. [2022-11-03 02:51:03,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:51:03,756 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-03 02:51:03,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:51:03,768 INFO L225 Difference]: With dead ends: 2010 [2022-11-03 02:51:03,768 INFO L226 Difference]: Without dead ends: 2010 [2022-11-03 02:51:03,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2022-11-03 02:51:03,769 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:51:03,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:51:03,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2010 states. [2022-11-03 02:51:03,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2010 to 2010. [2022-11-03 02:51:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2010 states, 1717 states have (on average 3.935934769947583) internal successors, (6758), 2009 states have internal predecessors, (6758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:03,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 6758 transitions. [2022-11-03 02:51:03,902 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 6758 transitions. Word has length 20 [2022-11-03 02:51:03,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:51:03,903 INFO L495 AbstractCegarLoop]: Abstraction has 2010 states and 6758 transitions. [2022-11-03 02:51:03,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:03,903 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 6758 transitions. [2022-11-03 02:51:03,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 02:51:03,905 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:51:03,905 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:51:03,945 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:51:04,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-03 02:51:04,105 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-11-03 02:51:04,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:51:04,106 INFO L85 PathProgramCache]: Analyzing trace with hash 2034692907, now seen corresponding path program 3 times [2022-11-03 02:51:04,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:51:04,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575355468] [2022-11-03 02:51:04,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:51:04,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:51:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:51:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:51:08,009 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:51:08,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575355468] [2022-11-03 02:51:08,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575355468] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:51:08,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030936120] [2022-11-03 02:51:08,009 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:51:08,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:51:08,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:51:08,015 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:51:08,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 02:51:08,234 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:51:08,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:51:08,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-03 02:51:08,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:51:08,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:08,343 INFO L356 Elim1Store]: treesize reduction 56, result has 37.8 percent of original size [2022-11-03 02:51:08,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 39 [2022-11-03 02:51:08,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:51:08,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:08,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 02:51:08,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:08,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 02:51:08,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:08,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 02:51:08,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:08,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 02:51:08,880 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:51:08,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 02:51:08,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:08,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:09,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:09,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:09,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:09,150 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:51:09,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-03 02:51:09,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:09,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:09,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:09,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:09,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:09,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:09,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:09,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-03 02:51:09,535 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-03 02:51:09,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:51:09,673 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_404 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_404) c_~o_0~0.base) c_~o_0~0.offset)))) is different from false [2022-11-03 02:51:09,683 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_404 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_403) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_404) c_~o_0~0.base) c_~o_0~0.offset)))) is different from false [2022-11-03 02:51:10,779 INFO L356 Elim1Store]: treesize reduction 364, result has 14.4 percent of original size [2022-11-03 02:51:10,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 79 [2022-11-03 02:51:10,799 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:51:10,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 139 [2022-11-03 02:51:10,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 116 [2022-11-03 02:51:10,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2022-11-03 02:51:10,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2022-11-03 02:51:11,243 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 17 refuted. 3 times theorem prover too weak. 20 trivial. 5 not checked. [2022-11-03 02:51:11,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030936120] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:51:11,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [413812749] [2022-11-03 02:51:11,244 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:51:11,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:51:11,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 40 [2022-11-03 02:51:11,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879339601] [2022-11-03 02:51:11,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:51:11,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-03 02:51:11,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:51:11,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-03 02:51:11,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1348, Unknown=24, NotChecked=154, Total=1722 [2022-11-03 02:51:11,247 INFO L87 Difference]: Start difference. First operand 2010 states and 6758 transitions. Second operand has 42 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:12,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:51:12,689 INFO L93 Difference]: Finished difference Result 2740 states and 9258 transitions. [2022-11-03 02:51:12,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 02:51:12,690 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 02:51:12,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:51:12,706 INFO L225 Difference]: With dead ends: 2740 [2022-11-03 02:51:12,706 INFO L226 Difference]: Without dead ends: 2740 [2022-11-03 02:51:12,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=334, Invalid=1906, Unknown=24, NotChecked=186, Total=2450 [2022-11-03 02:51:12,708 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 188 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 915 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:51:12,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 0 Invalid, 1644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 684 Invalid, 0 Unknown, 915 Unchecked, 0.7s Time] [2022-11-03 02:51:12,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2740 states. [2022-11-03 02:51:12,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2740 to 2193. [2022-11-03 02:51:12,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2193 states, 1900 states have (on average 4.17421052631579) internal successors, (7931), 2192 states have internal predecessors, (7931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:12,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 7931 transitions. [2022-11-03 02:51:12,814 INFO L78 Accepts]: Start accepts. Automaton has 2193 states and 7931 transitions. Word has length 23 [2022-11-03 02:51:12,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:51:12,815 INFO L495 AbstractCegarLoop]: Abstraction has 2193 states and 7931 transitions. [2022-11-03 02:51:12,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:12,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 7931 transitions. [2022-11-03 02:51:12,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 02:51:12,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:51:12,816 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:51:12,858 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-03 02:51:13,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:51:13,039 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-11-03 02:51:13,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:51:13,040 INFO L85 PathProgramCache]: Analyzing trace with hash 2034692909, now seen corresponding path program 1 times [2022-11-03 02:51:13,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:51:13,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245746402] [2022-11-03 02:51:13,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:51:13,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:51:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:51:14,273 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-03 02:51:14,273 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:51:14,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245746402] [2022-11-03 02:51:14,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245746402] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:51:14,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692761769] [2022-11-03 02:51:14,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:51:14,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:51:14,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:51:14,275 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:51:14,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 02:51:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:51:14,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-03 02:51:14,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:51:14,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:51:14,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:51:14,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:14,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 02:51:14,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:14,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 02:51:14,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:14,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 02:51:14,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:14,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 02:51:14,861 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:51:14,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-03 02:51:14,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:14,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:14,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:14,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:14,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:15,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:15,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:15,075 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-03 02:51:15,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:51:15,140 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_521 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_521) c_~o_2~0.base) c_~o_2~0.offset) 4294967296))) is different from false [2022-11-03 02:51:15,148 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_520 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_520) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_521) c_~o_2~0.base) c_~o_2~0.offset) 4294967296))) is different from false [2022-11-03 02:51:15,671 INFO L356 Elim1Store]: treesize reduction 364, result has 14.4 percent of original size [2022-11-03 02:51:15,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 76 [2022-11-03 02:51:15,689 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:51:15,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 137 [2022-11-03 02:51:15,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 114 [2022-11-03 02:51:15,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2022-11-03 02:51:15,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 02:51:15,872 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 12 refuted. 3 times theorem prover too weak. 25 trivial. 5 not checked. [2022-11-03 02:51:15,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692761769] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:51:15,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [921217356] [2022-11-03 02:51:15,873 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:51:15,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:51:15,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-11-03 02:51:15,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897505988] [2022-11-03 02:51:15,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:51:15,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 02:51:15,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:51:15,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 02:51:15,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=704, Unknown=15, NotChecked=114, Total=992 [2022-11-03 02:51:15,876 INFO L87 Difference]: Start difference. First operand 2193 states and 7931 transitions. Second operand has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:16,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:51:16,754 INFO L93 Difference]: Finished difference Result 3101 states and 10138 transitions. [2022-11-03 02:51:16,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:51:16,755 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 02:51:16,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:51:16,773 INFO L225 Difference]: With dead ends: 3101 [2022-11-03 02:51:16,774 INFO L226 Difference]: Without dead ends: 3101 [2022-11-03 02:51:16,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=282, Invalid=1193, Unknown=15, NotChecked=150, Total=1640 [2022-11-03 02:51:16,775 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 143 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 558 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:51:16,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 0 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 577 Invalid, 0 Unknown, 558 Unchecked, 0.6s Time] [2022-11-03 02:51:16,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3101 states. [2022-11-03 02:51:16,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3101 to 2193. [2022-11-03 02:51:16,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2193 states, 1900 states have (on average 4.173684210526316) internal successors, (7930), 2192 states have internal predecessors, (7930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:16,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 7930 transitions. [2022-11-03 02:51:16,866 INFO L78 Accepts]: Start accepts. Automaton has 2193 states and 7930 transitions. Word has length 23 [2022-11-03 02:51:16,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:51:16,866 INFO L495 AbstractCegarLoop]: Abstraction has 2193 states and 7930 transitions. [2022-11-03 02:51:16,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:16,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 7930 transitions. [2022-11-03 02:51:16,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 02:51:16,867 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:51:16,868 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:51:16,910 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:51:17,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:51:17,082 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-11-03 02:51:17,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:51:17,083 INFO L85 PathProgramCache]: Analyzing trace with hash 2034692830, now seen corresponding path program 1 times [2022-11-03 02:51:17,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:51:17,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65993946] [2022-11-03 02:51:17,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:51:17,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:51:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:51:18,199 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-03 02:51:18,199 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:51:18,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65993946] [2022-11-03 02:51:18,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65993946] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:51:18,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549172373] [2022-11-03 02:51:18,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:51:18,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:51:18,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:51:18,215 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:51:18,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 02:51:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:51:18,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-03 02:51:18,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:51:18,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:51:18,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:51:18,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:18,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 02:51:18,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:18,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 02:51:18,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:18,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 02:51:18,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:18,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 02:51:18,755 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:51:18,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-03 02:51:18,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:18,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:18,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:18,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:18,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:18,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:18,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:18,954 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-03 02:51:18,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:51:19,023 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_638 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_638) c_~o_2~0.base) c_~o_2~0.offset) 9223372039002259456)) is different from false [2022-11-03 02:51:19,030 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_638 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_637) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_638) c_~o_2~0.base) c_~o_2~0.offset) 9223372039002259456)) is different from false [2022-11-03 02:51:19,520 INFO L356 Elim1Store]: treesize reduction 364, result has 14.4 percent of original size [2022-11-03 02:51:19,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 74 [2022-11-03 02:51:19,537 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:51:19,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 119 [2022-11-03 02:51:19,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2022-11-03 02:51:19,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2022-11-03 02:51:19,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 02:51:19,741 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 12 refuted. 3 times theorem prover too weak. 25 trivial. 5 not checked. [2022-11-03 02:51:19,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549172373] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:51:19,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1322182750] [2022-11-03 02:51:19,742 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:51:19,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:51:19,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-11-03 02:51:19,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053627101] [2022-11-03 02:51:19,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:51:19,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 02:51:19,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:51:19,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 02:51:19,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=704, Unknown=15, NotChecked=114, Total=992 [2022-11-03 02:51:19,749 INFO L87 Difference]: Start difference. First operand 2193 states and 7930 transitions. Second operand has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:20,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:51:20,681 INFO L93 Difference]: Finished difference Result 3100 states and 10136 transitions. [2022-11-03 02:51:20,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:51:20,682 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 02:51:20,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:51:20,699 INFO L225 Difference]: With dead ends: 3100 [2022-11-03 02:51:20,700 INFO L226 Difference]: Without dead ends: 3100 [2022-11-03 02:51:20,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=273, Invalid=1126, Unknown=15, NotChecked=146, Total=1560 [2022-11-03 02:51:20,701 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 53 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 577 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:51:20,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 0 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 640 Invalid, 0 Unknown, 577 Unchecked, 0.6s Time] [2022-11-03 02:51:20,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2022-11-03 02:51:20,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2193. [2022-11-03 02:51:20,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2193 states, 1900 states have (on average 4.173157894736842) internal successors, (7929), 2192 states have internal predecessors, (7929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:20,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 7929 transitions. [2022-11-03 02:51:20,793 INFO L78 Accepts]: Start accepts. Automaton has 2193 states and 7929 transitions. Word has length 23 [2022-11-03 02:51:20,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:51:20,794 INFO L495 AbstractCegarLoop]: Abstraction has 2193 states and 7929 transitions. [2022-11-03 02:51:20,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:20,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 7929 transitions. [2022-11-03 02:51:20,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 02:51:20,796 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:51:20,796 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:51:20,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 02:51:21,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:51:21,019 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-11-03 02:51:21,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:51:21,019 INFO L85 PathProgramCache]: Analyzing trace with hash 2034692913, now seen corresponding path program 1 times [2022-11-03 02:51:21,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:51:21,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111497291] [2022-11-03 02:51:21,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:51:21,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:51:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:51:23,542 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:51:23,543 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:51:23,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111497291] [2022-11-03 02:51:23,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111497291] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:51:23,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478251645] [2022-11-03 02:51:23,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:51:23,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:51:23,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:51:23,545 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:51:23,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 02:51:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:51:23,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-03 02:51:23,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:51:23,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:23,814 INFO L356 Elim1Store]: treesize reduction 56, result has 37.8 percent of original size [2022-11-03 02:51:23,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 39 [2022-11-03 02:51:23,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:51:23,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:23,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 02:51:23,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:23,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 02:51:24,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:24,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 02:51:24,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:24,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 02:51:24,207 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:51:24,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 02:51:24,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:24,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:24,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:24,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:24,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:24,385 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:51:24,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-03 02:51:24,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:24,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:24,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:24,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:24,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:24,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:24,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:24,644 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:51:24,647 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:51:24,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-11-03 02:51:24,681 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-03 02:51:24,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:51:24,866 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_764 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_764) c_~o_0~0.base) c_~o_0~0.offset) 2147483648)) is different from false [2022-11-03 02:51:24,874 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_764 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_763) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_764) c_~o_0~0.base) c_~o_0~0.offset) 2147483648)) is different from false [2022-11-03 02:51:25,975 INFO L356 Elim1Store]: treesize reduction 364, result has 14.4 percent of original size [2022-11-03 02:51:25,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 77 [2022-11-03 02:51:25,999 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:51:26,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 121 [2022-11-03 02:51:26,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 100 [2022-11-03 02:51:26,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2022-11-03 02:51:26,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2022-11-03 02:51:26,278 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 16 refuted. 4 times theorem prover too weak. 20 trivial. 5 not checked. [2022-11-03 02:51:26,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478251645] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:51:26,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [314267911] [2022-11-03 02:51:26,279 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:51:26,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:51:26,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 41 [2022-11-03 02:51:26,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040000384] [2022-11-03 02:51:26,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:51:26,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-03 02:51:26,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:51:26,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-03 02:51:26,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1431, Unknown=20, NotChecked=158, Total=1806 [2022-11-03 02:51:26,283 INFO L87 Difference]: Start difference. First operand 2193 states and 7929 transitions. Second operand has 43 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:27,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:51:27,935 INFO L93 Difference]: Finished difference Result 2556 states and 8630 transitions. [2022-11-03 02:51:27,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 02:51:27,935 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 02:51:27,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:51:27,949 INFO L225 Difference]: With dead ends: 2556 [2022-11-03 02:51:27,950 INFO L226 Difference]: Without dead ends: 2556 [2022-11-03 02:51:27,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 24 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=393, Invalid=2351, Unknown=20, NotChecked=206, Total=2970 [2022-11-03 02:51:27,951 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 154 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 479 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:51:27,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 0 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 567 Invalid, 0 Unknown, 479 Unchecked, 0.6s Time] [2022-11-03 02:51:27,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2022-11-03 02:51:28,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2193. [2022-11-03 02:51:28,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2193 states, 1900 states have (on average 4.077368421052632) internal successors, (7747), 2192 states have internal predecessors, (7747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:28,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 7747 transitions. [2022-11-03 02:51:28,026 INFO L78 Accepts]: Start accepts. Automaton has 2193 states and 7747 transitions. Word has length 23 [2022-11-03 02:51:28,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:51:28,029 INFO L495 AbstractCegarLoop]: Abstraction has 2193 states and 7747 transitions. [2022-11-03 02:51:28,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:28,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 7747 transitions. [2022-11-03 02:51:28,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 02:51:28,030 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:51:28,031 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:51:28,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 02:51:28,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-03 02:51:28,248 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-11-03 02:51:28,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:51:28,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1349032153, now seen corresponding path program 1 times [2022-11-03 02:51:28,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:51:28,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540889906] [2022-11-03 02:51:28,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:51:28,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:51:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:51:30,310 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:51:30,310 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:51:30,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540889906] [2022-11-03 02:51:30,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540889906] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:51:30,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320365175] [2022-11-03 02:51:30,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:51:30,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:51:30,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:51:30,312 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:51:30,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 02:51:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:51:30,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 02:51:30,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:51:30,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:51:30,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:51:30,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:30,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 02:51:30,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:30,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 02:51:30,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:30,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 02:51:30,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:30,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 02:51:31,018 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:51:31,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-03 02:51:31,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:31,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:31,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:31,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:31,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:31,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:31,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:31,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:31,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:31,382 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-03 02:51:31,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:51:31,418 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (< 0 (+ 4294967296 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_886) c_~o_2~0.base) (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4)))))) is different from false [2022-11-03 02:51:31,427 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_886) c_~o_2~0.base) c_~o_2~0.offset) 4294967296))) is different from false [2022-11-03 02:51:31,439 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_885 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_885) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_886) c_~o_2~0.base) c_~o_2~0.offset) 4294967296))) is different from false [2022-11-03 02:51:31,447 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_885 (Array Int Int)) (v_ArrVal_884 (Array Int Int))) (< 0 (+ 4294967296 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_884) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_885) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_886) c_~o_2~0.base) c_~o_2~0.offset)))) is different from false [2022-11-03 02:51:32,058 INFO L356 Elim1Store]: treesize reduction 364, result has 14.4 percent of original size [2022-11-03 02:51:32,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 79 [2022-11-03 02:51:32,074 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:51:32,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 555 treesize of output 541 [2022-11-03 02:51:32,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 526 treesize of output 510 [2022-11-03 02:51:32,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 510 treesize of output 478 [2022-11-03 02:51:32,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 478 treesize of output 470 [2022-11-03 02:51:32,876 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:51:32,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 34 [2022-11-03 02:51:32,976 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 11 refuted. 4 times theorem prover too weak. 25 trivial. 5 not checked. [2022-11-03 02:51:32,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320365175] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:51:32,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [834786600] [2022-11-03 02:51:32,977 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:51:32,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:51:32,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 40 [2022-11-03 02:51:32,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168090845] [2022-11-03 02:51:32,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:51:32,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-03 02:51:32,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:51:32,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-03 02:51:32,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1227, Unknown=18, NotChecked=300, Total=1722 [2022-11-03 02:51:32,980 INFO L87 Difference]: Start difference. First operand 2193 states and 7747 transitions. Second operand has 42 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 41 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:34,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:51:34,762 INFO L93 Difference]: Finished difference Result 3111 states and 10031 transitions. [2022-11-03 02:51:34,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-03 02:51:34,762 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 41 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 02:51:34,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:51:34,778 INFO L225 Difference]: With dead ends: 3111 [2022-11-03 02:51:34,778 INFO L226 Difference]: Without dead ends: 3111 [2022-11-03 02:51:34,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=397, Invalid=2357, Unknown=18, NotChecked=420, Total=3192 [2022-11-03 02:51:34,780 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 214 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 949 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:51:34,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 0 Invalid, 1745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 703 Invalid, 0 Unknown, 949 Unchecked, 0.7s Time] [2022-11-03 02:51:34,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3111 states. [2022-11-03 02:51:34,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3111 to 2215. [2022-11-03 02:51:34,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2215 states, 1922 states have (on average 4.081165452653486) internal successors, (7844), 2214 states have internal predecessors, (7844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:34,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 2215 states and 7844 transitions. [2022-11-03 02:51:34,863 INFO L78 Accepts]: Start accepts. Automaton has 2215 states and 7844 transitions. Word has length 24 [2022-11-03 02:51:34,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:51:34,864 INFO L495 AbstractCegarLoop]: Abstraction has 2215 states and 7844 transitions. [2022-11-03 02:51:34,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 41 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:34,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 7844 transitions. [2022-11-03 02:51:34,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 02:51:34,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:51:34,865 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:51:34,910 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 02:51:35,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-03 02:51:35,075 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-11-03 02:51:35,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:51:35,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1349032232, now seen corresponding path program 1 times [2022-11-03 02:51:35,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:51:35,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882038857] [2022-11-03 02:51:35,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:51:35,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:51:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:51:36,288 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-03 02:51:36,288 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:51:36,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882038857] [2022-11-03 02:51:36,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882038857] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:51:36,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682289307] [2022-11-03 02:51:36,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:51:36,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:51:36,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:51:36,290 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:51:36,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 02:51:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:51:36,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 02:51:36,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:51:36,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:51:36,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:51:36,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:36,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 02:51:36,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:36,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 02:51:36,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:36,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 02:51:36,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:36,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 02:51:36,893 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:51:36,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-03 02:51:36,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:36,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:36,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:36,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:37,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:37,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:37,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:37,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:37,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:37,182 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-03 02:51:37,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:51:37,213 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1008 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1008) c_~o_2~0.base) (+ c_~o_2~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 9223372039002259456)) is different from false [2022-11-03 02:51:37,221 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1008 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1008) c_~o_2~0.base) c_~o_2~0.offset) 9223372039002259456)) is different from false [2022-11-03 02:51:37,230 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1007) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1008) c_~o_2~0.base) c_~o_2~0.offset) 9223372039002259456)) is different from false [2022-11-03 02:51:37,238 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1006 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1006) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1007) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1008) c_~o_2~0.base) c_~o_2~0.offset) 9223372039002259456)) is different from false [2022-11-03 02:51:37,761 INFO L356 Elim1Store]: treesize reduction 364, result has 14.4 percent of original size [2022-11-03 02:51:37,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 77 [2022-11-03 02:51:37,772 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:51:37,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 121 [2022-11-03 02:51:37,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 100 [2022-11-03 02:51:37,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 96 [2022-11-03 02:51:37,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2022-11-03 02:51:38,028 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:51:38,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 34 [2022-11-03 02:51:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 12 refuted. 3 times theorem prover too weak. 25 trivial. 5 not checked. [2022-11-03 02:51:38,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682289307] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:51:38,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [760318395] [2022-11-03 02:51:38,119 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:51:38,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:51:38,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2022-11-03 02:51:38,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131371030] [2022-11-03 02:51:38,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:51:38,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-03 02:51:38,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:51:38,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-03 02:51:38,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=842, Unknown=17, NotChecked=252, Total=1260 [2022-11-03 02:51:38,125 INFO L87 Difference]: Start difference. First operand 2215 states and 7844 transitions. Second operand has 36 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:39,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:51:39,545 INFO L93 Difference]: Finished difference Result 3100 states and 9988 transitions. [2022-11-03 02:51:39,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 02:51:39,546 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 02:51:39,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:51:39,557 INFO L225 Difference]: With dead ends: 3100 [2022-11-03 02:51:39,557 INFO L226 Difference]: Without dead ends: 3100 [2022-11-03 02:51:39,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=365, Invalid=1704, Unknown=17, NotChecked=364, Total=2450 [2022-11-03 02:51:39,559 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 154 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 998 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:51:39,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 0 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 635 Invalid, 0 Unknown, 998 Unchecked, 0.6s Time] [2022-11-03 02:51:39,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2022-11-03 02:51:39,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2215. [2022-11-03 02:51:39,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2215 states, 1922 states have (on average 4.069719042663892) internal successors, (7822), 2214 states have internal predecessors, (7822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:39,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 2215 states and 7822 transitions. [2022-11-03 02:51:39,633 INFO L78 Accepts]: Start accepts. Automaton has 2215 states and 7822 transitions. Word has length 24 [2022-11-03 02:51:39,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:51:39,633 INFO L495 AbstractCegarLoop]: Abstraction has 2215 states and 7822 transitions. [2022-11-03 02:51:39,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:39,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 7822 transitions. [2022-11-03 02:51:39,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 02:51:39,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:51:39,634 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:51:39,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 02:51:39,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:51:39,851 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-11-03 02:51:39,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:51:39,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1348819185, now seen corresponding path program 1 times [2022-11-03 02:51:39,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:51:39,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840200500] [2022-11-03 02:51:39,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:51:39,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:51:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:51:42,052 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:51:42,053 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:51:42,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840200500] [2022-11-03 02:51:42,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840200500] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:51:42,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052409345] [2022-11-03 02:51:42,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:51:42,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:51:42,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:51:42,060 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:51:42,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 02:51:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:51:42,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-03 02:51:42,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:51:42,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:42,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:42,331 INFO L356 Elim1Store]: treesize reduction 43, result has 41.9 percent of original size [2022-11-03 02:51:42,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 36 [2022-11-03 02:51:42,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:51:42,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:42,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 02:51:42,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:42,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 02:51:42,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:42,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 02:51:42,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:42,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 02:51:42,756 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:51:42,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 02:51:42,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:42,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:42,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:42,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:42,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:42,955 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:51:42,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-03 02:51:43,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:43,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:43,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:43,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:43,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:43,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:43,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:43,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:43,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:51:43,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-03 02:51:43,290 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-03 02:51:43,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:51:43,353 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1139) c_~o_0~0.base) (+ c_~o_0~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4)))))) is different from false [2022-11-03 02:51:43,357 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1139) c_~o_0~0.base) c_~o_0~0.offset) 2147483649))) is different from false [2022-11-03 02:51:43,365 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1139) c_~o_0~0.base) c_~o_0~0.offset)))) is different from false [2022-11-03 02:51:43,374 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1137 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1137) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1139) c_~o_0~0.base) c_~o_0~0.offset)))) is different from false [2022-11-03 02:51:44,213 INFO L356 Elim1Store]: treesize reduction 364, result has 14.4 percent of original size [2022-11-03 02:51:44,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 82 [2022-11-03 02:51:44,233 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:51:44,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2195 treesize of output 2165 [2022-11-03 02:51:44,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2150 treesize of output 2022 [2022-11-03 02:51:44,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2022 treesize of output 1990 [2022-11-03 02:51:44,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1990 treesize of output 1926 [2022-11-03 02:51:44,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 970 treesize of output 954 [2022-11-03 02:51:48,986 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 17 refuted. 3 times theorem prover too weak. 20 trivial. 5 not checked. [2022-11-03 02:51:48,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052409345] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:51:48,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [313008124] [2022-11-03 02:51:48,987 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:51:48,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:51:48,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 44 [2022-11-03 02:51:48,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967066690] [2022-11-03 02:51:48,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:51:48,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-03 02:51:48,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:51:48,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-03 02:51:48,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1503, Unknown=27, NotChecked=332, Total=2070 [2022-11-03 02:51:48,991 INFO L87 Difference]: Start difference. First operand 2215 states and 7822 transitions. Second operand has 46 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:50,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:51:50,344 INFO L93 Difference]: Finished difference Result 2917 states and 10235 transitions. [2022-11-03 02:51:50,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 02:51:50,345 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 02:51:50,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:51:50,355 INFO L225 Difference]: With dead ends: 2917 [2022-11-03 02:51:50,355 INFO L226 Difference]: Without dead ends: 2917 [2022-11-03 02:51:50,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=329, Invalid=2012, Unknown=27, NotChecked=388, Total=2756 [2022-11-03 02:51:50,356 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 150 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1195 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:51:50,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 0 Invalid, 2096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 847 Invalid, 0 Unknown, 1195 Unchecked, 0.7s Time] [2022-11-03 02:51:50,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2022-11-03 02:51:50,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2385. [2022-11-03 02:51:50,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2385 states, 2092 states have (on average 4.259560229445507) internal successors, (8911), 2384 states have internal predecessors, (8911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:50,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 2385 states and 8911 transitions. [2022-11-03 02:51:50,439 INFO L78 Accepts]: Start accepts. Automaton has 2385 states and 8911 transitions. Word has length 24 [2022-11-03 02:51:50,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:51:50,439 INFO L495 AbstractCegarLoop]: Abstraction has 2385 states and 8911 transitions. [2022-11-03 02:51:50,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:50,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states and 8911 transitions. [2022-11-03 02:51:50,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 02:51:50,440 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:51:50,440 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:51:50,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 02:51:50,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 02:51:50,667 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-11-03 02:51:50,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:51:50,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1348819179, now seen corresponding path program 1 times [2022-11-03 02:51:50,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:51:50,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710254512] [2022-11-03 02:51:50,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:51:50,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:51:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:51:52,141 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-03 02:51:52,142 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:51:52,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710254512] [2022-11-03 02:51:52,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710254512] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:51:52,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361550234] [2022-11-03 02:51:52,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:51:52,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:51:52,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:51:52,144 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:51:52,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 02:51:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:51:52,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-03 02:51:52,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:51:52,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:52,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:52,479 INFO L356 Elim1Store]: treesize reduction 43, result has 41.9 percent of original size [2022-11-03 02:51:52,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 36 [2022-11-03 02:51:52,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:51:52,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:52,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 02:51:52,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:52,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 02:51:52,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:52,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 02:51:52,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:52,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 02:51:52,891 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:51:52,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 02:51:52,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:53,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:53,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:53,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:53,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:53,171 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:51:53,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-03 02:51:53,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:53,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:53,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:53,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:53,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:53,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:53,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:53,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:53,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-03 02:51:53,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:51:53,546 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-03 02:51:53,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:51:53,696 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1270 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1270) c_~o_0~0.base) (+ c_~o_0~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) 2147483648)) is different from false [2022-11-03 02:51:53,702 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1270 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1270) c_~o_0~0.base) c_~o_0~0.offset) 2147483648)) is different from false [2022-11-03 02:51:53,712 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1269) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1270) c_~o_0~0.base) c_~o_0~0.offset) 2147483648)) is different from false [2022-11-03 02:51:53,719 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1268 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1268) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1269) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1270) c_~o_0~0.base) c_~o_0~0.offset) 2147483648)) is different from false [2022-11-03 02:51:54,578 INFO L356 Elim1Store]: treesize reduction 364, result has 14.4 percent of original size [2022-11-03 02:51:54,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 59 treesize of output 80 [2022-11-03 02:51:54,598 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:51:54,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 243 treesize of output 241 [2022-11-03 02:51:54,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 212 [2022-11-03 02:51:54,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 104 [2022-11-03 02:51:54,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 202 [2022-11-03 02:51:54,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 198 [2022-11-03 02:51:55,303 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 17 refuted. 3 times theorem prover too weak. 20 trivial. 5 not checked. [2022-11-03 02:51:55,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361550234] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:51:55,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [304556918] [2022-11-03 02:51:55,304 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:51:55,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:51:55,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 41 [2022-11-03 02:51:55,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413807709] [2022-11-03 02:51:55,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:51:55,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-03 02:51:55,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:51:55,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-03 02:51:55,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1258, Unknown=25, NotChecked=308, Total=1806 [2022-11-03 02:51:55,307 INFO L87 Difference]: Start difference. First operand 2385 states and 8911 transitions. Second operand has 43 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:55,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:51:55,994 INFO L93 Difference]: Finished difference Result 2736 states and 9613 transitions. [2022-11-03 02:51:55,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:51:55,995 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 02:51:55,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:51:56,008 INFO L225 Difference]: With dead ends: 2736 [2022-11-03 02:51:56,008 INFO L226 Difference]: Without dead ends: 2736 [2022-11-03 02:51:56,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=255, Invalid=1376, Unknown=25, NotChecked=324, Total=1980 [2022-11-03 02:51:56,010 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 170 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1001 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:51:56,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 0 Invalid, 1500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 470 Invalid, 0 Unknown, 1001 Unchecked, 0.5s Time] [2022-11-03 02:51:56,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2022-11-03 02:51:56,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 2204. [2022-11-03 02:51:56,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2204 states, 1911 states have (on average 4.064887493458922) internal successors, (7768), 2203 states have internal predecessors, (7768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:56,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2204 states to 2204 states and 7768 transitions. [2022-11-03 02:51:56,087 INFO L78 Accepts]: Start accepts. Automaton has 2204 states and 7768 transitions. Word has length 24 [2022-11-03 02:51:56,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:51:56,088 INFO L495 AbstractCegarLoop]: Abstraction has 2204 states and 7768 transitions. [2022-11-03 02:51:56,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:51:56,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2204 states and 7768 transitions. [2022-11-03 02:51:56,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 02:51:56,089 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:51:56,089 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:51:56,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 02:51:56,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 02:51:56,307 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-11-03 02:51:56,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:51:56,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1129819023, now seen corresponding path program 1 times [2022-11-03 02:51:56,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:51:56,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259239897] [2022-11-03 02:51:56,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:51:56,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:51:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:51:58,528 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:51:58,528 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:51:58,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259239897] [2022-11-03 02:51:58,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259239897] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:51:58,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217507035] [2022-11-03 02:51:58,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:51:58,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:51:58,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:51:58,530 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:51:58,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 02:51:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:51:58,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-03 02:51:58,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:51:58,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:58,895 INFO L356 Elim1Store]: treesize reduction 56, result has 37.8 percent of original size [2022-11-03 02:51:58,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 39 [2022-11-03 02:51:58,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:51:59,070 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 02:51:59,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-11-03 02:51:59,147 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 02:51:59,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-11-03 02:51:59,223 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 02:51:59,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-11-03 02:51:59,293 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:51:59,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 02:51:59,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:51:59,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:51:59,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:51:59,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:51:59,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:51:59,493 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:51:59,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-03 02:51:59,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:51:59,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:51:59,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:51:59,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:51:59,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:51:59,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:51:59,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:51:59,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-03 02:51:59,726 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-03 02:51:59,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:51:59,827 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1394 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1394) c_~o_0~0.base) (+ c_~o_0~0.offset 4)) 2147483648))) is different from false [2022-11-03 02:51:59,834 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (<= 0 (+ 2147483648 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1393) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1394) c_~o_0~0.base) (+ c_~o_0~0.offset 4))))) is different from false [2022-11-03 02:52:00,653 INFO L356 Elim1Store]: treesize reduction 203, result has 19.4 percent of original size [2022-11-03 02:52:00,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 69 [2022-11-03 02:52:00,675 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:52:00,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 153 [2022-11-03 02:52:00,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 122 [2022-11-03 02:52:00,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 114 [2022-11-03 02:52:00,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2022-11-03 02:52:01,199 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 21 refuted. 1 times theorem prover too weak. 20 trivial. 5 not checked. [2022-11-03 02:52:01,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217507035] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:52:01,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1848369020] [2022-11-03 02:52:01,200 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:52:01,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:52:01,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 40 [2022-11-03 02:52:01,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642714423] [2022-11-03 02:52:01,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:52:01,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-03 02:52:01,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:52:01,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-03 02:52:01,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1385, Unknown=16, NotChecked=154, Total=1722 [2022-11-03 02:52:01,203 INFO L87 Difference]: Start difference. First operand 2204 states and 7768 transitions. Second operand has 42 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:52:02,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:52:02,931 INFO L93 Difference]: Finished difference Result 2754 states and 10190 transitions. [2022-11-03 02:52:02,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 02:52:02,932 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 02:52:02,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:52:02,941 INFO L225 Difference]: With dead ends: 2754 [2022-11-03 02:52:02,941 INFO L226 Difference]: Without dead ends: 2754 [2022-11-03 02:52:02,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=339, Invalid=2203, Unknown=16, NotChecked=198, Total=2756 [2022-11-03 02:52:02,942 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 214 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 830 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:52:02,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 0 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 843 Invalid, 0 Unknown, 830 Unchecked, 0.8s Time] [2022-11-03 02:52:02,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2754 states. [2022-11-03 02:52:03,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2754 to 2387. [2022-11-03 02:52:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2387 states, 2094 states have (on average 4.4426934097421205) internal successors, (9303), 2386 states have internal predecessors, (9303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:52:03,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2387 states to 2387 states and 9303 transitions. [2022-11-03 02:52:03,024 INFO L78 Accepts]: Start accepts. Automaton has 2387 states and 9303 transitions. Word has length 25 [2022-11-03 02:52:03,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:52:03,024 INFO L495 AbstractCegarLoop]: Abstraction has 2387 states and 9303 transitions. [2022-11-03 02:52:03,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:52:03,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2387 states and 9303 transitions. [2022-11-03 02:52:03,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 02:52:03,025 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:52:03,025 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:52:03,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 02:52:03,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 02:52:03,239 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-11-03 02:52:03,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:52:03,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1129819025, now seen corresponding path program 1 times [2022-11-03 02:52:03,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:52:03,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687600150] [2022-11-03 02:52:03,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:52:03,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:52:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:52:05,362 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:52:05,362 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:52:05,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687600150] [2022-11-03 02:52:05,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687600150] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:52:05,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311813989] [2022-11-03 02:52:05,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:52:05,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:52:05,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:52:05,367 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:52:05,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 02:52:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:52:05,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-03 02:52:05,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:52:05,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:52:05,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:52:05,887 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 02:52:05,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-11-03 02:52:05,962 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 02:52:05,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-11-03 02:52:06,037 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 02:52:06,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-11-03 02:52:06,090 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:52:06,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-03 02:52:06,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:52:06,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:52:06,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:52:06,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:52:06,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:52:06,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:06,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:52:06,384 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-03 02:52:06,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:52:06,489 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1509 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1509) c_~o_2~0.base) (+ c_~o_2~0.offset 4)) 4294967296))) is different from false [2022-11-03 02:52:06,494 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1508 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1508) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1509) c_~o_2~0.base) (+ c_~o_2~0.offset 4)) 4294967296))) is different from false [2022-11-03 02:52:06,938 INFO L356 Elim1Store]: treesize reduction 203, result has 19.4 percent of original size [2022-11-03 02:52:06,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66 [2022-11-03 02:52:06,950 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:52:06,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 149 [2022-11-03 02:52:06,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2022-11-03 02:52:06,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 110 [2022-11-03 02:52:07,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 02:52:07,253 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 16 refuted. 1 times theorem prover too weak. 25 trivial. 5 not checked. [2022-11-03 02:52:07,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311813989] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:52:07,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [553187302] [2022-11-03 02:52:07,253 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:52:07,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:52:07,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 41 [2022-11-03 02:52:07,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782628561] [2022-11-03 02:52:07,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:52:07,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-03 02:52:07,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:52:07,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-03 02:52:07,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1475, Unknown=9, NotChecked=158, Total=1806 [2022-11-03 02:52:07,256 INFO L87 Difference]: Start difference. First operand 2387 states and 9303 transitions. Second operand has 43 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:52:10,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:52:10,471 INFO L93 Difference]: Finished difference Result 3317 states and 11552 transitions. [2022-11-03 02:52:10,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-03 02:52:10,471 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 02:52:10,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:52:10,481 INFO L225 Difference]: With dead ends: 3317 [2022-11-03 02:52:10,481 INFO L226 Difference]: Without dead ends: 3317 [2022-11-03 02:52:10,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=618, Invalid=4073, Unknown=9, NotChecked=270, Total=4970 [2022-11-03 02:52:10,483 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 289 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 643 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:52:10,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 0 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 939 Invalid, 0 Unknown, 643 Unchecked, 0.8s Time] [2022-11-03 02:52:10,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-11-03 02:52:10,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 2387. [2022-11-03 02:52:10,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2387 states, 2094 states have (on average 4.442215854823305) internal successors, (9302), 2386 states have internal predecessors, (9302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:52:10,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2387 states to 2387 states and 9302 transitions. [2022-11-03 02:52:10,556 INFO L78 Accepts]: Start accepts. Automaton has 2387 states and 9302 transitions. Word has length 25 [2022-11-03 02:52:10,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:52:10,556 INFO L495 AbstractCegarLoop]: Abstraction has 2387 states and 9302 transitions. [2022-11-03 02:52:10,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:52:10,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2387 states and 9302 transitions. [2022-11-03 02:52:10,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 02:52:10,557 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:52:10,557 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:52:10,581 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-03 02:52:10,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 02:52:10,763 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-11-03 02:52:10,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:52:10,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1129818946, now seen corresponding path program 1 times [2022-11-03 02:52:10,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:52:10,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756039273] [2022-11-03 02:52:10,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:52:10,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:52:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:52:12,578 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:52:12,578 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:52:12,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756039273] [2022-11-03 02:52:12,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756039273] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:52:12,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803373399] [2022-11-03 02:52:12,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:52:12,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:52:12,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:52:12,580 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:52:12,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 02:52:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:52:12,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-03 02:52:12,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:52:12,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:52:12,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:52:13,022 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 02:52:13,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 02:52:13,081 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 02:52:13,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 02:52:13,144 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 02:52:13,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 02:52:13,198 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:52:13,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-03 02:52:13,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:52:13,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:52:13,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:52:13,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:52:13,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:52:13,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:13,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:52:13,497 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-03 02:52:13,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:52:13,638 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1624 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1624) c_~o_2~0.base) (+ c_~o_2~0.offset 4)) 9223372039002259456)) is different from false [2022-11-03 02:52:13,645 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1623 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1624) c_~o_2~0.base) (+ c_~o_2~0.offset 4)) 9223372039002259456)) is different from false [2022-11-03 02:52:14,129 INFO L356 Elim1Store]: treesize reduction 203, result has 19.4 percent of original size [2022-11-03 02:52:14,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 64 [2022-11-03 02:52:14,146 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:52:14,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 131 [2022-11-03 02:52:14,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-11-03 02:52:14,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 94 [2022-11-03 02:52:14,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-03 02:52:14,457 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 16 refuted. 1 times theorem prover too weak. 25 trivial. 5 not checked. [2022-11-03 02:52:14,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803373399] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:52:14,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1669444478] [2022-11-03 02:52:14,458 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:52:14,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:52:14,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 41 [2022-11-03 02:52:14,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772805022] [2022-11-03 02:52:14,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:52:14,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-03 02:52:14,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:52:14,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-03 02:52:14,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1474, Unknown=9, NotChecked=158, Total=1806 [2022-11-03 02:52:14,462 INFO L87 Difference]: Start difference. First operand 2387 states and 9302 transitions. Second operand has 43 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:52:16,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:52:16,413 INFO L93 Difference]: Finished difference Result 3295 states and 11509 transitions. [2022-11-03 02:52:16,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 02:52:16,413 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 02:52:16,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:52:16,424 INFO L225 Difference]: With dead ends: 3295 [2022-11-03 02:52:16,424 INFO L226 Difference]: Without dead ends: 3295 [2022-11-03 02:52:16,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=345, Invalid=2733, Unknown=10, NotChecked=218, Total=3306 [2022-11-03 02:52:16,425 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 55 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 586 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:52:16,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 0 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1157 Invalid, 0 Unknown, 586 Unchecked, 1.0s Time] [2022-11-03 02:52:16,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3295 states. [2022-11-03 02:52:16,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3295 to 2387. [2022-11-03 02:52:16,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2387 states, 2094 states have (on average 4.441738299904489) internal successors, (9301), 2386 states have internal predecessors, (9301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:52:16,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2387 states to 2387 states and 9301 transitions. [2022-11-03 02:52:16,531 INFO L78 Accepts]: Start accepts. Automaton has 2387 states and 9301 transitions. Word has length 25 [2022-11-03 02:52:16,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:52:16,532 INFO L495 AbstractCegarLoop]: Abstraction has 2387 states and 9301 transitions. [2022-11-03 02:52:16,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:52:16,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2387 states and 9301 transitions. [2022-11-03 02:52:16,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 02:52:16,533 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:52:16,533 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:52:16,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-03 02:52:16,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 02:52:16,755 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-11-03 02:52:16,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:52:16,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1129819029, now seen corresponding path program 1 times [2022-11-03 02:52:16,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:52:16,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969361165] [2022-11-03 02:52:16,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:52:16,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:52:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:52:18,827 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:52:18,828 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:52:18,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969361165] [2022-11-03 02:52:18,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969361165] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:52:18,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331337364] [2022-11-03 02:52:18,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:52:18,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:52:18,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:52:18,832 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:52:18,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-03 02:52:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:52:19,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-03 02:52:19,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:52:19,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:19,124 INFO L356 Elim1Store]: treesize reduction 56, result has 37.8 percent of original size [2022-11-03 02:52:19,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 39 [2022-11-03 02:52:19,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:52:19,278 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 02:52:19,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 02:52:19,347 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 02:52:19,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 02:52:19,413 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 02:52:19,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 02:52:19,480 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:52:19,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 02:52:19,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:52:19,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:52:19,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:52:19,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:52:19,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:52:19,652 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:52:19,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-03 02:52:19,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:52:19,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:52:19,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:52:19,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:52:19,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:52:19,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:19,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:52:19,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 02:52:19,945 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-03 02:52:19,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:52:20,145 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1748 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1748) c_~o_0~0.base) (+ c_~o_0~0.offset 4)) 2147483647)) is different from false [2022-11-03 02:52:20,152 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1748 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1747) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1748) c_~o_0~0.base) (+ c_~o_0~0.offset 4)) 2147483647)) is different from false [2022-11-03 02:52:20,888 INFO L356 Elim1Store]: treesize reduction 203, result has 19.4 percent of original size [2022-11-03 02:52:20,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2022-11-03 02:52:20,908 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:52:20,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 267 [2022-11-03 02:52:20,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 222 [2022-11-03 02:52:20,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 206 [2022-11-03 02:52:20,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 99 [2022-11-03 02:52:21,471 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 21 refuted. 1 times theorem prover too weak. 20 trivial. 5 not checked. [2022-11-03 02:52:21,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331337364] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:52:21,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1355717664] [2022-11-03 02:52:21,472 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:52:21,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:52:21,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 43 [2022-11-03 02:52:21,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427941624] [2022-11-03 02:52:21,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:52:21,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-03 02:52:21,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:52:21,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-03 02:52:21,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1634, Unknown=12, NotChecked=166, Total=1980 [2022-11-03 02:52:21,475 INFO L87 Difference]: Start difference. First operand 2387 states and 9301 transitions. Second operand has 45 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:52:23,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:52:23,409 INFO L93 Difference]: Finished difference Result 2751 states and 10003 transitions. [2022-11-03 02:52:23,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 02:52:23,409 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 02:52:23,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:52:23,418 INFO L225 Difference]: With dead ends: 2751 [2022-11-03 02:52:23,418 INFO L226 Difference]: Without dead ends: 2751 [2022-11-03 02:52:23,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=362, Invalid=2604, Unknown=12, NotChecked=214, Total=3192 [2022-11-03 02:52:23,419 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 129 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 506 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:52:23,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 0 Invalid, 1745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1172 Invalid, 0 Unknown, 506 Unchecked, 0.9s Time] [2022-11-03 02:52:23,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2751 states. [2022-11-03 02:52:23,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2751 to 2387. [2022-11-03 02:52:23,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2387 states, 2094 states have (on average 4.354823304680038) internal successors, (9119), 2386 states have internal predecessors, (9119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:52:23,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2387 states to 2387 states and 9119 transitions. [2022-11-03 02:52:23,493 INFO L78 Accepts]: Start accepts. Automaton has 2387 states and 9119 transitions. Word has length 25 [2022-11-03 02:52:23,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:52:23,493 INFO L495 AbstractCegarLoop]: Abstraction has 2387 states and 9119 transitions. [2022-11-03 02:52:23,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:52:23,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2387 states and 9119 transitions. [2022-11-03 02:52:23,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 02:52:23,494 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:52:23,494 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:52:23,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-03 02:52:23,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:52:23,711 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-11-03 02:52:23,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:52:23,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1045906187, now seen corresponding path program 1 times [2022-11-03 02:52:23,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:52:23,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874202143] [2022-11-03 02:52:23,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:52:23,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:52:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:52:23,834 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-03 02:52:23,834 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:52:23,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874202143] [2022-11-03 02:52:23,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874202143] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:52:23,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:52:23,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:52:23,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457588330] [2022-11-03 02:52:23,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:52:23,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:52:23,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:52:23,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:52:23,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:52:23,837 INFO L87 Difference]: Start difference. First operand 2387 states and 9119 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:52:24,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:52:24,048 INFO L93 Difference]: Finished difference Result 4028 states and 15448 transitions. [2022-11-03 02:52:24,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:52:24,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 02:52:24,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:52:24,069 INFO L225 Difference]: With dead ends: 4028 [2022-11-03 02:52:24,069 INFO L226 Difference]: Without dead ends: 4028 [2022-11-03 02:52:24,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:52:24,071 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:52:24,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:52:24,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4028 states. [2022-11-03 02:52:24,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4028 to 2853. [2022-11-03 02:52:24,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 2560 states have (on average 4.7203125) internal successors, (12084), 2852 states have internal predecessors, (12084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:52:24,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 12084 transitions. [2022-11-03 02:52:24,185 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 12084 transitions. Word has length 25 [2022-11-03 02:52:24,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:52:24,185 INFO L495 AbstractCegarLoop]: Abstraction has 2853 states and 12084 transitions. [2022-11-03 02:52:24,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:52:24,185 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 12084 transitions. [2022-11-03 02:52:24,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 02:52:24,187 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:52:24,188 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:52:24,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-03 02:52:24,188 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 54 more)] === [2022-11-03 02:52:24,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:52:24,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1045906160, now seen corresponding path program 1 times [2022-11-03 02:52:24,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:52:24,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937829992] [2022-11-03 02:52:24,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:52:24,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:52:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:52:25,831 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-03 02:52:25,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:52:25,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937829992] [2022-11-03 02:52:25,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937829992] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:52:25,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772207312] [2022-11-03 02:52:25,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:52:25,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:52:25,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:52:25,833 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:52:25,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2941fcc-c1e5-4737-82aa-107e140b30db/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-03 02:52:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:52:26,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-03 02:52:26,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:52:26,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:26,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:26,190 INFO L356 Elim1Store]: treesize reduction 43, result has 41.9 percent of original size [2022-11-03 02:52:26,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 36 [2022-11-03 02:52:26,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:52:26,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:26,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 02:52:26,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:26,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 02:52:26,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:26,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 02:52:26,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:26,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 02:52:26,605 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 02:52:26,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-03 02:52:26,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:52:26,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:52:26,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:52:26,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:52:26,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:52:26,822 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:52:26,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-03 02:52:26,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:52:26,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:52:26,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:52:26,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:52:26,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:52:27,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:27,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:52:27,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:52:27,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:52:27,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-03 02:52:27,187 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-03 02:52:27,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:52:27,280 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1931 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1931) c_~o_0~0.base) c_~o_0~0.offset)))) is different from false [2022-11-03 02:52:27,289 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1930 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1930) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1931) c_~o_0~0.base) c_~o_0~0.offset)))) is different from false [2022-11-03 02:52:27,296 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_1929) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1930) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1931) c_~o_0~0.base) c_~o_0~0.offset)))) is different from false [2022-11-03 02:52:28,130 INFO L356 Elim1Store]: treesize reduction 364, result has 14.4 percent of original size [2022-11-03 02:52:28,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 82 [2022-11-03 02:52:28,165 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:52:28,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35075 treesize of output 34565 [2022-11-03 02:52:28,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34550 treesize of output 33526 [2022-11-03 02:52:28,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33526 treesize of output 33270 [2022-11-03 02:52:28,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33270 treesize of output 31222 [2022-11-03 02:52:28,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31222 treesize of output 30710