./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_572de341-c4e9-4b3c-927b-633fe802f77c/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_572de341-c4e9-4b3c-927b-633fe802f77c/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_572de341-c4e9-4b3c-927b-633fe802f77c/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_572de341-c4e9-4b3c-927b-633fe802f77c/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_572de341-c4e9-4b3c-927b-633fe802f77c/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_572de341-c4e9-4b3c-927b-633fe802f77c/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 44a86740b4b3d791346dd5ab0675f134d34312247f7633c0f06bf117457d4ce2 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 03:29:58,860 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:29:58,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:29:58,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:29:58,899 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:29:58,900 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:29:58,901 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:29:58,903 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:29:58,905 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:29:58,906 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:29:58,907 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:29:58,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:29:58,909 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:29:58,910 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:29:58,911 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:29:58,913 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:29:58,914 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:29:58,915 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:29:58,917 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:29:58,919 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:29:58,920 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:29:58,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:29:58,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:29:58,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:29:58,928 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:29:58,928 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:29:58,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:29:58,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:29:58,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:29:58,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:29:58,932 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:29:58,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:29:58,934 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:29:58,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:29:58,936 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:29:58,936 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:29:58,937 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:29:58,937 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:29:58,938 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:29:58,939 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:29:58,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:29:58,940 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_572de341-c4e9-4b3c-927b-633fe802f77c/bin/utaipan-7li7fVZpFI/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-03 03:29:58,977 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:29:58,984 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:29:58,985 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:29:58,986 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:29:58,987 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:29:58,987 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:29:58,987 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:29:58,988 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:29:58,988 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:29:58,988 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:29:58,989 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:29:58,989 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:29:58,990 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:29:58,990 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:29:58,990 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:29:58,990 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:29:58,990 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:29:58,991 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:29:58,991 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:29:58,992 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:29:58,992 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 03:29:58,992 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:29:58,992 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:29:58,992 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:29:58,993 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:29:58,993 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:29:58,994 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:29:58,995 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-03 03:29:58,995 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:29:58,995 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:29:58,995 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:29:58,996 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:29:58,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:29:58,996 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:29:58,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:29:58,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:29:58,997 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:29:58,997 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:29:58,997 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:29:58,998 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:29:58,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:29:58,998 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:29:58,998 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:29:58,998 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_572de341-c4e9-4b3c-927b-633fe802f77c/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_572de341-c4e9-4b3c-927b-633fe802f77c/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 -> 44a86740b4b3d791346dd5ab0675f134d34312247f7633c0f06bf117457d4ce2 [2022-11-03 03:29:59,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:29:59,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:29:59,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:29:59,316 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:29:59,317 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:29:59,318 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_572de341-c4e9-4b3c-927b-633fe802f77c/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c [2022-11-03 03:29:59,396 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_572de341-c4e9-4b3c-927b-633fe802f77c/bin/utaipan-7li7fVZpFI/data/7651a1ec1/078693286d4f46d599459c711bb02514/FLAG4fc171ec6 [2022-11-03 03:29:59,812 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:29:59,813 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_572de341-c4e9-4b3c-927b-633fe802f77c/sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c [2022-11-03 03:29:59,820 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_572de341-c4e9-4b3c-927b-633fe802f77c/bin/utaipan-7li7fVZpFI/data/7651a1ec1/078693286d4f46d599459c711bb02514/FLAG4fc171ec6 [2022-11-03 03:30:00,205 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_572de341-c4e9-4b3c-927b-633fe802f77c/bin/utaipan-7li7fVZpFI/data/7651a1ec1/078693286d4f46d599459c711bb02514 [2022-11-03 03:30:00,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:30:00,209 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:30:00,211 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:30:00,211 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:30:00,218 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:30:00,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:30:00" (1/1) ... [2022-11-03 03:30:00,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74a5824c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:30:00, skipping insertion in model container [2022-11-03 03:30:00,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:30:00" (1/1) ... [2022-11-03 03:30:00,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:30:00,249 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:30:00,455 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_572de341-c4e9-4b3c-927b-633fe802f77c/sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c[3481,3494] [2022-11-03 03:30:00,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:30:00,475 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:30:00,521 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_572de341-c4e9-4b3c-927b-633fe802f77c/sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c[3481,3494] [2022-11-03 03:30:00,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:30:00,557 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:30:00,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:30:00 WrapperNode [2022-11-03 03:30:00,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:30:00,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:30:00,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:30:00,559 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:30:00,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:30:00" (1/1) ... [2022-11-03 03:30:00,587 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:30:00" (1/1) ... [2022-11-03 03:30:00,642 INFO L138 Inliner]: procedures = 23, calls = 45, calls flagged for inlining = 17, calls inlined = 39, statements flattened = 517 [2022-11-03 03:30:00,643 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:30:00,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:30:00,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:30:00,645 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:30:00,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:30:00" (1/1) ... [2022-11-03 03:30:00,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:30:00" (1/1) ... [2022-11-03 03:30:00,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:30:00" (1/1) ... [2022-11-03 03:30:00,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:30:00" (1/1) ... [2022-11-03 03:30:00,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:30:00" (1/1) ... [2022-11-03 03:30:00,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:30:00" (1/1) ... [2022-11-03 03:30:00,702 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:30:00" (1/1) ... [2022-11-03 03:30:00,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:30:00" (1/1) ... [2022-11-03 03:30:00,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:30:00,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:30:00,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:30:00,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:30:00,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:30:00" (1/1) ... [2022-11-03 03:30:00,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:30:00,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_572de341-c4e9-4b3c-927b-633fe802f77c/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:30:00,763 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_572de341-c4e9-4b3c-927b-633fe802f77c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:30:00,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_572de341-c4e9-4b3c-927b-633fe802f77c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:30:00,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:30:00,811 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-03 03:30:00,812 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-03 03:30:00,812 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-03 03:30:00,812 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-03 03:30:00,812 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-03 03:30:00,812 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-03 03:30:00,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:30:00,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 03:30:00,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 03:30:00,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-03 03:30:00,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-03 03:30:00,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:30:00,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:30:00,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 03:30:00,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 03:30:00,815 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 03:30:01,014 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:30:01,016 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:30:02,015 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:30:07,445 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:30:07,446 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 03:30:07,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:30:07 BoogieIcfgContainer [2022-11-03 03:30:07,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:30:07,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:30:07,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:30:07,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:30:07,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:30:00" (1/3) ... [2022-11-03 03:30:07,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ad73f1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:30:07, skipping insertion in model container [2022-11-03 03:30:07,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:30:00" (2/3) ... [2022-11-03 03:30:07,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ad73f1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:30:07, skipping insertion in model container [2022-11-03 03:30:07,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:30:07" (3/3) ... [2022-11-03 03:30:07,457 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-collitem-trans.wvr.c [2022-11-03 03:30:07,466 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 03:30:07,476 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:30:07,477 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2022-11-03 03:30:07,477 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 03:30:09,037 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-03 03:30:09,088 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 03:30:09,105 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 196 transitions, 416 flow [2022-11-03 03:30:09,114 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 196 transitions, 416 flow [2022-11-03 03:30:09,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 196 transitions, 416 flow [2022-11-03 03:30:09,513 INFO L130 PetriNetUnfolder]: 1/193 cut-off events. [2022-11-03 03:30:09,514 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-03 03:30:09,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 193 events. 1/193 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 542 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-11-03 03:30:09,524 INFO L118 LiptonReduction]: Number of co-enabled transitions 6318 [2022-11-03 03:30:16,808 WARN L234 SmtUtils]: Spent 7.17s on a formula simplification. DAG size of input: 1135 DAG size of output: 442 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-03 03:30:29,588 WARN L234 SmtUtils]: Spent 11.25s on a formula simplification. DAG size of input: 1335 DAG size of output: 599 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-03 03:30:43,263 WARN L234 SmtUtils]: Spent 5.86s on a formula simplification. DAG size of input: 836 DAG size of output: 439 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-03 03:31:03,540 WARN L234 SmtUtils]: Spent 5.43s on a formula simplification. DAG size of input: 1016 DAG size of output: 418 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-03 03:31:13,438 WARN L234 SmtUtils]: Spent 8.71s on a formula simplification. DAG size of input: 1073 DAG size of output: 542 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-03 03:31:20,372 INFO L133 LiptonReduction]: Checked pairs total: 4799 [2022-11-03 03:31:20,372 INFO L135 LiptonReduction]: Total number of compositions: 111 [2022-11-03 03:31:20,380 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 101 places, 91 transitions, 206 flow [2022-11-03 03:31:21,837 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 37956 states, 22332 states have (on average 5.6899964176965785) internal successors, (127069), 37955 states have internal predecessors, (127069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:21,857 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:31:21,862 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;@550e295a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:31:21,862 INFO L358 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2022-11-03 03:31:21,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 37956 states, 22332 states have (on average 5.6899964176965785) internal successors, (127069), 37955 states have internal predecessors, (127069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:21,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 03:31:21,928 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:31:21,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 03:31:21,930 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-03 03:31:21,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:31:21,936 INFO L85 PathProgramCache]: Analyzing trace with hash 2660362, now seen corresponding path program 1 times [2022-11-03 03:31:21,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:31:21,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517508426] [2022-11-03 03:31:21,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:21,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:31:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:22,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:31:22,361 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:31:22,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517508426] [2022-11-03 03:31:22,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517508426] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:31:22,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:31:22,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:31:22,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601280327] [2022-11-03 03:31:22,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:31:22,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:31:22,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:31:22,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:31:22,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:22,473 INFO L87 Difference]: Start difference. First operand has 37956 states, 22332 states have (on average 5.6899964176965785) internal successors, (127069), 37955 states have internal predecessors, (127069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:23,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:31:23,208 INFO L93 Difference]: Finished difference Result 11660 states and 38165 transitions. [2022-11-03 03:31:23,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:31:23,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 03:31:23,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:31:23,344 INFO L225 Difference]: With dead ends: 11660 [2022-11-03 03:31:23,344 INFO L226 Difference]: Without dead ends: 11660 [2022-11-03 03:31:23,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:23,350 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 03:31:23,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 0 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 03:31:23,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11660 states. [2022-11-03 03:31:23,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11660 to 11660. [2022-11-03 03:31:23,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11660 states, 7309 states have (on average 5.221644547817759) internal successors, (38165), 11659 states have internal predecessors, (38165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:23,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11660 states to 11660 states and 38165 transitions. [2022-11-03 03:31:23,923 INFO L78 Accepts]: Start accepts. Automaton has 11660 states and 38165 transitions. Word has length 3 [2022-11-03 03:31:23,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:31:23,925 INFO L495 AbstractCegarLoop]: Abstraction has 11660 states and 38165 transitions. [2022-11-03 03:31:23,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:23,926 INFO L276 IsEmpty]: Start isEmpty. Operand 11660 states and 38165 transitions. [2022-11-03 03:31:23,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 03:31:23,926 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:31:23,927 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 03:31:23,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:31:23,931 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-03 03:31:23,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:31:23,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2660373, now seen corresponding path program 1 times [2022-11-03 03:31:23,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:31:23,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951224351] [2022-11-03 03:31:23,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:23,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:31:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:24,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:31:24,822 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:31:24,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951224351] [2022-11-03 03:31:24,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951224351] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:31:24,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:31:24,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:31:24,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925657437] [2022-11-03 03:31:24,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:31:24,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:31:24,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:31:24,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:31:24,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:24,827 INFO L87 Difference]: Start difference. First operand 11660 states and 38165 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:25,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:31:25,301 INFO L93 Difference]: Finished difference Result 10432 states and 34047 transitions. [2022-11-03 03:31:25,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:31:25,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 03:31:25,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:31:25,371 INFO L225 Difference]: With dead ends: 10432 [2022-11-03 03:31:25,371 INFO L226 Difference]: Without dead ends: 10432 [2022-11-03 03:31:25,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:25,372 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:31:25,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:31:25,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10432 states. [2022-11-03 03:31:25,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10432 to 10432. [2022-11-03 03:31:25,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10432 states, 6593 states have (on average 5.164113453662976) internal successors, (34047), 10431 states have internal predecessors, (34047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:25,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10432 states to 10432 states and 34047 transitions. [2022-11-03 03:31:25,753 INFO L78 Accepts]: Start accepts. Automaton has 10432 states and 34047 transitions. Word has length 3 [2022-11-03 03:31:25,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:31:25,753 INFO L495 AbstractCegarLoop]: Abstraction has 10432 states and 34047 transitions. [2022-11-03 03:31:25,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:25,754 INFO L276 IsEmpty]: Start isEmpty. Operand 10432 states and 34047 transitions. [2022-11-03 03:31:25,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 03:31:25,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:31:25,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 03:31:25,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 03:31:25,755 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-03 03:31:25,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:31:25,757 INFO L85 PathProgramCache]: Analyzing trace with hash 2660374, now seen corresponding path program 1 times [2022-11-03 03:31:25,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:31:25,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086603669] [2022-11-03 03:31:25,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:25,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:31:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:25,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:31:25,958 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:31:25,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086603669] [2022-11-03 03:31:25,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086603669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:31:25,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:31:25,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:31:25,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817494648] [2022-11-03 03:31:25,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:31:25,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:31:25,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:31:25,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:31:25,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:25,961 INFO L87 Difference]: Start difference. First operand 10432 states and 34047 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:26,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:31:26,379 INFO L93 Difference]: Finished difference Result 9244 states and 30079 transitions. [2022-11-03 03:31:26,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:31:26,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 03:31:26,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:31:26,442 INFO L225 Difference]: With dead ends: 9244 [2022-11-03 03:31:26,442 INFO L226 Difference]: Without dead ends: 9244 [2022-11-03 03:31:26,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:26,447 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:31:26,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:31:26,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9244 states. [2022-11-03 03:31:26,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9244 to 9244. [2022-11-03 03:31:26,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9244 states, 5885 states have (on average 5.111129991503823) internal successors, (30079), 9243 states have internal predecessors, (30079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:26,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9244 states to 9244 states and 30079 transitions. [2022-11-03 03:31:26,807 INFO L78 Accepts]: Start accepts. Automaton has 9244 states and 30079 transitions. Word has length 3 [2022-11-03 03:31:26,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:31:26,807 INFO L495 AbstractCegarLoop]: Abstraction has 9244 states and 30079 transitions. [2022-11-03 03:31:26,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:26,808 INFO L276 IsEmpty]: Start isEmpty. Operand 9244 states and 30079 transitions. [2022-11-03 03:31:26,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 03:31:26,808 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:31:26,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 03:31:26,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 03:31:26,809 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-03 03:31:26,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:31:26,810 INFO L85 PathProgramCache]: Analyzing trace with hash 2660377, now seen corresponding path program 1 times [2022-11-03 03:31:26,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:31:26,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55487373] [2022-11-03 03:31:26,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:26,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:31:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:27,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:31:27,048 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:31:27,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55487373] [2022-11-03 03:31:27,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55487373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:31:27,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:31:27,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:31:27,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854425428] [2022-11-03 03:31:27,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:31:27,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:31:27,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:31:27,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:31:27,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:27,051 INFO L87 Difference]: Start difference. First operand 9244 states and 30079 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:27,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:31:27,430 INFO L93 Difference]: Finished difference Result 8128 states and 26357 transitions. [2022-11-03 03:31:27,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:31:27,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 03:31:27,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:31:27,478 INFO L225 Difference]: With dead ends: 8128 [2022-11-03 03:31:27,478 INFO L226 Difference]: Without dead ends: 8128 [2022-11-03 03:31:27,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:27,482 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:31:27,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:31:27,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8128 states. [2022-11-03 03:31:27,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8128 to 8128. [2022-11-03 03:31:27,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8128 states, 5217 states have (on average 5.052137243626605) internal successors, (26357), 8127 states have internal predecessors, (26357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8128 states to 8128 states and 26357 transitions. [2022-11-03 03:31:27,729 INFO L78 Accepts]: Start accepts. Automaton has 8128 states and 26357 transitions. Word has length 3 [2022-11-03 03:31:27,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:31:27,730 INFO L495 AbstractCegarLoop]: Abstraction has 8128 states and 26357 transitions. [2022-11-03 03:31:27,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:27,734 INFO L276 IsEmpty]: Start isEmpty. Operand 8128 states and 26357 transitions. [2022-11-03 03:31:27,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 03:31:27,735 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:31:27,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 03:31:27,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 03:31:27,736 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-03 03:31:27,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:31:27,736 INFO L85 PathProgramCache]: Analyzing trace with hash 2660378, now seen corresponding path program 1 times [2022-11-03 03:31:27,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:31:27,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311922259] [2022-11-03 03:31:27,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:27,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:31:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:28,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:31:28,337 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:31:28,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311922259] [2022-11-03 03:31:28,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311922259] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:31:28,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:31:28,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:31:28,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312638823] [2022-11-03 03:31:28,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:31:28,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:31:28,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:31:28,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:31:28,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:28,339 INFO L87 Difference]: Start difference. First operand 8128 states and 26357 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:28,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:31:28,683 INFO L93 Difference]: Finished difference Result 7164 states and 23143 transitions. [2022-11-03 03:31:28,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:31:28,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 03:31:28,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:31:28,729 INFO L225 Difference]: With dead ends: 7164 [2022-11-03 03:31:28,729 INFO L226 Difference]: Without dead ends: 7164 [2022-11-03 03:31:28,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:28,730 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:31:28,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:31:28,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7164 states. [2022-11-03 03:31:28,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7164 to 7164. [2022-11-03 03:31:28,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7164 states, 4645 states have (on average 4.982346609257266) internal successors, (23143), 7163 states have internal predecessors, (23143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:28,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7164 states to 7164 states and 23143 transitions. [2022-11-03 03:31:28,944 INFO L78 Accepts]: Start accepts. Automaton has 7164 states and 23143 transitions. Word has length 3 [2022-11-03 03:31:28,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:31:28,945 INFO L495 AbstractCegarLoop]: Abstraction has 7164 states and 23143 transitions. [2022-11-03 03:31:28,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:28,945 INFO L276 IsEmpty]: Start isEmpty. Operand 7164 states and 23143 transitions. [2022-11-03 03:31:28,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 03:31:28,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:31:28,946 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 03:31:28,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 03:31:28,946 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-03 03:31:28,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:31:28,947 INFO L85 PathProgramCache]: Analyzing trace with hash 2660379, now seen corresponding path program 1 times [2022-11-03 03:31:28,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:31:28,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185454449] [2022-11-03 03:31:28,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:28,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:31:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:29,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:31:29,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:31:29,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185454449] [2022-11-03 03:31:29,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185454449] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:31:29,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:31:29,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:31:29,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723920285] [2022-11-03 03:31:29,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:31:29,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:31:29,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:31:29,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:31:29,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:29,272 INFO L87 Difference]: Start difference. First operand 7164 states and 23143 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:29,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:31:29,575 INFO L93 Difference]: Finished difference Result 6260 states and 20135 transitions. [2022-11-03 03:31:29,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:31:29,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 03:31:29,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:31:29,611 INFO L225 Difference]: With dead ends: 6260 [2022-11-03 03:31:29,611 INFO L226 Difference]: Without dead ends: 6260 [2022-11-03 03:31:29,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:29,613 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:31:29,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:31:29,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6260 states. [2022-11-03 03:31:29,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6260 to 6260. [2022-11-03 03:31:29,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6260 states, 4105 states have (on average 4.904993909866017) internal successors, (20135), 6259 states have internal predecessors, (20135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:29,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6260 states to 6260 states and 20135 transitions. [2022-11-03 03:31:29,792 INFO L78 Accepts]: Start accepts. Automaton has 6260 states and 20135 transitions. Word has length 3 [2022-11-03 03:31:29,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:31:29,792 INFO L495 AbstractCegarLoop]: Abstraction has 6260 states and 20135 transitions. [2022-11-03 03:31:29,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:29,792 INFO L276 IsEmpty]: Start isEmpty. Operand 6260 states and 20135 transitions. [2022-11-03 03:31:29,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 03:31:29,793 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:31:29,793 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 03:31:29,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 03:31:29,794 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-03 03:31:29,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:31:29,794 INFO L85 PathProgramCache]: Analyzing trace with hash 2660380, now seen corresponding path program 1 times [2022-11-03 03:31:29,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:31:29,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910976990] [2022-11-03 03:31:29,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:29,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:31:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:29,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:31:29,902 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:31:29,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910976990] [2022-11-03 03:31:29,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910976990] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:31:29,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:31:29,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:31:29,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871186111] [2022-11-03 03:31:29,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:31:29,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:31:29,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:31:29,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:31:29,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:29,904 INFO L87 Difference]: Start difference. First operand 6260 states and 20135 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:30,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:31:30,188 INFO L93 Difference]: Finished difference Result 5396 states and 17273 transitions. [2022-11-03 03:31:30,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:31:30,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 03:31:30,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:31:30,218 INFO L225 Difference]: With dead ends: 5396 [2022-11-03 03:31:30,218 INFO L226 Difference]: Without dead ends: 5396 [2022-11-03 03:31:30,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:30,220 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:31:30,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:31:30,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5396 states. [2022-11-03 03:31:30,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5396 to 5396. [2022-11-03 03:31:30,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5396 states, 3577 states have (on average 4.828906905227845) internal successors, (17273), 5395 states have internal predecessors, (17273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:30,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5396 states to 5396 states and 17273 transitions. [2022-11-03 03:31:30,370 INFO L78 Accepts]: Start accepts. Automaton has 5396 states and 17273 transitions. Word has length 3 [2022-11-03 03:31:30,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:31:30,370 INFO L495 AbstractCegarLoop]: Abstraction has 5396 states and 17273 transitions. [2022-11-03 03:31:30,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:30,371 INFO L276 IsEmpty]: Start isEmpty. Operand 5396 states and 17273 transitions. [2022-11-03 03:31:30,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 03:31:30,371 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:31:30,371 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 03:31:30,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 03:31:30,373 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-03 03:31:30,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:31:30,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2660365, now seen corresponding path program 1 times [2022-11-03 03:31:30,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:31:30,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663520476] [2022-11-03 03:31:30,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:30,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:31:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:30,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:31:30,471 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:31:30,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663520476] [2022-11-03 03:31:30,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663520476] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:31:30,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:31:30,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:31:30,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304232584] [2022-11-03 03:31:30,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:31:30,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:31:30,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:31:30,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:31:30,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:30,473 INFO L87 Difference]: Start difference. First operand 5396 states and 17273 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:30,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:31:30,734 INFO L93 Difference]: Finished difference Result 4596 states and 14629 transitions. [2022-11-03 03:31:30,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:31:30,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 03:31:30,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:31:30,761 INFO L225 Difference]: With dead ends: 4596 [2022-11-03 03:31:30,762 INFO L226 Difference]: Without dead ends: 4596 [2022-11-03 03:31:30,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:30,763 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:31:30,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:31:30,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4596 states. [2022-11-03 03:31:30,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4596 to 4596. [2022-11-03 03:31:30,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4596 states, 3085 states have (on average 4.741977309562398) internal successors, (14629), 4595 states have internal predecessors, (14629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:30,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4596 states to 4596 states and 14629 transitions. [2022-11-03 03:31:30,897 INFO L78 Accepts]: Start accepts. Automaton has 4596 states and 14629 transitions. Word has length 3 [2022-11-03 03:31:30,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:31:30,898 INFO L495 AbstractCegarLoop]: Abstraction has 4596 states and 14629 transitions. [2022-11-03 03:31:30,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:30,898 INFO L276 IsEmpty]: Start isEmpty. Operand 4596 states and 14629 transitions. [2022-11-03 03:31:30,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 03:31:30,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:31:30,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 03:31:30,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 03:31:30,899 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-03 03:31:30,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:31:30,900 INFO L85 PathProgramCache]: Analyzing trace with hash 2660366, now seen corresponding path program 1 times [2022-11-03 03:31:30,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:31:30,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507772078] [2022-11-03 03:31:30,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:30,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:31:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:31,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:31:31,043 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:31:31,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507772078] [2022-11-03 03:31:31,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507772078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:31:31,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:31:31,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:31:31,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559430493] [2022-11-03 03:31:31,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:31:31,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:31:31,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:31:31,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:31:31,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:31,046 INFO L87 Difference]: Start difference. First operand 4596 states and 14629 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:31,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:31:31,292 INFO L93 Difference]: Finished difference Result 3916 states and 12385 transitions. [2022-11-03 03:31:31,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:31:31,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 03:31:31,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:31:31,313 INFO L225 Difference]: With dead ends: 3916 [2022-11-03 03:31:31,313 INFO L226 Difference]: Without dead ends: 3916 [2022-11-03 03:31:31,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:31,314 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:31:31,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:31:31,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3916 states. [2022-11-03 03:31:31,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3916 to 3916. [2022-11-03 03:31:31,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3916 states, 2669 states have (on average 4.640314724615961) internal successors, (12385), 3915 states have internal predecessors, (12385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:31,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3916 states to 3916 states and 12385 transitions. [2022-11-03 03:31:31,414 INFO L78 Accepts]: Start accepts. Automaton has 3916 states and 12385 transitions. Word has length 3 [2022-11-03 03:31:31,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:31:31,415 INFO L495 AbstractCegarLoop]: Abstraction has 3916 states and 12385 transitions. [2022-11-03 03:31:31,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:31,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3916 states and 12385 transitions. [2022-11-03 03:31:31,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 03:31:31,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:31:31,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 03:31:31,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 03:31:31,416 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-03 03:31:31,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:31:31,417 INFO L85 PathProgramCache]: Analyzing trace with hash 2660383, now seen corresponding path program 1 times [2022-11-03 03:31:31,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:31:31,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237512312] [2022-11-03 03:31:31,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:31,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:31:31,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:31,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:31:31,506 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:31:31,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237512312] [2022-11-03 03:31:31,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237512312] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:31:31,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:31:31,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:31:31,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233029616] [2022-11-03 03:31:31,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:31:31,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:31:31,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:31:31,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:31:31,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:31,508 INFO L87 Difference]: Start difference. First operand 3916 states and 12385 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:31,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:31:31,785 INFO L93 Difference]: Finished difference Result 3256 states and 10217 transitions. [2022-11-03 03:31:31,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:31:31,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 03:31:31,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:31:31,801 INFO L225 Difference]: With dead ends: 3256 [2022-11-03 03:31:31,802 INFO L226 Difference]: Without dead ends: 3256 [2022-11-03 03:31:31,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:31,803 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:31:31,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:31:31,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3256 states. [2022-11-03 03:31:31,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3256 to 3256. [2022-11-03 03:31:31,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3256 states, 2256 states have (on average 4.528812056737588) internal successors, (10217), 3255 states have internal predecessors, (10217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:31,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3256 states to 3256 states and 10217 transitions. [2022-11-03 03:31:31,886 INFO L78 Accepts]: Start accepts. Automaton has 3256 states and 10217 transitions. Word has length 3 [2022-11-03 03:31:31,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:31:31,886 INFO L495 AbstractCegarLoop]: Abstraction has 3256 states and 10217 transitions. [2022-11-03 03:31:31,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:31,887 INFO L276 IsEmpty]: Start isEmpty. Operand 3256 states and 10217 transitions. [2022-11-03 03:31:31,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 03:31:31,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:31:31,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 03:31:31,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 03:31:31,888 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-03 03:31:31,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:31:31,888 INFO L85 PathProgramCache]: Analyzing trace with hash 2660367, now seen corresponding path program 1 times [2022-11-03 03:31:31,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:31:31,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564803195] [2022-11-03 03:31:31,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:31,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:31:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:31:32,012 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:31:32,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564803195] [2022-11-03 03:31:32,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564803195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:31:32,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:31:32,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:31:32,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367473463] [2022-11-03 03:31:32,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:31:32,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:31:32,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:31:32,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:31:32,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:32,014 INFO L87 Difference]: Start difference. First operand 3256 states and 10217 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:32,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:31:32,227 INFO L93 Difference]: Finished difference Result 2700 states and 8395 transitions. [2022-11-03 03:31:32,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:31:32,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 03:31:32,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:31:32,240 INFO L225 Difference]: With dead ends: 2700 [2022-11-03 03:31:32,240 INFO L226 Difference]: Without dead ends: 2700 [2022-11-03 03:31:32,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:32,241 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:31:32,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 0 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:31:32,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2022-11-03 03:31:32,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2700. [2022-11-03 03:31:32,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2700 states, 1909 states have (on average 4.397590361445783) internal successors, (8395), 2699 states have internal predecessors, (8395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:32,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 8395 transitions. [2022-11-03 03:31:32,307 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 8395 transitions. Word has length 3 [2022-11-03 03:31:32,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:31:32,307 INFO L495 AbstractCegarLoop]: Abstraction has 2700 states and 8395 transitions. [2022-11-03 03:31:32,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:32,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 8395 transitions. [2022-11-03 03:31:32,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 03:31:32,308 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:31:32,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 03:31:32,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 03:31:32,309 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-03 03:31:32,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:31:32,309 INFO L85 PathProgramCache]: Analyzing trace with hash 2660384, now seen corresponding path program 1 times [2022-11-03 03:31:32,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:31:32,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940458957] [2022-11-03 03:31:32,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:32,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:31:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:31:32,516 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:31:32,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940458957] [2022-11-03 03:31:32,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940458957] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:31:32,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:31:32,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:31:32,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889511824] [2022-11-03 03:31:32,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:31:32,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:31:32,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:31:32,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:31:32,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:32,518 INFO L87 Difference]: Start difference. First operand 2700 states and 8395 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:32,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:31:32,713 INFO L93 Difference]: Finished difference Result 2192 states and 6737 transitions. [2022-11-03 03:31:32,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:31:32,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 03:31:32,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:31:32,724 INFO L225 Difference]: With dead ends: 2192 [2022-11-03 03:31:32,724 INFO L226 Difference]: Without dead ends: 2192 [2022-11-03 03:31:32,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:32,725 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:31:32,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:31:32,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2022-11-03 03:31:32,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 2192. [2022-11-03 03:31:32,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2192 states, 1588 states have (on average 4.242443324937028) internal successors, (6737), 2191 states have internal predecessors, (6737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:32,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 6737 transitions. [2022-11-03 03:31:32,777 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 6737 transitions. Word has length 3 [2022-11-03 03:31:32,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:31:32,777 INFO L495 AbstractCegarLoop]: Abstraction has 2192 states and 6737 transitions. [2022-11-03 03:31:32,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:32,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 6737 transitions. [2022-11-03 03:31:32,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 03:31:32,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:31:32,778 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 03:31:32,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 03:31:32,778 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-03 03:31:32,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:31:32,779 INFO L85 PathProgramCache]: Analyzing trace with hash 2660368, now seen corresponding path program 1 times [2022-11-03 03:31:32,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:31:32,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397052332] [2022-11-03 03:31:32,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:32,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:31:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:32,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:31:32,837 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:31:32,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397052332] [2022-11-03 03:31:32,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397052332] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:31:32,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:31:32,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:31:32,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384940724] [2022-11-03 03:31:32,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:31:32,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:31:32,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:31:32,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:31:32,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:32,840 INFO L87 Difference]: Start difference. First operand 2192 states and 6737 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:33,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:31:33,017 INFO L93 Difference]: Finished difference Result 1724 states and 5219 transitions. [2022-11-03 03:31:33,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:31:33,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 03:31:33,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:31:33,026 INFO L225 Difference]: With dead ends: 1724 [2022-11-03 03:31:33,026 INFO L226 Difference]: Without dead ends: 1724 [2022-11-03 03:31:33,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:33,027 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:31:33,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:31:33,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2022-11-03 03:31:33,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1724. [2022-11-03 03:31:33,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1724 states, 1285 states have (on average 4.06147859922179) internal successors, (5219), 1723 states have internal predecessors, (5219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:33,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 5219 transitions. [2022-11-03 03:31:33,068 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 5219 transitions. Word has length 3 [2022-11-03 03:31:33,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:31:33,068 INFO L495 AbstractCegarLoop]: Abstraction has 1724 states and 5219 transitions. [2022-11-03 03:31:33,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:33,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 5219 transitions. [2022-11-03 03:31:33,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 03:31:33,069 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:31:33,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 03:31:33,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 03:31:33,069 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-03 03:31:33,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:31:33,070 INFO L85 PathProgramCache]: Analyzing trace with hash 2660385, now seen corresponding path program 1 times [2022-11-03 03:31:33,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:31:33,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681747856] [2022-11-03 03:31:33,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:33,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:31:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:33,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:31:33,217 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:31:33,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681747856] [2022-11-03 03:31:33,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681747856] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:31:33,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:31:33,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:31:33,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140662446] [2022-11-03 03:31:33,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:31:33,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:31:33,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:31:33,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:31:33,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:33,220 INFO L87 Difference]: Start difference. First operand 1724 states and 5219 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:33,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:31:33,378 INFO L93 Difference]: Finished difference Result 1324 states and 3927 transitions. [2022-11-03 03:31:33,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:31:33,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 03:31:33,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:31:33,385 INFO L225 Difference]: With dead ends: 1324 [2022-11-03 03:31:33,385 INFO L226 Difference]: Without dead ends: 1324 [2022-11-03 03:31:33,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:33,386 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:31:33,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:31:33,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2022-11-03 03:31:33,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1324. [2022-11-03 03:31:33,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 1025 states have (on average 3.831219512195122) internal successors, (3927), 1323 states have internal predecessors, (3927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:33,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 3927 transitions. [2022-11-03 03:31:33,417 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 3927 transitions. Word has length 3 [2022-11-03 03:31:33,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:31:33,417 INFO L495 AbstractCegarLoop]: Abstraction has 1324 states and 3927 transitions. [2022-11-03 03:31:33,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:33,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 3927 transitions. [2022-11-03 03:31:33,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 03:31:33,418 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:31:33,418 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 03:31:33,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 03:31:33,418 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-03 03:31:33,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:31:33,419 INFO L85 PathProgramCache]: Analyzing trace with hash 2660371, now seen corresponding path program 1 times [2022-11-03 03:31:33,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:31:33,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931604228] [2022-11-03 03:31:33,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:33,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:31:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:33,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:31:33,495 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:31:33,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931604228] [2022-11-03 03:31:33,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931604228] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:31:33,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:31:33,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:31:33,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659315100] [2022-11-03 03:31:33,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:31:33,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:31:33,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:31:33,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:31:33,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:33,497 INFO L87 Difference]: Start difference. First operand 1324 states and 3927 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:33,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:31:33,636 INFO L93 Difference]: Finished difference Result 964 states and 2773 transitions. [2022-11-03 03:31:33,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:31:33,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 03:31:33,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:31:33,641 INFO L225 Difference]: With dead ends: 964 [2022-11-03 03:31:33,641 INFO L226 Difference]: Without dead ends: 964 [2022-11-03 03:31:33,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:33,642 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:31:33,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:31:33,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2022-11-03 03:31:33,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 964. [2022-11-03 03:31:33,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 785 states have (on average 3.532484076433121) internal successors, (2773), 963 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:33,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 2773 transitions. [2022-11-03 03:31:33,664 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 2773 transitions. Word has length 3 [2022-11-03 03:31:33,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:31:33,664 INFO L495 AbstractCegarLoop]: Abstraction has 964 states and 2773 transitions. [2022-11-03 03:31:33,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:33,665 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 2773 transitions. [2022-11-03 03:31:33,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 03:31:33,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:31:33,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 03:31:33,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-03 03:31:33,666 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-03 03:31:33,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:31:33,666 INFO L85 PathProgramCache]: Analyzing trace with hash 2660372, now seen corresponding path program 1 times [2022-11-03 03:31:33,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:31:33,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611765038] [2022-11-03 03:31:33,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:33,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:31:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:33,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:31:33,815 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:31:33,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611765038] [2022-11-03 03:31:33,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611765038] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:31:33,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:31:33,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:31:33,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143405585] [2022-11-03 03:31:33,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:31:33,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:31:33,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:31:33,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:31:33,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:33,817 INFO L87 Difference]: Start difference. First operand 964 states and 2773 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:33,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:31:33,946 INFO L93 Difference]: Finished difference Result 660 states and 1805 transitions. [2022-11-03 03:31:33,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:31:33,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 03:31:33,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:31:33,950 INFO L225 Difference]: With dead ends: 660 [2022-11-03 03:31:33,950 INFO L226 Difference]: Without dead ends: 658 [2022-11-03 03:31:33,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:33,951 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:31:33,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:31:33,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2022-11-03 03:31:33,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2022-11-03 03:31:33,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 578 states have (on average 3.114186851211073) internal successors, (1800), 657 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:33,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1800 transitions. [2022-11-03 03:31:33,967 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1800 transitions. Word has length 3 [2022-11-03 03:31:33,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:31:33,968 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 1800 transitions. [2022-11-03 03:31:33,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:33,968 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1800 transitions. [2022-11-03 03:31:33,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 03:31:33,968 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:31:33,969 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 03:31:33,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-03 03:31:33,969 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-03 03:31:33,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:31:33,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1738116839, now seen corresponding path program 1 times [2022-11-03 03:31:33,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:31:33,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910288375] [2022-11-03 03:31:33,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:33,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:31:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:34,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:31:34,019 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:31:34,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910288375] [2022-11-03 03:31:34,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910288375] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:31:34,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:31:34,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:31:34,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61031004] [2022-11-03 03:31:34,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:31:34,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:31:34,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:31:34,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:31:34,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:34,022 INFO L87 Difference]: Start difference. First operand 658 states and 1800 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:34,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:31:34,142 INFO L93 Difference]: Finished difference Result 538 states and 1456 transitions. [2022-11-03 03:31:34,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:31:34,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-03 03:31:34,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:31:34,145 INFO L225 Difference]: With dead ends: 538 [2022-11-03 03:31:34,145 INFO L226 Difference]: Without dead ends: 538 [2022-11-03 03:31:34,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:34,146 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:31:34,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:31:34,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-11-03 03:31:34,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2022-11-03 03:31:34,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 475 states have (on average 3.0652631578947367) internal successors, (1456), 537 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:34,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1456 transitions. [2022-11-03 03:31:34,159 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1456 transitions. Word has length 5 [2022-11-03 03:31:34,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:31:34,159 INFO L495 AbstractCegarLoop]: Abstraction has 538 states and 1456 transitions. [2022-11-03 03:31:34,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:34,160 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1456 transitions. [2022-11-03 03:31:34,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 03:31:34,160 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:31:34,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 03:31:34,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-03 03:31:34,161 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-03 03:31:34,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:31:34,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1738116821, now seen corresponding path program 1 times [2022-11-03 03:31:34,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:31:34,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063072107] [2022-11-03 03:31:34,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:34,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:31:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:34,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:31:34,457 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:31:34,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063072107] [2022-11-03 03:31:34,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063072107] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:31:34,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:31:34,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:31:34,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708418384] [2022-11-03 03:31:34,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:31:34,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:31:34,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:31:34,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:31:34,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:34,459 INFO L87 Difference]: Start difference. First operand 538 states and 1456 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:34,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:31:34,570 INFO L93 Difference]: Finished difference Result 430 states and 1148 transitions. [2022-11-03 03:31:34,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:31:34,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-03 03:31:34,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:31:34,572 INFO L225 Difference]: With dead ends: 430 [2022-11-03 03:31:34,572 INFO L226 Difference]: Without dead ends: 430 [2022-11-03 03:31:34,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:34,573 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:31:34,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 0 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:31:34,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-11-03 03:31:34,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2022-11-03 03:31:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 382 states have (on average 3.005235602094241) internal successors, (1148), 429 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:34,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1148 transitions. [2022-11-03 03:31:34,583 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1148 transitions. Word has length 5 [2022-11-03 03:31:34,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:31:34,584 INFO L495 AbstractCegarLoop]: Abstraction has 430 states and 1148 transitions. [2022-11-03 03:31:34,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:34,584 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1148 transitions. [2022-11-03 03:31:34,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 03:31:34,585 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:31:34,585 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 03:31:34,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-03 03:31:34,585 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-03 03:31:34,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:31:34,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1738116836, now seen corresponding path program 1 times [2022-11-03 03:31:34,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:31:34,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948446552] [2022-11-03 03:31:34,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:34,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:31:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:34,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:31:34,646 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:31:34,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948446552] [2022-11-03 03:31:34,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948446552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:31:34,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:31:34,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:31:34,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849518333] [2022-11-03 03:31:34,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:31:34,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:31:34,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:31:34,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:31:34,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:34,651 INFO L87 Difference]: Start difference. First operand 430 states and 1148 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:34,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:31:34,749 INFO L93 Difference]: Finished difference Result 334 states and 876 transitions. [2022-11-03 03:31:34,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:31:34,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-03 03:31:34,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:31:34,751 INFO L225 Difference]: With dead ends: 334 [2022-11-03 03:31:34,751 INFO L226 Difference]: Without dead ends: 334 [2022-11-03 03:31:34,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:34,752 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:31:34,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:31:34,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-11-03 03:31:34,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2022-11-03 03:31:34,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 299 states have (on average 2.9297658862876252) internal successors, (876), 333 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:34,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 876 transitions. [2022-11-03 03:31:34,761 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 876 transitions. Word has length 5 [2022-11-03 03:31:34,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:31:34,762 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 876 transitions. [2022-11-03 03:31:34,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:34,762 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 876 transitions. [2022-11-03 03:31:34,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 03:31:34,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:31:34,763 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 03:31:34,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-03 03:31:34,763 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-03 03:31:34,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:31:34,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1738116818, now seen corresponding path program 1 times [2022-11-03 03:31:34,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:31:34,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413055615] [2022-11-03 03:31:34,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:34,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:31:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:35,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:31:35,161 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:31:35,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413055615] [2022-11-03 03:31:35,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413055615] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:31:35,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:31:35,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:31:35,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256324157] [2022-11-03 03:31:35,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:31:35,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:31:35,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:31:35,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:31:35,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:35,164 INFO L87 Difference]: Start difference. First operand 334 states and 876 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:35,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:31:35,250 INFO L93 Difference]: Finished difference Result 250 states and 640 transitions. [2022-11-03 03:31:35,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:31:35,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-03 03:31:35,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:31:35,252 INFO L225 Difference]: With dead ends: 250 [2022-11-03 03:31:35,252 INFO L226 Difference]: Without dead ends: 250 [2022-11-03 03:31:35,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:35,253 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:31:35,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:31:35,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-11-03 03:31:35,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2022-11-03 03:31:35,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 226 states have (on average 2.831858407079646) internal successors, (640), 249 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:35,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 640 transitions. [2022-11-03 03:31:35,260 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 640 transitions. Word has length 5 [2022-11-03 03:31:35,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:31:35,261 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 640 transitions. [2022-11-03 03:31:35,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:35,261 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 640 transitions. [2022-11-03 03:31:35,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 03:31:35,261 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:31:35,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 03:31:35,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-03 03:31:35,262 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-03 03:31:35,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:31:35,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1738116833, now seen corresponding path program 1 times [2022-11-03 03:31:35,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:31:35,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452982215] [2022-11-03 03:31:35,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:35,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:31:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:31:35,323 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:31:35,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452982215] [2022-11-03 03:31:35,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452982215] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:31:35,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:31:35,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:31:35,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767446927] [2022-11-03 03:31:35,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:31:35,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:31:35,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:31:35,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:31:35,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:35,328 INFO L87 Difference]: Start difference. First operand 250 states and 640 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:35,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:31:35,398 INFO L93 Difference]: Finished difference Result 178 states and 440 transitions. [2022-11-03 03:31:35,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:31:35,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-03 03:31:35,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:31:35,399 INFO L225 Difference]: With dead ends: 178 [2022-11-03 03:31:35,399 INFO L226 Difference]: Without dead ends: 178 [2022-11-03 03:31:35,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:35,400 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:31:35,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:31:35,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-03 03:31:35,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2022-11-03 03:31:35,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 163 states have (on average 2.6993865030674846) internal successors, (440), 177 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:35,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 440 transitions. [2022-11-03 03:31:35,405 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 440 transitions. Word has length 5 [2022-11-03 03:31:35,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:31:35,405 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 440 transitions. [2022-11-03 03:31:35,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:35,405 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 440 transitions. [2022-11-03 03:31:35,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 03:31:35,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:31:35,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 03:31:35,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-03 03:31:35,406 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-03 03:31:35,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:31:35,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1738116830, now seen corresponding path program 1 times [2022-11-03 03:31:35,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:31:35,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201285415] [2022-11-03 03:31:35,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:35,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:31:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:35,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:31:35,487 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:31:35,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201285415] [2022-11-03 03:31:35,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201285415] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:31:35,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:31:35,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:31:35,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738729056] [2022-11-03 03:31:35,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:31:35,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:31:35,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:31:35,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:31:35,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:35,490 INFO L87 Difference]: Start difference. First operand 178 states and 440 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:35,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:31:35,553 INFO L93 Difference]: Finished difference Result 118 states and 276 transitions. [2022-11-03 03:31:35,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:31:35,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-03 03:31:35,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:31:35,554 INFO L225 Difference]: With dead ends: 118 [2022-11-03 03:31:35,554 INFO L226 Difference]: Without dead ends: 118 [2022-11-03 03:31:35,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:35,555 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:31:35,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:31:35,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-03 03:31:35,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-11-03 03:31:35,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 110 states have (on average 2.5090909090909093) internal successors, (276), 117 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:35,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 276 transitions. [2022-11-03 03:31:35,559 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 276 transitions. Word has length 5 [2022-11-03 03:31:35,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:31:35,560 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 276 transitions. [2022-11-03 03:31:35,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:35,560 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 276 transitions. [2022-11-03 03:31:35,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 03:31:35,561 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:31:35,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 03:31:35,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-03 03:31:35,562 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-03 03:31:35,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:31:35,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1738116827, now seen corresponding path program 1 times [2022-11-03 03:31:35,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:31:35,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611485499] [2022-11-03 03:31:35,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:35,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:31:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:35,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:31:35,625 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:31:35,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611485499] [2022-11-03 03:31:35,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611485499] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:31:35,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:31:35,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:31:35,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598865595] [2022-11-03 03:31:35,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:31:35,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:31:35,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:31:35,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:31:35,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:35,628 INFO L87 Difference]: Start difference. First operand 118 states and 276 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:35,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:31:35,685 INFO L93 Difference]: Finished difference Result 70 states and 148 transitions. [2022-11-03 03:31:35,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:31:35,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-03 03:31:35,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:31:35,687 INFO L225 Difference]: With dead ends: 70 [2022-11-03 03:31:35,687 INFO L226 Difference]: Without dead ends: 70 [2022-11-03 03:31:35,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:35,687 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:31:35,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:31:35,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-03 03:31:35,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-03 03:31:35,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 67 states have (on average 2.208955223880597) internal successors, (148), 69 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:35,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 148 transitions. [2022-11-03 03:31:35,690 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 148 transitions. Word has length 5 [2022-11-03 03:31:35,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:31:35,690 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 148 transitions. [2022-11-03 03:31:35,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:35,690 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 148 transitions. [2022-11-03 03:31:35,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 03:31:35,691 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:31:35,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 03:31:35,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-03 03:31:35,691 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2022-11-03 03:31:35,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:31:35,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1738116824, now seen corresponding path program 1 times [2022-11-03 03:31:35,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:31:35,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088600552] [2022-11-03 03:31:35,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:31:35,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:31:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:31:35,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:31:35,899 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:31:35,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088600552] [2022-11-03 03:31:35,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088600552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:31:35,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:31:35,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:31:35,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613718389] [2022-11-03 03:31:35,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:31:35,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:31:35,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:31:35,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:31:35,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:35,902 INFO L87 Difference]: Start difference. First operand 70 states and 148 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:35,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:31:35,949 INFO L93 Difference]: Finished difference Result 34 states and 56 transitions. [2022-11-03 03:31:35,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:31:35,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-03 03:31:35,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:31:35,950 INFO L225 Difference]: With dead ends: 34 [2022-11-03 03:31:35,950 INFO L226 Difference]: Without dead ends: 0 [2022-11-03 03:31:35,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:31:35,951 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:31:35,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 03:31:35,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-03 03:31:35,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-03 03:31:35,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:35,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-03 03:31:35,952 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2022-11-03 03:31:35,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:31:35,952 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-03 03:31:35,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:31:35,952 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-03 03:31:35,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-03 03:31:35,955 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (146 of 147 remaining) [2022-11-03 03:31:35,955 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (145 of 147 remaining) [2022-11-03 03:31:35,955 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (144 of 147 remaining) [2022-11-03 03:31:35,956 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (143 of 147 remaining) [2022-11-03 03:31:35,956 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (142 of 147 remaining) [2022-11-03 03:31:35,956 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (141 of 147 remaining) [2022-11-03 03:31:35,956 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (140 of 147 remaining) [2022-11-03 03:31:35,956 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (139 of 147 remaining) [2022-11-03 03:31:35,956 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (138 of 147 remaining) [2022-11-03 03:31:35,956 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 147 remaining) [2022-11-03 03:31:35,957 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 147 remaining) [2022-11-03 03:31:35,957 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 147 remaining) [2022-11-03 03:31:35,957 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 147 remaining) [2022-11-03 03:31:35,957 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 147 remaining) [2022-11-03 03:31:35,957 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 147 remaining) [2022-11-03 03:31:35,957 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 147 remaining) [2022-11-03 03:31:35,957 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 147 remaining) [2022-11-03 03:31:35,957 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 147 remaining) [2022-11-03 03:31:35,958 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 147 remaining) [2022-11-03 03:31:35,958 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 147 remaining) [2022-11-03 03:31:35,958 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 147 remaining) [2022-11-03 03:31:35,958 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 147 remaining) [2022-11-03 03:31:35,958 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 147 remaining) [2022-11-03 03:31:35,961 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 147 remaining) [2022-11-03 03:31:35,961 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 147 remaining) [2022-11-03 03:31:35,961 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 147 remaining) [2022-11-03 03:31:35,962 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 147 remaining) [2022-11-03 03:31:35,962 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 147 remaining) [2022-11-03 03:31:35,962 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 147 remaining) [2022-11-03 03:31:35,962 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 147 remaining) [2022-11-03 03:31:35,962 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 147 remaining) [2022-11-03 03:31:35,963 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 147 remaining) [2022-11-03 03:31:35,963 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 147 remaining) [2022-11-03 03:31:35,963 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 147 remaining) [2022-11-03 03:31:35,965 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 147 remaining) [2022-11-03 03:31:35,965 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 147 remaining) [2022-11-03 03:31:35,965 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 147 remaining) [2022-11-03 03:31:35,965 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 147 remaining) [2022-11-03 03:31:35,966 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 147 remaining) [2022-11-03 03:31:35,966 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 147 remaining) [2022-11-03 03:31:35,966 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 147 remaining) [2022-11-03 03:31:35,966 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 147 remaining) [2022-11-03 03:31:35,966 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 147 remaining) [2022-11-03 03:31:35,967 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 147 remaining) [2022-11-03 03:31:35,967 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 147 remaining) [2022-11-03 03:31:35,967 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 147 remaining) [2022-11-03 03:31:35,967 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 147 remaining) [2022-11-03 03:31:35,968 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 147 remaining) [2022-11-03 03:31:35,968 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 147 remaining) [2022-11-03 03:31:35,968 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 147 remaining) [2022-11-03 03:31:35,968 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 147 remaining) [2022-11-03 03:31:35,968 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 147 remaining) [2022-11-03 03:31:35,969 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 147 remaining) [2022-11-03 03:31:35,969 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 147 remaining) [2022-11-03 03:31:35,969 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 147 remaining) [2022-11-03 03:31:35,969 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 147 remaining) [2022-11-03 03:31:35,969 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 147 remaining) [2022-11-03 03:31:35,969 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 147 remaining) [2022-11-03 03:31:35,970 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 147 remaining) [2022-11-03 03:31:35,970 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 147 remaining) [2022-11-03 03:31:35,970 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 147 remaining) [2022-11-03 03:31:35,970 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 147 remaining) [2022-11-03 03:31:35,970 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 147 remaining) [2022-11-03 03:31:35,971 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 147 remaining) [2022-11-03 03:31:35,971 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 147 remaining) [2022-11-03 03:31:35,971 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 147 remaining) [2022-11-03 03:31:35,971 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 147 remaining) [2022-11-03 03:31:35,971 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 147 remaining) [2022-11-03 03:31:35,972 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 147 remaining) [2022-11-03 03:31:35,972 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 147 remaining) [2022-11-03 03:31:35,972 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 147 remaining) [2022-11-03 03:31:35,972 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 147 remaining) [2022-11-03 03:31:35,972 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (74 of 147 remaining) [2022-11-03 03:31:35,973 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (73 of 147 remaining) [2022-11-03 03:31:35,973 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (72 of 147 remaining) [2022-11-03 03:31:35,973 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 147 remaining) [2022-11-03 03:31:35,973 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 147 remaining) [2022-11-03 03:31:35,973 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 147 remaining) [2022-11-03 03:31:35,973 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 147 remaining) [2022-11-03 03:31:35,974 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 147 remaining) [2022-11-03 03:31:35,974 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 147 remaining) [2022-11-03 03:31:35,974 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 147 remaining) [2022-11-03 03:31:35,974 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 147 remaining) [2022-11-03 03:31:35,974 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 147 remaining) [2022-11-03 03:31:35,975 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 147 remaining) [2022-11-03 03:31:35,976 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 147 remaining) [2022-11-03 03:31:35,976 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 147 remaining) [2022-11-03 03:31:35,977 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 147 remaining) [2022-11-03 03:31:35,977 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 147 remaining) [2022-11-03 03:31:35,977 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 147 remaining) [2022-11-03 03:31:35,977 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 147 remaining) [2022-11-03 03:31:35,977 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 147 remaining) [2022-11-03 03:31:35,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 147 remaining) [2022-11-03 03:31:35,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 147 remaining) [2022-11-03 03:31:35,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 147 remaining) [2022-11-03 03:31:35,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 147 remaining) [2022-11-03 03:31:35,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 147 remaining) [2022-11-03 03:31:35,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 147 remaining) [2022-11-03 03:31:35,979 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 147 remaining) [2022-11-03 03:31:35,979 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 147 remaining) [2022-11-03 03:31:35,979 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 147 remaining) [2022-11-03 03:31:35,979 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 147 remaining) [2022-11-03 03:31:35,979 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 147 remaining) [2022-11-03 03:31:35,980 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 147 remaining) [2022-11-03 03:31:35,980 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 147 remaining) [2022-11-03 03:31:35,980 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 147 remaining) [2022-11-03 03:31:35,980 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 147 remaining) [2022-11-03 03:31:35,980 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 147 remaining) [2022-11-03 03:31:35,981 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 147 remaining) [2022-11-03 03:31:35,981 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 147 remaining) [2022-11-03 03:31:35,981 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 147 remaining) [2022-11-03 03:31:35,981 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 147 remaining) [2022-11-03 03:31:35,981 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 147 remaining) [2022-11-03 03:31:35,982 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 147 remaining) [2022-11-03 03:31:35,982 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 147 remaining) [2022-11-03 03:31:35,982 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 147 remaining) [2022-11-03 03:31:35,982 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 147 remaining) [2022-11-03 03:31:35,982 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 147 remaining) [2022-11-03 03:31:35,983 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 147 remaining) [2022-11-03 03:31:35,983 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 147 remaining) [2022-11-03 03:31:35,983 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 147 remaining) [2022-11-03 03:31:35,983 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 147 remaining) [2022-11-03 03:31:35,983 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 147 remaining) [2022-11-03 03:31:35,984 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 147 remaining) [2022-11-03 03:31:35,984 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 147 remaining) [2022-11-03 03:31:35,984 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 147 remaining) [2022-11-03 03:31:35,984 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 147 remaining) [2022-11-03 03:31:35,984 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 147 remaining) [2022-11-03 03:31:35,985 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 147 remaining) [2022-11-03 03:31:35,985 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 147 remaining) [2022-11-03 03:31:35,985 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 147 remaining) [2022-11-03 03:31:35,985 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 147 remaining) [2022-11-03 03:31:35,985 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 147 remaining) [2022-11-03 03:31:35,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 147 remaining) [2022-11-03 03:31:35,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 147 remaining) [2022-11-03 03:31:35,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 147 remaining) [2022-11-03 03:31:35,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 147 remaining) [2022-11-03 03:31:35,986 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 147 remaining) [2022-11-03 03:31:35,987 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 147 remaining) [2022-11-03 03:31:35,987 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 147 remaining) [2022-11-03 03:31:35,987 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 147 remaining) [2022-11-03 03:31:35,987 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 147 remaining) [2022-11-03 03:31:35,987 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 147 remaining) [2022-11-03 03:31:35,987 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 147 remaining) [2022-11-03 03:31:35,988 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 147 remaining) [2022-11-03 03:31:35,988 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 147 remaining) [2022-11-03 03:31:35,988 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 147 remaining) [2022-11-03 03:31:35,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-03 03:31:35,992 INFO L444 BasicCegarLoop]: Path program 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] [2022-11-03 03:31:36,008 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-03 03:31:36,008 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 03:31:36,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 03:31:36 BasicIcfg [2022-11-03 03:31:36,017 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 03:31:36,018 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 03:31:36,018 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 03:31:36,018 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 03:31:36,019 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:30:07" (3/4) ... [2022-11-03 03:31:36,021 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-03 03:31:36,026 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-03 03:31:36,027 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-03 03:31:36,027 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-03 03:31:36,032 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-11-03 03:31:36,032 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-03 03:31:36,032 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-03 03:31:36,033 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-03 03:31:36,082 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_572de341-c4e9-4b3c-927b-633fe802f77c/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 03:31:36,082 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 03:31:36,083 INFO L158 Benchmark]: Toolchain (without parser) took 95873.76ms. Allocated memory was 113.2MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 76.4MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 436.2MB. Max. memory is 16.1GB. [2022-11-03 03:31:36,083 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 113.2MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:31:36,083 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.55ms. Allocated memory is still 113.2MB. Free memory was 76.2MB in the beginning and 88.4MB in the end (delta: -12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 03:31:36,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.80ms. Allocated memory is still 113.2MB. Free memory was 88.4MB in the beginning and 85.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-03 03:31:36,085 INFO L158 Benchmark]: Boogie Preprocessor took 65.74ms. Allocated memory is still 113.2MB. Free memory was 84.8MB in the beginning and 82.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 03:31:36,085 INFO L158 Benchmark]: RCFGBuilder took 6738.56ms. Allocated memory was 113.2MB in the beginning and 339.7MB in the end (delta: 226.5MB). Free memory was 82.4MB in the beginning and 94.5MB in the end (delta: -12.1MB). Peak memory consumption was 232.0MB. Max. memory is 16.1GB. [2022-11-03 03:31:36,087 INFO L158 Benchmark]: TraceAbstraction took 88567.26ms. Allocated memory was 339.7MB in the beginning and 1.7GB in the end (delta: 1.3GB). Free memory was 93.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 221.6MB. Max. memory is 16.1GB. [2022-11-03 03:31:36,088 INFO L158 Benchmark]: Witness Printer took 64.48ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-03 03:31:36,097 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 113.2MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.55ms. Allocated memory is still 113.2MB. Free memory was 76.2MB in the beginning and 88.4MB in the end (delta: -12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.80ms. Allocated memory is still 113.2MB. Free memory was 88.4MB in the beginning and 85.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.74ms. Allocated memory is still 113.2MB. Free memory was 84.8MB in the beginning and 82.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 6738.56ms. Allocated memory was 113.2MB in the beginning and 339.7MB in the end (delta: 226.5MB). Free memory was 82.4MB in the beginning and 94.5MB in the end (delta: -12.1MB). Peak memory consumption was 232.0MB. Max. memory is 16.1GB. * TraceAbstraction took 88567.26ms. Allocated memory was 339.7MB in the beginning and 1.7GB in the end (delta: 1.3GB). Free memory was 93.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 221.6MB. Max. memory is 16.1GB. * Witness Printer took 64.48ms. Allocated memory is still 1.7GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 71.3s, 205 PlacesBefore, 101 PlacesAfterwards, 196 TransitionsBefore, 91 TransitionsAfterwards, 6318 CoEnabledTransitionPairs, 8 FixpointIterations, 85 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 0 ConcurrentYvCompositions, 1 ChoiceCompositions, 111 TotalNumberOfCompositions, 4799 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4799, positive: 4799, positive conditional: 0, positive unconditional: 4799, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1365, positive: 1365, positive conditional: 0, positive unconditional: 1365, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1365, positive: 1365, positive conditional: 0, positive unconditional: 1365, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4799, positive: 3434, positive conditional: 0, positive unconditional: 3434, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1365, unknown conditional: 0, unknown unconditional: 1365] , Statistics on independence cache: Total cache size (in pairs): 390, Positive cache size: 390, Positive conditional cache size: 0, Positive unconditional cache size: 390, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 283 locations, 147 error locations. Started 1 CEGAR loops. OverallTime: 86.9s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 72.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 824 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 824 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 888 IncrementalHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 0 mSDtfsCounter, 888 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37956occurred in iteration=0, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 24 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 256 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 72 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-03 03:31:36,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_572de341-c4e9-4b3c-927b-633fe802f77c/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE