./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/weaver/popl20-min-max-inc.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/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_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-min-max-inc.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/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_8c2257b7-d39a-486f-a295-b54a208b0479/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 24c46cfa0dbb54d68ea1c1d9e6e82d14a582b1d00782b6decedd8126f489ee67 --- 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 03:59:37,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:59:37,970 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:59:38,036 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:59:38,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:59:38,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:59:38,044 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:59:38,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:59:38,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:59:38,056 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:59:38,057 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:59:38,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:59:38,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:59:38,064 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:59:38,066 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:59:38,067 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:59:38,068 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:59:38,069 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:59:38,070 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:59:38,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:59:38,074 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:59:38,075 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:59:38,076 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:59:38,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:59:38,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:59:38,081 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:59:38,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:59:38,082 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:59:38,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:59:38,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:59:38,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:59:38,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:59:38,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:59:38,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:59:38,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:59:38,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:59:38,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:59:38,090 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:59:38,090 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:59:38,091 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:59:38,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:59:38,094 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-03 03:59:38,129 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:59:38,129 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:59:38,130 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:59:38,130 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:59:38,138 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:59:38,138 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:59:38,139 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:59:38,139 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:59:38,139 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:59:38,139 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:59:38,140 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:59:38,141 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:59:38,141 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:59:38,141 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:59:38,141 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:59:38,141 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:59:38,142 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:59:38,142 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:59:38,143 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:59:38,143 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:59:38,143 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 03:59:38,143 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:59:38,143 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:59:38,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:59:38,146 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:59:38,146 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:59:38,146 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:59:38,146 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-03 03:59:38,146 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:59:38,147 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:59:38,147 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:59:38,147 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:59:38,147 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:59:38,148 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:59:38,148 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:59:38,148 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:59:38,148 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:59:38,149 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:59:38,149 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:59:38,149 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:59:38,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:59:38,149 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:59:38,149 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:59:38,150 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_8c2257b7-d39a-486f-a295-b54a208b0479/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_8c2257b7-d39a-486f-a295-b54a208b0479/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 -> 24c46cfa0dbb54d68ea1c1d9e6e82d14a582b1d00782b6decedd8126f489ee67 [2022-11-03 03:59:38,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:59:38,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:59:38,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:59:38,523 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:59:38,524 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:59:38,525 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/weaver/popl20-min-max-inc.wvr.c [2022-11-03 03:59:38,624 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/data/f8c18684e/fd6d897088b64036a16fd11d9bade212/FLAG08dd780d8 [2022-11-03 03:59:39,242 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:59:39,243 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/sv-benchmarks/c/weaver/popl20-min-max-inc.wvr.c [2022-11-03 03:59:39,253 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/data/f8c18684e/fd6d897088b64036a16fd11d9bade212/FLAG08dd780d8 [2022-11-03 03:59:39,563 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/data/f8c18684e/fd6d897088b64036a16fd11d9bade212 [2022-11-03 03:59:39,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:59:39,567 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:59:39,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:59:39,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:59:39,573 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:59:39,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:59:39" (1/1) ... [2022-11-03 03:59:39,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9a11be2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:59:39, skipping insertion in model container [2022-11-03 03:59:39,576 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:59:39" (1/1) ... [2022-11-03 03:59:39,583 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:59:39,602 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:59:39,828 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_8c2257b7-d39a-486f-a295-b54a208b0479/sv-benchmarks/c/weaver/popl20-min-max-inc.wvr.c[3018,3031] [2022-11-03 03:59:39,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:59:39,845 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:59:39,877 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_8c2257b7-d39a-486f-a295-b54a208b0479/sv-benchmarks/c/weaver/popl20-min-max-inc.wvr.c[3018,3031] [2022-11-03 03:59:39,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:59:39,898 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:59:39,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:59:39 WrapperNode [2022-11-03 03:59:39,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:59:39,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:59:39,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:59:39,901 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:59:39,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:59:39" (1/1) ... [2022-11-03 03:59:39,919 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:59:39" (1/1) ... [2022-11-03 03:59:39,945 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2022-11-03 03:59:39,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:59:39,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:59:39,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:59:39,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:59:39,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:59:39" (1/1) ... [2022-11-03 03:59:39,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:59:39" (1/1) ... [2022-11-03 03:59:39,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:59:39" (1/1) ... [2022-11-03 03:59:39,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:59:39" (1/1) ... [2022-11-03 03:59:39,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:59:39" (1/1) ... [2022-11-03 03:59:39,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:59:39" (1/1) ... [2022-11-03 03:59:39,978 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:59:39" (1/1) ... [2022-11-03 03:59:39,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:59:39" (1/1) ... [2022-11-03 03:59:39,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:59:39,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:59:39,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:59:39,983 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:59:39,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:59:39" (1/1) ... [2022-11-03 03:59:39,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:59:40,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:59:40,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:59:40,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:59:40,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:59:40,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 03:59:40,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 03:59:40,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 03:59:40,093 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-03 03:59:40,093 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-03 03:59:40,093 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-03 03:59:40,093 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-03 03:59:40,093 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-03 03:59:40,093 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-03 03:59:40,094 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-03 03:59:40,094 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-03 03:59:40,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:59:40,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-03 03:59:40,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-03 03:59:40,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 03:59:40,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:59:40,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:59:40,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 03:59:40,097 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 03:59:40,231 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:59:40,233 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:59:40,749 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:59:40,942 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:59:40,943 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-03 03:59:40,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:59:40 BoogieIcfgContainer [2022-11-03 03:59:40,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:59:40,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:59:40,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:59:40,953 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:59:40,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:59:39" (1/3) ... [2022-11-03 03:59:40,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@441bfcfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:59:40, skipping insertion in model container [2022-11-03 03:59:40,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:59:39" (2/3) ... [2022-11-03 03:59:40,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@441bfcfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:59:40, skipping insertion in model container [2022-11-03 03:59:40,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:59:40" (3/3) ... [2022-11-03 03:59:40,956 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-inc.wvr.c [2022-11-03 03:59:40,966 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 03:59:40,978 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:59:40,978 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-03 03:59:40,978 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 03:59:41,088 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-03 03:59:41,143 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 03:59:41,160 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 191 transitions, 414 flow [2022-11-03 03:59:41,163 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 192 places, 191 transitions, 414 flow [2022-11-03 03:59:41,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 191 transitions, 414 flow [2022-11-03 03:59:41,257 INFO L130 PetriNetUnfolder]: 12/187 cut-off events. [2022-11-03 03:59:41,258 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-03 03:59:41,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 187 events. 12/187 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 207 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 152. Up to 2 conditions per place. [2022-11-03 03:59:41,270 INFO L118 LiptonReduction]: Number of co-enabled transitions 3864 [2022-11-03 03:59:53,208 INFO L133 LiptonReduction]: Checked pairs total: 6749 [2022-11-03 03:59:53,209 INFO L135 LiptonReduction]: Total number of compositions: 193 [2022-11-03 03:59:53,218 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 47 transitions, 126 flow [2022-11-03 03:59:53,465 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3001 states, 2865 states have (on average 4.269109947643979) internal successors, (12231), 3000 states have internal predecessors, (12231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:59:53,490 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:59:53,499 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;@5075b2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:59:53,500 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-11-03 03:59:53,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 3001 states, 2865 states have (on average 4.269109947643979) internal successors, (12231), 3000 states have internal predecessors, (12231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:59:53,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-03 03:59:53,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:59:53,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-03 03:59:53,554 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-11-03 03:59:53,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:59:53,563 INFO L85 PathProgramCache]: Analyzing trace with hash 26502, now seen corresponding path program 1 times [2022-11-03 03:59:53,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:59:53,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395356137] [2022-11-03 03:59:53,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:53,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:59:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:53,993 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 03:59:53,993 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:59:53,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395356137] [2022-11-03 03:59:53,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395356137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:59:53,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:59:53,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:59:53,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837988491] [2022-11-03 03:59:53,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:59:54,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:59:54,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:59:54,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:59:54,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:59:54,049 INFO L87 Difference]: Start difference. First operand has 3001 states, 2865 states have (on average 4.269109947643979) internal successors, (12231), 3000 states have internal predecessors, (12231), 0 states have call successors, (0), 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 03:59:54,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:59:54,255 INFO L93 Difference]: Finished difference Result 2066 states and 8244 transitions. [2022-11-03 03:59:54,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:59:54,257 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 03:59:54,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:59:54,310 INFO L225 Difference]: With dead ends: 2066 [2022-11-03 03:59:54,310 INFO L226 Difference]: Without dead ends: 2066 [2022-11-03 03:59:54,311 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 03:59:54,316 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:59:54,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:59:54,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2022-11-03 03:59:54,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 2066. [2022-11-03 03:59:54,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2066 states, 1994 states have (on average 4.1344032096288865) internal successors, (8244), 2065 states have internal predecessors, (8244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:59:54,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 2066 states and 8244 transitions. [2022-11-03 03:59:54,535 INFO L78 Accepts]: Start accepts. Automaton has 2066 states and 8244 transitions. Word has length 2 [2022-11-03 03:59:54,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:59:54,535 INFO L495 AbstractCegarLoop]: Abstraction has 2066 states and 8244 transitions. [2022-11-03 03:59:54,536 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 03:59:54,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 8244 transitions. [2022-11-03 03:59:54,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-03 03:59:54,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:59:54,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-03 03:59:54,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:59:54,538 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-11-03 03:59:54,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:59:54,544 INFO L85 PathProgramCache]: Analyzing trace with hash 26503, now seen corresponding path program 1 times [2022-11-03 03:59:54,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:59:54,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517508691] [2022-11-03 03:59:54,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:54,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:59:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:54,664 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 03:59:54,664 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:59:54,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517508691] [2022-11-03 03:59:54,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517508691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:59:54,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:59:54,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:59:54,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443077306] [2022-11-03 03:59:54,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:59:54,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:59:54,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:59:54,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:59:54,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:59:54,668 INFO L87 Difference]: Start difference. First operand 2066 states and 8244 transitions. 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 03:59:54,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:59:54,837 INFO L93 Difference]: Finished difference Result 4130 states and 16486 transitions. [2022-11-03 03:59:54,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:59:54,838 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 03:59:54,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:59:54,870 INFO L225 Difference]: With dead ends: 4130 [2022-11-03 03:59:54,870 INFO L226 Difference]: Without dead ends: 4130 [2022-11-03 03:59:54,871 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 03:59:54,873 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 35 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:59:54,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 2 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:59:54,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4130 states. [2022-11-03 03:59:55,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4130 to 2067. [2022-11-03 03:59:55,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2067 states, 1995 states have (on average 4.133333333333334) internal successors, (8246), 2066 states have internal predecessors, (8246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:59:55,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 8246 transitions. [2022-11-03 03:59:55,076 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 8246 transitions. Word has length 2 [2022-11-03 03:59:55,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:59:55,077 INFO L495 AbstractCegarLoop]: Abstraction has 2067 states and 8246 transitions. [2022-11-03 03:59:55,077 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 03:59:55,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 8246 transitions. [2022-11-03 03:59:55,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 03:59:55,078 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:59:55,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 03:59:55,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 03:59:55,078 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-11-03 03:59:55,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:59:55,079 INFO L85 PathProgramCache]: Analyzing trace with hash 822397, now seen corresponding path program 1 times [2022-11-03 03:59:55,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:59:55,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595133341] [2022-11-03 03:59:55,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:55,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:59:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:55,251 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 03:59:55,251 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:59:55,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595133341] [2022-11-03 03:59:55,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595133341] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:59:55,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775152642] [2022-11-03 03:59:55,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:55,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:55,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:59:55,259 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:59:55,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 03:59:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:55,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 03:59:55,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:59:55,447 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 03:59:55,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:59:55,468 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 03:59:55,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775152642] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:59:55,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1339261980] [2022-11-03 03:59:55,478 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 03:59:55,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:59:55,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2022-11-03 03:59:55,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942346554] [2022-11-03 03:59:55,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:59:55,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 03:59:55,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:59:55,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 03:59:55,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 03:59:55,500 INFO L87 Difference]: Start difference. First operand 2067 states and 8246 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 03:59:56,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:59:56,040 INFO L93 Difference]: Finished difference Result 10322 states and 41212 transitions. [2022-11-03 03:59:56,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:59:56,041 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 03:59:56,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:59:56,153 INFO L225 Difference]: With dead ends: 10322 [2022-11-03 03:59:56,153 INFO L226 Difference]: Without dead ends: 10322 [2022-11-03 03:59:56,153 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 03:59:56,157 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 245 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:59:56,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 5 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:59:56,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10322 states. [2022-11-03 03:59:56,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10322 to 2070. [2022-11-03 03:59:56,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2070 states, 1998 states have (on average 4.13013013013013) internal successors, (8252), 2069 states have internal predecessors, (8252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:59:56,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 8252 transitions. [2022-11-03 03:59:56,467 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 8252 transitions. Word has length 3 [2022-11-03 03:59:56,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:59:56,467 INFO L495 AbstractCegarLoop]: Abstraction has 2070 states and 8252 transitions. [2022-11-03 03:59:56,468 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 03:59:56,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 8252 transitions. [2022-11-03 03:59:56,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 03:59:56,469 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:59:56,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 03:59:56,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 03:59:56,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:56,695 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-11-03 03:59:56,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:59:56,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1279987255, now seen corresponding path program 1 times [2022-11-03 03:59:56,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:59:56,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983637868] [2022-11-03 03:59:56,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:56,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:59:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:56,769 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 03:59:56,770 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:59:56,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983637868] [2022-11-03 03:59:56,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983637868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:59:56,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:59:56,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:59:56,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831516321] [2022-11-03 03:59:56,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:59:56,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:59:56,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:59:56,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:59:56,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:59:56,772 INFO L87 Difference]: Start difference. First operand 2070 states and 8252 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:59:56,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:59:56,937 INFO L93 Difference]: Finished difference Result 2924 states and 11579 transitions. [2022-11-03 03:59:56,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:59:56,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-03 03:59:56,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:59:56,958 INFO L225 Difference]: With dead ends: 2924 [2022-11-03 03:59:56,958 INFO L226 Difference]: Without dead ends: 2924 [2022-11-03 03:59:56,958 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 03:59:56,959 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 28 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:59:56,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 3 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:59:56,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2022-11-03 03:59:57,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 2372. [2022-11-03 03:59:57,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2372 states, 2300 states have (on average 4.252173913043478) internal successors, (9780), 2371 states have internal predecessors, (9780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:59:57,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 2372 states and 9780 transitions. [2022-11-03 03:59:57,221 INFO L78 Accepts]: Start accepts. Automaton has 2372 states and 9780 transitions. Word has length 6 [2022-11-03 03:59:57,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:59:57,221 INFO L495 AbstractCegarLoop]: Abstraction has 2372 states and 9780 transitions. [2022-11-03 03:59:57,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:59:57,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2372 states and 9780 transitions. [2022-11-03 03:59:57,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 03:59:57,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:59:57,222 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1] [2022-11-03 03:59:57,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 03:59:57,223 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-11-03 03:59:57,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:59:57,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1268976377, now seen corresponding path program 2 times [2022-11-03 03:59:57,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:59:57,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697765872] [2022-11-03 03:59:57,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:57,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:59:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:57,459 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 03:59:57,460 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:59:57,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697765872] [2022-11-03 03:59:57,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697765872] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:59:57,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019246629] [2022-11-03 03:59:57,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:59:57,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:57,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:59:57,462 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:59:57,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 03:59:57,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 03:59:57,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:59:57,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 03:59:57,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:59:57,607 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 03:59:57,607 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:59:57,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019246629] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:59:57,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:59:57,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2022-11-03 03:59:57,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873548152] [2022-11-03 03:59:57,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:59:57,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:59:57,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:59:57,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:59:57,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:59:57,610 INFO L87 Difference]: Start difference. First operand 2372 states and 9780 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 03:59:57,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:59:57,712 INFO L93 Difference]: Finished difference Result 2371 states and 9779 transitions. [2022-11-03 03:59:57,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:59:57,712 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 03:59:57,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:59:57,731 INFO L225 Difference]: With dead ends: 2371 [2022-11-03 03:59:57,731 INFO L226 Difference]: Without dead ends: 2371 [2022-11-03 03:59:57,732 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 03:59:57,732 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:59:57,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:59:57,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2371 states. [2022-11-03 03:59:57,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 2367. [2022-11-03 03:59:57,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2367 states, 2296 states have (on average 4.255662020905923) internal successors, (9771), 2366 states have internal predecessors, (9771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:59:57,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 9771 transitions. [2022-11-03 03:59:57,856 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 9771 transitions. Word has length 6 [2022-11-03 03:59:57,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:59:57,856 INFO L495 AbstractCegarLoop]: Abstraction has 2367 states and 9771 transitions. [2022-11-03 03:59:57,856 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 03:59:57,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 9771 transitions. [2022-11-03 03:59:57,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 03:59:57,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:59:57,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:59:57,897 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-03 03:59:58,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:58,067 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-11-03 03:59:58,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:59:58,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1024897836, now seen corresponding path program 1 times [2022-11-03 03:59:58,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:59:58,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873862513] [2022-11-03 03:59:58,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:58,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:59:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:58,161 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 03:59:58,161 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:59:58,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873862513] [2022-11-03 03:59:58,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873862513] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:59:58,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546282100] [2022-11-03 03:59:58,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:58,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:58,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:59:58,164 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:59:58,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 03:59:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:58,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 03:59:58,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:59:58,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:59:58,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 03:59:58,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546282100] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:59:58,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 03:59:58,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2022-11-03 03:59:58,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778156842] [2022-11-03 03:59:58,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:59:58,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:59:58,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:59:58,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:59:58,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:59:58,323 INFO L87 Difference]: Start difference. First operand 2367 states and 9771 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:59:58,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:59:58,429 INFO L93 Difference]: Finished difference Result 2368 states and 9772 transitions. [2022-11-03 03:59:58,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:59:58,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-03 03:59:58,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:59:58,445 INFO L225 Difference]: With dead ends: 2368 [2022-11-03 03:59:58,445 INFO L226 Difference]: Without dead ends: 2368 [2022-11-03 03:59:58,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:59:58,449 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:59:58,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:59:58,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2022-11-03 03:59:58,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2368. [2022-11-03 03:59:58,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2368 states, 2297 states have (on average 4.2542446669569) internal successors, (9772), 2367 states have internal predecessors, (9772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:59:58,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 9772 transitions. [2022-11-03 03:59:58,540 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 9772 transitions. Word has length 7 [2022-11-03 03:59:58,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:59:58,540 INFO L495 AbstractCegarLoop]: Abstraction has 2368 states and 9772 transitions. [2022-11-03 03:59:58,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:59:58,541 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 9772 transitions. [2022-11-03 03:59:58,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:59:58,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:59:58,542 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:59:58,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 03:59:58,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-03 03:59:58,767 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-11-03 03:59:58,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:59:58,768 INFO L85 PathProgramCache]: Analyzing trace with hash -56897122, now seen corresponding path program 1 times [2022-11-03 03:59:58,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:59:58,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852103797] [2022-11-03 03:59:58,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:58,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:59:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:58,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 03:59:58,850 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:59:58,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852103797] [2022-11-03 03:59:58,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852103797] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:59:58,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710040333] [2022-11-03 03:59:58,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:58,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:58,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:59:58,853 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:59:58,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 03:59:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:59,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 03:59:59,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:59:59,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:59:59,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:59:59,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:59:59,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710040333] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:59:59,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1392339349] [2022-11-03 03:59:59,192 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 03:59:59,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:59:59,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 12 [2022-11-03 03:59:59,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361990300] [2022-11-03 03:59:59,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:59:59,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 03:59:59,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:59:59,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 03:59:59,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-11-03 03:59:59,200 INFO L87 Difference]: Start difference. First operand 2368 states and 9772 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:00,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:00,022 INFO L93 Difference]: Finished difference Result 5404 states and 21019 transitions. [2022-11-03 04:00:00,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 04:00:00,023 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 04:00:00,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:00,091 INFO L225 Difference]: With dead ends: 5404 [2022-11-03 04:00:00,092 INFO L226 Difference]: Without dead ends: 5396 [2022-11-03 04:00:00,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2022-11-03 04:00:00,094 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 561 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:00,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 27 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 04:00:00,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5396 states. [2022-11-03 04:00:00,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5396 to 3874. [2022-11-03 04:00:00,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3874 states, 3803 states have (on average 4.358401262161451) internal successors, (16575), 3873 states have internal predecessors, (16575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:00,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3874 states to 3874 states and 16575 transitions. [2022-11-03 04:00:00,322 INFO L78 Accepts]: Start accepts. Automaton has 3874 states and 16575 transitions. Word has length 8 [2022-11-03 04:00:00,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:00,323 INFO L495 AbstractCegarLoop]: Abstraction has 3874 states and 16575 transitions. [2022-11-03 04:00:00,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:00,323 INFO L276 IsEmpty]: Start isEmpty. Operand 3874 states and 16575 transitions. [2022-11-03 04:00:00,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 04:00:00,325 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:00,325 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:00,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:00,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:00,551 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-11-03 04:00:00,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:00,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1570856283, now seen corresponding path program 1 times [2022-11-03 04:00:00,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:00,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423690668] [2022-11-03 04:00:00,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:00,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:00,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:00:00,630 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:00,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423690668] [2022-11-03 04:00:00,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423690668] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:00,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:00:00,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 04:00:00,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623866878] [2022-11-03 04:00:00,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:00,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:00:00,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:00,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:00:00,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:00:00,633 INFO L87 Difference]: Start difference. First operand 3874 states and 16575 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:00,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:00,806 INFO L93 Difference]: Finished difference Result 5236 states and 22400 transitions. [2022-11-03 04:00:00,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:00:00,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-03 04:00:00,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:00,846 INFO L225 Difference]: With dead ends: 5236 [2022-11-03 04:00:00,847 INFO L226 Difference]: Without dead ends: 5236 [2022-11-03 04:00:00,847 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 04:00:00,848 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 26 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:00,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:00:00,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5236 states. [2022-11-03 04:00:01,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5236 to 4564. [2022-11-03 04:00:01,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4564 states, 4493 states have (on average 4.487202314711774) internal successors, (20161), 4563 states have internal predecessors, (20161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4564 states to 4564 states and 20161 transitions. [2022-11-03 04:00:01,110 INFO L78 Accepts]: Start accepts. Automaton has 4564 states and 20161 transitions. Word has length 9 [2022-11-03 04:00:01,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:01,111 INFO L495 AbstractCegarLoop]: Abstraction has 4564 states and 20161 transitions. [2022-11-03 04:00:01,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:01,111 INFO L276 IsEmpty]: Start isEmpty. Operand 4564 states and 20161 transitions. [2022-11-03 04:00:01,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 04:00:01,112 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:01,112 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:01,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 04:00:01,113 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-11-03 04:00:01,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:01,113 INFO L85 PathProgramCache]: Analyzing trace with hash -113646059, now seen corresponding path program 1 times [2022-11-03 04:00:01,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:01,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220400689] [2022-11-03 04:00:01,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:01,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:01,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 04:00:01,165 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:01,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220400689] [2022-11-03 04:00:01,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220400689] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:01,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:00:01,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 04:00:01,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326760290] [2022-11-03 04:00:01,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:01,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:00:01,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:01,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:00:01,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:00:01,168 INFO L87 Difference]: Start difference. First operand 4564 states and 20161 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:01,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:01,311 INFO L93 Difference]: Finished difference Result 4212 states and 18327 transitions. [2022-11-03 04:00:01,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:00:01,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-03 04:00:01,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:01,338 INFO L225 Difference]: With dead ends: 4212 [2022-11-03 04:00:01,339 INFO L226 Difference]: Without dead ends: 4212 [2022-11-03 04:00: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 04:00:01,340 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 29 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:01,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:00:01,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4212 states. [2022-11-03 04:00:01,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4212 to 4212. [2022-11-03 04:00:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4212 states, 4165 states have (on average 4.400240096038416) internal successors, (18327), 4211 states have internal predecessors, (18327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:01,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4212 states to 4212 states and 18327 transitions. [2022-11-03 04:00:01,553 INFO L78 Accepts]: Start accepts. Automaton has 4212 states and 18327 transitions. Word has length 9 [2022-11-03 04:00:01,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:01,553 INFO L495 AbstractCegarLoop]: Abstraction has 4212 states and 18327 transitions. [2022-11-03 04:00:01,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:01,554 INFO L276 IsEmpty]: Start isEmpty. Operand 4212 states and 18327 transitions. [2022-11-03 04:00:01,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 04:00:01,559 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:01,559 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:01,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 04:00:01,560 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-11-03 04:00:01,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:01,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1446053424, now seen corresponding path program 1 times [2022-11-03 04:00:01,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:01,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230543239] [2022-11-03 04:00:01,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:01,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:02,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:00:02,211 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:02,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230543239] [2022-11-03 04:00:02,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230543239] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:02,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031402547] [2022-11-03 04:00:02,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:02,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:02,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:02,228 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:02,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 04:00:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:02,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-03 04:00:02,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:02,435 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 04:00:02,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:02,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:00:02,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:02,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:00:02,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:02,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:00:02,617 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 04:00:02,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:02,659 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_379 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_379) c_~A~0.base) c_~A~0.offset)))) is different from false [2022-11-03 04:00:02,680 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_379 (Array Int Int)) (v_ArrVal_378 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_378) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_379) c_~A~0.base) c_~A~0.offset)))) is different from false [2022-11-03 04:00:02,700 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_377 (Array Int Int)) (v_ArrVal_379 (Array Int Int)) (v_ArrVal_378 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_377) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_378) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_379) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483650))) is different from false [2022-11-03 04:00:02,727 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:02,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-03 04:00:02,753 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:02,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1107 treesize of output 1077 [2022-11-03 04:00:02,781 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 1062 treesize of output 998 [2022-11-03 04:00:02,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 998 treesize of output 966 [2022-11-03 04:00:02,829 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 966 treesize of output 950 [2022-11-03 04:00:06,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 04:00:06,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031402547] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:00:06,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [863045811] [2022-11-03 04:00:06,088 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 04:00:06,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:00:06,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-11-03 04:00:06,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100802663] [2022-11-03 04:00:06,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:00:06,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 04:00:06,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:06,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 04:00:06,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=165, Unknown=3, NotChecked=84, Total=306 [2022-11-03 04:00:06,092 INFO L87 Difference]: Start difference. First operand 4212 states and 18327 transitions. Second operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:06,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:06,765 INFO L93 Difference]: Finished difference Result 5423 states and 22642 transitions. [2022-11-03 04:00:06,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 04:00:06,766 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-03 04:00:06,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:06,802 INFO L225 Difference]: With dead ends: 5423 [2022-11-03 04:00:06,802 INFO L226 Difference]: Without dead ends: 5423 [2022-11-03 04:00:06,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=225, Unknown=3, NotChecked=102, Total=420 [2022-11-03 04:00:06,803 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 88 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 289 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:06,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 9 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 433 Invalid, 0 Unknown, 289 Unchecked, 0.4s Time] [2022-11-03 04:00:06,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5423 states. [2022-11-03 04:00:06,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5423 to 4292. [2022-11-03 04:00:06,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4292 states, 4245 states have (on average 4.4171967020023555) internal successors, (18751), 4291 states have internal predecessors, (18751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:07,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4292 states to 4292 states and 18751 transitions. [2022-11-03 04:00:07,014 INFO L78 Accepts]: Start accepts. Automaton has 4292 states and 18751 transitions. Word has length 10 [2022-11-03 04:00:07,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:07,015 INFO L495 AbstractCegarLoop]: Abstraction has 4292 states and 18751 transitions. [2022-11-03 04:00:07,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:07,015 INFO L276 IsEmpty]: Start isEmpty. Operand 4292 states and 18751 transitions. [2022-11-03 04:00:07,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 04:00:07,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:07,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:07,058 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:07,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:07,231 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-11-03 04:00:07,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:07,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1451903411, now seen corresponding path program 1 times [2022-11-03 04:00:07,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:07,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627729323] [2022-11-03 04:00:07,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:07,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:07,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:00:07,313 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:07,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627729323] [2022-11-03 04:00:07,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627729323] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:07,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751806756] [2022-11-03 04:00:07,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:07,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:07,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:07,315 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:07,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 04:00:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:07,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 04:00:07,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:07,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:00:07,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:07,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:00:07,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751806756] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:00:07,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1420539995] [2022-11-03 04:00:07,583 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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 04:00:07,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:00:07,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 12 [2022-11-03 04:00:07,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745989919] [2022-11-03 04:00:07,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:00:07,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 04:00:07,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:07,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 04:00:07,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-11-03 04:00:07,590 INFO L87 Difference]: Start difference. First operand 4292 states and 18751 transitions. Second operand has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 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 04:00:08,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:08,377 INFO L93 Difference]: Finished difference Result 4826 states and 19418 transitions. [2022-11-03 04:00:08,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 04:00:08,377 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-03 04:00:08,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:08,408 INFO L225 Difference]: With dead ends: 4826 [2022-11-03 04:00:08,409 INFO L226 Difference]: Without dead ends: 4752 [2022-11-03 04:00:08,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-11-03 04:00:08,410 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 379 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:08,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 34 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 04:00:08,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4752 states. [2022-11-03 04:00:08,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4752 to 4009. [2022-11-03 04:00:08,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4009 states, 3978 states have (on average 4.244595274007039) internal successors, (16885), 4008 states have internal predecessors, (16885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:08,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4009 states to 4009 states and 16885 transitions. [2022-11-03 04:00:08,568 INFO L78 Accepts]: Start accepts. Automaton has 4009 states and 16885 transitions. Word has length 10 [2022-11-03 04:00:08,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:08,569 INFO L495 AbstractCegarLoop]: Abstraction has 4009 states and 16885 transitions. [2022-11-03 04:00:08,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 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 04:00:08,569 INFO L276 IsEmpty]: Start isEmpty. Operand 4009 states and 16885 transitions. [2022-11-03 04:00:08,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 04:00:08,570 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:08,570 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:08,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:08,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:08,783 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-11-03 04:00:08,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:08,784 INFO L85 PathProgramCache]: Analyzing trace with hash 771940841, now seen corresponding path program 2 times [2022-11-03 04:00:08,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:08,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483779213] [2022-11-03 04:00:08,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:08,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:08,883 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 04:00:08,883 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:08,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483779213] [2022-11-03 04:00:08,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483779213] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:08,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780396940] [2022-11-03 04:00:08,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:00:08,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:08,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:08,885 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:08,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 04:00:09,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 04:00:09,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:00:09,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 04:00:09,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:09,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 04:00:09,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:00:09,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780396940] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:09,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 04:00:09,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2022-11-03 04:00:09,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485845008] [2022-11-03 04:00:09,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:09,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:00:09,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:09,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:00:09,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-03 04:00:09,024 INFO L87 Difference]: Start difference. First operand 4009 states and 16885 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:09,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:09,095 INFO L93 Difference]: Finished difference Result 2967 states and 12490 transitions. [2022-11-03 04:00:09,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:00:09,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-03 04:00:09,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:09,119 INFO L225 Difference]: With dead ends: 2967 [2022-11-03 04:00:09,119 INFO L226 Difference]: Without dead ends: 2901 [2022-11-03 04:00:09,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-03 04:00:09,121 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:09,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:00:09,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2022-11-03 04:00:09,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 1920. [2022-11-03 04:00:09,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1920 states, 1915 states have (on average 4.0365535248041775) internal successors, (7730), 1919 states have internal predecessors, (7730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:09,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 7730 transitions. [2022-11-03 04:00:09,207 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 7730 transitions. Word has length 10 [2022-11-03 04:00:09,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:09,208 INFO L495 AbstractCegarLoop]: Abstraction has 1920 states and 7730 transitions. [2022-11-03 04:00:09,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:09,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 7730 transitions. [2022-11-03 04:00:09,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 04:00:09,210 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:09,210 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:09,248 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-03 04:00:09,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-03 04:00:09,423 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread4Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-11-03 04:00:09,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:09,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1877815937, now seen corresponding path program 1 times [2022-11-03 04:00:09,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:09,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415865482] [2022-11-03 04:00:09,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:09,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:09,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:00:09,467 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:09,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415865482] [2022-11-03 04:00:09,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415865482] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:09,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:00:09,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 04:00:09,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860043148] [2022-11-03 04:00:09,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:09,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:00:09,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:09,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:00:09,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:00:09,470 INFO L87 Difference]: Start difference. First operand 1920 states and 7730 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:09,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:09,562 INFO L93 Difference]: Finished difference Result 1810 states and 7245 transitions. [2022-11-03 04:00:09,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:00:09,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 04:00:09,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:09,574 INFO L225 Difference]: With dead ends: 1810 [2022-11-03 04:00:09,574 INFO L226 Difference]: Without dead ends: 1810 [2022-11-03 04:00:09,575 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 04:00:09,576 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 13 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:09,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:00:09,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2022-11-03 04:00:09,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1810. [2022-11-03 04:00:09,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1805 states have (on average 4.013850415512465) internal successors, (7245), 1809 states have internal predecessors, (7245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:09,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 7245 transitions. [2022-11-03 04:00:09,643 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 7245 transitions. Word has length 11 [2022-11-03 04:00:09,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:09,644 INFO L495 AbstractCegarLoop]: Abstraction has 1810 states and 7245 transitions. [2022-11-03 04:00:09,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:09,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 7245 transitions. [2022-11-03 04:00:09,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 04:00:09,645 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:09,645 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:09,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 04:00:09,645 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-11-03 04:00:09,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:09,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1877816654, now seen corresponding path program 1 times [2022-11-03 04:00:09,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:09,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219182566] [2022-11-03 04:00:09,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:09,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:10,244 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 04:00:10,244 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:10,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219182566] [2022-11-03 04:00:10,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219182566] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:10,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930447615] [2022-11-03 04:00:10,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:10,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:10,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:10,246 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:10,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 04:00:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:10,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-03 04:00:10,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:10,421 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 04:00:10,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:10,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 16 treesize of output 18 [2022-11-03 04:00:10,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:10,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:00:10,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:10,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:00:10,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:10,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:00:10,662 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 04:00:10,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:10,717 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_579 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_579) c_~A~0.base) c_~A~0.offset) 2147483650))) is different from false [2022-11-03 04:00:10,727 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_579) c_~A~0.base) c_~A~0.offset)))) is different from false [2022-11-03 04:00:10,738 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_577) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_579) c_~A~0.base) c_~A~0.offset) 2147483650))) is different from false [2022-11-03 04:00:10,754 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_577 (Array Int Int)) (v_ArrVal_576 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_576) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_577) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) is different from false [2022-11-03 04:00:10,770 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:10,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-03 04:00:10,782 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:10,782 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 551 treesize of output 545 [2022-11-03 04:00:10,801 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 530 treesize of output 498 [2022-11-03 04:00:10,811 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 498 treesize of output 490 [2022-11-03 04:00:10,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 242 [2022-11-03 04:00:10,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 486 treesize of output 470 [2022-11-03 04:00:11,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 04:00:11,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930447615] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:00:11,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1845885364] [2022-11-03 04:00:11,372 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 04:00:11,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:00:11,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-03 04:00:11,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91885762] [2022-11-03 04:00:11,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:00:11,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 04:00:11,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:11,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 04:00:11,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=277, Unknown=4, NotChecked=148, Total=506 [2022-11-03 04:00:11,376 INFO L87 Difference]: Start difference. First operand 1810 states and 7245 transitions. Second operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:12,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:12,322 INFO L93 Difference]: Finished difference Result 2380 states and 9487 transitions. [2022-11-03 04:00:12,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 04:00:12,323 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 04:00:12,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:12,336 INFO L225 Difference]: With dead ends: 2380 [2022-11-03 04:00:12,337 INFO L226 Difference]: Without dead ends: 2380 [2022-11-03 04:00:12,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=135, Invalid=429, Unknown=4, NotChecked=188, Total=756 [2022-11-03 04:00:12,338 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 257 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 261 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:12,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 4 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 259 Invalid, 0 Unknown, 261 Unchecked, 0.4s Time] [2022-11-03 04:00:12,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2022-11-03 04:00:12,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 2122. [2022-11-03 04:00:12,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2122 states, 2117 states have (on average 4.125649504015116) internal successors, (8734), 2121 states have internal predecessors, (8734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:12,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 8734 transitions. [2022-11-03 04:00:12,421 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 8734 transitions. Word has length 11 [2022-11-03 04:00:12,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:12,421 INFO L495 AbstractCegarLoop]: Abstraction has 2122 states and 8734 transitions. [2022-11-03 04:00:12,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:12,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 8734 transitions. [2022-11-03 04:00:12,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 04:00:12,422 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:12,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:12,463 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:12,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 04:00:12,639 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-11-03 04:00:12,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:12,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1877979931, now seen corresponding path program 1 times [2022-11-03 04:00:12,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:12,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546938355] [2022-11-03 04:00:12,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:12,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:12,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:00:12,779 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:12,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546938355] [2022-11-03 04:00:12,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546938355] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:12,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68699398] [2022-11-03 04:00:12,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:12,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:12,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:12,781 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:12,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 04:00:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:12,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 04:00:12,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:12,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:00:12,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:13,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:00:13,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68699398] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:00:13,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1884979675] [2022-11-03 04:00:13,067 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 04:00:13,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:00:13,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-11-03 04:00:13,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122946162] [2022-11-03 04:00:13,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:00:13,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 04:00:13,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:13,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 04:00:13,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-11-03 04:00:13,069 INFO L87 Difference]: Start difference. First operand 2122 states and 8734 transitions. Second operand has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:13,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:13,602 INFO L93 Difference]: Finished difference Result 1960 states and 7484 transitions. [2022-11-03 04:00:13,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 04:00:13,603 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 04:00:13,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:13,611 INFO L225 Difference]: With dead ends: 1960 [2022-11-03 04:00:13,611 INFO L226 Difference]: Without dead ends: 1774 [2022-11-03 04:00:13,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2022-11-03 04:00:13,612 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 156 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:13,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 5 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 04:00:13,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2022-11-03 04:00:13,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1590. [2022-11-03 04:00:13,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1590 states, 1585 states have (on average 3.9356466876971608) internal successors, (6238), 1589 states have internal predecessors, (6238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:13,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 6238 transitions. [2022-11-03 04:00:13,667 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 6238 transitions. Word has length 11 [2022-11-03 04:00:13,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:13,668 INFO L495 AbstractCegarLoop]: Abstraction has 1590 states and 6238 transitions. [2022-11-03 04:00:13,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:13,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 6238 transitions. [2022-11-03 04:00:13,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 04:00:13,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:13,669 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:13,713 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:13,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:13,895 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread4Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-11-03 04:00:13,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:13,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1917247665, now seen corresponding path program 1 times [2022-11-03 04:00:13,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:13,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060599039] [2022-11-03 04:00:13,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:13,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:13,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:00:13,984 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:13,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060599039] [2022-11-03 04:00:13,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060599039] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:13,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:00:13,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 04:00:13,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983651800] [2022-11-03 04:00:13,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:13,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:00:13,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:13,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:00:13,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:00:13,986 INFO L87 Difference]: Start difference. First operand 1590 states and 6238 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:14,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:14,073 INFO L93 Difference]: Finished difference Result 1454 states and 5614 transitions. [2022-11-03 04:00:14,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:00:14,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-03 04:00:14,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:14,079 INFO L225 Difference]: With dead ends: 1454 [2022-11-03 04:00:14,079 INFO L226 Difference]: Without dead ends: 1454 [2022-11-03 04:00:14,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:00:14,080 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 11 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:14,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:00:14,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2022-11-03 04:00:14,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1454. [2022-11-03 04:00:14,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1454 states, 1449 states have (on average 3.8743961352657004) internal successors, (5614), 1453 states have internal predecessors, (5614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:14,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 5614 transitions. [2022-11-03 04:00:14,125 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 5614 transitions. Word has length 12 [2022-11-03 04:00:14,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:14,125 INFO L495 AbstractCegarLoop]: Abstraction has 1454 states and 5614 transitions. [2022-11-03 04:00:14,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:14,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 5614 transitions. [2022-11-03 04:00:14,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 04:00:14,127 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:14,127 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:14,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-03 04:00:14,127 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-11-03 04:00:14,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:14,128 INFO L85 PathProgramCache]: Analyzing trace with hash -268477265, now seen corresponding path program 2 times [2022-11-03 04:00:14,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:14,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944001585] [2022-11-03 04:00:14,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:14,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:14,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:00:14,847 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:14,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944001585] [2022-11-03 04:00:14,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944001585] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:14,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89106420] [2022-11-03 04:00:14,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:00:14,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:14,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:14,856 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:14,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 04:00:15,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 04:00:15,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:00:15,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-03 04:00:15,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:15,099 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 04:00:15,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:15,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:00:15,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:15,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 04:00:15,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:15,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:00:15,298 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 04:00:15,299 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 28 treesize of output 27 [2022-11-03 04:00:15,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:00:15,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:15,408 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_738 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_738) c_~A~0.base) (+ c_~A~0.offset 4))))) is different from false [2022-11-03 04:00:15,419 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_737 (Array Int Int)) (v_ArrVal_738 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_738) c_~A~0.base) (+ c_~A~0.offset 4))))) is different from false [2022-11-03 04:00:15,433 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_738 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_736) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_738) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483650))) is different from false [2022-11-03 04:00:15,449 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:15,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-03 04:00:15,463 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:15,463 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 619 treesize of output 597 [2022-11-03 04:00:15,473 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 582 treesize of output 566 [2022-11-03 04:00:15,483 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 566 treesize of output 534 [2022-11-03 04:00:15,493 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 534 treesize of output 470 [2022-11-03 04:00:15,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 04:00:15,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89106420] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:00:15,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [641300883] [2022-11-03 04:00:15,871 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 04:00:15,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:00:15,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-03 04:00:15,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503421863] [2022-11-03 04:00:15,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:00:15,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 04:00:15,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:15,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 04:00:15,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=431, Unknown=3, NotChecked=132, Total=650 [2022-11-03 04:00:15,876 INFO L87 Difference]: Start difference. First operand 1454 states and 5614 transitions. Second operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:17,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:17,401 INFO L93 Difference]: Finished difference Result 1640 states and 6164 transitions. [2022-11-03 04:00:17,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 04:00:17,402 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-03 04:00:17,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:17,413 INFO L225 Difference]: With dead ends: 1640 [2022-11-03 04:00:17,413 INFO L226 Difference]: Without dead ends: 1640 [2022-11-03 04:00:17,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=157, Invalid=722, Unknown=3, NotChecked=174, Total=1056 [2022-11-03 04:00:17,414 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 190 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 292 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:17,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 16 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 937 Invalid, 0 Unknown, 292 Unchecked, 0.9s Time] [2022-11-03 04:00:17,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2022-11-03 04:00:17,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1470. [2022-11-03 04:00:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1470 states, 1465 states have (on average 3.8866894197952218) internal successors, (5694), 1469 states have internal predecessors, (5694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:17,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 5694 transitions. [2022-11-03 04:00:17,484 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 5694 transitions. Word has length 12 [2022-11-03 04:00:17,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:17,485 INFO L495 AbstractCegarLoop]: Abstraction has 1470 states and 5694 transitions. [2022-11-03 04:00:17,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:17,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 5694 transitions. [2022-11-03 04:00:17,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 04:00:17,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:17,487 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:17,526 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:17,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 04:00:17,703 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-11-03 04:00:17,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:17,704 INFO L85 PathProgramCache]: Analyzing trace with hash 272204217, now seen corresponding path program 1 times [2022-11-03 04:00:17,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:17,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674670405] [2022-11-03 04:00:17,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:17,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:18,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:00:18,842 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:18,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674670405] [2022-11-03 04:00:18,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674670405] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:18,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356269161] [2022-11-03 04:00:18,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:18,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:18,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:18,844 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:18,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 04:00:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:19,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-03 04:00:19,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:19,102 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 04:00:19,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:19,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:00:19,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:19,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 18 treesize of output 20 [2022-11-03 04:00:19,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:19,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 18 treesize of output 20 [2022-11-03 04:00:19,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:19,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 18 treesize of output 20 [2022-11-03 04:00:19,396 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 04:00:19,397 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 28 treesize of output 27 [2022-11-03 04:00:19,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:00:19,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:19,525 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_814 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_814) c_~A~0.base) (+ c_~A~0.offset 4))))) is different from false [2022-11-03 04:00:19,536 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_814) c_~A~0.base) (+ c_~A~0.offset 4)) 2147483650))) is different from false [2022-11-03 04:00:19,548 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_814) c_~A~0.base) (+ c_~A~0.offset 4))))) is different from false [2022-11-03 04:00:19,562 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_813 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_811) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_812) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2022-11-03 04:00:19,578 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:19,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 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-03 04:00:19,592 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:19,592 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 1227 treesize of output 1205 [2022-11-03 04:00:19,609 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 1190 treesize of output 1126 [2022-11-03 04:00:19,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 563 treesize of output 531 [2022-11-03 04:00:19,645 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 1094 treesize of output 1078 [2022-11-03 04:00:19,661 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 1078 treesize of output 950 [2022-11-03 04:00:24,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 04:00:24,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356269161] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:00:24,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1052211105] [2022-11-03 04:00:24,694 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 04:00:24,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:00:24,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-03 04:00:24,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321092607] [2022-11-03 04:00:24,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:00:24,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 04:00:24,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:24,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 04:00:24,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=519, Unknown=4, NotChecked=196, Total=812 [2022-11-03 04:00:24,698 INFO L87 Difference]: Start difference. First operand 1470 states and 5694 transitions. Second operand has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:26,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:26,446 INFO L93 Difference]: Finished difference Result 1804 states and 6794 transitions. [2022-11-03 04:00:26,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 04:00:26,446 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 04:00:26,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:26,452 INFO L225 Difference]: With dead ends: 1804 [2022-11-03 04:00:26,452 INFO L226 Difference]: Without dead ends: 1804 [2022-11-03 04:00:26,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=175, Invalid=829, Unknown=4, NotChecked=252, Total=1260 [2022-11-03 04:00:26,453 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 383 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 457 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:26,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 13 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 907 Invalid, 0 Unknown, 457 Unchecked, 0.9s Time] [2022-11-03 04:00:26,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2022-11-03 04:00:26,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1590. [2022-11-03 04:00:26,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1590 states, 1585 states have (on average 3.9381703470031546) internal successors, (6242), 1589 states have internal predecessors, (6242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:26,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 6242 transitions. [2022-11-03 04:00:26,505 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 6242 transitions. Word has length 13 [2022-11-03 04:00:26,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:26,506 INFO L495 AbstractCegarLoop]: Abstraction has 1590 states and 6242 transitions. [2022-11-03 04:00:26,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:26,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 6242 transitions. [2022-11-03 04:00:26,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 04:00:26,508 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:26,508 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:26,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:26,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 04:00:26,715 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-11-03 04:00:26,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:26,716 INFO L85 PathProgramCache]: Analyzing trace with hash 267142630, now seen corresponding path program 3 times [2022-11-03 04:00:26,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:26,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821150243] [2022-11-03 04:00:26,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:26,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:26,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:00:26,846 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:26,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821150243] [2022-11-03 04:00:26,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821150243] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:26,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849289310] [2022-11-03 04:00:26,847 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:00:26,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:26,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:26,848 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:26,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 04:00:27,006 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:00:27,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:00:27,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 04:00:27,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:27,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:00:27,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:27,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:00:27,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849289310] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:00:27,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [623320150] [2022-11-03 04:00:27,216 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 04:00:27,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:00:27,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-11-03 04:00:27,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943536386] [2022-11-03 04:00:27,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:00:27,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-03 04:00:27,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:27,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-03 04:00:27,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-11-03 04:00:27,218 INFO L87 Difference]: Start difference. First operand 1590 states and 6242 transitions. Second operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:28,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:28,079 INFO L93 Difference]: Finished difference Result 2638 states and 9870 transitions. [2022-11-03 04:00:28,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 04:00:28,079 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 04:00:28,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:28,088 INFO L225 Difference]: With dead ends: 2638 [2022-11-03 04:00:28,088 INFO L226 Difference]: Without dead ends: 2470 [2022-11-03 04:00:28,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=611, Unknown=0, NotChecked=0, Total=870 [2022-11-03 04:00:28,089 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 591 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:28,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 7 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 04:00:28,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2022-11-03 04:00:28,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 1980. [2022-11-03 04:00:28,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1980 states, 1975 states have (on average 3.9873417721518987) internal successors, (7875), 1979 states have internal predecessors, (7875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:28,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1980 states to 1980 states and 7875 transitions. [2022-11-03 04:00:28,165 INFO L78 Accepts]: Start accepts. Automaton has 1980 states and 7875 transitions. Word has length 13 [2022-11-03 04:00:28,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:28,165 INFO L495 AbstractCegarLoop]: Abstraction has 1980 states and 7875 transitions. [2022-11-03 04:00:28,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:28,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 7875 transitions. [2022-11-03 04:00:28,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 04:00:28,172 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:28,172 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:28,212 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:28,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:28,387 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread4Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-11-03 04:00:28,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:28,387 INFO L85 PathProgramCache]: Analyzing trace with hash -65989988, now seen corresponding path program 1 times [2022-11-03 04:00:28,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:28,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714766351] [2022-11-03 04:00:28,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:28,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:28,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:00:28,459 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:28,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714766351] [2022-11-03 04:00:28,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714766351] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:28,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:00:28,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 04:00:28,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821937097] [2022-11-03 04:00:28,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:28,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:00:28,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:28,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:00:28,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:00:28,461 INFO L87 Difference]: Start difference. First operand 1980 states and 7875 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:28,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:28,543 INFO L93 Difference]: Finished difference Result 1882 states and 7425 transitions. [2022-11-03 04:00:28,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:00:28,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-03 04:00:28,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:28,550 INFO L225 Difference]: With dead ends: 1882 [2022-11-03 04:00:28,550 INFO L226 Difference]: Without dead ends: 1882 [2022-11-03 04:00:28,551 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 04:00:28,552 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 11 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:28,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:00:28,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2022-11-03 04:00:28,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1882. [2022-11-03 04:00:28,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1882 states, 1877 states have (on average 3.955780500799148) internal successors, (7425), 1881 states have internal predecessors, (7425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:28,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 7425 transitions. [2022-11-03 04:00:28,624 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 7425 transitions. Word has length 14 [2022-11-03 04:00:28,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:28,625 INFO L495 AbstractCegarLoop]: Abstraction has 1882 states and 7425 transitions. [2022-11-03 04:00:28,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:28,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 7425 transitions. [2022-11-03 04:00:28,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 04:00:28,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:28,627 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:28,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-03 04:00:28,628 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-11-03 04:00:28,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:28,628 INFO L85 PathProgramCache]: Analyzing trace with hash 810978096, now seen corresponding path program 4 times [2022-11-03 04:00:28,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:28,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984507602] [2022-11-03 04:00:28,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:28,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:29,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:00:29,240 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:29,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984507602] [2022-11-03 04:00:29,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984507602] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:29,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068470671] [2022-11-03 04:00:29,240 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:00:29,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:29,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:29,241 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:29,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 04:00:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:29,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-03 04:00:29,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:29,509 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 04:00:29,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:29,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:00:29,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:29,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 18 treesize of output 20 [2022-11-03 04:00:29,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:29,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 18 treesize of output 20 [2022-11-03 04:00:29,705 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 04:00:29,705 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 28 treesize of output 27 [2022-11-03 04:00:29,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 04:00:29,769 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:00:29,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:29,892 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_991 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) c_~A~0.base) (+ c_~A~0.offset 8)) 2147483650))) is different from false [2022-11-03 04:00:29,901 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_991 (Array Int Int)) (v_ArrVal_990 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) c_~A~0.base) (+ c_~A~0.offset 8))))) is different from false [2022-11-03 04:00:29,913 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_989 (Array Int Int)) (v_ArrVal_991 (Array Int Int)) (v_ArrVal_990 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_989) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_990) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_991) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2022-11-03 04:00:29,926 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:29,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-03 04:00:29,937 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:29,938 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 1235 treesize of output 1189 [2022-11-03 04:00:29,954 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 587 treesize of output 555 [2022-11-03 04:00:29,967 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 1142 treesize of output 1014 [2022-11-03 04:00:29,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1014 treesize of output 950 [2022-11-03 04:00:30,754 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 04:00:30,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068470671] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:00:30,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [964260059] [2022-11-03 04:00:30,755 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 04:00:30,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:00:30,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-11-03 04:00:30,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162596515] [2022-11-03 04:00:30,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:00:30,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 04:00:30,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:30,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 04:00:30,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=723, Unknown=3, NotChecked=168, Total=992 [2022-11-03 04:00:30,757 INFO L87 Difference]: Start difference. First operand 1882 states and 7425 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 04:00:32,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:32,612 INFO L93 Difference]: Finished difference Result 2198 states and 8325 transitions. [2022-11-03 04:00:32,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 04:00:32,612 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 14 [2022-11-03 04:00:32,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:32,618 INFO L225 Difference]: With dead ends: 2198 [2022-11-03 04:00:32,618 INFO L226 Difference]: Without dead ends: 2198 [2022-11-03 04:00:32,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=193, Invalid=1222, Unknown=3, NotChecked=222, Total=1640 [2022-11-03 04:00:32,619 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 337 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 1439 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 1851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 355 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:32,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 23 Invalid, 1851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1439 Invalid, 0 Unknown, 355 Unchecked, 1.1s Time] [2022-11-03 04:00:32,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2022-11-03 04:00:32,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 1898. [2022-11-03 04:00:32,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1893 states have (on average 3.964606444796619) internal successors, (7505), 1897 states have internal predecessors, (7505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:32,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 7505 transitions. [2022-11-03 04:00:32,682 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 7505 transitions. Word has length 14 [2022-11-03 04:00:32,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:32,682 INFO L495 AbstractCegarLoop]: Abstraction has 1898 states and 7505 transitions. [2022-11-03 04:00:32,682 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 04:00:32,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 7505 transitions. [2022-11-03 04:00:32,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 04:00:32,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:32,685 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:32,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:32,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-03 04:00:32,899 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread4Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-11-03 04:00:32,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:32,899 INFO L85 PathProgramCache]: Analyzing trace with hash -2045686557, now seen corresponding path program 1 times [2022-11-03 04:00:32,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:32,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437227287] [2022-11-03 04:00:32,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:32,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:33,261 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 04:00:33,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:33,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437227287] [2022-11-03 04:00:33,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437227287] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:33,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96307586] [2022-11-03 04:00:33,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:33,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:33,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:33,263 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:33,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 04:00:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:33,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-03 04:00:33,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:33,486 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 04:00:33,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:33,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 04:00:33,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:33,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 16 treesize of output 18 [2022-11-03 04:00:33,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:33,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:00:33,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:33,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:00:33,731 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 04:00:33,751 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 04:00:33,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:33,780 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1061 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1061) c_~A~0.base) c_~A~0.offset) 2147483650))) is different from false [2022-11-03 04:00:33,790 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1061 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1060) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1061) c_~A~0.base) c_~A~0.offset) 2147483650))) is different from false [2022-11-03 04:00:33,803 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int)) (v_ArrVal_1061 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1059) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1060) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1061) c_~A~0.base) c_~A~0.offset) 2147483650))) is different from false [2022-11-03 04:00:33,816 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1060 (Array Int Int)) (v_ArrVal_1059 (Array Int Int)) (v_ArrVal_1058 (Array Int Int)) (v_ArrVal_1061 (Array Int Int))) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1058) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1059) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1060) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1061) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483650))) is different from false [2022-11-03 04:00:33,828 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:33,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-03 04:00:33,839 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:33,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 551 treesize of output 545 [2022-11-03 04:00:33,849 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 530 treesize of output 498 [2022-11-03 04:00:33,858 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 498 treesize of output 482 [2022-11-03 04:00:33,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 242 treesize of output 238 [2022-11-03 04:00:33,892 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 04:00:34,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 04:00:34,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96307586] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:00:34,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1736035560] [2022-11-03 04:00:34,263 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 04:00:34,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:00:34,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-11-03 04:00:34,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430822584] [2022-11-03 04:00:34,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:00:34,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 04:00:34,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:34,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 04:00:34,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=242, Unknown=4, NotChecked=140, Total=462 [2022-11-03 04:00:34,267 INFO L87 Difference]: Start difference. First operand 1898 states and 7505 transitions. Second operand has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:34,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:34,616 INFO L93 Difference]: Finished difference Result 1656 states and 6414 transitions. [2022-11-03 04:00:34,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 04:00:34,617 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 04:00:34,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:34,620 INFO L225 Difference]: With dead ends: 1656 [2022-11-03 04:00:34,620 INFO L226 Difference]: Without dead ends: 758 [2022-11-03 04:00:34,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=327, Unknown=4, NotChecked=164, Total=600 [2022-11-03 04:00:34,621 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 61 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:34,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 2 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 75 Invalid, 0 Unknown, 121 Unchecked, 0.2s Time] [2022-11-03 04:00:34,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2022-11-03 04:00:34,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 758. [2022-11-03 04:00:34,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 756 states have (on average 3.8134920634920637) internal successors, (2883), 757 states have internal predecessors, (2883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:34,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 2883 transitions. [2022-11-03 04:00:34,642 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 2883 transitions. Word has length 15 [2022-11-03 04:00:34,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:34,642 INFO L495 AbstractCegarLoop]: Abstraction has 758 states and 2883 transitions. [2022-11-03 04:00:34,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:34,643 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 2883 transitions. [2022-11-03 04:00:34,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 04:00:34,644 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:34,644 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:34,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:34,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-03 04:00:34,846 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2022-11-03 04:00:34,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:34,846 INFO L85 PathProgramCache]: Analyzing trace with hash -472570350, now seen corresponding path program 2 times [2022-11-03 04:00:34,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:34,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814903739] [2022-11-03 04:00:34,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:34,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:35,871 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:00:35,871 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:35,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814903739] [2022-11-03 04:00:35,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814903739] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:35,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241286482] [2022-11-03 04:00:35,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:00:35,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:35,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:35,873 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:35,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c2257b7-d39a-486f-a295-b54a208b0479/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 04:00:36,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 04:00:36,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:00:36,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 04:00:36,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:36,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 04:00:36,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:36,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-03 04:00:36,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:36,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-03 04:00:36,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:36,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-03 04:00:36,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:36,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-03 04:00:36,810 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-03 04:00:36,811 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 29 treesize of output 36 [2022-11-03 04:00:36,938 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-11-03 04:00:36,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 59 [2022-11-03 04:00:37,093 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:00:37,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:41,819 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:41,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 52 [2022-11-03 04:00:41,848 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 35971 treesize of output 35841 [2022-11-03 04:00:42,038 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:42,039 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 39361 treesize of output 38983 [2022-11-03 04:00:42,212 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 42486 treesize of output 42102 [2022-11-03 04:00:42,418 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 56182 treesize of output 54646 [2022-11-03 04:00:42,647 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 82806 treesize of output 79734 [2022-11-03 04:00:43,078 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 86774 treesize of output 86006