./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue.i --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_0cab448e-50a2-4abf-b5fa-d51cfa53625d/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/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_0cab448e-50a2-4abf-b5fa-d51cfa53625d/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/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_0cab448e-50a2-4abf-b5fa-d51cfa53625d/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 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 02:16:55,848 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:16:55,850 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:16:55,877 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:16:55,877 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:16:55,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:16:55,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:16:55,881 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:16:55,883 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:16:55,884 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:16:55,885 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:16:55,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:16:55,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:16:55,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:16:55,889 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:16:55,890 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:16:55,891 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:16:55,892 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:16:55,894 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:16:55,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:16:55,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:16:55,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:16:55,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:16:55,901 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:16:55,904 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:16:55,905 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:16:55,905 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:16:55,906 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:16:55,906 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:16:55,907 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:16:55,908 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:16:55,909 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:16:55,909 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:16:55,910 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:16:55,911 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:16:55,912 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:16:55,913 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:16:55,913 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:16:55,913 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:16:55,914 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:16:55,915 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:16:55,916 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/bin/utaipan-7li7fVZpFI/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-03 02:16:55,945 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:16:55,951 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:16:55,951 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:16:55,951 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:16:55,952 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:16:55,953 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:16:55,953 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:16:55,953 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:16:55,953 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:16:55,954 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:16:55,955 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:16:55,955 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:16:55,955 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:16:55,955 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:16:55,956 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:16:55,956 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:16:55,956 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:16:55,956 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:16:55,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:16:55,957 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:16:55,957 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 02:16:55,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:16:55,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:16:55,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:16:55,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:16:55,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:16:55,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:16:55,959 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-03 02:16:55,959 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:16:55,959 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:16:55,959 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:16:55,960 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:16:55,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:16:55,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:16:55,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:16:55,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:16:55,961 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:16:55,961 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:16:55,963 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:16:55,963 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:16:55,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:16:55,963 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:16:55,963 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:16:55,964 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_0cab448e-50a2-4abf-b5fa-d51cfa53625d/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_0cab448e-50a2-4abf-b5fa-d51cfa53625d/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 -> 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 [2022-11-03 02:16:56,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:16:56,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:16:56,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:16:56,306 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:16:56,307 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:16:56,309 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/pthread/queue.i [2022-11-03 02:16:56,387 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/bin/utaipan-7li7fVZpFI/data/06104dcc9/9bbe16dd94b84cf08d52fded14d56bf0/FLAGcd62eb10a [2022-11-03 02:16:56,900 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:16:56,901 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/sv-benchmarks/c/pthread/queue.i [2022-11-03 02:16:56,919 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/bin/utaipan-7li7fVZpFI/data/06104dcc9/9bbe16dd94b84cf08d52fded14d56bf0/FLAGcd62eb10a [2022-11-03 02:16:57,204 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/bin/utaipan-7li7fVZpFI/data/06104dcc9/9bbe16dd94b84cf08d52fded14d56bf0 [2022-11-03 02:16:57,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:16:57,207 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:16:57,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:16:57,210 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:16:57,213 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:16:57,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:16:57" (1/1) ... [2022-11-03 02:16:57,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4371cf40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:16:57, skipping insertion in model container [2022-11-03 02:16:57,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:16:57" (1/1) ... [2022-11-03 02:16:57,223 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:16:57,270 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:16:57,775 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_0cab448e-50a2-4abf-b5fa-d51cfa53625d/sv-benchmarks/c/pthread/queue.i[43284,43297] [2022-11-03 02:16:57,780 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_0cab448e-50a2-4abf-b5fa-d51cfa53625d/sv-benchmarks/c/pthread/queue.i[43491,43504] [2022-11-03 02:16:57,783 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_0cab448e-50a2-4abf-b5fa-d51cfa53625d/sv-benchmarks/c/pthread/queue.i[43772,43785] [2022-11-03 02:16:57,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:16:57,799 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:16:57,850 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_0cab448e-50a2-4abf-b5fa-d51cfa53625d/sv-benchmarks/c/pthread/queue.i[43284,43297] [2022-11-03 02:16:57,852 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_0cab448e-50a2-4abf-b5fa-d51cfa53625d/sv-benchmarks/c/pthread/queue.i[43491,43504] [2022-11-03 02:16:57,855 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_0cab448e-50a2-4abf-b5fa-d51cfa53625d/sv-benchmarks/c/pthread/queue.i[43772,43785] [2022-11-03 02:16:57,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:16:57,916 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:16:57,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:16:57 WrapperNode [2022-11-03 02:16:57,917 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:16:57,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:16:57,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:16:57,919 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:16:57,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:16:57" (1/1) ... [2022-11-03 02:16:57,946 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:16:57" (1/1) ... [2022-11-03 02:16:57,978 INFO L138 Inliner]: procedures = 274, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 262 [2022-11-03 02:16:57,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:16:57,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:16:57,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:16:57,980 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:16:57,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:16:57" (1/1) ... [2022-11-03 02:16:57,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:16:57" (1/1) ... [2022-11-03 02:16:58,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:16:57" (1/1) ... [2022-11-03 02:16:58,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:16:57" (1/1) ... [2022-11-03 02:16:58,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:16:57" (1/1) ... [2022-11-03 02:16:58,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:16:57" (1/1) ... [2022-11-03 02:16:58,039 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:16:57" (1/1) ... [2022-11-03 02:16:58,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:16:57" (1/1) ... [2022-11-03 02:16:58,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:16:58,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:16:58,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:16:58,052 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:16:58,060 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:16:57" (1/1) ... [2022-11-03 02:16:58,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:16:58,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:16:58,099 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:16:58,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:16:58,140 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-03 02:16:58,141 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-03 02:16:58,141 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-03 02:16:58,141 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-03 02:16:58,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:16:58,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:16:58,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 02:16:58,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:16:58,142 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-03 02:16:58,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:16:58,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:16:58,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:16:58,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:16:58,145 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 02:16:58,323 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:16:58,325 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:16:58,854 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:16:58,863 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:16:58,863 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-03 02:16:58,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:16:58 BoogieIcfgContainer [2022-11-03 02:16:58,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:16:58,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:16:58,879 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:16:58,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:16:58,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:16:57" (1/3) ... [2022-11-03 02:16:58,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7206c3c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:16:58, skipping insertion in model container [2022-11-03 02:16:58,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:16:57" (2/3) ... [2022-11-03 02:16:58,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7206c3c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:16:58, skipping insertion in model container [2022-11-03 02:16:58,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:16:58" (3/3) ... [2022-11-03 02:16:58,888 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.i [2022-11-03 02:16:58,897 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 02:16:58,907 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:16:58,908 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-11-03 02:16:58,927 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 02:16:59,074 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-03 02:16:59,113 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:16:59,129 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 299 places, 307 transitions, 630 flow [2022-11-03 02:16:59,132 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 299 places, 307 transitions, 630 flow [2022-11-03 02:16:59,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 299 places, 307 transitions, 630 flow [2022-11-03 02:16:59,308 INFO L130 PetriNetUnfolder]: 15/305 cut-off events. [2022-11-03 02:16:59,308 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-03 02:16:59,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 305 events. 15/305 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 461 event pairs, 0 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 223. Up to 2 conditions per place. [2022-11-03 02:16:59,329 INFO L118 LiptonReduction]: Number of co-enabled transitions 23276 [2022-11-03 02:17:14,238 INFO L133 LiptonReduction]: Checked pairs total: 50876 [2022-11-03 02:17:14,239 INFO L135 LiptonReduction]: Total number of compositions: 290 [2022-11-03 02:17:14,249 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 82 transitions, 180 flow [2022-11-03 02:17:14,356 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1882 states, 1792 states have (on average 2.8286830357142856) internal successors, (5069), 1881 states have internal predecessors, (5069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:14,387 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:17:14,394 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;@5ada299a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:17:14,394 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2022-11-03 02:17:14,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 1882 states, 1792 states have (on average 2.8286830357142856) internal successors, (5069), 1881 states have internal predecessors, (5069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:14,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 02:17:14,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:14,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 02:17:14,409 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:17:14,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:14,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1253414157, now seen corresponding path program 1 times [2022-11-03 02:17:14,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:14,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162428962] [2022-11-03 02:17:14,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:14,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:15,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:15,620 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:15,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162428962] [2022-11-03 02:17:15,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162428962] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:15,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:15,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:17:15,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114284018] [2022-11-03 02:17:15,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:15,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:17:15,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:15,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:17:15,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:17:15,662 INFO L87 Difference]: Start difference. First operand has 1882 states, 1792 states have (on average 2.8286830357142856) internal successors, (5069), 1881 states have internal predecessors, (5069), 0 states have call successors, (0), 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 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:16,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:16,200 INFO L93 Difference]: Finished difference Result 1880 states and 4939 transitions. [2022-11-03 02:17:16,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:17:16,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-03 02:17:16,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:16,244 INFO L225 Difference]: With dead ends: 1880 [2022-11-03 02:17:16,245 INFO L226 Difference]: Without dead ends: 1880 [2022-11-03 02:17:16,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:17:16,249 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 6 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:16,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:17:16,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2022-11-03 02:17:16,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1880. [2022-11-03 02:17:16,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1790 states have (on average 2.7592178770949722) internal successors, (4939), 1879 states have internal predecessors, (4939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:16,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 4939 transitions. [2022-11-03 02:17:16,389 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 4939 transitions. Word has length 6 [2022-11-03 02:17:16,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:16,390 INFO L495 AbstractCegarLoop]: Abstraction has 1880 states and 4939 transitions. [2022-11-03 02:17:16,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:16,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 4939 transitions. [2022-11-03 02:17:16,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 02:17:16,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:16,391 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:16,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:17:16,392 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:17:16,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:16,393 INFO L85 PathProgramCache]: Analyzing trace with hash 203514151, now seen corresponding path program 1 times [2022-11-03 02:17:16,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:16,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841524369] [2022-11-03 02:17:16,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:16,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:17,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:17,010 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:17,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841524369] [2022-11-03 02:17:17,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841524369] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:17,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:17,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:17:17,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270754127] [2022-11-03 02:17:17,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:17,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:17:17,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:17,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:17:17,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:17:17,021 INFO L87 Difference]: Start difference. First operand 1880 states and 4939 transitions. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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 02:17:17,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:17,505 INFO L93 Difference]: Finished difference Result 2141 states and 5608 transitions. [2022-11-03 02:17:17,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:17:17,506 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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 02:17:17,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:17,522 INFO L225 Difference]: With dead ends: 2141 [2022-11-03 02:17:17,523 INFO L226 Difference]: Without dead ends: 2141 [2022-11-03 02:17:17,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:17:17,525 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 87 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:17,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 30 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:17:17,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2022-11-03 02:17:17,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 1982. [2022-11-03 02:17:17,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1982 states, 1892 states have (on average 2.7489429175475686) internal successors, (5201), 1981 states have internal predecessors, (5201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:17,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 5201 transitions. [2022-11-03 02:17:17,629 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 5201 transitions. Word has length 7 [2022-11-03 02:17:17,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:17,630 INFO L495 AbstractCegarLoop]: Abstraction has 1982 states and 5201 transitions. [2022-11-03 02:17:17,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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 02:17:17,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 5201 transitions. [2022-11-03 02:17:17,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 02:17:17,632 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:17,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:17,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:17:17,633 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:17:17,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:17,633 INFO L85 PathProgramCache]: Analyzing trace with hash 201323071, now seen corresponding path program 2 times [2022-11-03 02:17:17,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:17,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533534300] [2022-11-03 02:17:17,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:17,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:18,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:18,285 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:18,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533534300] [2022-11-03 02:17:18,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533534300] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:18,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:18,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:17:18,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249790939] [2022-11-03 02:17:18,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:18,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:17:18,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:18,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:17:18,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:17:18,288 INFO L87 Difference]: Start difference. First operand 1982 states and 5201 transitions. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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 02:17:18,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:18,895 INFO L93 Difference]: Finished difference Result 2156 states and 5649 transitions. [2022-11-03 02:17:18,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:17:18,895 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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 02:17:18,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:18,908 INFO L225 Difference]: With dead ends: 2156 [2022-11-03 02:17:18,908 INFO L226 Difference]: Without dead ends: 2156 [2022-11-03 02:17:18,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:17:18,910 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 72 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:18,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 38 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:17:18,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-11-03 02:17:18,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 1979. [2022-11-03 02:17:18,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1979 states, 1889 states have (on average 2.749602964531498) internal successors, (5194), 1978 states have internal predecessors, (5194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:18,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1979 states and 5194 transitions. [2022-11-03 02:17:18,977 INFO L78 Accepts]: Start accepts. Automaton has 1979 states and 5194 transitions. Word has length 7 [2022-11-03 02:17:18,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:18,978 INFO L495 AbstractCegarLoop]: Abstraction has 1979 states and 5194 transitions. [2022-11-03 02:17:18,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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 02:17:18,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 5194 transitions. [2022-11-03 02:17:18,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 02:17:18,979 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:18,979 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:18,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 02:17:18,980 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:17:18,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:18,980 INFO L85 PathProgramCache]: Analyzing trace with hash 201135211, now seen corresponding path program 3 times [2022-11-03 02:17:18,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:18,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335369453] [2022-11-03 02:17:18,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:18,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:19,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:19,878 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:19,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335369453] [2022-11-03 02:17:19,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335369453] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:19,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:19,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:17:19,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17856553] [2022-11-03 02:17:19,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:19,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:17:19,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:19,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:17:19,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:17:19,880 INFO L87 Difference]: Start difference. First operand 1979 states and 5194 transitions. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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 02:17:21,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:21,024 INFO L93 Difference]: Finished difference Result 2021 states and 5304 transitions. [2022-11-03 02:17:21,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:17:21,026 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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 02:17:21,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:21,037 INFO L225 Difference]: With dead ends: 2021 [2022-11-03 02:17:21,037 INFO L226 Difference]: Without dead ends: 2021 [2022-11-03 02:17:21,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:17:21,038 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 110 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:21,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 26 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-03 02:17:21,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2021 states. [2022-11-03 02:17:21,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2021 to 1970. [2022-11-03 02:17:21,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1970 states, 1880 states have (on average 2.751595744680851) internal successors, (5173), 1969 states have internal predecessors, (5173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:21,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 5173 transitions. [2022-11-03 02:17:21,099 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 5173 transitions. Word has length 7 [2022-11-03 02:17:21,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:21,100 INFO L495 AbstractCegarLoop]: Abstraction has 1970 states and 5173 transitions. [2022-11-03 02:17:21,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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 02:17:21,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 5173 transitions. [2022-11-03 02:17:21,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 02:17:21,101 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:21,101 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:21,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 02:17:21,102 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:17:21,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:21,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1329685775, now seen corresponding path program 1 times [2022-11-03 02:17:21,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:21,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446157584] [2022-11-03 02:17:21,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:21,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:21,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:21,146 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:21,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446157584] [2022-11-03 02:17:21,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446157584] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:21,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:21,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:17:21,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50388365] [2022-11-03 02:17:21,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:21,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:17:21,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:21,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:17:21,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:17:21,148 INFO L87 Difference]: Start difference. First operand 1970 states and 5173 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 02:17:21,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:21,351 INFO L93 Difference]: Finished difference Result 3434 states and 9083 transitions. [2022-11-03 02:17:21,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:17:21,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 02:17:21,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:21,389 INFO L225 Difference]: With dead ends: 3434 [2022-11-03 02:17:21,390 INFO L226 Difference]: Without dead ends: 3434 [2022-11-03 02:17:21,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:17:21,391 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 63 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:21,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 16 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:17:21,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3434 states. [2022-11-03 02:17:21,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3434 to 3114. [2022-11-03 02:17:21,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3114 states, 3024 states have (on average 2.8382936507936507) internal successors, (8583), 3113 states have internal predecessors, (8583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:21,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 8583 transitions. [2022-11-03 02:17:21,491 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 8583 transitions. Word has length 8 [2022-11-03 02:17:21,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:21,492 INFO L495 AbstractCegarLoop]: Abstraction has 3114 states and 8583 transitions. [2022-11-03 02:17:21,492 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 02:17:21,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 8583 transitions. [2022-11-03 02:17:21,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 02:17:21,494 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:21,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:21,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 02:17:21,494 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:17:21,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:21,496 INFO L85 PathProgramCache]: Analyzing trace with hash 16501957, now seen corresponding path program 1 times [2022-11-03 02:17:21,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:21,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636007194] [2022-11-03 02:17:21,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:21,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:22,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:22,248 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:22,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636007194] [2022-11-03 02:17:22,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636007194] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:22,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:22,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:17:22,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801690389] [2022-11-03 02:17:22,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:22,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:17:22,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:22,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:17:22,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:17:22,250 INFO L87 Difference]: Start difference. First operand 3114 states and 8583 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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 02:17:23,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:23,646 INFO L93 Difference]: Finished difference Result 3111 states and 8576 transitions. [2022-11-03 02:17:23,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:17:23,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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 02:17:23,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:23,666 INFO L225 Difference]: With dead ends: 3111 [2022-11-03 02:17:23,666 INFO L226 Difference]: Without dead ends: 3111 [2022-11-03 02:17:23,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:17:23,668 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:23,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 26 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-03 02:17:23,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3111 states. [2022-11-03 02:17:23,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3111 to 3111. [2022-11-03 02:17:23,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3111 states, 3021 states have (on average 2.8387951009599472) internal successors, (8576), 3110 states have internal predecessors, (8576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:23,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3111 states to 3111 states and 8576 transitions. [2022-11-03 02:17:23,832 INFO L78 Accepts]: Start accepts. Automaton has 3111 states and 8576 transitions. Word has length 9 [2022-11-03 02:17:23,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:23,833 INFO L495 AbstractCegarLoop]: Abstraction has 3111 states and 8576 transitions. [2022-11-03 02:17:23,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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 02:17:23,835 INFO L276 IsEmpty]: Start isEmpty. Operand 3111 states and 8576 transitions. [2022-11-03 02:17:23,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 02:17:23,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:23,842 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:23,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 02:17:23,842 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:17:23,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:23,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1731302810, now seen corresponding path program 1 times [2022-11-03 02:17:23,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:23,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688588678] [2022-11-03 02:17:23,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:23,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:23,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:23,915 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:23,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688588678] [2022-11-03 02:17:23,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688588678] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:23,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:23,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:17:23,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366164342] [2022-11-03 02:17:23,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:23,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:17:23,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:23,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:17:23,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:17:23,919 INFO L87 Difference]: Start difference. First operand 3111 states and 8576 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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 02:17:24,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:24,097 INFO L93 Difference]: Finished difference Result 2873 states and 7689 transitions. [2022-11-03 02:17:24,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:17:24,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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 02:17:24,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:24,141 INFO L225 Difference]: With dead ends: 2873 [2022-11-03 02:17:24,142 INFO L226 Difference]: Without dead ends: 2865 [2022-11-03 02:17:24,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:17:24,143 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 50 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:24,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 11 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:17:24,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2022-11-03 02:17:24,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2705. [2022-11-03 02:17:24,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2705 states, 2627 states have (on average 2.832508564902931) internal successors, (7441), 2704 states have internal predecessors, (7441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:24,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2705 states to 2705 states and 7441 transitions. [2022-11-03 02:17:24,246 INFO L78 Accepts]: Start accepts. Automaton has 2705 states and 7441 transitions. Word has length 9 [2022-11-03 02:17:24,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:24,246 INFO L495 AbstractCegarLoop]: Abstraction has 2705 states and 7441 transitions. [2022-11-03 02:17:24,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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 02:17:24,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 7441 transitions. [2022-11-03 02:17:24,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:17:24,248 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:24,249 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:24,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 02:17:24,250 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:17:24,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:24,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1602727317, now seen corresponding path program 1 times [2022-11-03 02:17:24,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:24,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145259403] [2022-11-03 02:17:24,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:24,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:24,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:24,842 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:24,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145259403] [2022-11-03 02:17:24,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145259403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:24,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:24,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:17:24,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445872982] [2022-11-03 02:17:24,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:24,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:17:24,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:24,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:17:24,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:17:24,845 INFO L87 Difference]: Start difference. First operand 2705 states and 7441 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:25,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:25,257 INFO L93 Difference]: Finished difference Result 2855 states and 7813 transitions. [2022-11-03 02:17:25,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:17:25,257 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-03 02:17:25,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:25,270 INFO L225 Difference]: With dead ends: 2855 [2022-11-03 02:17:25,270 INFO L226 Difference]: Without dead ends: 2855 [2022-11-03 02:17:25,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:17:25,272 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 54 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:25,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 32 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:17:25,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2022-11-03 02:17:25,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 2830. [2022-11-03 02:17:25,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2830 states, 2752 states have (on average 2.816497093023256) internal successors, (7751), 2829 states have internal predecessors, (7751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:25,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2830 states to 2830 states and 7751 transitions. [2022-11-03 02:17:25,363 INFO L78 Accepts]: Start accepts. Automaton has 2830 states and 7751 transitions. Word has length 10 [2022-11-03 02:17:25,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:25,364 INFO L495 AbstractCegarLoop]: Abstraction has 2830 states and 7751 transitions. [2022-11-03 02:17:25,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:25,364 INFO L276 IsEmpty]: Start isEmpty. Operand 2830 states and 7751 transitions. [2022-11-03 02:17:25,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:17:25,365 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:25,366 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:25,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 02:17:25,366 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:17:25,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:25,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1842285139, now seen corresponding path program 2 times [2022-11-03 02:17:25,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:25,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211085138] [2022-11-03 02:17:25,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:25,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:26,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:26,319 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:26,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211085138] [2022-11-03 02:17:26,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211085138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:26,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:26,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:17:26,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219117271] [2022-11-03 02:17:26,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:26,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:17:26,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:26,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:17:26,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:17:26,322 INFO L87 Difference]: Start difference. First operand 2830 states and 7751 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:27,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:27,419 INFO L93 Difference]: Finished difference Result 2955 states and 8061 transitions. [2022-11-03 02:17:27,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:17:27,419 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-03 02:17:27,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:27,430 INFO L225 Difference]: With dead ends: 2955 [2022-11-03 02:17:27,430 INFO L226 Difference]: Without dead ends: 2955 [2022-11-03 02:17:27,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:17:27,431 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 44 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:27,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 39 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-03 02:17:27,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2022-11-03 02:17:27,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2805. [2022-11-03 02:17:27,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2805 states, 2727 states have (on average 2.8195819581958195) internal successors, (7689), 2804 states have internal predecessors, (7689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:27,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2805 states and 7689 transitions. [2022-11-03 02:17:27,515 INFO L78 Accepts]: Start accepts. Automaton has 2805 states and 7689 transitions. Word has length 10 [2022-11-03 02:17:27,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:27,516 INFO L495 AbstractCegarLoop]: Abstraction has 2805 states and 7689 transitions. [2022-11-03 02:17:27,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:27,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2805 states and 7689 transitions. [2022-11-03 02:17:27,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:17:27,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:27,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:27,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 02:17:27,518 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:17:27,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:27,518 INFO L85 PathProgramCache]: Analyzing trace with hash 540715175, now seen corresponding path program 3 times [2022-11-03 02:17:27,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:27,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583906729] [2022-11-03 02:17:27,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:27,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:28,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:28,279 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:28,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583906729] [2022-11-03 02:17:28,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583906729] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:28,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:28,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:17:28,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195010176] [2022-11-03 02:17:28,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:28,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:17:28,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:28,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:17:28,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:17:28,280 INFO L87 Difference]: Start difference. First operand 2805 states and 7689 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:29,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:29,320 INFO L93 Difference]: Finished difference Result 2734 states and 7480 transitions. [2022-11-03 02:17:29,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:17:29,321 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-03 02:17:29,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:29,333 INFO L225 Difference]: With dead ends: 2734 [2022-11-03 02:17:29,334 INFO L226 Difference]: Without dead ends: 2734 [2022-11-03 02:17:29,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:17:29,335 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 56 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:29,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 32 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 02:17:29,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2734 states. [2022-11-03 02:17:29,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2734 to 2634. [2022-11-03 02:17:29,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2634 states, 2564 states have (on average 2.8205928237129485) internal successors, (7232), 2633 states have internal predecessors, (7232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:29,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 7232 transitions. [2022-11-03 02:17:29,438 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 7232 transitions. Word has length 10 [2022-11-03 02:17:29,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:29,438 INFO L495 AbstractCegarLoop]: Abstraction has 2634 states and 7232 transitions. [2022-11-03 02:17:29,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:29,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 7232 transitions. [2022-11-03 02:17:29,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:17:29,440 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:29,440 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:29,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 02:17:29,440 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:17:29,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:29,441 INFO L85 PathProgramCache]: Analyzing trace with hash 187869938, now seen corresponding path program 1 times [2022-11-03 02:17:29,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:29,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406039414] [2022-11-03 02:17:29,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:29,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:29,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:29,491 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:29,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406039414] [2022-11-03 02:17:29,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406039414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:29,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:29,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:17:29,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45058088] [2022-11-03 02:17:29,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:29,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:17:29,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:29,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:17:29,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:17:29,495 INFO L87 Difference]: Start difference. First operand 2634 states and 7232 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:29,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:29,675 INFO L93 Difference]: Finished difference Result 2562 states and 7001 transitions. [2022-11-03 02:17:29,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:17:29,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 02:17:29,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:29,686 INFO L225 Difference]: With dead ends: 2562 [2022-11-03 02:17:29,686 INFO L226 Difference]: Without dead ends: 2562 [2022-11-03 02:17:29,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:17:29,687 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 59 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:29,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 14 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:17:29,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2022-11-03 02:17:29,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2562. [2022-11-03 02:17:29,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2562 states, 2501 states have (on average 2.799280287884846) internal successors, (7001), 2561 states have internal predecessors, (7001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:29,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 7001 transitions. [2022-11-03 02:17:29,766 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 7001 transitions. Word has length 11 [2022-11-03 02:17:29,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:29,766 INFO L495 AbstractCegarLoop]: Abstraction has 2562 states and 7001 transitions. [2022-11-03 02:17:29,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:29,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 7001 transitions. [2022-11-03 02:17:29,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:17:29,768 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:29,768 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:29,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 02:17:29,768 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:17:29,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:29,769 INFO L85 PathProgramCache]: Analyzing trace with hash 187869846, now seen corresponding path program 1 times [2022-11-03 02:17:29,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:29,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982834880] [2022-11-03 02:17:29,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:29,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:29,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:17:29,822 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:29,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982834880] [2022-11-03 02:17:29,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982834880] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:29,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:29,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:17:29,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821481157] [2022-11-03 02:17:29,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:29,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:17:29,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:29,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:17:29,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:17:29,824 INFO L87 Difference]: Start difference. First operand 2562 states and 7001 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:29,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:29,986 INFO L93 Difference]: Finished difference Result 2490 states and 6770 transitions. [2022-11-03 02:17:29,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:17:29,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 02:17:29,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:29,996 INFO L225 Difference]: With dead ends: 2490 [2022-11-03 02:17:29,996 INFO L226 Difference]: Without dead ends: 2420 [2022-11-03 02:17:29,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:17:29,997 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 57 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:29,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 14 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:17:30,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2022-11-03 02:17:30,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 1576. [2022-11-03 02:17:30,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1524 states have (on average 2.776246719160105) internal successors, (4231), 1575 states have internal predecessors, (4231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:30,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 4231 transitions. [2022-11-03 02:17:30,056 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 4231 transitions. Word has length 11 [2022-11-03 02:17:30,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:30,056 INFO L495 AbstractCegarLoop]: Abstraction has 1576 states and 4231 transitions. [2022-11-03 02:17:30,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:30,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 4231 transitions. [2022-11-03 02:17:30,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:17:30,057 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:30,058 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:30,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 02:17:30,058 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:17:30,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:30,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1359366297, now seen corresponding path program 1 times [2022-11-03 02:17:30,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:30,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329299215] [2022-11-03 02:17:30,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:30,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:30,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:30,108 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:30,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329299215] [2022-11-03 02:17:30,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329299215] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:30,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:30,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:17:30,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467044242] [2022-11-03 02:17:30,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:30,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:17:30,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:30,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:17:30,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:17:30,110 INFO L87 Difference]: Start difference. First operand 1576 states and 4231 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:30,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:30,269 INFO L93 Difference]: Finished difference Result 1948 states and 5225 transitions. [2022-11-03 02:17:30,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:17:30,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 02:17:30,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:30,277 INFO L225 Difference]: With dead ends: 1948 [2022-11-03 02:17:30,277 INFO L226 Difference]: Without dead ends: 1948 [2022-11-03 02:17:30,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:17:30,278 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 42 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:30,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 13 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:17:30,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2022-11-03 02:17:30,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1884. [2022-11-03 02:17:30,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1832 states have (on average 2.7974890829694323) internal successors, (5125), 1883 states have internal predecessors, (5125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:30,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 5125 transitions. [2022-11-03 02:17:30,354 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 5125 transitions. Word has length 17 [2022-11-03 02:17:30,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:30,355 INFO L495 AbstractCegarLoop]: Abstraction has 1884 states and 5125 transitions. [2022-11-03 02:17:30,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:30,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 5125 transitions. [2022-11-03 02:17:30,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 02:17:30,356 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:30,357 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:30,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 02:17:30,359 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:17:30,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:30,360 INFO L85 PathProgramCache]: Analyzing trace with hash 809735391, now seen corresponding path program 1 times [2022-11-03 02:17:30,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:30,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036617826] [2022-11-03 02:17:30,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:30,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:31,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:31,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:31,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036617826] [2022-11-03 02:17:31,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036617826] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:31,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:31,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 02:17:31,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146130810] [2022-11-03 02:17:31,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:31,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 02:17:31,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:31,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 02:17:31,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:17:31,072 INFO L87 Difference]: Start difference. First operand 1884 states and 5125 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:32,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:32,368 INFO L93 Difference]: Finished difference Result 4447 states and 12199 transitions. [2022-11-03 02:17:32,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 02:17:32,368 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-03 02:17:32,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:32,384 INFO L225 Difference]: With dead ends: 4447 [2022-11-03 02:17:32,384 INFO L226 Difference]: Without dead ends: 4447 [2022-11-03 02:17:32,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2022-11-03 02:17:32,386 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 545 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:32,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 74 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-03 02:17:32,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4447 states. [2022-11-03 02:17:32,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4447 to 2968. [2022-11-03 02:17:32,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2968 states, 2916 states have (on average 2.9537037037037037) internal successors, (8613), 2967 states have internal predecessors, (8613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:32,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 2968 states and 8613 transitions. [2022-11-03 02:17:32,491 INFO L78 Accepts]: Start accepts. Automaton has 2968 states and 8613 transitions. Word has length 18 [2022-11-03 02:17:32,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:32,492 INFO L495 AbstractCegarLoop]: Abstraction has 2968 states and 8613 transitions. [2022-11-03 02:17:32,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:32,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2968 states and 8613 transitions. [2022-11-03 02:17:32,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 02:17:32,494 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:32,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:32,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 02:17:32,494 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:17:32,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:32,495 INFO L85 PathProgramCache]: Analyzing trace with hash 809735307, now seen corresponding path program 1 times [2022-11-03 02:17:32,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:32,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594924226] [2022-11-03 02:17:32,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:32,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:33,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:33,675 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:33,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594924226] [2022-11-03 02:17:33,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594924226] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:33,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:33,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-03 02:17:33,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309652530] [2022-11-03 02:17:33,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:33,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 02:17:33,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:33,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 02:17:33,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:17:33,704 INFO L87 Difference]: Start difference. First operand 2968 states and 8613 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:34,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:34,513 INFO L93 Difference]: Finished difference Result 2995 states and 8654 transitions. [2022-11-03 02:17:34,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 02:17:34,514 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-03 02:17:34,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:34,525 INFO L225 Difference]: With dead ends: 2995 [2022-11-03 02:17:34,526 INFO L226 Difference]: Without dead ends: 2995 [2022-11-03 02:17:34,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-11-03 02:17:34,531 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 61 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:34,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 46 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:17:34,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2022-11-03 02:17:34,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2967. [2022-11-03 02:17:34,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2967 states, 2915 states have (on average 2.95368782161235) internal successors, (8610), 2966 states have internal predecessors, (8610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2967 states to 2967 states and 8610 transitions. [2022-11-03 02:17:34,619 INFO L78 Accepts]: Start accepts. Automaton has 2967 states and 8610 transitions. Word has length 18 [2022-11-03 02:17:34,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:34,620 INFO L495 AbstractCegarLoop]: Abstraction has 2967 states and 8610 transitions. [2022-11-03 02:17:34,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:34,620 INFO L276 IsEmpty]: Start isEmpty. Operand 2967 states and 8610 transitions. [2022-11-03 02:17:34,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:17:34,621 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:34,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:34,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-03 02:17:34,622 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:17:34,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:34,623 INFO L85 PathProgramCache]: Analyzing trace with hash -877917787, now seen corresponding path program 1 times [2022-11-03 02:17:34,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:34,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82201638] [2022-11-03 02:17:34,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:34,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:36,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:36,851 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:36,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82201638] [2022-11-03 02:17:36,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82201638] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:36,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:36,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-03 02:17:36,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128195286] [2022-11-03 02:17:36,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:36,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 02:17:36,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:36,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 02:17:36,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:17:36,854 INFO L87 Difference]: Start difference. First operand 2967 states and 8610 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:38,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:38,794 INFO L93 Difference]: Finished difference Result 3370 states and 9659 transitions. [2022-11-03 02:17:38,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 02:17:38,795 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 02:17:38,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:38,805 INFO L225 Difference]: With dead ends: 3370 [2022-11-03 02:17:38,805 INFO L226 Difference]: Without dead ends: 3370 [2022-11-03 02:17:38,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-11-03 02:17:38,812 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 190 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:38,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 110 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-03 02:17:38,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3370 states. [2022-11-03 02:17:38,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3370 to 3282. [2022-11-03 02:17:38,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3282 states, 3230 states have (on average 2.9377708978328174) internal successors, (9489), 3281 states have internal predecessors, (9489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:38,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3282 states to 3282 states and 9489 transitions. [2022-11-03 02:17:38,899 INFO L78 Accepts]: Start accepts. Automaton has 3282 states and 9489 transitions. Word has length 19 [2022-11-03 02:17:38,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:38,900 INFO L495 AbstractCegarLoop]: Abstraction has 3282 states and 9489 transitions. [2022-11-03 02:17:38,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:38,900 INFO L276 IsEmpty]: Start isEmpty. Operand 3282 states and 9489 transitions. [2022-11-03 02:17:38,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:17:38,902 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:38,902 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:38,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-03 02:17:38,902 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:17:38,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:38,903 INFO L85 PathProgramCache]: Analyzing trace with hash -748620055, now seen corresponding path program 2 times [2022-11-03 02:17:38,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:38,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501466304] [2022-11-03 02:17:38,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:38,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:40,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:40,391 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:40,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501466304] [2022-11-03 02:17:40,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501466304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:40,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:40,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-03 02:17:40,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074998346] [2022-11-03 02:17:40,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:40,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 02:17:40,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:40,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 02:17:40,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:17:40,392 INFO L87 Difference]: Start difference. First operand 3282 states and 9489 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:41,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:41,353 INFO L93 Difference]: Finished difference Result 3406 states and 9781 transitions. [2022-11-03 02:17:41,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 02:17:41,354 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 02:17:41,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:41,361 INFO L225 Difference]: With dead ends: 3406 [2022-11-03 02:17:41,361 INFO L226 Difference]: Without dead ends: 3406 [2022-11-03 02:17:41,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2022-11-03 02:17:41,362 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 172 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:41,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 83 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 02:17:41,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3406 states. [2022-11-03 02:17:41,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 3031. [2022-11-03 02:17:41,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3031 states, 2979 states have (on average 2.945955018462571) internal successors, (8776), 3030 states have internal predecessors, (8776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:41,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3031 states to 3031 states and 8776 transitions. [2022-11-03 02:17:41,441 INFO L78 Accepts]: Start accepts. Automaton has 3031 states and 8776 transitions. Word has length 19 [2022-11-03 02:17:41,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:41,442 INFO L495 AbstractCegarLoop]: Abstraction has 3031 states and 8776 transitions. [2022-11-03 02:17:41,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:41,442 INFO L276 IsEmpty]: Start isEmpty. Operand 3031 states and 8776 transitions. [2022-11-03 02:17:41,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:17:41,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:41,444 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:41,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-03 02:17:41,444 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:17:41,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:41,445 INFO L85 PathProgramCache]: Analyzing trace with hash 142450913, now seen corresponding path program 1 times [2022-11-03 02:17:41,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:41,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534850505] [2022-11-03 02:17:41,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:41,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:42,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:42,753 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:42,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534850505] [2022-11-03 02:17:42,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534850505] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:42,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:42,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-03 02:17:42,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057215139] [2022-11-03 02:17:42,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:42,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 02:17:42,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:42,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 02:17:42,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:17:42,755 INFO L87 Difference]: Start difference. First operand 3031 states and 8776 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:43,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:43,810 INFO L93 Difference]: Finished difference Result 3346 states and 9640 transitions. [2022-11-03 02:17:43,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 02:17:43,810 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 02:17:43,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:43,817 INFO L225 Difference]: With dead ends: 3346 [2022-11-03 02:17:43,817 INFO L226 Difference]: Without dead ends: 3346 [2022-11-03 02:17:43,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2022-11-03 02:17:43,818 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 159 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:43,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 90 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 02:17:43,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2022-11-03 02:17:43,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 3207. [2022-11-03 02:17:43,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3207 states, 3155 states have (on average 2.945800316957211) internal successors, (9294), 3206 states have internal predecessors, (9294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:43,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3207 states to 3207 states and 9294 transitions. [2022-11-03 02:17:43,901 INFO L78 Accepts]: Start accepts. Automaton has 3207 states and 9294 transitions. Word has length 19 [2022-11-03 02:17:43,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:43,901 INFO L495 AbstractCegarLoop]: Abstraction has 3207 states and 9294 transitions. [2022-11-03 02:17:43,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:43,902 INFO L276 IsEmpty]: Start isEmpty. Operand 3207 states and 9294 transitions. [2022-11-03 02:17:43,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:17:43,904 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:43,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:43,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-03 02:17:43,904 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:17:43,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:43,905 INFO L85 PathProgramCache]: Analyzing trace with hash 142450829, now seen corresponding path program 3 times [2022-11-03 02:17:43,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:43,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850460195] [2022-11-03 02:17:43,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:43,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:45,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:45,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:45,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850460195] [2022-11-03 02:17:45,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850460195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:45,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:45,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-03 02:17:45,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826113998] [2022-11-03 02:17:45,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:45,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 02:17:45,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:45,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 02:17:45,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:17:45,103 INFO L87 Difference]: Start difference. First operand 3207 states and 9294 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:46,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:46,051 INFO L93 Difference]: Finished difference Result 3359 states and 9630 transitions. [2022-11-03 02:17:46,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 02:17:46,052 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 02:17:46,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:46,063 INFO L225 Difference]: With dead ends: 3359 [2022-11-03 02:17:46,063 INFO L226 Difference]: Without dead ends: 3359 [2022-11-03 02:17:46,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2022-11-03 02:17:46,065 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 240 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:46,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 76 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 02:17:46,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3359 states. [2022-11-03 02:17:46,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3359 to 2986. [2022-11-03 02:17:46,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2986 states, 2934 states have (on average 2.951261077027948) internal successors, (8659), 2985 states have internal predecessors, (8659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:46,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2986 states and 8659 transitions. [2022-11-03 02:17:46,167 INFO L78 Accepts]: Start accepts. Automaton has 2986 states and 8659 transitions. Word has length 19 [2022-11-03 02:17:46,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:46,168 INFO L495 AbstractCegarLoop]: Abstraction has 2986 states and 8659 transitions. [2022-11-03 02:17:46,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:46,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2986 states and 8659 transitions. [2022-11-03 02:17:46,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:17:46,170 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:46,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:46,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-03 02:17:46,170 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:17:46,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:46,171 INFO L85 PathProgramCache]: Analyzing trace with hash 700884197, now seen corresponding path program 2 times [2022-11-03 02:17:46,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:46,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970843278] [2022-11-03 02:17:46,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:46,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:47,604 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:47,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970843278] [2022-11-03 02:17:47,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970843278] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:47,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:47,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-03 02:17:47,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114409358] [2022-11-03 02:17:47,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:47,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 02:17:47,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:47,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 02:17:47,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:17:47,607 INFO L87 Difference]: Start difference. First operand 2986 states and 8659 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:48,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:48,601 INFO L93 Difference]: Finished difference Result 3217 states and 9242 transitions. [2022-11-03 02:17:48,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 02:17:48,602 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 02:17:48,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:48,612 INFO L225 Difference]: With dead ends: 3217 [2022-11-03 02:17:48,612 INFO L226 Difference]: Without dead ends: 3217 [2022-11-03 02:17:48,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2022-11-03 02:17:48,613 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 191 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:48,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 90 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 02:17:48,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3217 states. [2022-11-03 02:17:48,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3217 to 3042. [2022-11-03 02:17:48,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3042 states, 2990 states have (on average 2.9528428093645487) internal successors, (8829), 3041 states have internal predecessors, (8829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:48,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3042 states to 3042 states and 8829 transitions. [2022-11-03 02:17:48,698 INFO L78 Accepts]: Start accepts. Automaton has 3042 states and 8829 transitions. Word has length 19 [2022-11-03 02:17:48,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:48,699 INFO L495 AbstractCegarLoop]: Abstraction has 3042 states and 8829 transitions. [2022-11-03 02:17:48,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:48,699 INFO L276 IsEmpty]: Start isEmpty. Operand 3042 states and 8829 transitions. [2022-11-03 02:17:48,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:17:48,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:48,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:48,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-03 02:17:48,702 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:17:48,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:48,702 INFO L85 PathProgramCache]: Analyzing trace with hash 700884113, now seen corresponding path program 4 times [2022-11-03 02:17:48,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:48,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235427097] [2022-11-03 02:17:48,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:48,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:50,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:50,075 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:50,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235427097] [2022-11-03 02:17:50,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235427097] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:50,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:50,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-03 02:17:50,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309413906] [2022-11-03 02:17:50,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:50,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 02:17:50,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:50,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 02:17:50,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:17:50,076 INFO L87 Difference]: Start difference. First operand 3042 states and 8829 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:51,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:51,211 INFO L93 Difference]: Finished difference Result 3194 states and 9172 transitions. [2022-11-03 02:17:51,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 02:17:51,213 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 02:17:51,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:51,223 INFO L225 Difference]: With dead ends: 3194 [2022-11-03 02:17:51,223 INFO L226 Difference]: Without dead ends: 3194 [2022-11-03 02:17:51,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2022-11-03 02:17:51,226 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 167 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:51,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 93 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-03 02:17:51,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2022-11-03 02:17:51,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 2866. [2022-11-03 02:17:51,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2866 states, 2814 states have (on average 2.9534470504619756) internal successors, (8311), 2865 states have internal predecessors, (8311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:51,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2866 states to 2866 states and 8311 transitions. [2022-11-03 02:17:51,350 INFO L78 Accepts]: Start accepts. Automaton has 2866 states and 8311 transitions. Word has length 19 [2022-11-03 02:17:51,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:51,353 INFO L495 AbstractCegarLoop]: Abstraction has 2866 states and 8311 transitions. [2022-11-03 02:17:51,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:51,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2866 states and 8311 transitions. [2022-11-03 02:17:51,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:17:51,354 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:51,354 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:51,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-03 02:17:51,355 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:17:51,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:51,356 INFO L85 PathProgramCache]: Analyzing trace with hash -667872977, now seen corresponding path program 3 times [2022-11-03 02:17:51,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:51,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457249593] [2022-11-03 02:17:51,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:51,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:52,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:52,725 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:52,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457249593] [2022-11-03 02:17:52,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457249593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:52,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:52,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-03 02:17:52,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945822032] [2022-11-03 02:17:52,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:52,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 02:17:52,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:52,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 02:17:52,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:17:52,728 INFO L87 Difference]: Start difference. First operand 2866 states and 8311 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:54,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:54,070 INFO L93 Difference]: Finished difference Result 3022 states and 8675 transitions. [2022-11-03 02:17:54,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 02:17:54,071 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 02:17:54,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:54,077 INFO L225 Difference]: With dead ends: 3022 [2022-11-03 02:17:54,077 INFO L226 Difference]: Without dead ends: 3022 [2022-11-03 02:17:54,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2022-11-03 02:17:54,078 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 153 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:54,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 119 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1213 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-03 02:17:54,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2022-11-03 02:17:54,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 2886. [2022-11-03 02:17:54,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2886 states, 2834 states have (on average 2.958362738179252) internal successors, (8384), 2885 states have internal predecessors, (8384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:54,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2886 states to 2886 states and 8384 transitions. [2022-11-03 02:17:54,152 INFO L78 Accepts]: Start accepts. Automaton has 2886 states and 8384 transitions. Word has length 19 [2022-11-03 02:17:54,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:54,152 INFO L495 AbstractCegarLoop]: Abstraction has 2886 states and 8384 transitions. [2022-11-03 02:17:54,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:54,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2886 states and 8384 transitions. [2022-11-03 02:17:54,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:17:54,153 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:54,154 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:54,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-03 02:17:54,154 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:17:54,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:54,155 INFO L85 PathProgramCache]: Analyzing trace with hash -667873061, now seen corresponding path program 5 times [2022-11-03 02:17:54,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:54,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137167013] [2022-11-03 02:17:54,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:54,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:55,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:55,510 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:55,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137167013] [2022-11-03 02:17:55,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137167013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:55,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:55,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-03 02:17:55,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875444882] [2022-11-03 02:17:55,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:55,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-03 02:17:55,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:55,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-03 02:17:55,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-11-03 02:17:55,512 INFO L87 Difference]: Start difference. First operand 2886 states and 8384 transitions. Second operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:56,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:56,778 INFO L93 Difference]: Finished difference Result 2999 states and 8605 transitions. [2022-11-03 02:17:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 02:17:56,782 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 02:17:56,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:56,789 INFO L225 Difference]: With dead ends: 2999 [2022-11-03 02:17:56,790 INFO L226 Difference]: Without dead ends: 2999 [2022-11-03 02:17:56,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2022-11-03 02:17:56,791 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 179 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:56,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 105 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-03 02:17:56,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2022-11-03 02:17:56,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 2846. [2022-11-03 02:17:56,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2846 states, 2794 states have (on average 2.9556191839656405) internal successors, (8258), 2845 states have internal predecessors, (8258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:56,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2846 states to 2846 states and 8258 transitions. [2022-11-03 02:17:56,861 INFO L78 Accepts]: Start accepts. Automaton has 2846 states and 8258 transitions. Word has length 19 [2022-11-03 02:17:56,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:56,861 INFO L495 AbstractCegarLoop]: Abstraction has 2846 states and 8258 transitions. [2022-11-03 02:17:56,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:56,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2846 states and 8258 transitions. [2022-11-03 02:17:56,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:17:56,868 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:56,868 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:56,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-03 02:17:56,868 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:17:56,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:56,869 INFO L85 PathProgramCache]: Analyzing trace with hash -668005967, now seen corresponding path program 4 times [2022-11-03 02:17:56,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:56,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597715354] [2022-11-03 02:17:56,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:56,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:58,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:17:58,141 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:58,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597715354] [2022-11-03 02:17:58,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597715354] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:58,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:58,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-03 02:17:58,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306112733] [2022-11-03 02:17:58,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:58,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 02:17:58,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:58,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 02:17:58,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:17:58,143 INFO L87 Difference]: Start difference. First operand 2846 states and 8258 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:59,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:59,076 INFO L93 Difference]: Finished difference Result 2942 states and 8418 transitions. [2022-11-03 02:17:59,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 02:17:59,077 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 02:17:59,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:59,083 INFO L225 Difference]: With dead ends: 2942 [2022-11-03 02:17:59,083 INFO L226 Difference]: Without dead ends: 2942 [2022-11-03 02:17:59,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2022-11-03 02:17:59,085 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 205 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:59,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 89 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 02:17:59,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2022-11-03 02:17:59,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 2841. [2022-11-03 02:17:59,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2841 states, 2789 states have (on average 2.9505198996055935) internal successors, (8229), 2840 states have internal predecessors, (8229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:59,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2841 states and 8229 transitions. [2022-11-03 02:17:59,153 INFO L78 Accepts]: Start accepts. Automaton has 2841 states and 8229 transitions. Word has length 19 [2022-11-03 02:17:59,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:59,153 INFO L495 AbstractCegarLoop]: Abstraction has 2841 states and 8229 transitions. [2022-11-03 02:17:59,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:59,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 8229 transitions. [2022-11-03 02:17:59,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:17:59,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:59,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:59,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-03 02:17:59,155 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:17:59,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:59,156 INFO L85 PathProgramCache]: Analyzing trace with hash -668006051, now seen corresponding path program 6 times [2022-11-03 02:17:59,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:59,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819415491] [2022-11-03 02:17:59,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:59,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:00,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:00,297 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:00,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819415491] [2022-11-03 02:18:00,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819415491] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:00,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:00,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-03 02:18:00,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605075720] [2022-11-03 02:18:00,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:00,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 02:18:00,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:00,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 02:18:00,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:18:00,300 INFO L87 Difference]: Start difference. First operand 2841 states and 8229 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:01,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:01,373 INFO L93 Difference]: Finished difference Result 2904 states and 8324 transitions. [2022-11-03 02:18:01,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 02:18:01,374 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 02:18:01,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:01,380 INFO L225 Difference]: With dead ends: 2904 [2022-11-03 02:18:01,380 INFO L226 Difference]: Without dead ends: 2904 [2022-11-03 02:18:01,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2022-11-03 02:18:01,381 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 206 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:01,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 82 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-03 02:18:01,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2022-11-03 02:18:01,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 2816. [2022-11-03 02:18:01,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2816 states, 2764 states have (on average 2.9475397973950797) internal successors, (8147), 2815 states have internal predecessors, (8147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:01,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2816 states and 8147 transitions. [2022-11-03 02:18:01,444 INFO L78 Accepts]: Start accepts. Automaton has 2816 states and 8147 transitions. Word has length 19 [2022-11-03 02:18:01,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:01,444 INFO L495 AbstractCegarLoop]: Abstraction has 2816 states and 8147 transitions. [2022-11-03 02:18:01,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:01,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2816 states and 8147 transitions. [2022-11-03 02:18:01,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 02:18:01,446 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:01,446 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:01,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-03 02:18:01,446 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:18:01,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:01,447 INFO L85 PathProgramCache]: Analyzing trace with hash 367715036, now seen corresponding path program 1 times [2022-11-03 02:18:01,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:01,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116113096] [2022-11-03 02:18:01,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:01,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:01,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:01,504 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:01,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116113096] [2022-11-03 02:18:01,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116113096] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:18:01,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886373043] [2022-11-03 02:18:01,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:01,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:18:01,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:18:01,515 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:18:01,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:18:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:01,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:18:01,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:18:01,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:01,792 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:18:01,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886373043] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:01,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:18:01,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-11-03 02:18:01,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363862837] [2022-11-03 02:18:01,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:01,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:18:01,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:01,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:18:01,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:18:01,795 INFO L87 Difference]: Start difference. First operand 2816 states and 8147 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:02,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:02,035 INFO L93 Difference]: Finished difference Result 2728 states and 7762 transitions. [2022-11-03 02:18:02,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:18:02,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-03 02:18:02,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:02,044 INFO L225 Difference]: With dead ends: 2728 [2022-11-03 02:18:02,044 INFO L226 Difference]: Without dead ends: 2728 [2022-11-03 02:18:02,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:18:02,046 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 87 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:02,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 21 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:18:02,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2728 states. [2022-11-03 02:18:02,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2728 to 2696. [2022-11-03 02:18:02,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2696 states, 2656 states have (on average 2.9036144578313254) internal successors, (7712), 2695 states have internal predecessors, (7712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:02,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 7712 transitions. [2022-11-03 02:18:02,152 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 7712 transitions. Word has length 20 [2022-11-03 02:18:02,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:02,153 INFO L495 AbstractCegarLoop]: Abstraction has 2696 states and 7712 transitions. [2022-11-03 02:18:02,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:02,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 7712 transitions. [2022-11-03 02:18:02,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 02:18:02,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:02,156 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:02,209 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:18:02,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-03 02:18:02,378 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:18:02,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:02,378 INFO L85 PathProgramCache]: Analyzing trace with hash 367714936, now seen corresponding path program 1 times [2022-11-03 02:18:02,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:02,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779533313] [2022-11-03 02:18:02,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:02,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:18:02,442 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:02,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779533313] [2022-11-03 02:18:02,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779533313] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:02,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:02,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:18:02,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168026408] [2022-11-03 02:18:02,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:02,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:18:02,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:02,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:18:02,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:18:02,445 INFO L87 Difference]: Start difference. First operand 2696 states and 7712 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:02,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:02,613 INFO L93 Difference]: Finished difference Result 2576 states and 7277 transitions. [2022-11-03 02:18:02,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:18:02,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-03 02:18:02,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:02,625 INFO L225 Difference]: With dead ends: 2576 [2022-11-03 02:18:02,625 INFO L226 Difference]: Without dead ends: 2576 [2022-11-03 02:18:02,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:18:02,626 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 42 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:02,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 9 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:18:02,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2022-11-03 02:18:02,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 2093. [2022-11-03 02:18:02,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2093 states, 2065 states have (on average 2.864406779661017) internal successors, (5915), 2092 states have internal predecessors, (5915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:02,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 5915 transitions. [2022-11-03 02:18:02,686 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 5915 transitions. Word has length 20 [2022-11-03 02:18:02,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:02,687 INFO L495 AbstractCegarLoop]: Abstraction has 2093 states and 5915 transitions. [2022-11-03 02:18:02,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:02,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 5915 transitions. [2022-11-03 02:18:02,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:18:02,689 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:02,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:02,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-03 02:18:02,690 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:18:02,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:02,690 INFO L85 PathProgramCache]: Analyzing trace with hash -2014158432, now seen corresponding path program 1 times [2022-11-03 02:18:02,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:02,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5216304] [2022-11-03 02:18:02,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:02,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:04,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:04,185 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:04,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5216304] [2022-11-03 02:18:04,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5216304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:04,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:04,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 02:18:04,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666224414] [2022-11-03 02:18:04,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:04,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 02:18:04,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:04,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 02:18:04,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:18:04,187 INFO L87 Difference]: Start difference. First operand 2093 states and 5915 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:05,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:05,506 INFO L93 Difference]: Finished difference Result 2331 states and 6549 transitions. [2022-11-03 02:18:05,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 02:18:05,506 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-03 02:18:05,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:05,521 INFO L225 Difference]: With dead ends: 2331 [2022-11-03 02:18:05,522 INFO L226 Difference]: Without dead ends: 2331 [2022-11-03 02:18:05,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:18:05,524 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 84 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:05,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 65 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-03 02:18:05,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2331 states. [2022-11-03 02:18:05,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2331 to 2301. [2022-11-03 02:18:05,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2301 states, 2273 states have (on average 2.853497580290365) internal successors, (6486), 2300 states have internal predecessors, (6486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:05,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 2301 states and 6486 transitions. [2022-11-03 02:18:05,595 INFO L78 Accepts]: Start accepts. Automaton has 2301 states and 6486 transitions. Word has length 21 [2022-11-03 02:18:05,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:05,595 INFO L495 AbstractCegarLoop]: Abstraction has 2301 states and 6486 transitions. [2022-11-03 02:18:05,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:05,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 6486 transitions. [2022-11-03 02:18:05,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:18:05,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:05,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:05,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-03 02:18:05,598 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:18:05,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:05,599 INFO L85 PathProgramCache]: Analyzing trace with hash -2014158431, now seen corresponding path program 1 times [2022-11-03 02:18:05,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:05,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864755937] [2022-11-03 02:18:05,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:05,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:06,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:06,129 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:06,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864755937] [2022-11-03 02:18:06,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864755937] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:06,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:06,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:18:06,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824048965] [2022-11-03 02:18:06,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:06,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 02:18:06,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:06,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 02:18:06,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:18:06,131 INFO L87 Difference]: Start difference. First operand 2301 states and 6486 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:07,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:07,223 INFO L93 Difference]: Finished difference Result 4022 states and 11193 transitions. [2022-11-03 02:18:07,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 02:18:07,224 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-03 02:18:07,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:07,232 INFO L225 Difference]: With dead ends: 4022 [2022-11-03 02:18:07,232 INFO L226 Difference]: Without dead ends: 4022 [2022-11-03 02:18:07,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2022-11-03 02:18:07,233 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 486 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:07,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 79 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 02:18:07,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4022 states. [2022-11-03 02:18:07,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4022 to 3141. [2022-11-03 02:18:07,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 3113 states have (on average 2.8991326694506907) internal successors, (9025), 3140 states have internal predecessors, (9025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:07,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 9025 transitions. [2022-11-03 02:18:07,325 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 9025 transitions. Word has length 21 [2022-11-03 02:18:07,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:07,325 INFO L495 AbstractCegarLoop]: Abstraction has 3141 states and 9025 transitions. [2022-11-03 02:18:07,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:07,326 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 9025 transitions. [2022-11-03 02:18:07,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:18:07,328 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:07,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:07,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-03 02:18:07,329 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:18:07,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:07,329 INFO L85 PathProgramCache]: Analyzing trace with hash -2000314810, now seen corresponding path program 1 times [2022-11-03 02:18:07,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:07,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761594297] [2022-11-03 02:18:07,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:07,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:08,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:08,450 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:08,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761594297] [2022-11-03 02:18:08,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761594297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:08,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:08,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 02:18:08,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025529824] [2022-11-03 02:18:08,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:08,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 02:18:08,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:08,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 02:18:08,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-11-03 02:18:08,452 INFO L87 Difference]: Start difference. First operand 3141 states and 9025 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 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 02:18:09,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:09,161 INFO L93 Difference]: Finished difference Result 3186 states and 9129 transitions. [2022-11-03 02:18:09,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:18:09,162 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 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 22 [2022-11-03 02:18:09,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:09,168 INFO L225 Difference]: With dead ends: 3186 [2022-11-03 02:18:09,168 INFO L226 Difference]: Without dead ends: 3186 [2022-11-03 02:18:09,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2022-11-03 02:18:09,169 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 160 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:09,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 60 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:18:09,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3186 states. [2022-11-03 02:18:09,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3186 to 2961. [2022-11-03 02:18:09,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2961 states, 2933 states have (on average 2.907944084555063) internal successors, (8529), 2960 states have internal predecessors, (8529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:09,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2961 states to 2961 states and 8529 transitions. [2022-11-03 02:18:09,234 INFO L78 Accepts]: Start accepts. Automaton has 2961 states and 8529 transitions. Word has length 22 [2022-11-03 02:18:09,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:09,235 INFO L495 AbstractCegarLoop]: Abstraction has 2961 states and 8529 transitions. [2022-11-03 02:18:09,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 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 02:18:09,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2961 states and 8529 transitions. [2022-11-03 02:18:09,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:18:09,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:09,237 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:09,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-03 02:18:09,237 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:18:09,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:09,238 INFO L85 PathProgramCache]: Analyzing trace with hash -2099770406, now seen corresponding path program 2 times [2022-11-03 02:18:09,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:09,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101610993] [2022-11-03 02:18:09,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:09,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:10,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:10,322 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:10,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101610993] [2022-11-03 02:18:10,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101610993] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:10,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:10,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 02:18:10,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827392264] [2022-11-03 02:18:10,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:10,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 02:18:10,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:10,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 02:18:10,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-11-03 02:18:10,325 INFO L87 Difference]: Start difference. First operand 2961 states and 8529 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 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 02:18:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:11,412 INFO L93 Difference]: Finished difference Result 3550 states and 10087 transitions. [2022-11-03 02:18:11,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:18:11,413 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 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 22 [2022-11-03 02:18:11,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:11,424 INFO L225 Difference]: With dead ends: 3550 [2022-11-03 02:18:11,424 INFO L226 Difference]: Without dead ends: 3550 [2022-11-03 02:18:11,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2022-11-03 02:18:11,426 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 226 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:11,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 76 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 02:18:11,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3550 states. [2022-11-03 02:18:11,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3550 to 3320. [2022-11-03 02:18:11,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3320 states, 3292 states have (on average 2.9158566221142164) internal successors, (9599), 3319 states have internal predecessors, (9599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:11,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3320 states to 3320 states and 9599 transitions. [2022-11-03 02:18:11,521 INFO L78 Accepts]: Start accepts. Automaton has 3320 states and 9599 transitions. Word has length 22 [2022-11-03 02:18:11,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:11,521 INFO L495 AbstractCegarLoop]: Abstraction has 3320 states and 9599 transitions. [2022-11-03 02:18:11,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 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 02:18:11,522 INFO L276 IsEmpty]: Start isEmpty. Operand 3320 states and 9599 transitions. [2022-11-03 02:18:11,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:18:11,524 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:11,525 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:11,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-03 02:18:11,525 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:18:11,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:11,526 INFO L85 PathProgramCache]: Analyzing trace with hash -2099770405, now seen corresponding path program 1 times [2022-11-03 02:18:11,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:11,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440431948] [2022-11-03 02:18:11,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:11,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:12,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:12,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:12,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440431948] [2022-11-03 02:18:12,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440431948] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:12,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:12,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 02:18:12,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237093635] [2022-11-03 02:18:12,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:12,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 02:18:12,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:12,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 02:18:12,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:18:12,180 INFO L87 Difference]: Start difference. First operand 3320 states and 9599 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 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 02:18:13,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:13,733 INFO L93 Difference]: Finished difference Result 4414 states and 12453 transitions. [2022-11-03 02:18:13,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:18:13,734 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 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 22 [2022-11-03 02:18:13,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:13,743 INFO L225 Difference]: With dead ends: 4414 [2022-11-03 02:18:13,743 INFO L226 Difference]: Without dead ends: 4414 [2022-11-03 02:18:13,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2022-11-03 02:18:13,744 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 438 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:13,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 71 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-03 02:18:13,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4414 states. [2022-11-03 02:18:13,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4414 to 2998. [2022-11-03 02:18:13,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2998 states, 2970 states have (on average 2.9154882154882156) internal successors, (8659), 2997 states have internal predecessors, (8659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:13,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2998 states to 2998 states and 8659 transitions. [2022-11-03 02:18:13,812 INFO L78 Accepts]: Start accepts. Automaton has 2998 states and 8659 transitions. Word has length 22 [2022-11-03 02:18:13,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:13,812 INFO L495 AbstractCegarLoop]: Abstraction has 2998 states and 8659 transitions. [2022-11-03 02:18:13,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 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 02:18:13,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2998 states and 8659 transitions. [2022-11-03 02:18:13,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:18:13,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:13,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:13,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-03 02:18:13,815 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:18:13,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:13,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1969734480, now seen corresponding path program 3 times [2022-11-03 02:18:13,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:13,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066848801] [2022-11-03 02:18:13,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:13,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:15,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:15,350 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:15,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066848801] [2022-11-03 02:18:15,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066848801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:15,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:15,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-03 02:18:15,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940174663] [2022-11-03 02:18:15,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:15,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 02:18:15,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:15,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 02:18:15,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:18:15,352 INFO L87 Difference]: Start difference. First operand 2998 states and 8659 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 02:18:16,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:16,685 INFO L93 Difference]: Finished difference Result 3239 states and 9192 transitions. [2022-11-03 02:18:16,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:18:16,686 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 22 [2022-11-03 02:18:16,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:16,691 INFO L225 Difference]: With dead ends: 3239 [2022-11-03 02:18:16,691 INFO L226 Difference]: Without dead ends: 3239 [2022-11-03 02:18:16,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2022-11-03 02:18:16,692 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 182 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:16,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 89 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-03 02:18:16,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3239 states. [2022-11-03 02:18:16,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3239 to 2983. [2022-11-03 02:18:16,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2983 states, 2955 states have (on average 2.9170896785109983) internal successors, (8620), 2982 states have internal predecessors, (8620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:16,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 8620 transitions. [2022-11-03 02:18:16,734 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 8620 transitions. Word has length 22 [2022-11-03 02:18:16,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:16,735 INFO L495 AbstractCegarLoop]: Abstraction has 2983 states and 8620 transitions. [2022-11-03 02:18:16,735 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 02:18:16,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 8620 transitions. [2022-11-03 02:18:16,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:18:16,736 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:16,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:16,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-03 02:18:16,736 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:18:16,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:16,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1992170610, now seen corresponding path program 4 times [2022-11-03 02:18:16,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:16,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609900731] [2022-11-03 02:18:16,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:16,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:17,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:17,536 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:17,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609900731] [2022-11-03 02:18:17,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609900731] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:17,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:17,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 02:18:17,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204879714] [2022-11-03 02:18:17,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:17,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 02:18:17,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:17,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 02:18:17,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-11-03 02:18:17,538 INFO L87 Difference]: Start difference. First operand 2983 states and 8620 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 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 02:18:18,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:18,356 INFO L93 Difference]: Finished difference Result 2746 states and 7848 transitions. [2022-11-03 02:18:18,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:18:18,357 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 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 22 [2022-11-03 02:18:18,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:18,362 INFO L225 Difference]: With dead ends: 2746 [2022-11-03 02:18:18,362 INFO L226 Difference]: Without dead ends: 2746 [2022-11-03 02:18:18,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2022-11-03 02:18:18,363 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 142 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:18,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 77 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 02:18:18,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2022-11-03 02:18:18,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2666. [2022-11-03 02:18:18,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2666 states, 2638 states have (on average 2.8968915845337375) internal successors, (7642), 2665 states have internal predecessors, (7642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:18,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2666 states and 7642 transitions. [2022-11-03 02:18:18,425 INFO L78 Accepts]: Start accepts. Automaton has 2666 states and 7642 transitions. Word has length 22 [2022-11-03 02:18:18,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:18,425 INFO L495 AbstractCegarLoop]: Abstraction has 2666 states and 7642 transitions. [2022-11-03 02:18:18,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 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 02:18:18,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 7642 transitions. [2022-11-03 02:18:18,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 02:18:18,427 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:18,427 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:18,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-03 02:18:18,427 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:18:18,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:18,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1628691854, now seen corresponding path program 1 times [2022-11-03 02:18:18,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:18,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087392224] [2022-11-03 02:18:18,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:18,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:18,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:18,501 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:18,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087392224] [2022-11-03 02:18:18,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087392224] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:18,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:18,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:18:18,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438307164] [2022-11-03 02:18:18,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:18,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:18:18,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:18,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:18:18,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:18:18,503 INFO L87 Difference]: Start difference. First operand 2666 states and 7642 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:18,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:18,617 INFO L93 Difference]: Finished difference Result 966 states and 2526 transitions. [2022-11-03 02:18:18,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:18:18,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-03 02:18:18,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:18,620 INFO L225 Difference]: With dead ends: 966 [2022-11-03 02:18:18,620 INFO L226 Difference]: Without dead ends: 886 [2022-11-03 02:18:18,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:18:18,621 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:18,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 11 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:18:18,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2022-11-03 02:18:18,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 658. [2022-11-03 02:18:18,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 642 states have (on average 2.5576323987538943) internal successors, (1642), 657 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:18,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1642 transitions. [2022-11-03 02:18:18,637 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1642 transitions. Word has length 31 [2022-11-03 02:18:18,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:18,637 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 1642 transitions. [2022-11-03 02:18:18,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:18,638 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1642 transitions. [2022-11-03 02:18:18,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-03 02:18:18,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:18,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:18,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-03 02:18:18,640 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:18:18,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:18,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1406668626, now seen corresponding path program 1 times [2022-11-03 02:18:18,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:18,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195310973] [2022-11-03 02:18:18,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:18,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:18,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:18,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:18,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195310973] [2022-11-03 02:18:18,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195310973] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:18,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:18,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:18:18,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728322550] [2022-11-03 02:18:18,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:18,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:18:18,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:18,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:18:18,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:18:18,727 INFO L87 Difference]: Start difference. First operand 658 states and 1642 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:18,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:18,837 INFO L93 Difference]: Finished difference Result 458 states and 1006 transitions. [2022-11-03 02:18:18,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:18:18,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-03 02:18:18,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:18,839 INFO L225 Difference]: With dead ends: 458 [2022-11-03 02:18:18,839 INFO L226 Difference]: Without dead ends: 440 [2022-11-03 02:18:18,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:18:18,839 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 44 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:18,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 4 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:18:18,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-11-03 02:18:18,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2022-11-03 02:18:18,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 432 states have (on average 2.2453703703703702) internal successors, (970), 439 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:18,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 970 transitions. [2022-11-03 02:18:18,847 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 970 transitions. Word has length 32 [2022-11-03 02:18:18,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:18,848 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 970 transitions. [2022-11-03 02:18:18,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:18,848 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 970 transitions. [2022-11-03 02:18:18,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 02:18:18,849 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:18,849 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:18,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-03 02:18:18,850 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:18:18,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:18,850 INFO L85 PathProgramCache]: Analyzing trace with hash -733889250, now seen corresponding path program 1 times [2022-11-03 02:18:18,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:18,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916468632] [2022-11-03 02:18:18,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:18,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:19,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:19,650 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:19,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916468632] [2022-11-03 02:18:19,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916468632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:19,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:19,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-03 02:18:19,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457670754] [2022-11-03 02:18:19,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:19,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 02:18:19,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:19,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 02:18:19,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:18:19,653 INFO L87 Difference]: Start difference. First operand 440 states and 970 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 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 02:18:20,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:20,936 INFO L93 Difference]: Finished difference Result 889 states and 1965 transitions. [2022-11-03 02:18:20,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 02:18:20,937 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 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 33 [2022-11-03 02:18:20,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:20,938 INFO L225 Difference]: With dead ends: 889 [2022-11-03 02:18:20,938 INFO L226 Difference]: Without dead ends: 889 [2022-11-03 02:18:20,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=251, Invalid=679, Unknown=0, NotChecked=0, Total=930 [2022-11-03 02:18:20,939 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 353 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:20,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 69 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 02:18:20,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2022-11-03 02:18:20,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 636. [2022-11-03 02:18:20,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 628 states have (on average 2.254777070063694) internal successors, (1416), 635 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:20,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1416 transitions. [2022-11-03 02:18:20,952 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1416 transitions. Word has length 33 [2022-11-03 02:18:20,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:20,953 INFO L495 AbstractCegarLoop]: Abstraction has 636 states and 1416 transitions. [2022-11-03 02:18:20,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 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 02:18:20,953 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1416 transitions. [2022-11-03 02:18:20,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 02:18:20,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:20,955 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:20,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-03 02:18:20,955 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:18:20,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:20,956 INFO L85 PathProgramCache]: Analyzing trace with hash -733889249, now seen corresponding path program 1 times [2022-11-03 02:18:20,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:20,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172079847] [2022-11-03 02:18:20,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:20,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:21,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:21,379 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:21,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172079847] [2022-11-03 02:18:21,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172079847] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:21,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:21,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:18:21,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069467706] [2022-11-03 02:18:21,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:21,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:18:21,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:21,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:18:21,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:18:21,383 INFO L87 Difference]: Start difference. First operand 636 states and 1416 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 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 02:18:21,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:21,671 INFO L93 Difference]: Finished difference Result 748 states and 1656 transitions. [2022-11-03 02:18:21,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:18:21,672 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 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 33 [2022-11-03 02:18:21,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:21,673 INFO L225 Difference]: With dead ends: 748 [2022-11-03 02:18:21,674 INFO L226 Difference]: Without dead ends: 748 [2022-11-03 02:18:21,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:18:21,674 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 116 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:21,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 28 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:18:21,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2022-11-03 02:18:21,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 732. [2022-11-03 02:18:21,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 724 states have (on average 2.251381215469613) internal successors, (1630), 731 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:21,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1630 transitions. [2022-11-03 02:18:21,688 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1630 transitions. Word has length 33 [2022-11-03 02:18:21,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:21,689 INFO L495 AbstractCegarLoop]: Abstraction has 732 states and 1630 transitions. [2022-11-03 02:18:21,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 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 02:18:21,689 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1630 transitions. [2022-11-03 02:18:21,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 02:18:21,691 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:21,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:21,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-03 02:18:21,691 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:18:21,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:21,692 INFO L85 PathProgramCache]: Analyzing trace with hash -831709690, now seen corresponding path program 2 times [2022-11-03 02:18:21,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:21,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290779638] [2022-11-03 02:18:21,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:21,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:23,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:23,262 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:23,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290779638] [2022-11-03 02:18:23,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290779638] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:23,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:23,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-03 02:18:23,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198181933] [2022-11-03 02:18:23,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:23,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-03 02:18:23,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:23,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-03 02:18:23,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-11-03 02:18:23,264 INFO L87 Difference]: Start difference. First operand 732 states and 1630 transitions. Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 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 02:18:24,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:24,730 INFO L93 Difference]: Finished difference Result 926 states and 2065 transitions. [2022-11-03 02:18:24,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 02:18:24,731 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 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 33 [2022-11-03 02:18:24,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:24,733 INFO L225 Difference]: With dead ends: 926 [2022-11-03 02:18:24,733 INFO L226 Difference]: Without dead ends: 926 [2022-11-03 02:18:24,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2022-11-03 02:18:24,734 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 117 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 1596 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:24,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 118 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1596 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-03 02:18:24,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2022-11-03 02:18:24,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 717. [2022-11-03 02:18:24,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 709 states have (on average 2.2566995768688294) internal successors, (1600), 716 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:24,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1600 transitions. [2022-11-03 02:18:24,747 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1600 transitions. Word has length 33 [2022-11-03 02:18:24,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:24,747 INFO L495 AbstractCegarLoop]: Abstraction has 717 states and 1600 transitions. [2022-11-03 02:18:24,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 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 02:18:24,748 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1600 transitions. [2022-11-03 02:18:24,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 02:18:24,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:24,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:24,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-03 02:18:24,749 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:18:24,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:24,750 INFO L85 PathProgramCache]: Analyzing trace with hash 968683978, now seen corresponding path program 3 times [2022-11-03 02:18:24,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:24,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797421238] [2022-11-03 02:18:24,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:24,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:26,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:26,123 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:26,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797421238] [2022-11-03 02:18:26,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797421238] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:26,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:26,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-03 02:18:26,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007964783] [2022-11-03 02:18:26,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:26,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-03 02:18:26,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:26,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-03 02:18:26,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2022-11-03 02:18:26,125 INFO L87 Difference]: Start difference. First operand 717 states and 1600 transitions. Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 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 02:18:27,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:27,428 INFO L93 Difference]: Finished difference Result 844 states and 1881 transitions. [2022-11-03 02:18:27,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 02:18:27,429 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 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 33 [2022-11-03 02:18:27,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:27,430 INFO L225 Difference]: With dead ends: 844 [2022-11-03 02:18:27,430 INFO L226 Difference]: Without dead ends: 844 [2022-11-03 02:18:27,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2022-11-03 02:18:27,431 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 165 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:27,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 93 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-03 02:18:27,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2022-11-03 02:18:27,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 650. [2022-11-03 02:18:27,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 642 states have (on average 2.2523364485981308) internal successors, (1446), 649 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:27,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1446 transitions. [2022-11-03 02:18:27,440 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1446 transitions. Word has length 33 [2022-11-03 02:18:27,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:27,440 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 1446 transitions. [2022-11-03 02:18:27,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 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 02:18:27,440 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1446 transitions. [2022-11-03 02:18:27,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 02:18:27,442 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:27,442 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:27,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-03 02:18:27,442 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:18:27,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:27,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1014820086, now seen corresponding path program 4 times [2022-11-03 02:18:27,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:27,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051792121] [2022-11-03 02:18:27,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:27,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:28,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:28,822 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:28,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051792121] [2022-11-03 02:18:28,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051792121] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:28,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:28,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-03 02:18:28,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690015227] [2022-11-03 02:18:28,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:28,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-03 02:18:28,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:28,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-03 02:18:28,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2022-11-03 02:18:28,824 INFO L87 Difference]: Start difference. First operand 650 states and 1446 transitions. Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 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 02:18:30,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:30,226 INFO L93 Difference]: Finished difference Result 718 states and 1589 transitions. [2022-11-03 02:18:30,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 02:18:30,227 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 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 33 [2022-11-03 02:18:30,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:30,228 INFO L225 Difference]: With dead ends: 718 [2022-11-03 02:18:30,228 INFO L226 Difference]: Without dead ends: 718 [2022-11-03 02:18:30,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2022-11-03 02:18:30,229 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 159 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:30,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 106 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1437 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-03 02:18:30,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2022-11-03 02:18:30,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 604. [2022-11-03 02:18:30,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 596 states have (on average 2.2449664429530203) internal successors, (1338), 603 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:30,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1338 transitions. [2022-11-03 02:18:30,238 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1338 transitions. Word has length 33 [2022-11-03 02:18:30,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:30,238 INFO L495 AbstractCegarLoop]: Abstraction has 604 states and 1338 transitions. [2022-11-03 02:18:30,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 18 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 02:18:30,238 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1338 transitions. [2022-11-03 02:18:30,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 02:18:30,239 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:30,239 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:30,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-03 02:18:30,240 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:18:30,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:30,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1290180387, now seen corresponding path program 2 times [2022-11-03 02:18:30,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:30,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750403848] [2022-11-03 02:18:30,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:30,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:30,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:30,868 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:30,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750403848] [2022-11-03 02:18:30,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750403848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:30,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:30,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:18:30,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007441243] [2022-11-03 02:18:30,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:30,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 02:18:30,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:30,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 02:18:30,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:18:30,870 INFO L87 Difference]: Start difference. First operand 604 states and 1338 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 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 02:18:31,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:31,305 INFO L93 Difference]: Finished difference Result 596 states and 1321 transitions. [2022-11-03 02:18:31,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:18:31,305 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 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 33 [2022-11-03 02:18:31,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:31,307 INFO L225 Difference]: With dead ends: 596 [2022-11-03 02:18:31,307 INFO L226 Difference]: Without dead ends: 596 [2022-11-03 02:18:31,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-11-03 02:18:31,308 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 195 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:31,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 26 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:18:31,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-11-03 02:18:31,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 500. [2022-11-03 02:18:31,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 493 states have (on average 2.2454361054766734) internal successors, (1107), 499 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:31,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1107 transitions. [2022-11-03 02:18:31,335 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1107 transitions. Word has length 33 [2022-11-03 02:18:31,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:31,335 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 1107 transitions. [2022-11-03 02:18:31,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 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 02:18:31,336 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1107 transitions. [2022-11-03 02:18:31,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 02:18:31,337 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:31,337 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:31,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-03 02:18:31,337 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:18:31,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:31,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1909980202, now seen corresponding path program 1 times [2022-11-03 02:18:31,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:31,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391914600] [2022-11-03 02:18:31,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:31,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:33,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:33,004 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:33,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391914600] [2022-11-03 02:18:33,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391914600] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:33,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:33,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-03 02:18:33,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567404193] [2022-11-03 02:18:33,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:33,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 02:18:33,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:33,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 02:18:33,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:18:33,006 INFO L87 Difference]: Start difference. First operand 500 states and 1107 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 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 02:18:34,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:34,036 INFO L93 Difference]: Finished difference Result 792 states and 1756 transitions. [2022-11-03 02:18:34,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 02:18:34,037 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 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 36 [2022-11-03 02:18:34,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:34,038 INFO L225 Difference]: With dead ends: 792 [2022-11-03 02:18:34,038 INFO L226 Difference]: Without dead ends: 792 [2022-11-03 02:18:34,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-11-03 02:18:34,039 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 184 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:34,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 56 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 02:18:34,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2022-11-03 02:18:34,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 730. [2022-11-03 02:18:34,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 723 states have (on average 2.2461964038727524) internal successors, (1624), 729 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:34,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1624 transitions. [2022-11-03 02:18:34,049 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1624 transitions. Word has length 36 [2022-11-03 02:18:34,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:34,050 INFO L495 AbstractCegarLoop]: Abstraction has 730 states and 1624 transitions. [2022-11-03 02:18:34,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 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 02:18:34,050 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1624 transitions. [2022-11-03 02:18:34,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 02:18:34,052 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:34,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:34,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-03 02:18:34,052 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:18:34,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:34,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1909980301, now seen corresponding path program 1 times [2022-11-03 02:18:34,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:34,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346301265] [2022-11-03 02:18:34,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:34,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:36,054 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:36,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346301265] [2022-11-03 02:18:36,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346301265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:36,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:36,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-03 02:18:36,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759119177] [2022-11-03 02:18:36,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:36,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 02:18:36,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:36,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 02:18:36,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:18:36,055 INFO L87 Difference]: Start difference. First operand 730 states and 1624 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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 02:18:37,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:37,156 INFO L93 Difference]: Finished difference Result 734 states and 1620 transitions. [2022-11-03 02:18:37,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:18:37,157 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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 36 [2022-11-03 02:18:37,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:37,158 INFO L225 Difference]: With dead ends: 734 [2022-11-03 02:18:37,158 INFO L226 Difference]: Without dead ends: 693 [2022-11-03 02:18:37,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2022-11-03 02:18:37,158 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 144 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:37,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 46 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-03 02:18:37,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2022-11-03 02:18:37,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 689. [2022-11-03 02:18:37,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 682 states have (on average 2.228739002932551) internal successors, (1520), 688 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1520 transitions. [2022-11-03 02:18:37,167 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1520 transitions. Word has length 36 [2022-11-03 02:18:37,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:37,167 INFO L495 AbstractCegarLoop]: Abstraction has 689 states and 1520 transitions. [2022-11-03 02:18:37,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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 02:18:37,167 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1520 transitions. [2022-11-03 02:18:37,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 02:18:37,169 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:37,169 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:37,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-03 02:18:37,169 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:18:37,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:37,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1442134254, now seen corresponding path program 2 times [2022-11-03 02:18:37,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:37,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184211959] [2022-11-03 02:18:37,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:37,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:38,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:38,623 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:38,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184211959] [2022-11-03 02:18:38,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184211959] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:38,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:38,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-03 02:18:38,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051782626] [2022-11-03 02:18:38,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:38,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 02:18:38,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:38,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 02:18:38,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:18:38,625 INFO L87 Difference]: Start difference. First operand 689 states and 1520 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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 02:18:39,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:39,392 INFO L93 Difference]: Finished difference Result 898 states and 1983 transitions. [2022-11-03 02:18:39,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 02:18:39,393 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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 36 [2022-11-03 02:18:39,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:39,395 INFO L225 Difference]: With dead ends: 898 [2022-11-03 02:18:39,395 INFO L226 Difference]: Without dead ends: 857 [2022-11-03 02:18:39,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2022-11-03 02:18:39,396 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 147 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:39,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 54 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:18:39,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2022-11-03 02:18:39,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 664. [2022-11-03 02:18:39,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 657 states have (on average 2.2374429223744294) internal successors, (1470), 663 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:39,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1470 transitions. [2022-11-03 02:18:39,414 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1470 transitions. Word has length 36 [2022-11-03 02:18:39,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:39,414 INFO L495 AbstractCegarLoop]: Abstraction has 664 states and 1470 transitions. [2022-11-03 02:18:39,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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 02:18:39,415 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1470 transitions. [2022-11-03 02:18:39,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 02:18:39,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:39,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:39,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-03 02:18:39,417 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:18:39,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:39,417 INFO L85 PathProgramCache]: Analyzing trace with hash 180256682, now seen corresponding path program 3 times [2022-11-03 02:18:39,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:39,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651195086] [2022-11-03 02:18:39,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:39,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:40,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:40,777 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:40,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651195086] [2022-11-03 02:18:40,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651195086] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:40,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:40,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-03 02:18:40,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412669667] [2022-11-03 02:18:40,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:40,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 02:18:40,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:40,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 02:18:40,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:18:40,778 INFO L87 Difference]: Start difference. First operand 664 states and 1470 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 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 02:18:41,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:41,472 INFO L93 Difference]: Finished difference Result 856 states and 1895 transitions. [2022-11-03 02:18:41,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 02:18:41,472 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 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 36 [2022-11-03 02:18:41,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:41,474 INFO L225 Difference]: With dead ends: 856 [2022-11-03 02:18:41,474 INFO L226 Difference]: Without dead ends: 856 [2022-11-03 02:18:41,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2022-11-03 02:18:41,475 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 146 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:41,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 67 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:18:41,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2022-11-03 02:18:41,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 794. [2022-11-03 02:18:41,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 787 states have (on average 2.2401524777636594) internal successors, (1763), 793 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:41,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1763 transitions. [2022-11-03 02:18:41,488 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1763 transitions. Word has length 36 [2022-11-03 02:18:41,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:41,489 INFO L495 AbstractCegarLoop]: Abstraction has 794 states and 1763 transitions. [2022-11-03 02:18:41,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 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 02:18:41,489 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1763 transitions. [2022-11-03 02:18:41,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 02:18:41,490 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:41,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:41,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-03 02:18:41,491 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:18:41,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:41,491 INFO L85 PathProgramCache]: Analyzing trace with hash 180256583, now seen corresponding path program 2 times [2022-11-03 02:18:41,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:41,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344033395] [2022-11-03 02:18:41,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:41,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:42,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:42,856 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:42,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344033395] [2022-11-03 02:18:42,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344033395] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:42,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:42,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-03 02:18:42,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038202246] [2022-11-03 02:18:42,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:42,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 02:18:42,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:42,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 02:18:42,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:18:42,857 INFO L87 Difference]: Start difference. First operand 794 states and 1763 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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 02:18:43,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:43,596 INFO L93 Difference]: Finished difference Result 903 states and 1990 transitions. [2022-11-03 02:18:43,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:18:43,596 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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 36 [2022-11-03 02:18:43,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:43,597 INFO L225 Difference]: With dead ends: 903 [2022-11-03 02:18:43,597 INFO L226 Difference]: Without dead ends: 821 [2022-11-03 02:18:43,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2022-11-03 02:18:43,598 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 123 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:43,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 50 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:18:43,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2022-11-03 02:18:43,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 564. [2022-11-03 02:18:43,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 557 states have (on average 2.236983842010772) internal successors, (1246), 563 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:43,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 1246 transitions. [2022-11-03 02:18:43,606 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 1246 transitions. Word has length 36 [2022-11-03 02:18:43,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:43,607 INFO L495 AbstractCegarLoop]: Abstraction has 564 states and 1246 transitions. [2022-11-03 02:18:43,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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 02:18:43,607 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 1246 transitions. [2022-11-03 02:18:43,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 02:18:43,608 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:43,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:43,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-03 02:18:43,608 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:18:43,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:43,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1530103166, now seen corresponding path program 4 times [2022-11-03 02:18:43,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:43,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436920543] [2022-11-03 02:18:43,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:43,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:44,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:44,970 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:44,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436920543] [2022-11-03 02:18:44,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436920543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:18:44,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:18:44,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-03 02:18:44,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734039484] [2022-11-03 02:18:44,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:18:44,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 02:18:44,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:18:44,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 02:18:44,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-03 02:18:44,971 INFO L87 Difference]: Start difference. First operand 564 states and 1246 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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 02:18:45,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:18:45,800 INFO L93 Difference]: Finished difference Result 592 states and 1301 transitions. [2022-11-03 02:18:45,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:18:45,800 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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 36 [2022-11-03 02:18:45,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:18:45,801 INFO L225 Difference]: With dead ends: 592 [2022-11-03 02:18:45,801 INFO L226 Difference]: Without dead ends: 550 [2022-11-03 02:18:45,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2022-11-03 02:18:45,802 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 139 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:18:45,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 61 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:18:45,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-11-03 02:18:45,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 482. [2022-11-03 02:18:45,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 475 states have (on average 2.231578947368421) internal successors, (1060), 481 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:18:45,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1060 transitions. [2022-11-03 02:18:45,813 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1060 transitions. Word has length 36 [2022-11-03 02:18:45,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:18:45,813 INFO L495 AbstractCegarLoop]: Abstraction has 482 states and 1060 transitions. [2022-11-03 02:18:45,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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 02:18:45,814 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1060 transitions. [2022-11-03 02:18:45,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-03 02:18:45,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:18:45,814 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:18:45,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-11-03 02:18:45,815 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:18:45,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:18:45,815 INFO L85 PathProgramCache]: Analyzing trace with hash 835479563, now seen corresponding path program 1 times [2022-11-03 02:18:45,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:18:45,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892635698] [2022-11-03 02:18:45,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:45,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:18:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:46,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:18:46,397 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:18:46,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892635698] [2022-11-03 02:18:46,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892635698] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:18:46,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399243098] [2022-11-03 02:18:46,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:18:46,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:18:46,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:18:46,399 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:18:46,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 02:18:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:18:46,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-03 02:18:46,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:18:46,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:18:46,893 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 02:18:46,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:18:46,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:18:47,055 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:18:47,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2022-11-03 02:18:47,113 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 02:18:47,216 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-03 02:18:47,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-03 02:18:47,316 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 02:18:47,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:19:06,152 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_2265 Int) (v_ArrVal_2267 Int) (v_ArrVal_2264 (Array Int Int)) (v_ArrVal_2270 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2264) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (+ v_ArrVal_2265 1) (select .cse0 .cse1)) (< 0 (+ 2147483650 (select (store (store (store .cse0 .cse1 v_ArrVal_2265) (+ |c_~#queue~0.offset| 80) v_ArrVal_2267) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_2270) .cse1))) (< (+ v_ArrVal_2270 2147483648) 0)))) is different from false [2022-11-03 02:19:06,175 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_2262 Int) (v_ArrVal_2265 Int) (v_ArrVal_2267 Int) (v_ArrVal_2264 (Array Int Int)) (v_ArrVal_2270 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2262)) |c_~#stored_elements~0.base| v_ArrVal_2264) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< 0 (+ (select (store (store (store .cse0 .cse1 v_ArrVal_2265) (+ |c_~#queue~0.offset| 80) v_ArrVal_2267) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_2270) .cse1) 2147483650)) (< (+ v_ArrVal_2265 1) (select .cse0 .cse1)) (< (+ v_ArrVal_2270 2147483648) 0)))) is different from false [2022-11-03 02:19:06,236 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:19:06,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 66 [2022-11-03 02:19:06,254 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:19:06,254 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 104 treesize of output 106 [2022-11-03 02:19:06,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-11-03 02:19:06,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-03 02:19:06,323 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:19:06,323 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 57 treesize of output 57 [2022-11-03 02:19:06,459 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 02:19:06,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399243098] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:19:06,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [257216100] [2022-11-03 02:19:06,474 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:19:06,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:19:06,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 29 [2022-11-03 02:19:06,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321954989] [2022-11-03 02:19:06,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:19:06,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 02:19:06,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:19:06,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 02:19:06,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=671, Unknown=21, NotChecked=110, Total=930 [2022-11-03 02:19:06,483 INFO L87 Difference]: Start difference. First operand 482 states and 1060 transitions. Second operand has 31 states, 30 states have (on average 4.6) internal successors, (138), 30 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:19:07,909 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (<= 0 (+ 2147483648 (select .cse2 .cse3))))) (and (<= 0 (+ 2147483648 (select (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ 88 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|)))) .cse0 (= |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 0) (let ((.cse1 (= 88 (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)))) (or (and .cse0 (not .cse1)) (and .cse1 (<= 0 (+ |c_t1Thread1of1ForFork0_enqueue_~x#1| 2147483648))))) (= |c_~#queue~0.offset| 0) (= |c_t2Thread1of1ForFork1_dequeue_~q#1.base| |c_~#queue~0.base|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_2270 Int)) (or (< 0 (+ 2147483650 (select (store .cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_2270) .cse3))) (not (<= |c_t1Thread1of1ForFork0_enqueue_~x#1| v_ArrVal_2270))))))) is different from false [2022-11-03 02:19:09,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:19:09,795 INFO L93 Difference]: Finished difference Result 1522 states and 3372 transitions. [2022-11-03 02:19:09,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-03 02:19:09,795 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.6) internal successors, (138), 30 states have internal predecessors, (138), 0 states have call successors, (0), 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 46 [2022-11-03 02:19:09,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:19:09,798 INFO L225 Difference]: With dead ends: 1522 [2022-11-03 02:19:09,798 INFO L226 Difference]: Without dead ends: 1522 [2022-11-03 02:19:09,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 71 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=623, Invalid=1916, Unknown=23, NotChecked=300, Total=2862 [2022-11-03 02:19:09,800 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 572 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 2586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1299 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:19:09,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 176 Invalid, 2586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1169 Invalid, 0 Unknown, 1299 Unchecked, 0.9s Time] [2022-11-03 02:19:09,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2022-11-03 02:19:09,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 834. [2022-11-03 02:19:09,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 827 states have (on average 2.3675937122128174) internal successors, (1958), 833 states have internal predecessors, (1958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:19:09,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1958 transitions. [2022-11-03 02:19:09,820 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1958 transitions. Word has length 46 [2022-11-03 02:19:09,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:19:09,820 INFO L495 AbstractCegarLoop]: Abstraction has 834 states and 1958 transitions. [2022-11-03 02:19:09,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.6) internal successors, (138), 30 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:19:09,820 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1958 transitions. [2022-11-03 02:19:09,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-03 02:19:09,822 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:19:09,822 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:19:09,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:19:10,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-11-03 02:19:10,037 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:19:10,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:19:10,038 INFO L85 PathProgramCache]: Analyzing trace with hash 835479479, now seen corresponding path program 1 times [2022-11-03 02:19:10,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:19:10,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697335685] [2022-11-03 02:19:10,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:19:10,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:19:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:19:12,119 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 02:19:12,119 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:19:12,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697335685] [2022-11-03 02:19:12,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697335685] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:19:12,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771133936] [2022-11-03 02:19:12,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:19:12,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:12,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:19:12,121 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:19:12,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 02:19:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:19:12,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-03 02:19:12,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:19:12,706 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 32 treesize of output 16 [2022-11-03 02:19:12,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:12,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-11-03 02:19:12,847 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:19:12,857 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-03 02:19:12,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 28 [2022-11-03 02:19:12,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:12,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-11-03 02:19:13,080 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:19:13,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2022-11-03 02:19:13,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:13,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2022-11-03 02:19:13,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:13,355 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:19:13,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2022-11-03 02:19:13,440 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:19:13,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2022-11-03 02:19:13,629 INFO L356 Elim1Store]: treesize reduction 69, result has 28.9 percent of original size [2022-11-03 02:19:13,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 49 [2022-11-03 02:19:13,678 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 02:19:13,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:19:17,492 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2410 Int) (v_ArrVal_2411 Int) (v_ArrVal_2407 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2406) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_2407 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2407) (+ |c_~#queue~0.offset| 80) v_ArrVal_2410) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_2411) .cse1) 2147483647)))) is different from false [2022-11-03 02:19:17,509 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2410 Int) (v_ArrVal_2411 Int) (v_ArrVal_2407 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2406) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_2407 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2407) (+ |c_~#queue~0.offset| 80) v_ArrVal_2410) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_2411) .cse1) 2147483647)))) is different from false [2022-11-03 02:19:17,524 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2410 Int) (v_ArrVal_2411 Int) (v_ArrVal_2407 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2406) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_2407 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2407) (+ |c_~#queue~0.offset| 80) v_ArrVal_2410) (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_2411) .cse1) 2147483647)))) is different from false [2022-11-03 02:19:17,593 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2410 Int) (v_ArrVal_2411 Int) (v_ArrVal_2402 Int) (v_ArrVal_2407 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2402) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2406) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< 2147483647 v_ArrVal_2402) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2407) (+ |c_~#queue~0.offset| 80) v_ArrVal_2410) (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_2411) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_2407 1))))) is different from false [2022-11-03 02:19:17,642 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2410 Int) (v_ArrVal_2400 Int) (v_ArrVal_2411 Int) (v_ArrVal_2402 Int) (v_ArrVal_2407 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2400)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2402) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2406) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (< 2147483647 v_ArrVal_2402) (< (select .cse0 .cse1) (+ v_ArrVal_2407 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2407) (+ |c_~#queue~0.offset| 80) v_ArrVal_2410) (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_2411) .cse1) 2147483647)))) is different from false [2022-11-03 02:19:17,664 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2410 Int) (v_ArrVal_2400 Int) (v_ArrVal_2411 Int) (v_ArrVal_2402 Int) (v_ArrVal_2407 Int)) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2400)))) (store (store .cse3 .cse1 v_ArrVal_2402) .cse2 (+ (select .cse3 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2406) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_2402) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2407) (+ |c_~#queue~0.offset| 80) v_ArrVal_2410) (+ (* 4 (select .cse0 .cse2)) |c_~#queue~0.offset|) v_ArrVal_2411) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_2407 1)))))) is different from false [2022-11-03 02:19:17,749 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2410 Int) (v_ArrVal_2399 (Array Int Int)) (v_ArrVal_2400 Int) (v_ArrVal_2411 Int) (v_ArrVal_2402 Int) (v_ArrVal_2407 Int)) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2399))) (store .cse3 |c_~#queue~0.base| (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2400)))) (store (store .cse4 .cse1 v_ArrVal_2402) .cse2 (+ (select .cse4 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2406) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_2407 1)) (< 2147483647 v_ArrVal_2402) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2407) (+ |c_~#queue~0.offset| 80) v_ArrVal_2410) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2411) .cse1) 2147483647))))) is different from false [2022-11-03 02:19:17,781 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2410 Int) (v_ArrVal_2399 (Array Int Int)) (v_ArrVal_2400 Int) (v_ArrVal_2411 Int) (v_ArrVal_2402 Int) (v_ArrVal_2407 Int)) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2399))) (store .cse3 |c_~#queue~0.base| (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_2400)))) (store (store .cse4 .cse1 v_ArrVal_2402) .cse2 (+ (select .cse4 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2406) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_2402) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2407) (+ |c_~#queue~0.offset| 80) v_ArrVal_2410) (+ |c_~#queue~0.offset| (* (select .cse0 .cse2) 4)) v_ArrVal_2411) .cse1) 2147483647) (< (select .cse0 .cse1) (+ v_ArrVal_2407 1)))))) is different from false [2022-11-03 02:19:17,817 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2410 Int) (v_ArrVal_2399 (Array Int Int)) (v_ArrVal_2400 Int) (v_ArrVal_2411 Int) (v_ArrVal_2402 Int) (v_ArrVal_2407 Int)) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2399))) (store .cse3 |c_~#queue~0.base| (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_2400)))) (store (store .cse4 .cse1 v_ArrVal_2402) .cse2 (+ (select .cse4 .cse2) 1))))) |c_~#stored_elements~0.base| v_ArrVal_2406) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_2407 1)) (< 2147483647 v_ArrVal_2402) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2407) (+ |c_~#queue~0.offset| 80) v_ArrVal_2410) (+ |c_~#queue~0.offset| (* (select .cse0 .cse2) 4)) v_ArrVal_2411) .cse1) 2147483647))))) is different from false [2022-11-03 02:19:17,879 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:19:17,880 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 524 treesize of output 260 [2022-11-03 02:19:17,895 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:19:17,896 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 320 treesize of output 314 [2022-11-03 02:19:17,910 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:19:17,911 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 299 treesize of output 275 [2022-11-03 02:19:17,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2022-11-03 02:19:17,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-03 02:19:17,985 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:19:17,985 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 87 treesize of output 83 [2022-11-03 02:19:18,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-03 02:19:18,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771133936] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:19:18,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [94095440] [2022-11-03 02:19:18,257 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:19:18,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:19:18,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 19] total 57 [2022-11-03 02:19:18,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900910156] [2022-11-03 02:19:18,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:19:18,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-03 02:19:18,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:19:18,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-03 02:19:18,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2222, Unknown=13, NotChecked=936, Total=3422 [2022-11-03 02:19:18,260 INFO L87 Difference]: Start difference. First operand 834 states and 1958 transitions. Second operand has 59 states, 58 states have (on average 2.3793103448275863) internal successors, (138), 58 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:19:23,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:19:23,695 INFO L93 Difference]: Finished difference Result 2425 states and 5690 transitions. [2022-11-03 02:19:23,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-03 02:19:23,696 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 2.3793103448275863) internal successors, (138), 58 states have internal predecessors, (138), 0 states have call successors, (0), 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 46 [2022-11-03 02:19:23,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:19:23,699 INFO L225 Difference]: With dead ends: 2425 [2022-11-03 02:19:23,699 INFO L226 Difference]: Without dead ends: 2425 [2022-11-03 02:19:23,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 68 SyntacticMatches, 11 SemanticMatches, 89 ConstructedPredicates, 9 IntricatePredicates, 2 DeprecatedPredicates, 1958 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=985, Invalid=5680, Unknown=13, NotChecked=1512, Total=8190 [2022-11-03 02:19:23,701 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 1068 mSDsluCounter, 1807 mSDsCounter, 0 mSdLazyCounter, 2990 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1068 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 6068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 2990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2847 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:19:23,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1068 Valid, 370 Invalid, 6068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 2990 Invalid, 0 Unknown, 2847 Unchecked, 2.2s Time] [2022-11-03 02:19:23,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2425 states. [2022-11-03 02:19:23,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2425 to 1557. [2022-11-03 02:19:23,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1550 states have (on average 2.4070967741935485) internal successors, (3731), 1556 states have internal predecessors, (3731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:19:23,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 3731 transitions. [2022-11-03 02:19:23,732 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 3731 transitions. Word has length 46 [2022-11-03 02:19:23,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:19:23,732 INFO L495 AbstractCegarLoop]: Abstraction has 1557 states and 3731 transitions. [2022-11-03 02:19:23,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 2.3793103448275863) internal successors, (138), 58 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:19:23,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 3731 transitions. [2022-11-03 02:19:23,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-03 02:19:23,734 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:19:23,734 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:19:23,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:19:23,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:23,935 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2022-11-03 02:19:23,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:19:23,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1708578165, now seen corresponding path program 2 times [2022-11-03 02:19:23,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:19:23,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736098396] [2022-11-03 02:19:23,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:19:23,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:19:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:19:26,298 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 02:19:26,298 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:19:26,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736098396] [2022-11-03 02:19:26,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736098396] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:19:26,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476657637] [2022-11-03 02:19:26,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:19:26,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:19:26,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:19:26,300 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:19:26,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0cab448e-50a2-4abf-b5fa-d51cfa53625d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 02:19:26,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 02:19:26,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:19:26,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-03 02:19:26,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:19:26,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:26,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:26,733 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:19:26,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-03 02:19:26,752 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-03 02:19:26,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-03 02:19:26,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-03 02:19:27,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-03 02:19:30,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-03 02:19:36,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-03 02:19:43,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:19:43,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-03 02:19:45,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-03 02:19:57,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-11-03 02:20:21,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 68 [2022-11-03 02:20:42,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:42,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 64 [2022-11-03 02:21:11,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 73 [2022-11-03 02:21:21,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 69 [2022-11-03 02:22:03,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 83 [2022-11-03 02:22:23,553 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 02:22:23,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:22:45,955 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2571 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| Int) (v_ArrVal_2574 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 80) v_ArrVal_2571)) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| 4) |c_~#queue~0.offset|) v_ArrVal_2574) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| (select .cse0 (+ 84 |c_~#queue~0.offset|))))))) is different from false [2022-11-03 02:24:58,968 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2571 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| Int) (v_ArrVal_2568 (Array Int Int)) (v_ArrVal_2574 Int) (v_ArrVal_2569 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2568) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select .cse0 .cse1) (+ v_ArrVal_2569 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2569) (+ |c_~#queue~0.offset| 80) v_ArrVal_2571) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| 4) |c_~#queue~0.offset|) v_ArrVal_2574) .cse1) 2147483647)))) is different from false [2022-11-03 02:24:58,994 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2571 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| Int) (v_ArrVal_2568 (Array Int Int)) (v_ArrVal_2574 Int) (v_ArrVal_2567 Int) (v_ArrVal_2569 Int)) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2567)) |c_~#stored_elements~0.base| v_ArrVal_2568) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_2569 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2569) (+ |c_~#queue~0.offset| 80) v_ArrVal_2571) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| 4) |c_~#queue~0.offset|) v_ArrVal_2574) .cse1) 2147483647) (not (<= v_ArrVal_2567 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| (select .cse0 (+ 84 |c_~#queue~0.offset|))))))) is different from false [2022-11-03 02:24:59,024 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2571 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| Int) (v_ArrVal_2568 (Array Int Int)) (v_ArrVal_2574 Int) (v_ArrVal_2567 Int) (v_ArrVal_2569 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_2567)) |c_~#stored_elements~0.base| v_ArrVal_2568) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_2569 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2569) (+ |c_~#queue~0.offset| 80) v_ArrVal_2571) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| 4) |c_~#queue~0.offset|) v_ArrVal_2574) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2567) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| (select .cse0 (+ 84 |c_~#queue~0.offset|)))))))) is different from false [2022-11-03 02:24:59,080 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2571 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| Int) (v_ArrVal_2568 (Array Int Int)) (v_ArrVal_2564 Int) (v_ArrVal_2574 Int) (v_ArrVal_2567 Int) (v_ArrVal_2569 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2564) .cse3 v_ArrVal_2567)) |c_~#stored_elements~0.base| v_ArrVal_2568) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_2564) (< (select .cse0 .cse1) (+ v_ArrVal_2569 1)) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2569) (+ |c_~#queue~0.offset| 80) v_ArrVal_2571) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| 4) |c_~#queue~0.offset|) v_ArrVal_2574) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2567) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| (select .cse0 (+ 84 |c_~#queue~0.offset|)))))))) is different from false [2022-11-03 02:24:59,156 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2571 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| Int) (v_ArrVal_2562 Int) (v_ArrVal_2568 (Array Int Int)) (v_ArrVal_2564 Int) (v_ArrVal_2574 Int) (v_ArrVal_2567 Int) (v_ArrVal_2569 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2562)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2564) .cse1 v_ArrVal_2567)) |c_~#stored_elements~0.base| v_ArrVal_2568) |c_~#queue~0.base|)) (.cse3 (+ 88 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2567) (< (select (store (store (store .cse2 .cse3 v_ArrVal_2569) (+ |c_~#queue~0.offset| 80) v_ArrVal_2571) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| 4) |c_~#queue~0.offset|) v_ArrVal_2574) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (< 2147483647 v_ArrVal_2564) (< (select .cse2 .cse3) (+ v_ArrVal_2569 1)))))) is different from false [2022-11-03 02:24:59,222 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2571 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_2562 Int) (v_ArrVal_2568 (Array Int Int)) (v_ArrVal_2564 Int) (v_ArrVal_2574 Int) (v_ArrVal_2567 Int) (v_ArrVal_2569 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_2562)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse4 v_ArrVal_2564) .cse1 v_ArrVal_2567)) |c_~#stored_elements~0.base| v_ArrVal_2568) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| (select .cse0 .cse1))) (< 2147483647 v_ArrVal_2564) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2567) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse1))) (< (select (store (store (store .cse0 .cse4 v_ArrVal_2569) (+ |c_~#queue~0.offset| 80) v_ArrVal_2571) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| 4) |c_~#queue~0.offset|) v_ArrVal_2574) .cse4) 2147483647) (< (select .cse0 .cse4) (+ v_ArrVal_2569 1))))))) is different from false [2022-11-03 02:24:59,462 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2571 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_2562 Int) (v_ArrVal_2568 (Array Int Int)) (v_ArrVal_2564 Int) (v_ArrVal_2574 Int) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2567 Int) (v_ArrVal_2569 Int)) (let ((.cse5 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2561))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (let ((.cse4 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_2562)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse2 v_ArrVal_2564) .cse1 v_ArrVal_2567)) |c_~#stored_elements~0.base| v_ArrVal_2568) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| (select .cse0 .cse1))) (< (select .cse0 .cse2) (+ v_ArrVal_2569 1)) (< 2147483647 v_ArrVal_2564) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2567) (< (select (store (store (store .cse0 .cse2 v_ArrVal_2569) (+ |c_~#queue~0.offset| 80) v_ArrVal_2571) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| 4) |c_~#queue~0.offset|) v_ArrVal_2574) .cse2) 2147483647))))))) is different from false [2022-11-03 02:24:59,505 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2571 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_2562 Int) (v_ArrVal_2568 (Array Int Int)) (v_ArrVal_2564 Int) (v_ArrVal_2574 Int) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2567 Int) (v_ArrVal_2560 (Array Int Int)) (v_ArrVal_2569 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2560) |c_~#stored_elements~0.base| v_ArrVal_2561))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_2562)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_2564) .cse3 v_ArrVal_2567)) |c_~#stored_elements~0.base| v_ArrVal_2568) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_2564) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2569) (+ |c_~#queue~0.offset| 80) v_ArrVal_2571) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| 4) |c_~#queue~0.offset|) v_ArrVal_2574) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| (select .cse0 .cse3))) (< (select .cse0 .cse1) (+ v_ArrVal_2569 1)) (< (+ (select .cse4 .cse3) 1) v_ArrVal_2567))))))) is different from false [2022-11-03 02:24:59,566 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2568 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_ArrVal_2571 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_2562 Int) (v_ArrVal_2564 Int) (v_ArrVal_2574 Int) (v_ArrVal_2567 Int) (v_ArrVal_2558 Int) (v_ArrVal_2569 Int)) (let ((.cse5 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2558)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2560) |c_~#stored_elements~0.base| v_ArrVal_2561))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_2562)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse4 v_ArrVal_2564) .cse1 v_ArrVal_2567)) |c_~#stored_elements~0.base| v_ArrVal_2568) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_2564) (not (<= v_ArrVal_2558 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2567) (< (select (store (store (store .cse3 .cse4 v_ArrVal_2569) (+ |c_~#queue~0.offset| 80) v_ArrVal_2571) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| 4) |c_~#queue~0.offset|) v_ArrVal_2574) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| (select .cse3 .cse1))) (< (select .cse3 .cse4) (+ v_ArrVal_2569 1)))))))) is different from false [2022-11-03 02:24:59,623 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2568 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_ArrVal_2571 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_2562 Int) (v_ArrVal_2564 Int) (v_ArrVal_2574 Int) (v_ArrVal_2567 Int) (v_ArrVal_2558 Int) (v_ArrVal_2569 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_2558)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2560) |c_~#stored_elements~0.base| v_ArrVal_2561))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_2562)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse4 v_ArrVal_2564) .cse1 v_ArrVal_2567)) |c_~#stored_elements~0.base| v_ArrVal_2568) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_2564) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2567) (< (select (store (store (store .cse3 .cse4 v_ArrVal_2569) (+ |c_~#queue~0.offset| 80) v_ArrVal_2571) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| 4) |c_~#queue~0.offset|) v_ArrVal_2574) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| (select .cse3 .cse1))) (< (select .cse3 .cse4) (+ v_ArrVal_2569 1)) (< (+ (select .cse5 .cse6) 1) v_ArrVal_2558)))))))) is different from false [2022-11-03 02:24:59,732 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2568 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_ArrVal_2571 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_2562 Int) (v_ArrVal_2564 Int) (v_ArrVal_2574 Int) (v_ArrVal_2557 Int) (v_ArrVal_2567 Int) (v_ArrVal_2558 Int) (v_ArrVal_2569 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2557) .cse6 v_ArrVal_2558)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2560) |c_~#stored_elements~0.base| v_ArrVal_2561))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_2562)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_2564) .cse1 v_ArrVal_2567)) |c_~#stored_elements~0.base| v_ArrVal_2568) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2567) (< (select (store (store (store .cse2 .cse3 v_ArrVal_2569) (+ |c_~#queue~0.offset| 80) v_ArrVal_2571) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| 4) |c_~#queue~0.offset|) v_ArrVal_2574) .cse3) 2147483647) (< 2147483647 v_ArrVal_2564) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse4 .cse1))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_2558) (< (select .cse2 .cse3) (+ v_ArrVal_2569 1))))))))) is different from false [2022-11-03 02:24:59,856 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2568 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (v_ArrVal_2571 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_2562 Int) (v_ArrVal_2564 Int) (v_ArrVal_2574 Int) (v_ArrVal_2555 Int) (v_ArrVal_2557 Int) (v_ArrVal_2567 Int) (v_ArrVal_2558 Int) (v_ArrVal_2569 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2555)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2557) .cse4 v_ArrVal_2558)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2560) |c_~#stored_elements~0.base| v_ArrVal_2561))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_2562)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_2564) .cse2 v_ArrVal_2567)) |c_~#stored_elements~0.base| v_ArrVal_2568) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) (+ v_ArrVal_2569 1)) (< 2147483647 v_ArrVal_2564) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| (select .cse0 .cse2))) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2569) (+ |c_~#queue~0.offset| 80) v_ArrVal_2571) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| 4) |c_~#queue~0.offset|) v_ArrVal_2574) .cse1) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2558) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse5 .cse2))) (< (+ (select .cse6 .cse2) 1) v_ArrVal_2567)))))))) is different from false [2022-11-03 02:24:59,945 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2568 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_143| Int) (v_ArrVal_2571 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_2562 Int) (v_ArrVal_2564 Int) (v_ArrVal_2574 Int) (v_ArrVal_2555 Int) (v_ArrVal_2557 Int) (v_ArrVal_2567 Int) (v_ArrVal_2558 Int) (v_ArrVal_2569 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_143| 4)) v_ArrVal_2555)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse8 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2557) .cse4 v_ArrVal_2558)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2560) |c_~#stored_elements~0.base| v_ArrVal_2561))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse6 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_2562)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_2564) .cse2 v_ArrVal_2567)) |c_~#stored_elements~0.base| v_ArrVal_2568) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_2564) (< (select .cse0 .cse1) (+ v_ArrVal_2569 1)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| (select .cse0 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_143| (select .cse3 .cse4))) (< (+ (select .cse5 .cse4) 1) v_ArrVal_2558) (< (select (store (store (store .cse0 .cse1 v_ArrVal_2569) (+ |c_~#queue~0.offset| 80) v_ArrVal_2571) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| 4) |c_~#queue~0.offset|) v_ArrVal_2574) .cse1) 2147483647) (< (+ (select .cse6 .cse2) 1) v_ArrVal_2567) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse7 .cse2))))))))))) is different from false [2022-11-03 02:25:00,013 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2568 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_143| Int) (v_ArrVal_2571 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_2562 Int) (v_ArrVal_2564 Int) (v_ArrVal_2574 Int) (v_ArrVal_2555 Int) (v_ArrVal_2557 Int) (v_ArrVal_2567 Int) (v_ArrVal_2558 Int) (v_ArrVal_2569 Int)) (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_143| 4)) v_ArrVal_2555)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_2557) .cse1 v_ArrVal_2558)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2560) |c_~#stored_elements~0.base| v_ArrVal_2561))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_2562))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_2564) .cse1 v_ArrVal_2567)) |c_~#stored_elements~0.base| v_ArrVal_2568) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2558) (< (select .cse2 .cse3) (+ v_ArrVal_2569 1)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| (select .cse2 .cse1))) (< 2147483647 v_ArrVal_2564) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2567) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse5 .cse1))) (< (select (store (store (store .cse2 .cse3 v_ArrVal_2569) (+ |c_~#queue~0.offset| 80) v_ArrVal_2571) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| 4) |c_~#queue~0.offset|) v_ArrVal_2574) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_143| (select .cse6 .cse1))))))))))) is different from false [2022-11-03 02:25:00,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-03 02:25:00,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476657637] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:25:00,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1146662703] [2022-11-03 02:25:00,084 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:25:00,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:25:00,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 21] total 64 [2022-11-03 02:25:00,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968445132] [2022-11-03 02:25:00,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:25:00,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-03 02:25:00,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:25:00,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-03 02:25:00,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=2143, Unknown=154, NotChecked=1680, Total=4290 [2022-11-03 02:25:00,088 INFO L87 Difference]: Start difference. First operand 1557 states and 3731 transitions. Second operand has 66 states, 65 states have (on average 2.123076923076923) internal successors, (138), 65 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:25:03,624 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#queue~0.offset| 80)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (and (= (store (store (store ((as const (Array Int Int)) 0) .cse0 0) .cse1 0) .cse2 0) (select |c_#memory_int| |c_~#queue~0.base|)) (= (select .cse3 88) 0) (not (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= (select .cse3 84) 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| 7) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (forall ((v_ArrVal_2568 (Array Int Int)) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2560 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_143| Int) (v_ArrVal_2571 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_2562 Int) (v_ArrVal_2564 Int) (v_ArrVal_2574 Int) (v_ArrVal_2555 Int) (v_ArrVal_2557 Int) (v_ArrVal_2567 Int) (v_ArrVal_2558 Int) (v_ArrVal_2569 Int)) (let ((.cse6 (store .cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_143| 4)) v_ArrVal_2555)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse9 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2557) .cse5 v_ArrVal_2558)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2560) |c_~#stored_elements~0.base| v_ArrVal_2561))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_2562))) (let ((.cse4 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse2 v_ArrVal_2564) .cse1 v_ArrVal_2567)) |c_~#stored_elements~0.base| v_ArrVal_2568) |c_~#queue~0.base|))) (or (< 2147483647 v_ArrVal_2564) (< (select .cse4 .cse2) (+ v_ArrVal_2569 1)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_143| (select .cse3 .cse5))) (< (+ (select .cse6 .cse5) 1) v_ArrVal_2558) (< (select (store (store (store .cse4 .cse2 v_ArrVal_2569) .cse0 v_ArrVal_2571) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| 4) |c_~#queue~0.offset|) v_ArrVal_2574) .cse2) 2147483647) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2567) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse8 .cse1)))))))))) (= 7 |c_~#queue~0.base|) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 7)) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-03 02:27:01,980 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_~#queue~0.offset| 80)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_2571 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_2562 Int) (v_ArrVal_2568 (Array Int Int)) (v_ArrVal_2564 Int) (v_ArrVal_2574 Int) (v_ArrVal_2561 (Array Int Int)) (v_ArrVal_2567 Int) (v_ArrVal_2569 Int)) (let ((.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2561))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|))) (let ((.cse4 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_2562))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse2 v_ArrVal_2564) .cse1 v_ArrVal_2567)) |c_~#stored_elements~0.base| v_ArrVal_2568) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| (select .cse0 .cse1))) (< (select .cse0 .cse2) (+ v_ArrVal_2569 1)) (< 2147483647 v_ArrVal_2564) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2567) (< (select (store (store (store .cse0 .cse2 v_ArrVal_2569) .cse5 v_ArrVal_2571) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| 4) |c_~#queue~0.offset|) v_ArrVal_2574) .cse2) 2147483647))))))) (exists ((v_ArrVal_2555 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_138| Int) (v_ArrVal_2557 Int) (v_ArrVal_2558 Int)) (let ((.cse8 (store (store (store (store ((as const (Array Int Int)) 0) .cse5 0) .cse1 0) .cse2 0) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_138| 4) |c_~#queue~0.offset|) v_ArrVal_2555))) (and (= .cse7 (store (store .cse8 .cse2 v_ArrVal_2557) .cse1 v_ArrVal_2558)) (<= v_ArrVal_2558 (+ (select .cse8 .cse1) 1)) (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_138| 0)))) (= 7 |c_~#queue~0.base|) (<= (* (select .cse7 84) 4) 4) (<= (select .cse7 88) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-03 02:27:02,955 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_~#queue~0.offset| 80)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (and (forall ((v_ArrVal_2571 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_2562 Int) (v_ArrVal_2568 (Array Int Int)) (v_ArrVal_2564 Int) (v_ArrVal_2574 Int) (v_ArrVal_2567 Int) (v_ArrVal_2569 Int)) (let ((.cse2 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_2562))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse4 v_ArrVal_2564) .cse1 v_ArrVal_2567)) |c_~#stored_elements~0.base| v_ArrVal_2568) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| (select .cse0 .cse1))) (< 2147483647 v_ArrVal_2564) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2567) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse1))) (< (select (store (store (store .cse0 .cse4 v_ArrVal_2569) .cse5 v_ArrVal_2571) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| 4) |c_~#queue~0.offset|) v_ArrVal_2574) .cse4) 2147483647) (< (select .cse0 .cse4) (+ v_ArrVal_2569 1)))))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (exists ((v_ArrVal_2555 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_138| Int) (v_ArrVal_2557 Int) (v_ArrVal_2558 Int)) (let ((.cse6 (store (store (store (store ((as const (Array Int Int)) 0) .cse5 0) .cse1 0) .cse4 0) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_138| 4) |c_~#queue~0.offset|) v_ArrVal_2555))) (and (= .cse3 (store (store .cse6 .cse4 v_ArrVal_2557) .cse1 v_ArrVal_2558)) (<= v_ArrVal_2558 (+ (select .cse6 .cse1) 1)) (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_138| 0)))) (= 7 |c_~#queue~0.base|) (<= (* (select .cse3 84) 4) 4) (<= (select .cse3 88) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-03 02:27:13,282 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 80)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_empty_~q#1.base|))) (and (forall ((v_ArrVal_2571 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_2562 Int) (v_ArrVal_2568 (Array Int Int)) (v_ArrVal_2564 Int) (v_ArrVal_2574 Int) (v_ArrVal_2567 Int) (v_ArrVal_2569 Int)) (let ((.cse2 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_2562))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse4 v_ArrVal_2564) .cse1 v_ArrVal_2567)) |c_~#stored_elements~0.base| v_ArrVal_2568) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| (select .cse0 .cse1))) (< 2147483647 v_ArrVal_2564) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2567) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse1))) (< (select (store (store (store .cse0 .cse4 v_ArrVal_2569) .cse5 v_ArrVal_2571) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| 4) |c_~#queue~0.offset|) v_ArrVal_2574) .cse4) 2147483647) (< (select .cse0 .cse4) (+ v_ArrVal_2569 1)))))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_empty_~q#1.base| |c_~#queue~0.base|) (<= (select .cse6 84) 1) (= |c_~#queue~0.offset| 0) (exists ((v_ArrVal_2555 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_138| Int) (v_ArrVal_2557 Int) (v_ArrVal_2558 Int)) (let ((.cse7 (store (store (store (store ((as const (Array Int Int)) 0) .cse5 0) .cse1 0) .cse4 0) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_138| 4) |c_~#queue~0.offset|) v_ArrVal_2555))) (and (= .cse3 (store (store .cse7 .cse4 v_ArrVal_2557) .cse1 v_ArrVal_2558)) (<= v_ArrVal_2558 (+ (select .cse7 .cse1) 1)) (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_138| 0)))) (= 7 |c_~#queue~0.base|) (<= (select .cse6 88) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-03 02:27:14,419 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 80)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse4 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_2571 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_2562 Int) (v_ArrVal_2568 (Array Int Int)) (v_ArrVal_2564 Int) (v_ArrVal_2574 Int) (v_ArrVal_2567 Int) (v_ArrVal_2569 Int)) (let ((.cse2 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_2562))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse4 v_ArrVal_2564) .cse1 v_ArrVal_2567)) |c_~#stored_elements~0.base| v_ArrVal_2568) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| (select .cse0 .cse1))) (< 2147483647 v_ArrVal_2564) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2567) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse3 .cse1))) (< (select (store (store (store .cse0 .cse4 v_ArrVal_2569) .cse5 v_ArrVal_2571) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_141| 4) |c_~#queue~0.offset|) v_ArrVal_2574) .cse4) 2147483647) (< (select .cse0 .cse4) (+ v_ArrVal_2569 1)))))) (exists ((v_ArrVal_2555 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_138| Int) (v_ArrVal_2557 Int) (v_ArrVal_2558 Int)) (let ((.cse6 (store (store (store (store ((as const (Array Int Int)) 0) .cse5 0) .cse1 0) .cse4 0) (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_138| 4) |c_~#queue~0.offset|) v_ArrVal_2555))) (and (= .cse3 (store (store .cse6 .cse4 v_ArrVal_2557) .cse1 v_ArrVal_2558)) (<= v_ArrVal_2558 (+ (select .cse6 .cse1) 1)) (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_138| 0)))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false