./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/kundu1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/kundu1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur --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 c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 --- 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-38b53e6 [2022-11-26 01:07:05,848 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 01:07:05,851 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 01:07:05,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 01:07:05,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 01:07:05,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 01:07:05,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 01:07:05,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 01:07:05,879 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 01:07:05,880 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 01:07:05,881 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 01:07:05,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 01:07:05,883 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 01:07:05,884 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 01:07:05,885 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 01:07:05,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 01:07:05,887 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 01:07:05,888 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 01:07:05,889 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 01:07:05,891 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 01:07:05,893 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 01:07:05,895 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 01:07:05,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 01:07:05,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 01:07:05,901 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 01:07:05,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 01:07:05,901 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 01:07:05,902 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 01:07:05,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 01:07:05,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 01:07:05,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 01:07:05,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 01:07:05,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 01:07:05,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 01:07:05,907 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 01:07:05,908 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 01:07:05,908 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 01:07:05,909 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 01:07:05,909 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 01:07:05,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 01:07:05,918 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 01:07:05,920 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-26 01:07:05,961 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 01:07:05,961 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 01:07:05,962 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 01:07:05,962 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 01:07:05,963 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 01:07:05,963 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 01:07:05,963 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 01:07:05,963 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 01:07:05,963 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 01:07:05,964 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 01:07:05,964 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 01:07:05,964 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 01:07:05,964 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 01:07:05,964 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 01:07:05,964 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 01:07:05,965 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 01:07:05,965 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 01:07:05,965 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 01:07:05,966 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 01:07:05,966 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 01:07:05,966 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 01:07:05,966 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 01:07:05,966 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 01:07:05,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 01:07:05,967 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 01:07:05,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 01:07:05,967 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 01:07:05,967 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-26 01:07:05,967 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 01:07:05,968 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 01:07:05,968 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 01:07:05,968 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 01:07:05,968 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 01:07:05,968 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 01:07:05,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 01:07:05,969 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 01:07:05,969 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 01:07:05,969 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 01:07:05,969 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 01:07:05,969 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 01:07:05,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 01:07:05,970 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 01:07:05,970 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 01:07:05,975 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_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/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_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur 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 -> c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 [2022-11-26 01:07:06,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 01:07:06,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 01:07:06,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 01:07:06,338 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 01:07:06,339 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 01:07:06,340 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/systemc/kundu1.cil.c [2022-11-26 01:07:09,334 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 01:07:09,522 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 01:07:09,523 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/sv-benchmarks/c/systemc/kundu1.cil.c [2022-11-26 01:07:09,531 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/data/24e66221c/ac1e944cdb0546bd9f14bbab32347851/FLAGa80a65e3c [2022-11-26 01:07:09,545 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/data/24e66221c/ac1e944cdb0546bd9f14bbab32347851 [2022-11-26 01:07:09,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 01:07:09,549 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 01:07:09,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 01:07:09,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 01:07:09,554 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 01:07:09,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:07:09" (1/1) ... [2022-11-26 01:07:09,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5246e48a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:09, skipping insertion in model container [2022-11-26 01:07:09,557 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:07:09" (1/1) ... [2022-11-26 01:07:09,595 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 01:07:09,660 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 01:07:09,790 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2022-11-26 01:07:09,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 01:07:09,846 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 01:07:09,857 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2022-11-26 01:07:09,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 01:07:09,899 INFO L208 MainTranslator]: Completed translation [2022-11-26 01:07:09,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:09 WrapperNode [2022-11-26 01:07:09,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 01:07:09,901 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 01:07:09,901 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 01:07:09,901 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 01:07:09,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:09" (1/1) ... [2022-11-26 01:07:09,912 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:09" (1/1) ... [2022-11-26 01:07:09,957 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 265 [2022-11-26 01:07:09,957 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 01:07:09,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 01:07:09,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 01:07:09,958 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 01:07:09,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:09" (1/1) ... [2022-11-26 01:07:09,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:09" (1/1) ... [2022-11-26 01:07:09,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:09" (1/1) ... [2022-11-26 01:07:09,969 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:09" (1/1) ... [2022-11-26 01:07:09,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:09" (1/1) ... [2022-11-26 01:07:09,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:09" (1/1) ... [2022-11-26 01:07:09,980 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:09" (1/1) ... [2022-11-26 01:07:09,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:09" (1/1) ... [2022-11-26 01:07:09,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 01:07:09,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 01:07:09,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 01:07:09,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 01:07:09,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:09" (1/1) ... [2022-11-26 01:07:09,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 01:07:10,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:10,039 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 01:07:10,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 01:07:10,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 01:07:10,092 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-11-26 01:07:10,092 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-11-26 01:07:10,092 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-26 01:07:10,092 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-26 01:07:10,093 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-26 01:07:10,093 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-26 01:07:10,093 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-26 01:07:10,093 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-26 01:07:10,093 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-26 01:07:10,093 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-26 01:07:10,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 01:07:10,094 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-26 01:07:10,094 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-26 01:07:10,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 01:07:10,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 01:07:10,187 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 01:07:10,189 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 01:07:10,684 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 01:07:10,830 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 01:07:10,830 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-26 01:07:10,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:07:10 BoogieIcfgContainer [2022-11-26 01:07:10,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 01:07:10,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 01:07:10,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 01:07:10,842 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 01:07:10,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 01:07:09" (1/3) ... [2022-11-26 01:07:10,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c791f62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:07:10, skipping insertion in model container [2022-11-26 01:07:10,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:09" (2/3) ... [2022-11-26 01:07:10,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c791f62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:07:10, skipping insertion in model container [2022-11-26 01:07:10,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:07:10" (3/3) ... [2022-11-26 01:07:10,849 INFO L112 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2022-11-26 01:07:10,870 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 01:07:10,871 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-26 01:07:10,952 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 01:07:10,959 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;@46539538, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 01:07:10,960 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-26 01:07:10,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 70 states have internal predecessors, (92), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-26 01:07:10,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-26 01:07:10,978 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:10,978 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:10,979 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 01:07:10,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:10,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2123757291, now seen corresponding path program 1 times [2022-11-26 01:07:10,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:10,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579069727] [2022-11-26 01:07:10,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:11,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:11,368 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-26 01:07:11,369 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:11,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579069727] [2022-11-26 01:07:11,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579069727] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:11,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:11,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:07:11,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199252452] [2022-11-26 01:07:11,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:11,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:07:11,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:11,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:07:11,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:07:11,432 INFO L87 Difference]: Start difference. First operand has 89 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 70 states have internal predecessors, (92), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-26 01:07:11,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:11,782 INFO L93 Difference]: Finished difference Result 251 states and 347 transitions. [2022-11-26 01:07:11,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:07:11,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-11-26 01:07:11,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:11,793 INFO L225 Difference]: With dead ends: 251 [2022-11-26 01:07:11,793 INFO L226 Difference]: Without dead ends: 155 [2022-11-26 01:07:11,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:07:11,800 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 205 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:11,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 320 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 01:07:11,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-26 01:07:11,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 142. [2022-11-26 01:07:11,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 104 states have (on average 1.4711538461538463) internal successors, (153), 112 states have internal predecessors, (153), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-26 01:07:11,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 193 transitions. [2022-11-26 01:07:11,855 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 193 transitions. Word has length 33 [2022-11-26 01:07:11,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:11,856 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 193 transitions. [2022-11-26 01:07:11,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-26 01:07:11,857 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 193 transitions. [2022-11-26 01:07:11,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-26 01:07:11,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:11,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:11,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 01:07:11,859 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 01:07:11,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:11,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1391229076, now seen corresponding path program 1 times [2022-11-26 01:07:11,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:11,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188453482] [2022-11-26 01:07:11,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:11,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:11,931 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-26 01:07:11,932 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:11,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188453482] [2022-11-26 01:07:11,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188453482] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:11,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:11,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:07:11,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048617536] [2022-11-26 01:07:11,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:11,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:07:11,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:11,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:07:11,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:07:11,936 INFO L87 Difference]: Start difference. First operand 142 states and 193 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-26 01:07:12,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:12,112 INFO L93 Difference]: Finished difference Result 411 states and 558 transitions. [2022-11-26 01:07:12,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:07:12,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-11-26 01:07:12,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:12,116 INFO L225 Difference]: With dead ends: 411 [2022-11-26 01:07:12,116 INFO L226 Difference]: Without dead ends: 274 [2022-11-26 01:07:12,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:07:12,119 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 185 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:12,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 272 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:07:12,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-11-26 01:07:12,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 242. [2022-11-26 01:07:12,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 178 states have (on average 1.3932584269662922) internal successors, (248), 186 states have internal predecessors, (248), 36 states have call successors, (36), 20 states have call predecessors, (36), 20 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-11-26 01:07:12,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 320 transitions. [2022-11-26 01:07:12,171 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 320 transitions. Word has length 33 [2022-11-26 01:07:12,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:12,172 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 320 transitions. [2022-11-26 01:07:12,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-26 01:07:12,172 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 320 transitions. [2022-11-26 01:07:12,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-26 01:07:12,173 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:12,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:12,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 01:07:12,174 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 01:07:12,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:12,175 INFO L85 PathProgramCache]: Analyzing trace with hash -187866102, now seen corresponding path program 1 times [2022-11-26 01:07:12,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:12,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139060814] [2022-11-26 01:07:12,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:12,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:12,260 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-26 01:07:12,260 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:12,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139060814] [2022-11-26 01:07:12,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139060814] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:12,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:12,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:07:12,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911182498] [2022-11-26 01:07:12,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:12,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:12,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:12,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:12,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:12,263 INFO L87 Difference]: Start difference. First operand 242 states and 320 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-26 01:07:12,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:12,353 INFO L93 Difference]: Finished difference Result 493 states and 662 transitions. [2022-11-26 01:07:12,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:07:12,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2022-11-26 01:07:12,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:12,356 INFO L225 Difference]: With dead ends: 493 [2022-11-26 01:07:12,356 INFO L226 Difference]: Without dead ends: 357 [2022-11-26 01:07:12,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:12,359 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 74 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:12,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 171 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:07:12,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-11-26 01:07:12,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2022-11-26 01:07:12,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 267 states have (on average 1.3745318352059925) internal successors, (367), 275 states have internal predecessors, (367), 52 states have call successors, (52), 30 states have call predecessors, (52), 30 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-11-26 01:07:12,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 471 transitions. [2022-11-26 01:07:12,402 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 471 transitions. Word has length 34 [2022-11-26 01:07:12,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:12,402 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 471 transitions. [2022-11-26 01:07:12,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-26 01:07:12,403 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 471 transitions. [2022-11-26 01:07:12,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-26 01:07:12,404 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:12,404 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:12,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 01:07:12,405 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 01:07:12,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:12,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1638929732, now seen corresponding path program 1 times [2022-11-26 01:07:12,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:12,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631266880] [2022-11-26 01:07:12,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:12,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:12,463 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-26 01:07:12,463 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:12,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631266880] [2022-11-26 01:07:12,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631266880] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:12,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:12,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:07:12,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936489259] [2022-11-26 01:07:12,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:12,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:12,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:12,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:12,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:12,494 INFO L87 Difference]: Start difference. First operand 357 states and 471 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-26 01:07:12,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:12,551 INFO L93 Difference]: Finished difference Result 357 states and 471 transitions. [2022-11-26 01:07:12,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:07:12,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2022-11-26 01:07:12,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:12,554 INFO L225 Difference]: With dead ends: 357 [2022-11-26 01:07:12,555 INFO L226 Difference]: Without dead ends: 355 [2022-11-26 01:07:12,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:12,556 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:12,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 83 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:07:12,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-11-26 01:07:12,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2022-11-26 01:07:12,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 267 states have (on average 1.3595505617977528) internal successors, (363), 273 states have internal predecessors, (363), 52 states have call successors, (52), 30 states have call predecessors, (52), 30 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-11-26 01:07:12,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 467 transitions. [2022-11-26 01:07:12,593 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 467 transitions. Word has length 35 [2022-11-26 01:07:12,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:12,594 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 467 transitions. [2022-11-26 01:07:12,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-26 01:07:12,595 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 467 transitions. [2022-11-26 01:07:12,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-26 01:07:12,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:12,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:12,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-26 01:07:12,596 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 01:07:12,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:12,597 INFO L85 PathProgramCache]: Analyzing trace with hash 732786114, now seen corresponding path program 1 times [2022-11-26 01:07:12,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:12,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17154890] [2022-11-26 01:07:12,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:12,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:12,648 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-26 01:07:12,649 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:12,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17154890] [2022-11-26 01:07:12,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17154890] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:12,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:12,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:07:12,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929691479] [2022-11-26 01:07:12,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:12,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:12,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:12,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:12,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:12,652 INFO L87 Difference]: Start difference. First operand 355 states and 467 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-26 01:07:12,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:12,740 INFO L93 Difference]: Finished difference Result 376 states and 489 transitions. [2022-11-26 01:07:12,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:07:12,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-11-26 01:07:12,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:12,743 INFO L225 Difference]: With dead ends: 376 [2022-11-26 01:07:12,744 INFO L226 Difference]: Without dead ends: 374 [2022-11-26 01:07:12,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:12,745 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 76 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:12,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 175 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:07:12,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-11-26 01:07:12,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 370. [2022-11-26 01:07:12,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 282 states have (on average 1.3546099290780143) internal successors, (382), 288 states have internal predecessors, (382), 52 states have call successors, (52), 30 states have call predecessors, (52), 30 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-11-26 01:07:12,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 486 transitions. [2022-11-26 01:07:12,779 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 486 transitions. Word has length 36 [2022-11-26 01:07:12,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:12,780 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 486 transitions. [2022-11-26 01:07:12,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-26 01:07:12,781 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 486 transitions. [2022-11-26 01:07:12,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-26 01:07:12,782 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:12,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:12,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-26 01:07:12,783 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 01:07:12,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:12,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1018655309, now seen corresponding path program 1 times [2022-11-26 01:07:12,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:12,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022380646] [2022-11-26 01:07:12,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:12,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:12,858 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-26 01:07:12,858 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:12,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022380646] [2022-11-26 01:07:12,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022380646] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:12,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:12,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 01:07:12,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618924605] [2022-11-26 01:07:12,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:12,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:07:12,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:12,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:07:12,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:07:12,861 INFO L87 Difference]: Start difference. First operand 370 states and 486 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-26 01:07:13,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:13,054 INFO L93 Difference]: Finished difference Result 559 states and 739 transitions. [2022-11-26 01:07:13,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:07:13,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 42 [2022-11-26 01:07:13,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:13,058 INFO L225 Difference]: With dead ends: 559 [2022-11-26 01:07:13,058 INFO L226 Difference]: Without dead ends: 426 [2022-11-26 01:07:13,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:07:13,060 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 144 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:13,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 281 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:07:13,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-11-26 01:07:13,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 425. [2022-11-26 01:07:13,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 324 states have (on average 1.3518518518518519) internal successors, (438), 330 states have internal predecessors, (438), 60 states have call successors, (60), 35 states have call predecessors, (60), 35 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2022-11-26 01:07:13,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 558 transitions. [2022-11-26 01:07:13,108 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 558 transitions. Word has length 42 [2022-11-26 01:07:13,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:13,109 INFO L495 AbstractCegarLoop]: Abstraction has 425 states and 558 transitions. [2022-11-26 01:07:13,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-26 01:07:13,110 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 558 transitions. [2022-11-26 01:07:13,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-26 01:07:13,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:13,111 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:13,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-26 01:07:13,112 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 01:07:13,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:13,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1513543769, now seen corresponding path program 1 times [2022-11-26 01:07:13,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:13,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825831370] [2022-11-26 01:07:13,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:13,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:13,185 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-26 01:07:13,186 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:13,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825831370] [2022-11-26 01:07:13,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825831370] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:13,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:13,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 01:07:13,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673376733] [2022-11-26 01:07:13,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:13,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:07:13,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:13,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:07:13,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:07:13,189 INFO L87 Difference]: Start difference. First operand 425 states and 558 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-26 01:07:13,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:13,374 INFO L93 Difference]: Finished difference Result 613 states and 807 transitions. [2022-11-26 01:07:13,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:07:13,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 43 [2022-11-26 01:07:13,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:13,378 INFO L225 Difference]: With dead ends: 613 [2022-11-26 01:07:13,378 INFO L226 Difference]: Without dead ends: 611 [2022-11-26 01:07:13,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:07:13,380 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 196 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:13,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 220 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:07:13,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-11-26 01:07:13,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 607. [2022-11-26 01:07:13,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 467 states have (on average 1.3490364025695931) internal successors, (630), 473 states have internal predecessors, (630), 84 states have call successors, (84), 50 states have call predecessors, (84), 50 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-11-26 01:07:13,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 798 transitions. [2022-11-26 01:07:13,428 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 798 transitions. Word has length 43 [2022-11-26 01:07:13,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:13,428 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 798 transitions. [2022-11-26 01:07:13,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-26 01:07:13,429 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 798 transitions. [2022-11-26 01:07:13,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-26 01:07:13,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:13,430 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:13,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-26 01:07:13,431 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 01:07:13,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:13,431 INFO L85 PathProgramCache]: Analyzing trace with hash -995224183, now seen corresponding path program 1 times [2022-11-26 01:07:13,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:13,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650632791] [2022-11-26 01:07:13,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:13,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:13,479 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 01:07:13,479 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:13,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650632791] [2022-11-26 01:07:13,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650632791] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:13,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:13,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 01:07:13,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58673895] [2022-11-26 01:07:13,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:13,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:13,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:13,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:13,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:13,482 INFO L87 Difference]: Start difference. First operand 607 states and 798 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-26 01:07:13,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:13,601 INFO L93 Difference]: Finished difference Result 1551 states and 2042 transitions. [2022-11-26 01:07:13,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:07:13,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 52 [2022-11-26 01:07:13,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:13,607 INFO L225 Difference]: With dead ends: 1551 [2022-11-26 01:07:13,608 INFO L226 Difference]: Without dead ends: 950 [2022-11-26 01:07:13,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:13,610 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 43 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:13,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 208 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:07:13,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2022-11-26 01:07:13,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 765. [2022-11-26 01:07:13,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 601 states have (on average 1.3594009983361064) internal successors, (817), 608 states have internal predecessors, (817), 96 states have call successors, (96), 62 states have call predecessors, (96), 62 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2022-11-26 01:07:13,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1009 transitions. [2022-11-26 01:07:13,680 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1009 transitions. Word has length 52 [2022-11-26 01:07:13,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:13,681 INFO L495 AbstractCegarLoop]: Abstraction has 765 states and 1009 transitions. [2022-11-26 01:07:13,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-26 01:07:13,681 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1009 transitions. [2022-11-26 01:07:13,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-26 01:07:13,683 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:13,683 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:13,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-26 01:07:13,683 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 01:07:13,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:13,684 INFO L85 PathProgramCache]: Analyzing trace with hash 137229770, now seen corresponding path program 1 times [2022-11-26 01:07:13,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:13,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895861077] [2022-11-26 01:07:13,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:13,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:13,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:13,891 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 01:07:13,891 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:13,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895861077] [2022-11-26 01:07:13,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895861077] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:13,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:13,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-26 01:07:13,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850001229] [2022-11-26 01:07:13,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:13,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 01:07:13,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:13,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 01:07:13,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-26 01:07:13,894 INFO L87 Difference]: Start difference. First operand 765 states and 1009 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-26 01:07:14,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:14,273 INFO L93 Difference]: Finished difference Result 2035 states and 2676 transitions. [2022-11-26 01:07:14,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-26 01:07:14,274 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 58 [2022-11-26 01:07:14,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:14,280 INFO L225 Difference]: With dead ends: 2035 [2022-11-26 01:07:14,280 INFO L226 Difference]: Without dead ends: 1276 [2022-11-26 01:07:14,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-26 01:07:14,283 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 186 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:14,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 283 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:07:14,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2022-11-26 01:07:14,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1238. [2022-11-26 01:07:14,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 948 states have (on average 1.3386075949367089) internal successors, (1269), 954 states have internal predecessors, (1269), 174 states have call successors, (174), 110 states have call predecessors, (174), 110 states have return successors, (174), 174 states have call predecessors, (174), 174 states have call successors, (174) [2022-11-26 01:07:14,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1617 transitions. [2022-11-26 01:07:14,408 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1617 transitions. Word has length 58 [2022-11-26 01:07:14,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:14,408 INFO L495 AbstractCegarLoop]: Abstraction has 1238 states and 1617 transitions. [2022-11-26 01:07:14,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-26 01:07:14,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1617 transitions. [2022-11-26 01:07:14,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-26 01:07:14,410 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:14,411 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:14,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-26 01:07:14,411 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 01:07:14,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:14,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1417127900, now seen corresponding path program 1 times [2022-11-26 01:07:14,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:14,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072915121] [2022-11-26 01:07:14,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:14,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 01:07:14,455 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:14,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072915121] [2022-11-26 01:07:14,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072915121] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:14,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:14,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 01:07:14,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662240408] [2022-11-26 01:07:14,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:14,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:14,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:14,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:14,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:14,457 INFO L87 Difference]: Start difference. First operand 1238 states and 1617 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-26 01:07:14,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:14,691 INFO L93 Difference]: Finished difference Result 3102 states and 4018 transitions. [2022-11-26 01:07:14,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:07:14,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2022-11-26 01:07:14,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:14,700 INFO L225 Difference]: With dead ends: 3102 [2022-11-26 01:07:14,701 INFO L226 Difference]: Without dead ends: 1870 [2022-11-26 01:07:14,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:14,705 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 46 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:14,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 208 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:07:14,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2022-11-26 01:07:14,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1600. [2022-11-26 01:07:14,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1246 states have (on average 1.3282504012841092) internal successors, (1655), 1253 states have internal predecessors, (1655), 206 states have call successors, (206), 142 states have call predecessors, (206), 142 states have return successors, (206), 205 states have call predecessors, (206), 206 states have call successors, (206) [2022-11-26 01:07:14,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2067 transitions. [2022-11-26 01:07:14,924 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2067 transitions. Word has length 59 [2022-11-26 01:07:14,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:14,924 INFO L495 AbstractCegarLoop]: Abstraction has 1600 states and 2067 transitions. [2022-11-26 01:07:14,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-26 01:07:14,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2067 transitions. [2022-11-26 01:07:14,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-26 01:07:14,928 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:14,928 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:14,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-26 01:07:14,928 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 01:07:14,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:14,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1153558705, now seen corresponding path program 1 times [2022-11-26 01:07:14,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:14,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028132859] [2022-11-26 01:07:14,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:14,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:14,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:15,069 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-26 01:07:15,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:15,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028132859] [2022-11-26 01:07:15,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028132859] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:15,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279662133] [2022-11-26 01:07:15,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:15,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:15,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:15,074 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:15,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 01:07:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:15,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-26 01:07:15,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:15,378 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-26 01:07:15,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:07:15,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279662133] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:15,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:07:15,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2022-11-26 01:07:15,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523252385] [2022-11-26 01:07:15,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:15,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:15,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:15,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:15,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-26 01:07:15,383 INFO L87 Difference]: Start difference. First operand 1600 states and 2067 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-26 01:07:15,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:15,569 INFO L93 Difference]: Finished difference Result 2704 states and 3543 transitions. [2022-11-26 01:07:15,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:07:15,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 90 [2022-11-26 01:07:15,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:15,577 INFO L225 Difference]: With dead ends: 2704 [2022-11-26 01:07:15,577 INFO L226 Difference]: Without dead ends: 1600 [2022-11-26 01:07:15,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-26 01:07:15,580 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:15,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 88 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:07:15,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2022-11-26 01:07:15,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1600. [2022-11-26 01:07:15,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1246 states have (on average 1.3170144462279294) internal successors, (1641), 1253 states have internal predecessors, (1641), 206 states have call successors, (206), 142 states have call predecessors, (206), 142 states have return successors, (206), 205 states have call predecessors, (206), 206 states have call successors, (206) [2022-11-26 01:07:15,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2053 transitions. [2022-11-26 01:07:15,735 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2053 transitions. Word has length 90 [2022-11-26 01:07:15,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:15,736 INFO L495 AbstractCegarLoop]: Abstraction has 1600 states and 2053 transitions. [2022-11-26 01:07:15,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-26 01:07:15,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2053 transitions. [2022-11-26 01:07:15,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-26 01:07:15,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:15,739 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:15,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-26 01:07:15,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:15,945 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 01:07:15,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:15,946 INFO L85 PathProgramCache]: Analyzing trace with hash -954835796, now seen corresponding path program 1 times [2022-11-26 01:07:15,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:15,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661977539] [2022-11-26 01:07:15,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:15,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:16,078 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-26 01:07:16,079 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:16,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661977539] [2022-11-26 01:07:16,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661977539] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:16,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370203809] [2022-11-26 01:07:16,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:16,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:16,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:16,081 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:16,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 01:07:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:16,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-26 01:07:16,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:16,293 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-26 01:07:16,293 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:07:16,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370203809] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:16,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:07:16,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2022-11-26 01:07:16,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999472156] [2022-11-26 01:07:16,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:16,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:16,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:16,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:16,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-26 01:07:16,296 INFO L87 Difference]: Start difference. First operand 1600 states and 2053 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-26 01:07:16,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:16,562 INFO L93 Difference]: Finished difference Result 4258 states and 5484 transitions. [2022-11-26 01:07:16,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:07:16,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 91 [2022-11-26 01:07:16,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:16,576 INFO L225 Difference]: With dead ends: 4258 [2022-11-26 01:07:16,577 INFO L226 Difference]: Without dead ends: 3154 [2022-11-26 01:07:16,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-26 01:07:16,581 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 53 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:16,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 182 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:07:16,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3154 states. [2022-11-26 01:07:16,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3154 to 3140. [2022-11-26 01:07:16,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3140 states, 2466 states have (on average 1.3146796431467964) internal successors, (3242), 2473 states have internal predecessors, (3242), 386 states have call successors, (386), 282 states have call predecessors, (386), 282 states have return successors, (386), 385 states have call predecessors, (386), 386 states have call successors, (386) [2022-11-26 01:07:16,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 4014 transitions. [2022-11-26 01:07:16,932 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 4014 transitions. Word has length 91 [2022-11-26 01:07:16,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:16,932 INFO L495 AbstractCegarLoop]: Abstraction has 3140 states and 4014 transitions. [2022-11-26 01:07:16,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-26 01:07:16,933 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 4014 transitions. [2022-11-26 01:07:16,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-26 01:07:16,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:16,936 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:16,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 01:07:17,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:17,151 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 01:07:17,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:17,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1711481227, now seen corresponding path program 1 times [2022-11-26 01:07:17,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:17,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011610675] [2022-11-26 01:07:17,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:17,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:17,316 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-26 01:07:17,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:17,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011610675] [2022-11-26 01:07:17,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011610675] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:17,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022789084] [2022-11-26 01:07:17,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:17,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:17,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:17,319 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:17,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 01:07:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:17,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 01:07:17,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 01:07:17,474 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:07:17,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022789084] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:17,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:07:17,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-26 01:07:17,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621857981] [2022-11-26 01:07:17,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:17,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:17,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:17,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:17,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-26 01:07:17,481 INFO L87 Difference]: Start difference. First operand 3140 states and 4014 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-26 01:07:17,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:17,852 INFO L93 Difference]: Finished difference Result 5965 states and 7740 transitions. [2022-11-26 01:07:17,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:07:17,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 91 [2022-11-26 01:07:17,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:17,869 INFO L225 Difference]: With dead ends: 5965 [2022-11-26 01:07:17,869 INFO L226 Difference]: Without dead ends: 3791 [2022-11-26 01:07:17,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-26 01:07:17,875 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 62 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:17,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 231 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:07:17,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3791 states. [2022-11-26 01:07:18,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3791 to 3670. [2022-11-26 01:07:18,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3670 states, 2834 states have (on average 1.2865208186309103) internal successors, (3646), 2841 states have internal predecessors, (3646), 482 states have call successors, (482), 348 states have call predecessors, (482), 348 states have return successors, (500), 481 states have call predecessors, (500), 482 states have call successors, (500) [2022-11-26 01:07:18,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3670 states to 3670 states and 4628 transitions. [2022-11-26 01:07:18,259 INFO L78 Accepts]: Start accepts. Automaton has 3670 states and 4628 transitions. Word has length 91 [2022-11-26 01:07:18,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:18,259 INFO L495 AbstractCegarLoop]: Abstraction has 3670 states and 4628 transitions. [2022-11-26 01:07:18,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-26 01:07:18,260 INFO L276 IsEmpty]: Start isEmpty. Operand 3670 states and 4628 transitions. [2022-11-26 01:07:18,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-26 01:07:18,262 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:18,263 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:18,273 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 01:07:18,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-26 01:07:18,468 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 01:07:18,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:18,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1684958278, now seen corresponding path program 1 times [2022-11-26 01:07:18,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:18,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137416929] [2022-11-26 01:07:18,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:18,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:18,610 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-26 01:07:18,611 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:18,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137416929] [2022-11-26 01:07:18,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137416929] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:18,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522641058] [2022-11-26 01:07:18,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:18,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:18,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:18,613 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:18,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 01:07:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:18,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 01:07:18,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:18,886 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-26 01:07:18,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:07:19,044 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-26 01:07:19,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522641058] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:07:19,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1297187133] [2022-11-26 01:07:19,066 INFO L159 IcfgInterpreter]: Started Sifa with 61 locations of interest [2022-11-26 01:07:19,067 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:07:19,070 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:07:19,076 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:07:19,076 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:07:24,073 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 105 for LOIs [2022-11-26 01:07:24,113 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 111 for LOIs [2022-11-26 01:07:24,147 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 111 for LOIs [2022-11-26 01:07:24,186 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 38 for LOIs [2022-11-26 01:07:24,192 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 119 for LOIs [2022-11-26 01:07:24,563 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:07:33,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1297187133] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:33,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:07:33,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [6, 2, 3] total 47 [2022-11-26 01:07:33,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403807952] [2022-11-26 01:07:33,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:33,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-26 01:07:33,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:33,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-26 01:07:33,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1854, Unknown=0, NotChecked=0, Total=2162 [2022-11-26 01:07:33,338 INFO L87 Difference]: Start difference. First operand 3670 states and 4628 transitions. Second operand has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 33 states have internal predecessors, (47), 7 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2022-11-26 01:07:40,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:40,203 INFO L93 Difference]: Finished difference Result 6578 states and 8306 transitions. [2022-11-26 01:07:40,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-26 01:07:40,204 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 33 states have internal predecessors, (47), 7 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) Word has length 96 [2022-11-26 01:07:40,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:40,219 INFO L225 Difference]: With dead ends: 6578 [2022-11-26 01:07:40,219 INFO L226 Difference]: Without dead ends: 3864 [2022-11-26 01:07:40,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 241 SyntacticMatches, 7 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1915 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=692, Invalid=4710, Unknown=0, NotChecked=0, Total=5402 [2022-11-26 01:07:40,227 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 143 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:40,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 365 Invalid, 1425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-26 01:07:40,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3864 states. [2022-11-26 01:07:40,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3864 to 3794. [2022-11-26 01:07:40,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3794 states, 2926 states have (on average 1.284688995215311) internal successors, (3759), 2933 states have internal predecessors, (3759), 500 states have call successors, (500), 362 states have call predecessors, (500), 362 states have return successors, (518), 499 states have call predecessors, (518), 500 states have call successors, (518) [2022-11-26 01:07:40,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 4777 transitions. [2022-11-26 01:07:40,572 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 4777 transitions. Word has length 96 [2022-11-26 01:07:40,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:40,573 INFO L495 AbstractCegarLoop]: Abstraction has 3794 states and 4777 transitions. [2022-11-26 01:07:40,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 33 states have internal predecessors, (47), 7 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2022-11-26 01:07:40,573 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 4777 transitions. [2022-11-26 01:07:40,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-26 01:07:40,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:40,577 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:40,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-26 01:07:40,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-26 01:07:40,783 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 01:07:40,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:40,783 INFO L85 PathProgramCache]: Analyzing trace with hash -809567415, now seen corresponding path program 1 times [2022-11-26 01:07:40,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:40,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001062951] [2022-11-26 01:07:40,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:40,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-26 01:07:40,902 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:40,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001062951] [2022-11-26 01:07:40,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001062951] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:40,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741388573] [2022-11-26 01:07:40,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:40,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:40,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:40,904 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:40,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 01:07:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:41,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 01:07:41,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-26 01:07:41,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:07:41,291 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-26 01:07:41,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741388573] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:07:41,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [28228559] [2022-11-26 01:07:41,295 INFO L159 IcfgInterpreter]: Started Sifa with 62 locations of interest [2022-11-26 01:07:41,295 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:07:41,296 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:07:41,296 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:07:41,296 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:07:45,219 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 105 for LOIs [2022-11-26 01:07:45,250 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 111 for LOIs [2022-11-26 01:07:45,283 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 111 for LOIs [2022-11-26 01:07:45,315 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 71 for LOIs [2022-11-26 01:07:45,332 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 119 for LOIs [2022-11-26 01:07:45,774 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:07:53,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [28228559] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:53,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:07:53,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [6, 2, 3] total 47 [2022-11-26 01:07:53,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647291641] [2022-11-26 01:07:53,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:53,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-26 01:07:53,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:53,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-26 01:07:53,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=1868, Unknown=0, NotChecked=0, Total=2162 [2022-11-26 01:07:53,415 INFO L87 Difference]: Start difference. First operand 3794 states and 4777 transitions. Second operand has 39 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 33 states have internal predecessors, (49), 7 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2022-11-26 01:08:04,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:08:04,205 INFO L93 Difference]: Finished difference Result 6230 states and 7884 transitions. [2022-11-26 01:08:04,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-26 01:08:04,206 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 33 states have internal predecessors, (49), 7 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) Word has length 97 [2022-11-26 01:08:04,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:08:04,219 INFO L225 Difference]: With dead ends: 6230 [2022-11-26 01:08:04,219 INFO L226 Difference]: Without dead ends: 3521 [2022-11-26 01:08:04,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 242 SyntacticMatches, 9 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2795 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=1000, Invalid=7190, Unknown=0, NotChecked=0, Total=8190 [2022-11-26 01:08:04,229 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 146 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 2703 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 2775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-26 01:08:04,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 848 Invalid, 2775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2703 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-26 01:08:04,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3521 states. [2022-11-26 01:08:04,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3521 to 3409. [2022-11-26 01:08:04,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3409 states, 2633 states have (on average 1.286745157614888) internal successors, (3388), 2640 states have internal predecessors, (3388), 448 states have call successors, (448), 322 states have call predecessors, (448), 322 states have return successors, (464), 447 states have call predecessors, (464), 448 states have call successors, (464) [2022-11-26 01:08:04,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 4300 transitions. [2022-11-26 01:08:04,545 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 4300 transitions. Word has length 97 [2022-11-26 01:08:04,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:08:04,546 INFO L495 AbstractCegarLoop]: Abstraction has 3409 states and 4300 transitions. [2022-11-26 01:08:04,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 33 states have internal predecessors, (49), 7 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2022-11-26 01:08:04,547 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 4300 transitions. [2022-11-26 01:08:04,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-26 01:08:04,553 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:08:04,553 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:08:04,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-26 01:08:04,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:04,759 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 01:08:04,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:08:04,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1991679011, now seen corresponding path program 1 times [2022-11-26 01:08:04,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:08:04,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465031874] [2022-11-26 01:08:04,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:04,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:08:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:05,138 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 19 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-26 01:08:05,138 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:08:05,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465031874] [2022-11-26 01:08:05,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465031874] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:08:05,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658476808] [2022-11-26 01:08:05,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:05,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:05,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:08:05,141 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:08:05,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-26 01:08:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:05,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-26 01:08:05,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:08:05,318 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-26 01:08:05,319 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:08:05,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658476808] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:08:05,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:08:05,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [12] total 13 [2022-11-26 01:08:05,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741292934] [2022-11-26 01:08:05,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:08:05,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:08:05,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:08:05,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:08:05,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-11-26 01:08:05,321 INFO L87 Difference]: Start difference. First operand 3409 states and 4300 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-26 01:08:05,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:08:05,647 INFO L93 Difference]: Finished difference Result 5999 states and 7604 transitions. [2022-11-26 01:08:05,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:08:05,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2022-11-26 01:08:05,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:08:05,661 INFO L225 Difference]: With dead ends: 5999 [2022-11-26 01:08:05,661 INFO L226 Difference]: Without dead ends: 3415 [2022-11-26 01:08:05,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-11-26 01:08:05,667 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 51 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:08:05,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 182 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:08:05,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3415 states. [2022-11-26 01:08:05,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3415 to 3409. [2022-11-26 01:08:05,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3409 states, 2633 states have (on average 1.2799088492214203) internal successors, (3370), 2640 states have internal predecessors, (3370), 448 states have call successors, (448), 322 states have call predecessors, (448), 322 states have return successors, (464), 447 states have call predecessors, (464), 448 states have call successors, (464) [2022-11-26 01:08:05,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 4282 transitions. [2022-11-26 01:08:05,964 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 4282 transitions. Word has length 98 [2022-11-26 01:08:05,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:08:05,964 INFO L495 AbstractCegarLoop]: Abstraction has 3409 states and 4282 transitions. [2022-11-26 01:08:05,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-26 01:08:05,965 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 4282 transitions. [2022-11-26 01:08:05,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-26 01:08:05,968 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:08:05,968 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:08:05,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-26 01:08:06,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-26 01:08:06,181 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 01:08:06,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:08:06,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1028185596, now seen corresponding path program 1 times [2022-11-26 01:08:06,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:08:06,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217131779] [2022-11-26 01:08:06,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:06,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:08:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:06,528 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 19 proven. 18 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-26 01:08:06,528 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:08:06,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217131779] [2022-11-26 01:08:06,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217131779] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:08:06,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487648191] [2022-11-26 01:08:06,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:06,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:06,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:08:06,530 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:08:06,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-26 01:08:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:06,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 01:08:06,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:08:06,664 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 01:08:06,664 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:08:06,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487648191] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:08:06,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:08:06,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-11-26 01:08:06,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569548192] [2022-11-26 01:08:06,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:08:06,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:08:06,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:08:06,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:08:06,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-11-26 01:08:06,671 INFO L87 Difference]: Start difference. First operand 3409 states and 4282 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-26 01:08:07,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:08:07,121 INFO L93 Difference]: Finished difference Result 6052 states and 7683 transitions. [2022-11-26 01:08:07,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:08:07,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 98 [2022-11-26 01:08:07,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:08:07,153 INFO L225 Difference]: With dead ends: 6052 [2022-11-26 01:08:07,160 INFO L226 Difference]: Without dead ends: 3468 [2022-11-26 01:08:07,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-11-26 01:08:07,167 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 73 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:08:07,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 229 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:08:07,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3468 states. [2022-11-26 01:08:07,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3468 to 3409. [2022-11-26 01:08:07,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3409 states, 2633 states have (on average 1.2662362324344854) internal successors, (3334), 2640 states have internal predecessors, (3334), 448 states have call successors, (448), 322 states have call predecessors, (448), 322 states have return successors, (464), 447 states have call predecessors, (464), 448 states have call successors, (464) [2022-11-26 01:08:07,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 4246 transitions. [2022-11-26 01:08:07,512 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 4246 transitions. Word has length 98 [2022-11-26 01:08:07,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:08:07,513 INFO L495 AbstractCegarLoop]: Abstraction has 3409 states and 4246 transitions. [2022-11-26 01:08:07,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-26 01:08:07,513 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 4246 transitions. [2022-11-26 01:08:07,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-26 01:08:07,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:08:07,516 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:08:07,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-26 01:08:07,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-26 01:08:07,723 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 01:08:07,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:08:07,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1024717273, now seen corresponding path program 1 times [2022-11-26 01:08:07,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:08:07,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359726624] [2022-11-26 01:08:07,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:07,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:08:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:08,031 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 19 proven. 18 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-26 01:08:08,031 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:08:08,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359726624] [2022-11-26 01:08:08,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359726624] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:08:08,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20936608] [2022-11-26 01:08:08,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:08,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:08,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:08:08,035 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:08:08,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-26 01:08:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:08,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 01:08:08,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:08:08,279 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 41 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-26 01:08:08,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:08:08,418 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-26 01:08:08,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20936608] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:08:08,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [62412080] [2022-11-26 01:08:08,421 INFO L159 IcfgInterpreter]: Started Sifa with 58 locations of interest [2022-11-26 01:08:08,421 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:08:08,421 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:08:08,421 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:08:08,421 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:08:11,668 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 103 for LOIs [2022-11-26 01:08:11,685 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 111 for LOIs [2022-11-26 01:08:11,714 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 111 for LOIs [2022-11-26 01:08:11,747 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 38 for LOIs [2022-11-26 01:08:11,752 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 119 for LOIs [2022-11-26 01:08:11,876 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:08:17,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [62412080] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:08:17,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:08:17,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [12, 4, 5] total 45 [2022-11-26 01:08:17,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482185977] [2022-11-26 01:08:17,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:08:17,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-26 01:08:17,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:08:17,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-26 01:08:17,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=1705, Unknown=0, NotChecked=0, Total=1980 [2022-11-26 01:08:17,097 INFO L87 Difference]: Start difference. First operand 3409 states and 4246 transitions. Second operand has 32 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-11-26 01:08:20,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:08:20,647 INFO L93 Difference]: Finished difference Result 6920 states and 8625 transitions. [2022-11-26 01:08:20,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-26 01:08:20,647 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) Word has length 99 [2022-11-26 01:08:20,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:08:20,658 INFO L225 Difference]: With dead ends: 6920 [2022-11-26 01:08:20,658 INFO L226 Difference]: Without dead ends: 3517 [2022-11-26 01:08:20,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 258 SyntacticMatches, 10 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=466, Invalid=3074, Unknown=0, NotChecked=0, Total=3540 [2022-11-26 01:08:20,666 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 54 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 1843 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 1865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-26 01:08:20,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 668 Invalid, 1865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1843 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-26 01:08:20,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3517 states. [2022-11-26 01:08:20,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3517 to 3429. [2022-11-26 01:08:20,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3429 states, 2649 states have (on average 1.2627406568516422) internal successors, (3345), 2655 states have internal predecessors, (3345), 451 states have call successors, (451), 323 states have call predecessors, (451), 323 states have return successors, (467), 451 states have call predecessors, (467), 451 states have call successors, (467) [2022-11-26 01:08:20,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3429 states to 3429 states and 4263 transitions. [2022-11-26 01:08:20,984 INFO L78 Accepts]: Start accepts. Automaton has 3429 states and 4263 transitions. Word has length 99 [2022-11-26 01:08:20,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:08:20,984 INFO L495 AbstractCegarLoop]: Abstraction has 3429 states and 4263 transitions. [2022-11-26 01:08:20,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 states have internal predecessors, (44), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-11-26 01:08:20,985 INFO L276 IsEmpty]: Start isEmpty. Operand 3429 states and 4263 transitions. [2022-11-26 01:08:20,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-26 01:08:20,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:08:20,988 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:08:21,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-26 01:08:21,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-26 01:08:21,203 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 01:08:21,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:08:21,203 INFO L85 PathProgramCache]: Analyzing trace with hash 333311659, now seen corresponding path program 1 times [2022-11-26 01:08:21,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:08:21,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817919166] [2022-11-26 01:08:21,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:21,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:08:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:21,518 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 19 proven. 18 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-26 01:08:21,519 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:08:21,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817919166] [2022-11-26 01:08:21,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817919166] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:08:21,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752028969] [2022-11-26 01:08:21,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:21,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:21,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:08:21,520 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:08:21,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-26 01:08:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:21,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 01:08:21,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:08:21,806 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-26 01:08:21,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:08:21,961 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-26 01:08:21,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752028969] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:08:21,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1037433453] [2022-11-26 01:08:21,965 INFO L159 IcfgInterpreter]: Started Sifa with 59 locations of interest [2022-11-26 01:08:21,965 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:08:21,965 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:08:21,965 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:08:21,965 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:08:25,893 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 103 for LOIs [2022-11-26 01:08:25,910 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 111 for LOIs [2022-11-26 01:08:25,929 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 111 for LOIs [2022-11-26 01:08:25,947 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 38 for LOIs [2022-11-26 01:08:25,953 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 119 for LOIs [2022-11-26 01:08:26,068 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:08:33,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1037433453] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:08:33,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:08:33,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [12, 3, 4] total 49 [2022-11-26 01:08:33,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314954252] [2022-11-26 01:08:33,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:08:33,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-26 01:08:33,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:08:33,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-26 01:08:33,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=2067, Unknown=0, NotChecked=0, Total=2352 [2022-11-26 01:08:33,909 INFO L87 Difference]: Start difference. First operand 3429 states and 4263 transitions. Second operand has 33 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 states have internal predecessors, (46), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-11-26 01:08:38,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:08:38,785 INFO L93 Difference]: Finished difference Result 5967 states and 7438 transitions. [2022-11-26 01:08:38,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-26 01:08:38,785 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 states have internal predecessors, (46), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) Word has length 100 [2022-11-26 01:08:38,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:08:38,796 INFO L225 Difference]: With dead ends: 5967 [2022-11-26 01:08:38,796 INFO L226 Difference]: Without dead ends: 3383 [2022-11-26 01:08:38,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 250 SyntacticMatches, 17 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1693 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=470, Invalid=3562, Unknown=0, NotChecked=0, Total=4032 [2022-11-26 01:08:38,803 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 65 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 1822 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 1849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-26 01:08:38,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 647 Invalid, 1849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1822 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-26 01:08:38,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3383 states. [2022-11-26 01:08:39,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3383 to 3141. [2022-11-26 01:08:39,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 2425 states have (on average 1.2622680412371134) internal successors, (3061), 2431 states have internal predecessors, (3061), 415 states have call successors, (415), 295 states have call predecessors, (415), 295 states have return successors, (431), 415 states have call predecessors, (431), 415 states have call successors, (431) [2022-11-26 01:08:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 3907 transitions. [2022-11-26 01:08:39,112 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 3907 transitions. Word has length 100 [2022-11-26 01:08:39,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:08:39,112 INFO L495 AbstractCegarLoop]: Abstraction has 3141 states and 3907 transitions. [2022-11-26 01:08:39,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 states have internal predecessors, (46), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-11-26 01:08:39,113 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 3907 transitions. [2022-11-26 01:08:39,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-26 01:08:39,115 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:08:39,116 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:08:39,125 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-26 01:08:39,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:39,321 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 01:08:39,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:08:39,321 INFO L85 PathProgramCache]: Analyzing trace with hash -872734514, now seen corresponding path program 1 times [2022-11-26 01:08:39,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:08:39,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719462517] [2022-11-26 01:08:39,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:39,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:08:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:39,365 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-26 01:08:39,365 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:08:39,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719462517] [2022-11-26 01:08:39,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719462517] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:08:39,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:08:39,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:08:39,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970045452] [2022-11-26 01:08:39,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:08:39,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:08:39,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:08:39,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:08:39,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:08:39,368 INFO L87 Difference]: Start difference. First operand 3141 states and 3907 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-26 01:08:39,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:08:39,755 INFO L93 Difference]: Finished difference Result 4966 states and 6229 transitions. [2022-11-26 01:08:39,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:08:39,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 102 [2022-11-26 01:08:39,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:08:39,764 INFO L225 Difference]: With dead ends: 4966 [2022-11-26 01:08:39,764 INFO L226 Difference]: Without dead ends: 2644 [2022-11-26 01:08:39,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:08:39,769 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 170 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:08:39,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 256 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:08:39,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2022-11-26 01:08:40,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 2561. [2022-11-26 01:08:40,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2561 states, 1991 states have (on average 1.2521346057257658) internal successors, (2493), 1997 states have internal predecessors, (2493), 329 states have call successors, (329), 235 states have call predecessors, (329), 235 states have return successors, (329), 329 states have call predecessors, (329), 329 states have call successors, (329) [2022-11-26 01:08:40,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 3151 transitions. [2022-11-26 01:08:40,039 INFO L78 Accepts]: Start accepts. Automaton has 2561 states and 3151 transitions. Word has length 102 [2022-11-26 01:08:40,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:08:40,040 INFO L495 AbstractCegarLoop]: Abstraction has 2561 states and 3151 transitions. [2022-11-26 01:08:40,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-11-26 01:08:40,040 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 3151 transitions. [2022-11-26 01:08:40,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-26 01:08:40,043 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:08:40,043 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:08:40,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-26 01:08:40,043 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 01:08:40,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:08:40,044 INFO L85 PathProgramCache]: Analyzing trace with hash 320061323, now seen corresponding path program 1 times [2022-11-26 01:08:40,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:08:40,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55957539] [2022-11-26 01:08:40,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:40,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:08:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-26 01:08:40,099 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:08:40,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55957539] [2022-11-26 01:08:40,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55957539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:08:40,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:08:40,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:08:40,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208535150] [2022-11-26 01:08:40,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:08:40,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:08:40,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:08:40,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:08:40,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:08:40,101 INFO L87 Difference]: Start difference. First operand 2561 states and 3151 transitions. Second operand has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-26 01:08:40,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:08:40,362 INFO L93 Difference]: Finished difference Result 2561 states and 3151 transitions. [2022-11-26 01:08:40,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:08:40,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2022-11-26 01:08:40,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:08:40,370 INFO L225 Difference]: With dead ends: 2561 [2022-11-26 01:08:40,370 INFO L226 Difference]: Without dead ends: 2559 [2022-11-26 01:08:40,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:08:40,372 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 68 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:08:40,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 78 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:08:40,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2559 states. [2022-11-26 01:08:40,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2559 to 2549. [2022-11-26 01:08:40,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2549 states, 1981 states have (on average 1.2423018677435638) internal successors, (2461), 1985 states have internal predecessors, (2461), 329 states have call successors, (329), 235 states have call predecessors, (329), 235 states have return successors, (329), 329 states have call predecessors, (329), 329 states have call successors, (329) [2022-11-26 01:08:40,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2549 states and 3119 transitions. [2022-11-26 01:08:40,653 INFO L78 Accepts]: Start accepts. Automaton has 2549 states and 3119 transitions. Word has length 103 [2022-11-26 01:08:40,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:08:40,653 INFO L495 AbstractCegarLoop]: Abstraction has 2549 states and 3119 transitions. [2022-11-26 01:08:40,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-26 01:08:40,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 3119 transitions. [2022-11-26 01:08:40,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-26 01:08:40,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:08:40,656 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:08:40,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-26 01:08:40,657 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 01:08:40,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:08:40,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1376968750, now seen corresponding path program 1 times [2022-11-26 01:08:40,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:08:40,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127628773] [2022-11-26 01:08:40,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:40,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:08:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:40,760 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-26 01:08:40,760 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:08:40,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127628773] [2022-11-26 01:08:40,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127628773] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:08:40,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505337768] [2022-11-26 01:08:40,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:40,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:40,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:08:40,762 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:08:40,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-26 01:08:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:40,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 01:08:40,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:08:41,003 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-26 01:08:41,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:08:41,128 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-26 01:08:41,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505337768] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:08:41,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2081189136] [2022-11-26 01:08:41,131 INFO L159 IcfgInterpreter]: Started Sifa with 68 locations of interest [2022-11-26 01:08:41,131 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:08:41,132 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:08:41,132 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:08:41,132 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:08:44,952 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 105 for LOIs [2022-11-26 01:08:44,972 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 111 for LOIs [2022-11-26 01:08:45,004 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 111 for LOIs [2022-11-26 01:08:45,026 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 38 for LOIs [2022-11-26 01:08:45,032 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 119 for LOIs [2022-11-26 01:08:45,431 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:08:56,028 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '160433#(and (= |ULTIMATE.start_read_data_~__retres3~0#1| ~data_0~0) (<= 0 ~data_0~0) (= ~C_1_pc~0 1) (< 2147483646 ~i~0) (= ~P_1_pc~0 1) (<= |ULTIMATE.start_eval_~tmp___2~0#1| 1) (= ~e~0 0) (<= ~data_0~0 65) (= |ULTIMATE.start_read_data_#in~i___0#1| ~num~0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (= |ULTIMATE.start_write_data_~i___0#1| 0) (= ~P_1_ev~0 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= ~C_1_pr~0 0) (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0)) (= ~max_loop~0 2) (= 2 ~P_1_st~0) (= ~P_1_i~0 1) (= |ULTIMATE.start_write_data_#in~c#1| 65) (= |ULTIMATE.start_read_data_#res#1| |ULTIMATE.start_read_data_~__retres3~0#1|) (= |ULTIMATE.start_read_data_#res#1| |ULTIMATE.start_C_1_~c~1#1|) (= ~num~0 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_eval_~tmp___2~0#1|) (<= 0 ~timer~0) (= |ULTIMATE.start_read_data_#in~i___0#1| |ULTIMATE.start_read_data_~i___0#1|) (= ~C_1_ev~0 0) (<= |ULTIMATE.start_eval_~tmp___1~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (= ~data_1~0 0) (<= 0 (+ |ULTIMATE.start_eval_~tmp___1~0#1| 2147483648)) (= ~C_1_st~0 1) (= ~C_1_i~0 1) (= |#NULL.base| 0))' at error location [2022-11-26 01:08:56,028 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:08:56,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:08:56,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 2, 3] total 10 [2022-11-26 01:08:56,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70496219] [2022-11-26 01:08:56,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:08:56,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-26 01:08:56,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:08:56,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-26 01:08:56,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=2845, Unknown=0, NotChecked=0, Total=3192 [2022-11-26 01:08:56,032 INFO L87 Difference]: Start difference. First operand 2549 states and 3119 transitions. Second operand has 10 states, 10 states have (on average 18.6) internal successors, (186), 10 states have internal predecessors, (186), 7 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 7 states have call predecessors, (36), 7 states have call successors, (36) [2022-11-26 01:08:57,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:08:57,954 INFO L93 Difference]: Finished difference Result 14380 states and 17457 transitions. [2022-11-26 01:08:57,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-26 01:08:57,957 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 18.6) internal successors, (186), 10 states have internal predecessors, (186), 7 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 7 states have call predecessors, (36), 7 states have call successors, (36) Word has length 103 [2022-11-26 01:08:57,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:08:57,990 INFO L225 Difference]: With dead ends: 14380 [2022-11-26 01:08:57,990 INFO L226 Difference]: Without dead ends: 11837 [2022-11-26 01:08:57,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 266 SyntacticMatches, 7 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2764 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=715, Invalid=5765, Unknown=0, NotChecked=0, Total=6480 [2022-11-26 01:08:57,999 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 1583 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 572 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1591 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 572 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-26 01:08:57,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1591 Valid, 497 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [572 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-26 01:08:58,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11837 states. [2022-11-26 01:08:59,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11837 to 11822. [2022-11-26 01:08:59,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11822 states, 8936 states have (on average 1.20367054610564) internal successors, (10756), 8940 states have internal predecessors, (10756), 1696 states have call successors, (1696), 1186 states have call predecessors, (1696), 1186 states have return successors, (1696), 1696 states have call predecessors, (1696), 1696 states have call successors, (1696) [2022-11-26 01:08:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11822 states to 11822 states and 14148 transitions. [2022-11-26 01:08:59,145 INFO L78 Accepts]: Start accepts. Automaton has 11822 states and 14148 transitions. Word has length 103 [2022-11-26 01:08:59,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:08:59,146 INFO L495 AbstractCegarLoop]: Abstraction has 11822 states and 14148 transitions. [2022-11-26 01:08:59,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.6) internal successors, (186), 10 states have internal predecessors, (186), 7 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 7 states have call predecessors, (36), 7 states have call successors, (36) [2022-11-26 01:08:59,146 INFO L276 IsEmpty]: Start isEmpty. Operand 11822 states and 14148 transitions. [2022-11-26 01:08:59,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-26 01:08:59,150 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:08:59,150 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:08:59,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-11-26 01:08:59,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:59,359 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 01:08:59,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:08:59,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1845296670, now seen corresponding path program 1 times [2022-11-26 01:08:59,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:08:59,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421442422] [2022-11-26 01:08:59,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:59,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:08:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:59,674 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-26 01:08:59,675 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:08:59,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421442422] [2022-11-26 01:08:59,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421442422] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:08:59,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788141692] [2022-11-26 01:08:59,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:59,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:59,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:08:59,677 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:08:59,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-26 01:08:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:59,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 01:08:59,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:08:59,923 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-26 01:08:59,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:09:00,060 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 34 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-11-26 01:09:00,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788141692] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:09:00,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1629290007] [2022-11-26 01:09:00,063 INFO L159 IcfgInterpreter]: Started Sifa with 58 locations of interest [2022-11-26 01:09:00,063 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:09:00,063 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:09:00,064 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:09:00,064 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:09:03,113 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 107 for LOIs [2022-11-26 01:09:03,132 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 115 for LOIs [2022-11-26 01:09:03,153 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 115 for LOIs [2022-11-26 01:09:03,173 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 42 for LOIs [2022-11-26 01:09:03,179 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 123 for LOIs [2022-11-26 01:09:03,308 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:09:10,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1629290007] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:09:10,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:09:10,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [12, 4, 5] total 47 [2022-11-26 01:09:10,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305956155] [2022-11-26 01:09:10,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:09:10,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-26 01:09:10,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:09:10,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-26 01:09:10,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1857, Unknown=0, NotChecked=0, Total=2162 [2022-11-26 01:09:10,917 INFO L87 Difference]: Start difference. First operand 11822 states and 14148 transitions. Second operand has 34 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 29 states have internal predecessors, (45), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-11-26 01:09:14,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:09:14,979 INFO L93 Difference]: Finished difference Result 12108 states and 14476 transitions. [2022-11-26 01:09:14,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-26 01:09:14,979 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 29 states have internal predecessors, (45), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) Word has length 108 [2022-11-26 01:09:14,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:09:15,011 INFO L225 Difference]: With dead ends: 12108 [2022-11-26 01:09:15,012 INFO L226 Difference]: Without dead ends: 12107 [2022-11-26 01:09:15,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 279 SyntacticMatches, 14 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=518, Invalid=3264, Unknown=0, NotChecked=0, Total=3782 [2022-11-26 01:09:15,018 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 80 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-26 01:09:15,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 549 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1608 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-26 01:09:15,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12107 states. [2022-11-26 01:09:16,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12107 to 12018. [2022-11-26 01:09:16,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12018 states, 9080 states have (on average 1.2027533039647578) internal successors, (10921), 9084 states have internal predecessors, (10921), 1726 states have call successors, (1726), 1208 states have call predecessors, (1726), 1208 states have return successors, (1726), 1726 states have call predecessors, (1726), 1726 states have call successors, (1726) [2022-11-26 01:09:16,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12018 states to 12018 states and 14373 transitions. [2022-11-26 01:09:16,076 INFO L78 Accepts]: Start accepts. Automaton has 12018 states and 14373 transitions. Word has length 108 [2022-11-26 01:09:16,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:09:16,076 INFO L495 AbstractCegarLoop]: Abstraction has 12018 states and 14373 transitions. [2022-11-26 01:09:16,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 29 states have internal predecessors, (45), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2022-11-26 01:09:16,077 INFO L276 IsEmpty]: Start isEmpty. Operand 12018 states and 14373 transitions. [2022-11-26 01:09:16,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-26 01:09:16,081 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:09:16,083 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:09:16,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-26 01:09:16,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:09:16,289 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 01:09:16,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:09:16,289 INFO L85 PathProgramCache]: Analyzing trace with hash -655536756, now seen corresponding path program 1 times [2022-11-26 01:09:16,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:09:16,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128115220] [2022-11-26 01:09:16,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:09:16,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:09:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:09:16,605 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-26 01:09:16,606 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:09:16,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128115220] [2022-11-26 01:09:16,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128115220] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:09:16,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330359740] [2022-11-26 01:09:16,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:09:16,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:09:16,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:09:16,611 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:09:16,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-26 01:09:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:09:16,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 01:09:16,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:09:16,876 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-26 01:09:16,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:09:17,043 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-11-26 01:09:17,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330359740] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:09:17,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [146647767] [2022-11-26 01:09:17,046 INFO L159 IcfgInterpreter]: Started Sifa with 59 locations of interest [2022-11-26 01:09:17,046 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:09:17,046 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:09:17,046 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:09:17,046 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:09:20,590 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 103 for LOIs [2022-11-26 01:09:20,607 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 111 for LOIs [2022-11-26 01:09:20,629 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 111 for LOIs [2022-11-26 01:09:20,649 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 38 for LOIs [2022-11-26 01:09:20,652 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 119 for LOIs [2022-11-26 01:09:20,761 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:09:28,954 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '234656#(and (<= 0 ~data_0~0) (<= 0 ~P_1_ev~0) (<= |ULTIMATE.start_eval_~tmp___2~0#1| 1) (< 2147483648 ~num~0) (= ~i~0 0) (<= ~e~0 0) (<= 0 ~e~0) (<= 2 ~max_loop~0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= |#NULL.offset| 0) (<= ~max_loop~0 2) (<= 1 ~P_1_i~0) (= |ULTIMATE.start_main_~count~0#1| 0) (<= ~timer~0 0) (<= ~C_1_i~0 1) (<= ~P_1_ev~0 0) (= ~C_1_pr~0 0) (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0)) (<= ~C_1_ev~0 0) (= ~C_1_pc~0 0) (<= 0 ~data_1~0) (<= 0 ~C_1_ev~0) (<= 0 ~P_1_pc~0) (<= 0 |ULTIMATE.start_eval_~tmp___2~0#1|) (<= 0 ~timer~0) (<= 0 |#NULL.offset|) (<= ~P_1_i~0 1) (<= |ULTIMATE.start_eval_~tmp___1~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_eval_~tmp___1~0#1| 2147483648)) (<= 1 ~C_1_i~0) (= ~C_1_st~0 1) (= |#NULL.base| 0))' at error location [2022-11-26 01:09:28,954 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:09:28,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:09:28,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 3, 4] total 18 [2022-11-26 01:09:28,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277197469] [2022-11-26 01:09:28,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:09:28,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-26 01:09:28,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:09:28,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-26 01:09:28,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=2272, Unknown=0, NotChecked=0, Total=2550 [2022-11-26 01:09:28,957 INFO L87 Difference]: Start difference. First operand 12018 states and 14373 transitions. Second operand has 18 states, 16 states have (on average 12.1875) internal successors, (195), 16 states have internal predecessors, (195), 9 states have call successors, (38), 5 states have call predecessors, (38), 7 states have return successors, (39), 11 states have call predecessors, (39), 9 states have call successors, (39) [2022-11-26 01:09:32,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:09:32,793 INFO L93 Difference]: Finished difference Result 29774 states and 36607 transitions. [2022-11-26 01:09:32,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-11-26 01:09:32,793 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 12.1875) internal successors, (195), 16 states have internal predecessors, (195), 9 states have call successors, (38), 5 states have call predecessors, (38), 7 states have return successors, (39), 11 states have call predecessors, (39), 9 states have call successors, (39) Word has length 109 [2022-11-26 01:09:32,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:09:32,842 INFO L225 Difference]: With dead ends: 29774 [2022-11-26 01:09:32,843 INFO L226 Difference]: Without dead ends: 17748 [2022-11-26 01:09:32,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 285 SyntacticMatches, 17 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7865 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=1947, Invalid=15875, Unknown=0, NotChecked=0, Total=17822 [2022-11-26 01:09:32,868 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 1786 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 556 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1786 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 556 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-26 01:09:32,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1786 Valid, 811 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [556 Valid, 1073 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-26 01:09:32,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17748 states. [2022-11-26 01:09:34,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17748 to 14250. [2022-11-26 01:09:34,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14250 states, 11133 states have (on average 1.2186293002784514) internal successors, (13567), 11135 states have internal predecessors, (13567), 1772 states have call successors, (1772), 1342 states have call predecessors, (1772), 1342 states have return successors, (1772), 1772 states have call predecessors, (1772), 1772 states have call successors, (1772) [2022-11-26 01:09:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14250 states to 14250 states and 17111 transitions. [2022-11-26 01:09:34,187 INFO L78 Accepts]: Start accepts. Automaton has 14250 states and 17111 transitions. Word has length 109 [2022-11-26 01:09:34,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:09:34,188 INFO L495 AbstractCegarLoop]: Abstraction has 14250 states and 17111 transitions. [2022-11-26 01:09:34,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 12.1875) internal successors, (195), 16 states have internal predecessors, (195), 9 states have call successors, (38), 5 states have call predecessors, (38), 7 states have return successors, (39), 11 states have call predecessors, (39), 9 states have call successors, (39) [2022-11-26 01:09:34,188 INFO L276 IsEmpty]: Start isEmpty. Operand 14250 states and 17111 transitions. [2022-11-26 01:09:34,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-11-26 01:09:34,215 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:09:34,215 INFO L195 NwaCegarLoop]: trace histogram [18, 10, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:09:34,227 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-26 01:09:34,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-26 01:09:34,427 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 01:09:34,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:09:34,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1762751281, now seen corresponding path program 1 times [2022-11-26 01:09:34,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:09:34,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725907188] [2022-11-26 01:09:34,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:09:34,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:09:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:09:34,651 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 210 proven. 47 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2022-11-26 01:09:34,651 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:09:34,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725907188] [2022-11-26 01:09:34,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725907188] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:09:34,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846879439] [2022-11-26 01:09:34,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:09:34,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:09:34,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:09:34,653 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:09:34,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-26 01:09:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:09:34,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 01:09:34,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:09:35,005 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 486 proven. 1 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2022-11-26 01:09:35,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:09:35,244 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 215 proven. 1 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2022-11-26 01:09:35,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846879439] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:09:35,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2133838610] [2022-11-26 01:09:35,250 INFO L159 IcfgInterpreter]: Started Sifa with 60 locations of interest [2022-11-26 01:09:35,250 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:09:35,252 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:09:35,252 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:09:35,252 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:09:38,428 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 105 for LOIs [2022-11-26 01:09:38,452 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 111 for LOIs [2022-11-26 01:09:38,470 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 111 for LOIs [2022-11-26 01:09:38,488 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 38 for LOIs [2022-11-26 01:09:38,495 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 119 for LOIs [2022-11-26 01:09:38,632 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:09:47,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [2133838610] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:09:47,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:09:47,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [5, 4, 5] total 48 [2022-11-26 01:09:47,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897052069] [2022-11-26 01:09:47,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:09:47,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-26 01:09:47,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:09:47,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-26 01:09:47,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=1940, Unknown=0, NotChecked=0, Total=2256 [2022-11-26 01:09:47,735 INFO L87 Difference]: Start difference. First operand 14250 states and 17111 transitions. Second operand has 41 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 7 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2022-11-26 01:10:04,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:04,579 INFO L93 Difference]: Finished difference Result 33241 states and 39820 transitions. [2022-11-26 01:10:04,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-11-26 01:10:04,580 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 7 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) Word has length 275 [2022-11-26 01:10:04,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:04,627 INFO L225 Difference]: With dead ends: 33241 [2022-11-26 01:10:04,627 INFO L226 Difference]: Without dead ends: 21668 [2022-11-26 01:10:04,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 773 SyntacticMatches, 9 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3939 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=1245, Invalid=10745, Unknown=0, NotChecked=0, Total=11990 [2022-11-26 01:10:04,649 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 341 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 2670 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 2794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 2670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-26 01:10:04,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 562 Invalid, 2794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 2670 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-26 01:10:04,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21668 states. [2022-11-26 01:10:06,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21668 to 20350. [2022-11-26 01:10:06,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20350 states, 15877 states have (on average 1.2200037790514582) internal successors, (19370), 15879 states have internal predecessors, (19370), 2528 states have call successors, (2528), 1942 states have call predecessors, (2528), 1942 states have return successors, (2528), 2528 states have call predecessors, (2528), 2528 states have call successors, (2528) [2022-11-26 01:10:06,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20350 states to 20350 states and 24426 transitions. [2022-11-26 01:10:06,941 INFO L78 Accepts]: Start accepts. Automaton has 20350 states and 24426 transitions. Word has length 275 [2022-11-26 01:10:06,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:06,941 INFO L495 AbstractCegarLoop]: Abstraction has 20350 states and 24426 transitions. [2022-11-26 01:10:06,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 7 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2022-11-26 01:10:06,942 INFO L276 IsEmpty]: Start isEmpty. Operand 20350 states and 24426 transitions. [2022-11-26 01:10:06,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2022-11-26 01:10:06,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:06,978 INFO L195 NwaCegarLoop]: trace histogram [18, 10, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-26 01:10:06,990 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-26 01:10:07,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-26 01:10:07,187 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 01:10:07,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:07,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1190951651, now seen corresponding path program 1 times [2022-11-26 01:10:07,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:07,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778404202] [2022-11-26 01:10:07,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:07,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:07,324 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2022-11-26 01:10:07,324 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:07,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778404202] [2022-11-26 01:10:07,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778404202] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:10:07,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:10:07,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 01:10:07,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844688586] [2022-11-26 01:10:07,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:10:07,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:10:07,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:07,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:10:07,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:10:07,327 INFO L87 Difference]: Start difference. First operand 20350 states and 24426 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-26 01:10:09,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:09,287 INFO L93 Difference]: Finished difference Result 21291 states and 25555 transitions. [2022-11-26 01:10:09,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 01:10:09,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 276 [2022-11-26 01:10:09,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:09,334 INFO L225 Difference]: With dead ends: 21291 [2022-11-26 01:10:09,334 INFO L226 Difference]: Without dead ends: 21290 [2022-11-26 01:10:09,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:10:09,343 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 100 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:10:09,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 231 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:10:09,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21290 states. [2022-11-26 01:10:10,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21290 to 5665. [2022-11-26 01:10:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5665 states, 4479 states have (on average 1.2129939718687206) internal successors, (5433), 4480 states have internal predecessors, (5433), 668 states have call successors, (668), 516 states have call predecessors, (668), 516 states have return successors, (668), 668 states have call predecessors, (668), 668 states have call successors, (668) [2022-11-26 01:10:10,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5665 states to 5665 states and 6769 transitions. [2022-11-26 01:10:10,903 INFO L78 Accepts]: Start accepts. Automaton has 5665 states and 6769 transitions. Word has length 276 [2022-11-26 01:10:10,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:10,904 INFO L495 AbstractCegarLoop]: Abstraction has 5665 states and 6769 transitions. [2022-11-26 01:10:10,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-26 01:10:10,904 INFO L276 IsEmpty]: Start isEmpty. Operand 5665 states and 6769 transitions. [2022-11-26 01:10:10,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-11-26 01:10:10,921 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:10,921 INFO L195 NwaCegarLoop]: trace histogram [17, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:10:10,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-26 01:10:10,921 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 01:10:10,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:10,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1388658268, now seen corresponding path program 1 times [2022-11-26 01:10:10,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:10,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099604958] [2022-11-26 01:10:10,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:10,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:11,098 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 93 proven. 15 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2022-11-26 01:10:11,099 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:11,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099604958] [2022-11-26 01:10:11,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099604958] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:10:11,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309201912] [2022-11-26 01:10:11,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:11,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:11,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:10:11,101 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:10:11,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-26 01:10:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:11,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 799 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 01:10:11,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:10:11,762 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 581 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-11-26 01:10:11,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:10:11,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309201912] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:10:11,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:10:11,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2022-11-26 01:10:11,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253471303] [2022-11-26 01:10:11,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:10:11,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 01:10:11,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:11,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 01:10:11,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-26 01:10:11,764 INFO L87 Difference]: Start difference. First operand 5665 states and 6769 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 4 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-26 01:10:12,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:12,419 INFO L93 Difference]: Finished difference Result 6907 states and 8248 transitions. [2022-11-26 01:10:12,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 01:10:12,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 4 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) Word has length 279 [2022-11-26 01:10:12,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:12,420 INFO L225 Difference]: With dead ends: 6907 [2022-11-26 01:10:12,420 INFO L226 Difference]: Without dead ends: 0 [2022-11-26 01:10:12,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-26 01:10:12,427 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 87 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:10:12,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 298 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:10:12,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-26 01:10:12,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-26 01:10:12,428 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-26 01:10:12,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-26 01:10:12,429 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 279 [2022-11-26 01:10:12,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:12,429 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-26 01:10:12,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 4 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-26 01:10:12,430 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-26 01:10:12,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-26 01:10:12,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-26 01:10:12,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-26 01:10:12,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-26 01:10:12,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-26 01:10:12,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-26 01:10:12,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-26 01:10:12,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-26 01:10:12,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-26 01:10:12,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-26 01:10:12,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-26 01:10:12,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-26 01:10:54,281 WARN L233 SmtUtils]: Spent 27.43s on a formula simplification. DAG size of input: 1586 DAG size of output: 1430 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-26 01:11:26,131 WARN L233 SmtUtils]: Spent 29.10s on a formula simplification. DAG size of input: 1586 DAG size of output: 1430 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-26 01:12:13,765 WARN L233 SmtUtils]: Spent 16.81s on a formula simplification. DAG size of input: 1430 DAG size of output: 104 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-26 01:12:33,472 WARN L233 SmtUtils]: Spent 16.91s on a formula simplification. DAG size of input: 1430 DAG size of output: 104 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-26 01:12:41,752 WARN L233 SmtUtils]: Spent 5.36s on a formula simplification. DAG size of input: 1887 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-26 01:12:41,755 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 123) no Hoare annotation was computed. [2022-11-26 01:12:41,755 INFO L899 garLoopResultBuilder]: For program point L209-1(lines 209 218) no Hoare annotation was computed. [2022-11-26 01:12:41,755 INFO L899 garLoopResultBuilder]: For program point L210(lines 210 215) no Hoare annotation was computed. [2022-11-26 01:12:41,757 INFO L895 garLoopResultBuilder]: At program point L128(lines 116 130) the Hoare annotation is: (let ((.cse32 (= ~C_1_st~0 |old(~C_1_st~0)|)) (.cse33 (= |old(~P_1_st~0)| ~P_1_st~0))) (let ((.cse4 (not (= 2 ~C_1_pc~0))) (.cse6 (not (<= 0 ~num~0))) (.cse31 (not (<= 0 ~P_1_pc~0))) (.cse35 (not (<= 0 ~e~0))) (.cse36 (not (= ~data_0~0 0))) (.cse17 (not (= ~C_1_pr~0 0))) (.cse18 (not (= |#NULL.offset| 0))) (.cse19 (not (= ~data_1~0 0))) (.cse20 (not (= ~P_1_ev~0 0))) (.cse21 (not (= ~e~0 0))) (.cse22 (not (<= 0 ~data_0~0))) (.cse23 (not (= |#NULL.base| 0))) (.cse24 (not (= ~C_1_ev~0 0))) (.cse25 (not (= ~max_loop~0 2))) (.cse27 (not (<= 0 |#StackHeapBarrier|))) (.cse28 (not (<= 0 ~timer~0))) (.cse26 (= |activate_threads_is_P_1_triggered_~__retres1~0#1| 0)) (.cse0 (not (<= 1 ~i~0))) (.cse14 (not (<= ~P_1_pc~0 0))) (.cse8 (not (<= ~i~0 1))) (.cse2 (and .cse32 .cse33)) (.cse5 (not (<= ~max_loop~0 2))) (.cse15 (not (<= 2 ~i~0))) (.cse34 (not (= ~num~0 0))) (.cse13 (not (<= 1 ~P_1_pc~0))) (.cse1 (not (= ~C_1_i~0 1))) (.cse3 (not (<= 1 ~C_1_pc~0))) (.cse29 (not (= ~C_1_pc~0 1))) (.cse16 (not (< ~i~0 2147483646))) (.cse7 (not (<= 0 ~i~0))) (.cse9 (not (= ~P_1_i~0 1))) (.cse10 (not (= ~P_1_pc~0 1))) (.cse11 (not (<= ~e~0 0))) (.cse30 (not (<= 1 ~num~0))) (.cse12 (not (< ~num~0 2147483648)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse1 .cse2 .cse4 .cse14 .cse5 (not (<= ~num~0 0)) .cse15 .cse6 .cse16 .cse9 .cse11) (or .cse17 .cse18 .cse19 .cse0 .cse1 .cse3 .cse20 .cse4 .cse21 .cse22 .cse6 .cse7 .cse23 .cse24 .cse8 .cse9 .cse10 .cse25 .cse26 .cse27 .cse12 .cse13 .cse28) (or .cse17 .cse18 .cse19 .cse0 .cse1 .cse3 .cse20 .cse29 .cse21 .cse22 .cse7 .cse23 .cse24 .cse8 .cse9 .cse10 .cse25 .cse26 .cse27 .cse30 .cse12 .cse28) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7 (not (<= ~i~0 2147483646)) .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse17 .cse18 .cse19 .cse1 .cse3 .cse20 .cse4 .cse21 .cse22 .cse15 .cse6 .cse16 .cse7 .cse23 .cse24 .cse9 .cse10 .cse25 .cse26 .cse27 .cse12 .cse13 .cse28) (or (not (= |old(~P_1_st~0)| 0)) .cse18 .cse19 .cse1 .cse31 (not (<= 0 ~C_1_pr~0)) (and .cse32 .cse33 .cse26) .cse14 (not (<= ~C_1_pc~0 0)) (not (<= 0 ~P_1_ev~0)) (not (= ~timer~0 0)) (not (<= 0 |#NULL.base|)) .cse9 .cse11 .cse25 (not (<= ~C_1_pr~0 0)) .cse27 (not (<= 0 ~C_1_pc~0)) (not (<= 0 ~C_1_ev~0)) (not (<= ~P_1_ev~0 0)) .cse34 .cse35 .cse36 (not (<= |#NULL.base| 0)) (not (<= ~C_1_ev~0 0)) (not (= |old(~C_1_st~0)| 0)) (not (= ~i~0 0))) (or .cse0 .cse1 .cse2 .cse3 .cse29 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse30 .cse12) (or .cse17 .cse18 .cse19 .cse0 .cse1 .cse31 .cse3 .cse20 .cse14 .cse29 .cse7 .cse23 .cse24 .cse8 .cse9 .cse11 .cse25 .cse26 .cse27 .cse34 .cse35 .cse36 .cse28) (or (and (or .cse17 .cse18 .cse19 .cse1 .cse3 .cse20 .cse29 .cse21 .cse22 .cse16 .cse7 .cse23 .cse24 .cse9 .cse10 .cse25 .cse27 .cse30 .cse12 .cse28) (or .cse17 .cse18 .cse19 .cse1 .cse3 .cse20 .cse29 .cse21 .cse22 .cse16 .cse23 .cse24 .cse9 .cse10 .cse25 .cse27 .cse34 .cse13 .cse28)) .cse15 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse14 .cse29 .cse5 .cse7 .cse8 .cse9 .cse11 .cse34) (or .cse2 .cse5 .cse15 (and (or .cse1 .cse3 .cse29 .cse16 .cse9 .cse10 .cse11 .cse34 .cse13) (or .cse1 .cse3 .cse29 .cse16 .cse7 .cse9 .cse10 .cse11 .cse30 .cse12)))))) [2022-11-26 01:12:41,757 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 208) no Hoare annotation was computed. [2022-11-26 01:12:41,757 INFO L899 garLoopResultBuilder]: For program point L199-2(lines 198 222) no Hoare annotation was computed. [2022-11-26 01:12:41,758 INFO L895 garLoopResultBuilder]: At program point L220(lines 198 222) the Hoare annotation is: (let ((.cse35 (= |old(~P_1_st~0)| ~P_1_st~0))) (let ((.cse49 (<= 0 ~i~0)) (.cse48 (<= 1 ~P_1_pc~0)) (.cse50 (<= 1 ~C_1_pc~0)) (.cse36 (<= |activate_threads_~tmp~1#1| 0)) (.cse40 (<= 0 |activate_threads_~tmp~1#1|)) (.cse37 (= |activate_threads_is_P_1_triggered_~__retres1~0#1| 0)) (.cse39 (= |activate_threads_is_P_1_triggered_~__retres1~0#1| |activate_threads_is_P_1_triggered_#res#1|)) (.cse34 (= ~C_1_st~0 |old(~C_1_st~0)|)) (.cse47 (or (= ~P_1_st~0 0) .cse35)) (.cse38 (= |activate_threads_is_C_1_triggered_~__retres1~1#1| 0))) (let ((.cse0 (and .cse34 .cse47 .cse38)) (.cse27 (and (= |activate_threads_~tmp~1#1| |activate_threads_is_P_1_triggered_#res#1|) .cse35 .cse37 .cse39)) (.cse33 (not (<= ~i~0 2147483646))) (.cse41 (not (<= 0 ~P_1_pc~0))) (.cse43 (not (<= 0 ~e~0))) (.cse44 (not (= ~data_0~0 0))) (.cse13 (not (<= 1 ~num~0))) (.cse18 (not (= ~C_1_pr~0 0))) (.cse19 (not (= |#NULL.offset| 0))) (.cse20 (not (= ~data_1~0 0))) (.cse21 (not (= ~P_1_ev~0 0))) (.cse5 (not (= ~C_1_pc~0 1))) (.cse23 (not (= ~e~0 0))) (.cse24 (not (<= 0 ~data_0~0))) (.cse26 (not (= |#NULL.base| 0))) (.cse28 (not (= ~C_1_ev~0 0))) (.cse29 (not (= ~max_loop~0 2))) (.cse30 (not (<= 0 |#StackHeapBarrier|))) (.cse11 (not (= ~num~0 0))) (.cse31 (not (<= 0 ~timer~0))) (.cse46 (and .cse35 .cse36 .cse37 .cse39 .cse40)) (.cse32 (and .cse49 .cse34 .cse48 .cse47 .cse50)) (.cse1 (not (<= 1 ~i~0))) (.cse3 (not .cse50)) (.cse7 (not .cse49)) (.cse8 (not (<= ~i~0 1))) (.cse12 (not (= ~P_1_pc~0 1))) (.cse42 (not (<= ~P_1_ev~0 0))) (.cse14 (not (< ~num~0 2147483648))) (.cse45 (not (<= ~C_1_ev~0 0))) (.cse17 (not .cse48)) (.cse2 (not (= ~C_1_i~0 1))) (.cse22 (not (= 2 ~C_1_pc~0))) (.cse4 (not (<= ~P_1_pc~0 0))) (.cse6 (not (<= ~max_loop~0 2))) (.cse15 (not (<= 2 ~i~0))) (.cse25 (not (<= 0 ~num~0))) (.cse16 (not (< ~i~0 2147483646))) (.cse9 (not (= ~P_1_i~0 1))) (.cse10 (not (<= ~e~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse10 .cse13 .cse14) (or .cse0 .cse6 .cse15 (and (or .cse2 .cse3 .cse5 .cse16 .cse9 .cse12 .cse10 .cse11 .cse17) (or .cse2 .cse3 .cse5 .cse16 .cse7 .cse9 .cse12 .cse10 .cse13 .cse14))) (or .cse18 .cse19 .cse20 .cse1 .cse2 .cse3 .cse21 .cse22 .cse23 .cse24 .cse25 .cse7 .cse26 .cse27 .cse28 .cse8 .cse9 .cse12 .cse29 .cse30 .cse14 .cse17 .cse31) (or .cse2 .cse32 .cse3 .cse22 .cse6 .cse15 .cse25 .cse7 .cse33 .cse9 .cse12 .cse10 .cse14 .cse17) (or (not (= |old(~P_1_st~0)| 0)) .cse19 .cse20 (and .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40) .cse2 .cse41 (not (<= 0 ~C_1_pr~0)) .cse4 (not (<= ~C_1_pc~0 0)) (not (<= 0 ~P_1_ev~0)) (not (= ~timer~0 0)) (not (<= 0 |#NULL.base|)) .cse9 .cse10 .cse29 (not (<= ~C_1_pr~0 0)) .cse30 (not (<= 0 ~C_1_pc~0)) (not (<= 0 ~C_1_ev~0)) .cse42 .cse11 .cse43 .cse44 (not (<= |#NULL.base| 0)) .cse45 (not (= |old(~C_1_st~0)| 0)) (not (= ~i~0 0))) (or .cse18 .cse19 .cse20 .cse2 .cse3 .cse21 .cse22 .cse23 .cse24 .cse15 .cse25 .cse16 .cse7 .cse26 .cse27 .cse28 .cse9 .cse12 .cse29 .cse30 .cse14 .cse17 .cse31) (or .cse18 .cse19 .cse20 .cse1 .cse2 .cse3 .cse21 .cse5 .cse23 .cse24 .cse7 .cse26 .cse28 .cse8 .cse9 .cse12 .cse29 .cse30 .cse46 .cse13 .cse14 .cse31) (or .cse2 .cse3 .cse22 .cse6 .cse15 .cse25 .cse7 .cse33 .cse9 .cse12 .cse10 .cse42 .cse14 .cse45 .cse38 .cse17) (or .cse18 .cse19 .cse20 .cse1 .cse2 .cse41 .cse3 .cse21 .cse4 .cse5 .cse7 .cse26 .cse28 .cse8 .cse9 .cse10 .cse29 .cse30 .cse46 .cse11 .cse43 .cse44 .cse31) (or (and (or .cse18 .cse19 .cse20 .cse2 .cse3 .cse21 .cse5 .cse23 .cse24 .cse16 .cse7 .cse26 .cse28 .cse9 .cse12 .cse29 .cse30 .cse13 .cse14 .cse31) (or .cse18 .cse19 .cse20 .cse2 .cse3 .cse21 .cse5 .cse23 .cse24 .cse16 .cse26 .cse28 .cse9 .cse12 .cse29 .cse30 .cse11 .cse17 .cse31)) .cse15 .cse46) (or .cse1 .cse2 .cse32 .cse3 .cse22 .cse6 .cse25 .cse7 .cse8 .cse9 .cse12 .cse10 .cse14 .cse17) (or .cse1 .cse2 .cse3 .cse22 .cse6 .cse25 .cse7 .cse8 .cse9 .cse12 .cse10 .cse42 .cse14 .cse45 .cse38 .cse17) (or (and .cse34 .cse47) .cse2 .cse22 .cse4 .cse6 (not (<= ~num~0 0)) .cse15 .cse25 .cse16 .cse9 .cse10))))) [2022-11-26 01:12:41,758 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 126) no Hoare annotation was computed. [2022-11-26 01:12:41,759 INFO L899 garLoopResultBuilder]: For program point L117-2(lines 117 126) no Hoare annotation was computed. [2022-11-26 01:12:41,759 INFO L895 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 374 399) the Hoare annotation is: (let ((.cse4 (not (= 2 ~C_1_pc~0))) (.cse6 (not (<= 0 ~num~0))) (.cse13 (not (<= 1 ~P_1_pc~0))) (.cse3 (not (<= 1 ~C_1_pc~0))) (.cse17 (not (< ~i~0 2147483646))) (.cse7 (not (<= 0 ~i~0))) (.cse10 (not (= ~P_1_pc~0 1))) (.cse19 (not (<= 1 ~num~0))) (.cse12 (not (< ~num~0 2147483648))) (.cse16 (not (<= 2 ~i~0))) (.cse0 (not (<= 1 ~i~0))) (.cse1 (not (= ~C_1_i~0 1))) (.cse2 (and (= ~C_1_st~0 |old(~C_1_st~0)|) (= |old(~P_1_st~0)| ~P_1_st~0))) (.cse14 (not (<= ~P_1_pc~0 0))) (.cse18 (not (= ~C_1_pc~0 1))) (.cse5 (not (<= ~max_loop~0 2))) (.cse8 (not (<= ~i~0 1))) (.cse9 (not (= ~P_1_i~0 1))) (.cse11 (not (<= ~e~0 0))) (.cse15 (not (= ~num~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or (not (= |old(~P_1_st~0)| 0)) (not (= |#NULL.offset| 0)) (not (= ~data_1~0 0)) .cse1 (not (<= 0 ~P_1_pc~0)) .cse2 (not (<= 0 ~C_1_pr~0)) .cse14 (not (<= ~C_1_pc~0 0)) (not (<= 0 ~P_1_ev~0)) (not (= ~timer~0 0)) (not (<= 0 |#NULL.base|)) .cse9 .cse11 (not (= ~max_loop~0 2)) (not (<= ~C_1_pr~0 0)) (not (<= 0 |#StackHeapBarrier|)) (not (<= 0 ~C_1_pc~0)) (not (<= 0 ~C_1_ev~0)) (not (<= ~P_1_ev~0 0)) .cse15 (not (<= 0 ~e~0)) (not (= ~data_0~0 0)) (not (<= |#NULL.base| 0)) (not (<= ~C_1_ev~0 0)) (not (= |old(~C_1_st~0)| 0)) (not (= ~i~0 0))) (or .cse1 .cse2 .cse4 .cse14 .cse5 (not (<= ~num~0 0)) .cse16 .cse6 .cse17 .cse9 .cse11) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 (not (<= ~i~0 2147483646)) .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse12) (or .cse2 (and (or .cse1 .cse18 .cse17 .cse9 .cse10 .cse11 .cse15) (or .cse1 .cse3 .cse18 .cse17 .cse7 .cse9 .cse10 .cse11 .cse19 .cse12)) .cse5 .cse16) (or .cse0 .cse1 .cse2 .cse14 .cse18 .cse5 .cse8 .cse9 .cse11 .cse15))) [2022-11-26 01:12:41,760 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 374 399) no Hoare annotation was computed. [2022-11-26 01:12:41,760 INFO L899 garLoopResultBuilder]: For program point L200(lines 200 205) no Hoare annotation was computed. [2022-11-26 01:12:41,760 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 250 269) no Hoare annotation was computed. [2022-11-26 01:12:41,760 INFO L902 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 250 269) the Hoare annotation is: true [2022-11-26 01:12:41,760 INFO L902 garLoopResultBuilder]: At program point fire_delta_eventsFINAL(lines 326 333) the Hoare annotation is: true [2022-11-26 01:12:41,760 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 326 333) no Hoare annotation was computed. [2022-11-26 01:12:41,761 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 224 231) no Hoare annotation was computed. [2022-11-26 01:12:41,761 INFO L902 garLoopResultBuilder]: At program point update_channelsFINAL(lines 224 231) the Hoare annotation is: true [2022-11-26 01:12:41,761 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 334 341) no Hoare annotation was computed. [2022-11-26 01:12:41,761 INFO L902 garLoopResultBuilder]: At program point reset_delta_eventsFINAL(lines 334 341) the Hoare annotation is: true [2022-11-26 01:12:41,761 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 160) no Hoare annotation was computed. [2022-11-26 01:12:41,761 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-11-26 01:12:41,761 INFO L899 garLoopResultBuilder]: For program point L284(lines 284 288) no Hoare annotation was computed. [2022-11-26 01:12:41,762 INFO L899 garLoopResultBuilder]: For program point L284-1(lines 279 319) no Hoare annotation was computed. [2022-11-26 01:12:41,762 INFO L895 garLoopResultBuilder]: At program point L86(lines 81 111) the Hoare annotation is: (let ((.cse9 (< ~i~0 2147483646)) (.cse7 (<= 2 ~i~0)) (.cse11 (= ~C_1_pc~0 1)) (.cse14 (<= 1 ~num~0)) (.cse16 (<= 1 ~i~0)) (.cse0 (= 2 ~C_1_pc~0)) (.cse12 (= ~P_1_pc~0 1)) (.cse13 (< ~num~0 2147483648)) (.cse2 (<= ~max_loop~0 2)) (.cse17 (<= ~i~0 1)) (.cse6 (<= 0 ~num~0)) (.cse8 (or (= |exists_runnable_thread_#res| 1) (not (= ~P_1_st~0 0)))) (.cse1 (<= ~e~0 0)) (.cse3 (= ~P_1_i~0 1)) (.cse15 (= ~num~0 0)) (.cse4 (<= ~P_1_pc~0 0)) (.cse5 (not (= |ULTIMATE.start_eval_~tmp___2~0#1| 0))) (.cse10 (= ~C_1_i~0 1))) (or (and (<= ~num~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse2 (or (and .cse11 .cse12 .cse1 .cse13 .cse3 .cse5 .cse14 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse1 .cse3 .cse15 .cse5 .cse8 .cse9 .cse10)) .cse7) (and .cse16 .cse11 .cse1 .cse2 .cse17 .cse3 .cse15 .cse4 .cse5 .cse8 .cse10) (and .cse0 .cse12 .cse1 .cse13 .cse2 .cse3 (<= ~i~0 2147483646) .cse5 .cse6 .cse7 .cse8 .cse10) (and .cse16 .cse11 .cse12 .cse1 .cse13 .cse2 .cse17 .cse3 .cse5 .cse14 .cse8 .cse10) (and .cse16 .cse0 .cse12 .cse1 .cse13 .cse2 .cse17 .cse3 .cse5 .cse6 .cse8 .cse10) (and (<= 0 (+ |ULTIMATE.start_eval_~tmp~0#1| 2147483648)) (<= ~i~0 0) (= ~C_1_st~0 0) (<= |ULTIMATE.start_eval_~tmp~0#1| 2147483647) (<= |ULTIMATE.start_eval_~tmp___2~0#1| 1) .cse1 (<= 0 ~e~0) (= ~data_0~0 0) (<= 0 ~i~0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) (= ~P_1_ev~0 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= ~P_1_st~0 1) (= ~C_1_pr~0 0) (= ~max_loop~0 2) .cse3 (<= ~C_1_ev~0 0) .cse15 .cse4 (<= 0 ~C_1_ev~0) (<= 0 ~P_1_pc~0) (= |#NULL.offset| 0) .cse5 (<= 0 |ULTIMATE.start_eval_~tmp___2~0#1|) (<= 0 ~C_1_pc~0) (<= ~C_1_pc~0 0) (<= 0 |#StackHeapBarrier|) (= ~data_1~0 0) (= ~timer~0 0) .cse10 (= |#NULL.base| 0)))) [2022-11-26 01:12:41,762 INFO L899 garLoopResultBuilder]: For program point L169(line 169) no Hoare annotation was computed. [2022-11-26 01:12:41,763 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 49) no Hoare annotation was computed. [2022-11-26 01:12:41,763 INFO L902 garLoopResultBuilder]: At program point L483(lines 430 488) the Hoare annotation is: true [2022-11-26 01:12:41,763 INFO L895 garLoopResultBuilder]: At program point L417(line 417) the Hoare annotation is: (let ((.cse0 (<= 1 ~i~0)) (.cse6 (<= ~i~0 1)) (.cse10 (= ~num~0 0)) (.cse1 (= ~C_1_pc~0 1)) (.cse8 (<= 1 ~num~0)) (.cse11 (<= ~P_1_pc~0 0)) (.cse14 (< ~i~0 2147483646)) (.cse12 (= 2 ~C_1_pc~0)) (.cse2 (= ~P_1_pc~0 1)) (.cse3 (<= ~e~0 0)) (.cse4 (< ~num~0 2147483648)) (.cse5 (<= ~max_loop~0 2)) (.cse7 (= ~P_1_i~0 1)) (.cse13 (<= 0 ~num~0)) (.cse15 (<= 2 ~i~0)) (.cse9 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse10 .cse11 .cse9) (and .cse0 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse9) (and (or (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse14 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse14 .cse9)) .cse5 .cse15) (and (<= ~num~0 0) .cse12 .cse3 .cse5 .cse7 .cse11 .cse13 .cse15 .cse14 .cse9) (and .cse12 .cse2 .cse3 .cse4 .cse5 .cse7 (<= ~i~0 2147483646) .cse13 .cse15 .cse9))) [2022-11-26 01:12:41,763 INFO L895 garLoopResultBuilder]: At program point L417-1(line 417) the Hoare annotation is: (let ((.cse0 (<= 1 ~i~0)) (.cse6 (<= ~i~0 1)) (.cse10 (= ~num~0 0)) (.cse1 (= ~C_1_pc~0 1)) (.cse8 (<= 1 ~num~0)) (.cse11 (<= ~P_1_pc~0 0)) (.cse14 (< ~i~0 2147483646)) (.cse12 (= 2 ~C_1_pc~0)) (.cse2 (= ~P_1_pc~0 1)) (.cse3 (<= ~e~0 0)) (.cse4 (< ~num~0 2147483648)) (.cse5 (<= ~max_loop~0 2)) (.cse7 (= ~P_1_i~0 1)) (.cse13 (<= 0 ~num~0)) (.cse15 (<= 2 ~i~0)) (.cse9 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse10 .cse11 .cse9) (and .cse0 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse9) (and (or (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse14 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse14 .cse9)) .cse5 .cse15) (and (<= ~num~0 0) .cse12 .cse3 .cse5 .cse7 .cse11 .cse13 .cse15 .cse14 .cse9) (and .cse12 .cse2 .cse3 .cse4 .cse5 .cse7 (<= ~i~0 2147483646) .cse13 .cse15 .cse9))) [2022-11-26 01:12:41,764 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 176) no Hoare annotation was computed. [2022-11-26 01:12:41,764 INFO L899 garLoopResultBuilder]: For program point L170-1(lines 170 176) no Hoare annotation was computed. [2022-11-26 01:12:41,764 INFO L895 garLoopResultBuilder]: At program point L468(line 468) the Hoare annotation is: (let ((.cse0 (<= 1 ~i~0)) (.cse6 (<= ~i~0 1)) (.cse10 (= ~num~0 0)) (.cse1 (= ~C_1_pc~0 1)) (.cse8 (<= 1 ~num~0)) (.cse11 (<= ~P_1_pc~0 0)) (.cse14 (< ~i~0 2147483646)) (.cse12 (= 2 ~C_1_pc~0)) (.cse2 (= ~P_1_pc~0 1)) (.cse3 (<= ~e~0 0)) (.cse4 (< ~num~0 2147483648)) (.cse5 (<= ~max_loop~0 2)) (.cse7 (= ~P_1_i~0 1)) (.cse13 (<= 0 ~num~0)) (.cse15 (<= 2 ~i~0)) (.cse9 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse10 .cse11 .cse9) (and .cse0 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse9) (and (or (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse14 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse14 .cse9)) .cse5 .cse15) (and (<= ~num~0 0) .cse12 .cse3 .cse5 .cse7 .cse11 .cse13 .cse15 .cse14 .cse9) (and .cse12 .cse2 .cse3 .cse4 .cse5 .cse7 (<= ~i~0 2147483646) .cse13 .cse15 .cse9))) [2022-11-26 01:12:41,764 INFO L895 garLoopResultBuilder]: At program point L468-1(line 468) the Hoare annotation is: (let ((.cse0 (<= 1 ~i~0)) (.cse6 (<= ~i~0 1)) (.cse10 (= ~num~0 0)) (.cse1 (= ~C_1_pc~0 1)) (.cse8 (<= 1 ~num~0)) (.cse11 (<= ~P_1_pc~0 0)) (.cse14 (< ~i~0 2147483646)) (.cse12 (= 2 ~C_1_pc~0)) (.cse2 (= ~P_1_pc~0 1)) (.cse3 (<= ~e~0 0)) (.cse4 (< ~num~0 2147483648)) (.cse5 (<= ~max_loop~0 2)) (.cse7 (= ~P_1_i~0 1)) (.cse13 (<= 0 ~num~0)) (.cse15 (<= 2 ~i~0)) (.cse9 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse10 .cse11 .cse9) (and .cse0 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse9) (and (or (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse14 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse14 .cse9)) .cse5 .cse15) (and (<= ~num~0 0) .cse12 .cse3 .cse5 .cse7 .cse11 .cse13 .cse15 .cse14 .cse9) (and .cse12 .cse2 .cse3 .cse4 .cse5 .cse7 (<= ~i~0 2147483646) .cse13 .cse15 .cse9))) [2022-11-26 01:12:41,764 INFO L895 garLoopResultBuilder]: At program point L320(lines 271 325) the Hoare annotation is: (let ((.cse0 (= ~C_1_pc~0 1)) (.cse10 (<= 1 ~i~0)) (.cse11 (<= ~i~0 1)) (.cse12 (<= ~P_1_pc~0 0)) (.cse8 (< ~i~0 2147483646)) (.cse13 (= 2 ~C_1_pc~0)) (.cse1 (= ~P_1_pc~0 1)) (.cse2 (<= ~e~0 0)) (.cse3 (< ~num~0 2147483648)) (.cse4 (<= ~max_loop~0 2)) (.cse5 (= ~P_1_i~0 1)) (.cse6 (<= 0 ~num~0)) (.cse7 (<= 2 ~i~0)) (.cse9 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 (<= 1 ~num~0) .cse9) (and .cse10 .cse0 .cse2 .cse4 .cse11 .cse5 (= ~num~0 0) .cse12 .cse9) (and .cse10 .cse13 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse9) (and (<= ~num~0 0) .cse13 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~i~0 2147483646) .cse6 .cse7 .cse9))) [2022-11-26 01:12:41,765 INFO L895 garLoopResultBuilder]: At program point L304(lines 279 319) the Hoare annotation is: (let ((.cse26 (<= 1 ~i~0)) (.cse11 (<= ~i~0 1)) (.cse2 (<= |ULTIMATE.start_eval_~tmp___2~0#1| 1)) (.cse13 (= 2 ~P_1_st~0)) (.cse19 (not (= |ULTIMATE.start_eval_~tmp___2~0#1| 0))) (.cse20 (<= 0 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse1 (= ~C_1_st~0 0)) (.cse4 (<= 0 ~e~0)) (.cse5 (= ~data_0~0 0)) (.cse6 (<= 0 ~i~0)) (.cse7 (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1)) (.cse8 (= ~P_1_ev~0 0)) (.cse9 (= |ULTIMATE.start_main_~count~0#1| 0)) (.cse10 (= ~C_1_pr~0 0)) (.cse12 (= ~max_loop~0 2)) (.cse33 (= ~C_1_pc~0 0)) (.cse17 (<= 0 ~P_1_pc~0)) (.cse18 (= |#NULL.offset| 0)) (.cse21 (= ~C_1_ev~0 0)) (.cse22 (<= 0 |#StackHeapBarrier|)) (.cse23 (= ~data_1~0 0)) (.cse34 (= ~timer~0 0)) (.cse25 (= |#NULL.base| 0)) (.cse15 (= ~num~0 0)) (.cse0 (= ~C_1_pc~0 1)) (.cse30 (<= 1 ~num~0)) (.cse16 (<= ~P_1_pc~0 0)) (.cse35 (< ~i~0 2147483646)) (.cse31 (= 2 ~C_1_pc~0)) (.cse27 (= ~P_1_pc~0 1)) (.cse3 (<= ~e~0 0)) (.cse28 (< ~num~0 2147483648)) (.cse29 (<= ~max_loop~0 2)) (.cse14 (= ~P_1_i~0 1)) (.cse32 (<= 0 ~num~0)) (.cse36 (<= 2 ~i~0)) (.cse24 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= 0 ~timer~0) .cse21 (<= |ULTIMATE.start_eval_~tmp___1~0#1| 2147483647) .cse22 .cse23 (<= 0 (+ |ULTIMATE.start_eval_~tmp___1~0#1| 2147483648)) .cse24 .cse25) (and .cse26 .cse0 .cse27 .cse3 .cse28 .cse29 .cse11 .cse14 .cse30 .cse24) (and .cse26 .cse0 .cse3 .cse29 .cse11 .cse14 .cse15 .cse16 .cse24) (and .cse26 .cse31 .cse27 .cse3 .cse28 .cse29 .cse11 .cse14 .cse32 .cse24) (and (<= 0 ~data_0~0) .cse1 .cse27 .cse2 (= ~i~0 0) (= ~e~0 0) .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse33 (<= 0 ~data_1~0) .cse18 .cse19 .cse20 (<= ~num~0 1) .cse21 .cse22 .cse30 .cse34 .cse24 .cse25) (and (<= ~i~0 0) .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~P_1_st~0 0) .cse8 .cse9 .cse10 .cse12 .cse14 .cse33 .cse15 .cse16 .cse17 .cse18 .cse21 .cse22 .cse23 .cse34 .cse24 .cse25) (and (or (and .cse0 .cse27 .cse3 .cse14 .cse15 .cse35 .cse24) (and .cse0 .cse27 .cse3 .cse28 .cse14 .cse30 .cse35 .cse24)) .cse29 .cse36) (and (<= ~num~0 0) .cse31 .cse3 .cse29 .cse14 .cse16 .cse32 .cse36 .cse35 .cse24) (and .cse31 .cse27 .cse3 .cse28 .cse29 .cse14 (<= ~i~0 2147483646) .cse32 .cse36 .cse24))) [2022-11-26 01:12:41,765 INFO L902 garLoopResultBuilder]: At program point L172(line 172) the Hoare annotation is: true [2022-11-26 01:12:41,765 INFO L895 garLoopResultBuilder]: At program point L453(line 453) the Hoare annotation is: (let ((.cse0 (= ~C_1_pc~0 1)) (.cse10 (<= 1 ~i~0)) (.cse11 (<= ~i~0 1)) (.cse12 (<= ~P_1_pc~0 0)) (.cse8 (< ~i~0 2147483646)) (.cse13 (= 2 ~C_1_pc~0)) (.cse1 (= ~P_1_pc~0 1)) (.cse2 (<= ~e~0 0)) (.cse3 (< ~num~0 2147483648)) (.cse4 (<= ~max_loop~0 2)) (.cse5 (= ~P_1_i~0 1)) (.cse6 (<= 0 ~num~0)) (.cse7 (<= 2 ~i~0)) (.cse9 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 (<= 1 ~num~0) .cse9) (and .cse10 .cse0 .cse2 .cse4 .cse11 .cse5 (= ~num~0 0) .cse12 .cse9) (and .cse10 .cse13 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse9) (and (<= ~num~0 0) .cse13 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~i~0 2147483646) .cse6 .cse7 .cse9))) [2022-11-26 01:12:41,765 INFO L899 garLoopResultBuilder]: For program point L453-1(line 453) no Hoare annotation was computed. [2022-11-26 01:12:41,765 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 48) no Hoare annotation was computed. [2022-11-26 01:12:41,765 INFO L899 garLoopResultBuilder]: For program point L289(lines 279 319) no Hoare annotation was computed. [2022-11-26 01:12:41,765 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-26 01:12:41,766 INFO L899 garLoopResultBuilder]: For program point L157(lines 156 186) no Hoare annotation was computed. [2022-11-26 01:12:41,767 INFO L895 garLoopResultBuilder]: At program point L438(line 438) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= 13 (select |#length| 2)) (= ~C_1_st~0 0) (= ~i~0 0) (= ~e~0 0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 0) (= ~data_0~0 0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= ~P_1_st~0 0) (= ~P_1_ev~0 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= ~C_1_pr~0 0) (= ~max_loop~0 2) (= ~P_1_i~0 1) (= (select |#valid| 1) 1) (= ~P_1_pc~0 0) (= ~C_1_pc~0 0) (= ~num~0 0) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (= ~C_1_ev~0 0) (= ~data_1~0 0) (= ~timer~0 0) (= ~C_1_i~0 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-26 01:12:41,767 INFO L895 garLoopResultBuilder]: At program point L438-1(line 438) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= 13 (select |#length| 2)) (= ~C_1_st~0 0) (= ~i~0 0) (= ~e~0 0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 0) (= ~data_0~0 0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= ~P_1_st~0 0) (= ~P_1_ev~0 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= ~C_1_pr~0 0) (= ~max_loop~0 2) (= ~P_1_i~0 1) (= (select |#valid| 1) 1) (= ~P_1_pc~0 0) (= ~C_1_pc~0 0) (= ~num~0 0) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (= ~C_1_ev~0 0) (= ~data_1~0 0) (= ~timer~0 0) (= ~C_1_i~0 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-26 01:12:41,767 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 153) no Hoare annotation was computed. [2022-11-26 01:12:41,767 INFO L895 garLoopResultBuilder]: At program point L191(lines 137 194) the Hoare annotation is: (let ((.cse5 (<= ~P_1_pc~0 0)) (.cse12 (= ~C_1_pc~0 1)) (.cse14 (= ~num~0 0)) (.cse8 (<= 2 ~i~0)) (.cse9 (< ~i~0 2147483646)) (.cse11 (<= 1 ~i~0)) (.cse0 (= 2 ~C_1_st~0)) (.cse1 (= 2 ~C_1_pc~0)) (.cse15 (= ~P_1_pc~0 1)) (.cse2 (<= ~e~0 0)) (.cse16 (< ~num~0 2147483648)) (.cse3 (<= ~max_loop~0 2)) (.cse13 (<= ~i~0 1)) (.cse4 (= ~P_1_i~0 1)) (.cse6 (not (= |ULTIMATE.start_eval_~tmp___2~0#1| 0))) (.cse7 (<= 0 ~num~0)) (.cse10 (= ~C_1_i~0 1))) (or (and (<= ~num~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse12 (<= |ULTIMATE.start_eval_~tmp___2~0#1| 1) .cse2 (<= 0 ~e~0) (= ~data_0~0 0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (= ~P_1_st~0 0) (= ~P_1_ev~0 0) (= |ULTIMATE.start_eval_~tmp~0#1| 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= ~timer~0 1) (= ~C_1_pr~0 0) .cse13 (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0)) (= ~max_loop~0 2) .cse4 .cse14 .cse5 (<= 0 ~P_1_pc~0) (= |#NULL.offset| 0) .cse6 (<= 0 |ULTIMATE.start_eval_~tmp___2~0#1|) (= ~C_1_ev~0 0) (<= |ULTIMATE.start_eval_~tmp___1~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (= ~data_1~0 0) (<= 0 (+ |ULTIMATE.start_eval_~tmp___1~0#1| 2147483648)) .cse10 (= |#NULL.base| 0)) (and .cse0 .cse1 .cse15 .cse2 .cse16 .cse3 .cse4 (<= ~i~0 2147483646) .cse6 .cse7 .cse8 .cse10) (and .cse0 .cse12 .cse15 .cse2 .cse3 .cse4 .cse14 .cse6 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse15 .cse2 .cse16 .cse3 .cse13 .cse4 .cse6 .cse7 .cse10))) [2022-11-26 01:12:41,767 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 160) no Hoare annotation was computed. [2022-11-26 01:12:41,768 INFO L895 garLoopResultBuilder]: At program point L158(lines 140 193) the Hoare annotation is: (let ((.cse14 (<= ~num~0 1)) (.cse35 (= 2 ~C_1_pc~0)) (.cse36 (<= 0 ~num~0)) (.cse21 (= ~C_1_pc~0 1)) (.cse0 (= ~P_1_pc~0 1)) (.cse34 (<= ~e~0 0)) (.cse3 (<= 0 ~i~0)) (.cse17 (<= 1 ~num~0))) (let ((.cse10 (<= 0 ~data_1~0)) (.cse1 (<= |ULTIMATE.start_eval_~tmp___2~0#1| 1)) (.cse2 (= ~e~0 0)) (.cse22 (= ~data_0~0 0)) (.cse4 (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1)) (.cse5 (= ~P_1_ev~0 0)) (.cse6 (= |ULTIMATE.start_main_~count~0#1| 0)) (.cse7 (= ~C_1_pr~0 0)) (.cse23 (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0))) (.cse8 (= ~max_loop~0 2)) (.cse24 (= ~num~0 0)) (.cse25 (<= ~P_1_pc~0 0)) (.cse26 (<= 0 ~P_1_pc~0)) (.cse11 (= |#NULL.offset| 0)) (.cse13 (<= 0 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse27 (<= 0 ~timer~0)) (.cse15 (= ~C_1_ev~0 0)) (.cse28 (<= |ULTIMATE.start_eval_~tmp___1~0#1| 2147483647)) (.cse16 (<= 0 |#StackHeapBarrier|)) (.cse29 (<= 0 (+ |ULTIMATE.start_eval_~tmp___1~0#1| 2147483648))) (.cse30 (= ~C_1_st~0 1)) (.cse20 (= |#NULL.base| 0)) (.cse31 (<= 1 ~i~0)) (.cse39 (< ~num~0 2147483648)) (.cse40 (or (and .cse35 .cse0 .cse34 .cse3 .cse36) (and .cse21 .cse0 .cse34 .cse3 .cse17))) (.cse37 (or (and .cse21 .cse0 .cse34 .cse3 .cse14 .cse36) (and .cse35 .cse0 .cse34 .cse3 .cse14 .cse36))) (.cse33 (<= ~i~0 1)) (.cse9 (= ~P_1_i~0 1)) (.cse12 (not (= |ULTIMATE.start_eval_~tmp___2~0#1| 0))) (.cse18 (or (= |exists_runnable_thread_#res| 1) (not (= ~C_1_st~0 0)))) (.cse19 (= ~C_1_i~0 1)) (.cse32 (<= ~max_loop~0 2))) (or (and (<= ~i~0 0) (<= 0 ~data_0~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ~P_1_st~0) .cse9 (= ~C_1_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ~timer~0 0) .cse19 .cse20) (and .cse21 .cse1 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse9 (<= ~C_1_ev~0 0) .cse10 .cse24 .cse25 (<= 0 ~C_1_ev~0) .cse26 .cse11 .cse12 .cse13 .cse27 (<= ~data_1~0 0) .cse28 .cse16 .cse29 .cse30 .cse19 (not (= ~P_1_st~0 0)) .cse20) (and .cse31 (<= ~num~0 0) .cse32 .cse33 .cse9 (or (and .cse21 .cse34 .cse24 .cse25) (and .cse35 .cse34 .cse25 .cse36)) .cse12 .cse18 .cse19) (and (<= 0 (+ |ULTIMATE.start_eval_~tmp~0#1| 2147483648)) .cse21 (<= |ULTIMATE.start_eval_~tmp~0#1| 2147483647) .cse1 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse9 .cse24 .cse25 .cse26 .cse11 .cse12 .cse13 .cse27 .cse15 .cse28 .cse16 (= ~data_1~0 0) .cse29 .cse30 .cse19 .cse20) (and .cse32 (let ((.cse38 (< ~i~0 2147483646))) (or (and .cse37 .cse9 .cse12 .cse18 .cse38 .cse19) (and .cse39 .cse9 .cse12 .cse40 .cse18 .cse38 .cse19))) (<= 2 ~i~0)) (and .cse31 (or (and .cse39 .cse33 .cse9 .cse12 .cse40 .cse18 .cse19) (and .cse37 .cse33 .cse9 .cse12 .cse18 .cse19)) .cse32)))) [2022-11-26 01:12:41,768 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 69) no Hoare annotation was computed. [2022-11-26 01:12:41,771 INFO L895 garLoopResultBuilder]: At program point L109(lines 78 112) the Hoare annotation is: (let ((.cse0 (<= 1 ~i~0)) (.cse23 (<= 1 ~num~0)) (.cse29 (< ~i~0 2147483646)) (.cse1 (= ~C_1_pc~0 1)) (.cse11 (= ~C_1_st~0 0)) (.cse13 (<= |ULTIMATE.start_eval_~tmp___2~0#1| 1)) (.cse14 (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1)) (.cse15 (= ~P_1_ev~0 0)) (.cse16 (= |ULTIMATE.start_main_~count~0#1| 0)) (.cse17 (= ~C_1_pr~0 0)) (.cse4 (<= ~i~0 1)) (.cse18 (= ~max_loop~0 2)) (.cse19 (<= 0 ~data_1~0)) (.cse7 (= ~num~0 0)) (.cse8 (<= ~P_1_pc~0 0)) (.cse20 (= |#NULL.offset| 0)) (.cse21 (<= 0 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse22 (<= 0 |#StackHeapBarrier|)) (.cse24 (= |#NULL.base| 0)) (.cse26 (= 2 ~C_1_pc~0)) (.cse12 (= ~P_1_pc~0 1)) (.cse2 (<= ~e~0 0)) (.cse25 (< ~num~0 2147483648)) (.cse3 (<= ~max_loop~0 2)) (.cse5 (= 2 ~P_1_st~0)) (.cse6 (= ~P_1_i~0 1)) (.cse9 (not (= |ULTIMATE.start_eval_~tmp___2~0#1| 0))) (.cse27 (<= 0 ~num~0)) (.cse28 (<= 2 ~i~0)) (.cse10 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (<= 0 (+ |ULTIMATE.start_eval_~tmp~0#1| 2147483648)) .cse11 .cse12 (<= |ULTIMATE.start_eval_~tmp~0#1| 2147483647) .cse13 (= ~i~0 0) (= ~e~0 0) .cse14 (= |ULTIMATE.start_write_data_~c#1| ~data_0~0) (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) (= |ULTIMATE.start_write_data_#in~i___0#1| |ULTIMATE.start_write_data_~i___0#1|) .cse15 .cse16 (<= 65 |ULTIMATE.start_write_data_~c#1|) .cse17 .cse18 .cse5 (<= |ULTIMATE.start_write_data_~c#1| 65) .cse6 (= |ULTIMATE.start_write_data_#in~c#1| 65) (<= 0 |ULTIMATE.start_write_data_#in~i___0#1|) (= ~C_1_pc~0 0) .cse19 .cse20 .cse9 .cse21 (<= ~num~0 1) (<= |ULTIMATE.start_write_data_#in~i___0#1| 0) (= ~C_1_ev~0 0) .cse22 .cse23 (= ~timer~0 0) .cse10 .cse24) (and .cse0 .cse1 .cse12 .cse2 .cse25 .cse3 .cse4 .cse5 .cse6 .cse9 .cse23 .cse10) (and (<= ~num~0 0) .cse26 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse27 .cse28 .cse29 .cse10) (and .cse0 .cse26 .cse12 .cse2 .cse25 .cse3 .cse4 .cse5 .cse6 .cse9 .cse27 .cse10) (and .cse3 (or (and .cse1 .cse12 .cse2 .cse5 .cse6 .cse7 .cse9 .cse29 .cse10) (and .cse1 .cse12 .cse2 .cse25 .cse5 .cse6 .cse9 .cse23 .cse29 .cse10)) .cse28) (and .cse1 .cse11 .cse13 .cse2 (<= 0 ~e~0) (= ~data_0~0 0) (<= 0 ~i~0) .cse14 .cse15 .cse16 .cse17 .cse4 .cse18 .cse5 .cse6 (<= ~C_1_ev~0 0) .cse19 .cse7 .cse8 (<= 0 ~C_1_ev~0) (<= 0 ~P_1_pc~0) .cse20 .cse9 .cse21 (<= 0 ~timer~0) (<= ~data_1~0 0) .cse22 .cse10 .cse24) (and .cse26 .cse12 .cse2 .cse25 .cse3 .cse5 .cse6 (<= ~i~0 2147483646) .cse9 .cse27 .cse28 .cse10))) [2022-11-26 01:12:41,771 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 179) no Hoare annotation was computed. [2022-11-26 01:12:41,771 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= 13 (select |#length| 2)) (= ~C_1_st~0 0) (= ~i~0 0) (= ~e~0 0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 0) (= ~data_0~0 0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= ~P_1_st~0 0) (= ~P_1_ev~0 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= ~C_1_pr~0 0) (= ~max_loop~0 2) (= ~P_1_i~0 1) (= (select |#valid| 1) 1) (= ~P_1_pc~0 0) (= ~C_1_pc~0 0) (= ~num~0 0) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (= ~C_1_ev~0 0) (= ~data_1~0 0) (= ~timer~0 0) (= ~C_1_i~0 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-26 01:12:41,772 INFO L895 garLoopResultBuilder]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= 13 (select |#length| 2)) (= ~C_1_st~0 0) (= ~i~0 0) (= ~e~0 0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 0) (= ~data_0~0 0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= ~P_1_st~0 0) (= ~P_1_ev~0 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= ~C_1_pr~0 0) (= ~max_loop~0 2) (= ~P_1_i~0 1) (= (select |#valid| 1) 1) (= ~P_1_pc~0 0) (= ~C_1_pc~0 0) (= ~num~0 0) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (= ~C_1_ev~0 0) (= ~data_1~0 0) (= ~timer~0 0) (= ~C_1_i~0 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-26 01:12:41,772 INFO L899 garLoopResultBuilder]: For program point L308(lines 308 315) no Hoare annotation was computed. [2022-11-26 01:12:41,773 INFO L895 garLoopResultBuilder]: At program point L457(line 457) the Hoare annotation is: (let ((.cse0 (= ~C_1_pc~0 1)) (.cse10 (<= 1 ~i~0)) (.cse11 (<= ~i~0 1)) (.cse12 (<= ~P_1_pc~0 0)) (.cse8 (< ~i~0 2147483646)) (.cse13 (= 2 ~C_1_pc~0)) (.cse1 (= ~P_1_pc~0 1)) (.cse2 (<= ~e~0 0)) (.cse3 (< ~num~0 2147483648)) (.cse4 (<= ~max_loop~0 2)) (.cse5 (= ~P_1_i~0 1)) (.cse6 (<= 0 ~num~0)) (.cse7 (<= 2 ~i~0)) (.cse9 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 (<= 1 ~num~0) .cse9) (and .cse10 .cse0 .cse2 .cse4 .cse11 .cse5 (= ~num~0 0) .cse12 .cse9) (and .cse10 .cse13 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse9) (and (<= ~num~0 0) .cse13 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~i~0 2147483646) .cse6 .cse7 .cse9))) [2022-11-26 01:12:41,773 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 179) no Hoare annotation was computed. [2022-11-26 01:12:41,773 INFO L895 garLoopResultBuilder]: At program point L457-1(line 457) the Hoare annotation is: (let ((.cse0 (= ~C_1_pc~0 1)) (.cse10 (<= 1 ~i~0)) (.cse11 (<= ~i~0 1)) (.cse12 (<= ~P_1_pc~0 0)) (.cse8 (< ~i~0 2147483646)) (.cse13 (= 2 ~C_1_pc~0)) (.cse1 (= ~P_1_pc~0 1)) (.cse2 (<= ~e~0 0)) (.cse3 (< ~num~0 2147483648)) (.cse4 (<= ~max_loop~0 2)) (.cse5 (= ~P_1_i~0 1)) (.cse6 (<= 0 ~num~0)) (.cse7 (<= 2 ~i~0)) (.cse9 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 (<= 1 ~num~0) .cse9) (and .cse10 .cse0 .cse2 .cse4 .cse11 .cse5 (= ~num~0 0) .cse12 .cse9) (and .cse10 .cse13 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse9) (and (<= ~num~0 0) .cse13 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~i~0 2147483646) .cse6 .cse7 .cse9))) [2022-11-26 01:12:41,773 INFO L899 garLoopResultBuilder]: For program point L160(line 160) no Hoare annotation was computed. [2022-11-26 01:12:41,773 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 97) no Hoare annotation was computed. [2022-11-26 01:12:41,774 INFO L899 garLoopResultBuilder]: For program point L160-1(line 160) no Hoare annotation was computed. [2022-11-26 01:12:41,774 INFO L895 garLoopResultBuilder]: At program point L441(line 441) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= 13 (select |#length| 2)) (= ~C_1_st~0 0) (= ~i~0 0) (= ~e~0 0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 0) (= ~data_0~0 0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= ~P_1_st~0 0) (= ~P_1_ev~0 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= ~C_1_pr~0 0) (= ~max_loop~0 2) (= ~P_1_i~0 1) (= (select |#valid| 1) 1) (= ~P_1_pc~0 0) (= ~C_1_pc~0 0) (= ~num~0 0) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (= ~C_1_ev~0 0) (= ~data_1~0 0) (= ~timer~0 0) (= ~C_1_i~0 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-26 01:12:41,774 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 152) no Hoare annotation was computed. [2022-11-26 01:12:41,774 INFO L895 garLoopResultBuilder]: At program point L458(line 458) the Hoare annotation is: (let ((.cse0 (<= 1 ~i~0)) (.cse6 (<= ~i~0 1)) (.cse10 (= ~num~0 0)) (.cse1 (= ~C_1_pc~0 1)) (.cse8 (<= 1 ~num~0)) (.cse11 (<= ~P_1_pc~0 0)) (.cse14 (< ~i~0 2147483646)) (.cse12 (= 2 ~C_1_pc~0)) (.cse2 (= ~P_1_pc~0 1)) (.cse3 (<= ~e~0 0)) (.cse4 (< ~num~0 2147483648)) (.cse5 (<= ~max_loop~0 2)) (.cse7 (= ~P_1_i~0 1)) (.cse13 (<= 0 ~num~0)) (.cse15 (<= 2 ~i~0)) (.cse9 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse10 .cse11 .cse9) (and .cse0 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse9) (and (or (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse14 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse14 .cse9)) .cse5 .cse15) (and (<= ~num~0 0) .cse12 .cse3 .cse5 .cse7 .cse11 .cse13 .cse15 .cse14 .cse9) (and .cse12 .cse2 .cse3 .cse4 .cse5 .cse7 (<= ~i~0 2147483646) .cse13 .cse15 .cse9))) [2022-11-26 01:12:41,775 INFO L899 garLoopResultBuilder]: For program point L293(lines 293 300) no Hoare annotation was computed. [2022-11-26 01:12:41,775 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 97) no Hoare annotation was computed. [2022-11-26 01:12:41,775 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 68) no Hoare annotation was computed. [2022-11-26 01:12:41,775 INFO L902 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: true [2022-11-26 01:12:41,775 INFO L899 garLoopResultBuilder]: For program point L46-1(line 46) no Hoare annotation was computed. [2022-11-26 01:12:41,775 INFO L895 garLoopResultBuilder]: At program point L459(line 459) the Hoare annotation is: (let ((.cse0 (<= 1 ~i~0)) (.cse6 (<= ~i~0 1)) (.cse10 (= ~num~0 0)) (.cse1 (= ~C_1_pc~0 1)) (.cse8 (<= 1 ~num~0)) (.cse11 (<= ~P_1_pc~0 0)) (.cse14 (< ~i~0 2147483646)) (.cse12 (= 2 ~C_1_pc~0)) (.cse2 (= ~P_1_pc~0 1)) (.cse3 (<= ~e~0 0)) (.cse4 (< ~num~0 2147483648)) (.cse5 (<= ~max_loop~0 2)) (.cse7 (= ~P_1_i~0 1)) (.cse13 (<= 0 ~num~0)) (.cse15 (<= 2 ~i~0)) (.cse9 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse10 .cse11 .cse9) (and .cse0 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse9) (and (or (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse14 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse14 .cse9)) .cse5 .cse15) (and (<= ~num~0 0) .cse12 .cse3 .cse5 .cse7 .cse11 .cse13 .cse15 .cse14 .cse9) (and .cse12 .cse2 .cse3 .cse4 .cse5 .cse7 (<= ~i~0 2147483646) .cse13 .cse15 .cse9))) [2022-11-26 01:12:41,776 INFO L899 garLoopResultBuilder]: For program point L179(line 179) no Hoare annotation was computed. [2022-11-26 01:12:41,776 INFO L899 garLoopResultBuilder]: For program point L179-1(line 179) no Hoare annotation was computed. [2022-11-26 01:12:41,776 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2022-11-26 01:12:41,776 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2022-11-26 01:12:41,776 INFO L899 garLoopResultBuilder]: For program point L477(lines 477 481) no Hoare annotation was computed. [2022-11-26 01:12:41,776 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 169) no Hoare annotation was computed. [2022-11-26 01:12:41,777 INFO L895 garLoopResultBuilder]: At program point L445-1(lines 442 482) the Hoare annotation is: (let ((.cse0 (<= 1 ~i~0)) (.cse6 (<= ~i~0 1)) (.cse10 (= ~num~0 0)) (.cse1 (= ~C_1_pc~0 1)) (.cse8 (<= 1 ~num~0)) (.cse11 (<= ~P_1_pc~0 0)) (.cse15 (< ~i~0 2147483646)) (.cse12 (= 2 ~C_1_pc~0)) (.cse2 (= ~P_1_pc~0 1)) (.cse3 (<= ~e~0 0)) (.cse4 (< ~num~0 2147483648)) (.cse5 (<= ~max_loop~0 2)) (.cse7 (= ~P_1_i~0 1)) (.cse13 (<= 0 ~num~0)) (.cse16 (<= 2 ~i~0)) (.cse9 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse10 .cse11 .cse9) (and .cse0 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse9) (let ((.cse14 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= 13 (select |#length| 2)) (= ~C_1_st~0 0) (= ~i~0 0) (= ~e~0 0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 0) (= ~data_0~0 0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= ~P_1_st~0 0) (= ~P_1_ev~0 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= ~C_1_pr~0 0) (= ~max_loop~0 2) .cse7 (= (select |#valid| 1) 1) (= ~P_1_pc~0 0) (= ~C_1_pc~0 0) .cse10 (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse14 0) 48) (= (select .cse14 1) 0) (= ~C_1_ev~0 0) (= ~data_1~0 0) (= ~timer~0 0) .cse9 (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) (and (or (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse15 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse15 .cse9)) .cse5 .cse16) (and (<= ~num~0 0) .cse12 .cse3 .cse5 .cse7 .cse11 .cse13 .cse16 .cse15 .cse9) (and .cse12 .cse2 .cse3 .cse4 .cse5 .cse7 (<= ~i~0 2147483646) .cse13 .cse16 .cse9))) [2022-11-26 01:12:41,777 INFO L895 garLoopResultBuilder]: At program point L280(line 280) the Hoare annotation is: (let ((.cse26 (<= 1 ~i~0)) (.cse11 (<= ~i~0 1)) (.cse2 (<= |ULTIMATE.start_eval_~tmp___2~0#1| 1)) (.cse13 (= 2 ~P_1_st~0)) (.cse19 (not (= |ULTIMATE.start_eval_~tmp___2~0#1| 0))) (.cse20 (<= 0 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse1 (= ~C_1_st~0 0)) (.cse4 (<= 0 ~e~0)) (.cse5 (= ~data_0~0 0)) (.cse6 (<= 0 ~i~0)) (.cse7 (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1)) (.cse8 (= ~P_1_ev~0 0)) (.cse9 (= |ULTIMATE.start_main_~count~0#1| 0)) (.cse10 (= ~C_1_pr~0 0)) (.cse12 (= ~max_loop~0 2)) (.cse33 (= ~C_1_pc~0 0)) (.cse17 (<= 0 ~P_1_pc~0)) (.cse18 (= |#NULL.offset| 0)) (.cse21 (= ~C_1_ev~0 0)) (.cse22 (<= 0 |#StackHeapBarrier|)) (.cse23 (= ~data_1~0 0)) (.cse34 (= ~timer~0 0)) (.cse25 (= |#NULL.base| 0)) (.cse15 (= ~num~0 0)) (.cse0 (= ~C_1_pc~0 1)) (.cse30 (<= 1 ~num~0)) (.cse16 (<= ~P_1_pc~0 0)) (.cse35 (< ~i~0 2147483646)) (.cse31 (= 2 ~C_1_pc~0)) (.cse27 (= ~P_1_pc~0 1)) (.cse3 (<= ~e~0 0)) (.cse28 (< ~num~0 2147483648)) (.cse29 (<= ~max_loop~0 2)) (.cse14 (= ~P_1_i~0 1)) (.cse32 (<= 0 ~num~0)) (.cse36 (<= 2 ~i~0)) (.cse24 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= 0 ~timer~0) .cse21 (<= |ULTIMATE.start_eval_~tmp___1~0#1| 2147483647) .cse22 .cse23 (<= 0 (+ |ULTIMATE.start_eval_~tmp___1~0#1| 2147483648)) .cse24 .cse25) (and .cse26 .cse0 .cse27 .cse3 .cse28 .cse29 .cse11 .cse14 .cse30 .cse24) (and .cse26 .cse0 .cse3 .cse29 .cse11 .cse14 .cse15 .cse16 .cse24) (and .cse26 .cse31 .cse27 .cse3 .cse28 .cse29 .cse11 .cse14 .cse32 .cse24) (and (<= 0 ~data_0~0) .cse1 .cse27 .cse2 (= ~i~0 0) (= ~e~0 0) .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse33 (<= 0 ~data_1~0) .cse18 .cse19 .cse20 (<= ~num~0 1) .cse21 .cse22 .cse30 .cse34 .cse24 .cse25) (and (<= ~i~0 0) .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~P_1_st~0 0) .cse8 .cse9 .cse10 .cse12 .cse14 .cse33 .cse15 .cse16 .cse17 .cse18 .cse21 .cse22 .cse23 .cse34 .cse24 .cse25) (and (or (and .cse0 .cse27 .cse3 .cse14 .cse15 .cse35 .cse24) (and .cse0 .cse27 .cse3 .cse28 .cse14 .cse30 .cse35 .cse24)) .cse29 .cse36) (and (<= ~num~0 0) .cse31 .cse3 .cse29 .cse14 .cse16 .cse32 .cse36 .cse35 .cse24) (and .cse31 .cse27 .cse3 .cse28 .cse29 .cse14 (<= ~i~0 2147483646) .cse32 .cse36 .cse24))) [2022-11-26 01:12:41,778 INFO L895 garLoopResultBuilder]: At program point L148(lines 140 193) the Hoare annotation is: (let ((.cse0 (<= ~num~0 0)) (.cse11 (<= ~P_1_pc~0 0)) (.cse24 (<= 2 ~i~0)) (.cse21 (= 2 ~C_1_pc~0)) (.cse22 (<= ~e~0 0)) (.cse27 (< ~num~0 2147483648)) (.cse23 (<= ~max_loop~0 2)) (.cse15 (<= 0 ~num~0)) (.cse26 (= ~P_1_pc~0 1)) (.cse1 (<= |ULTIMATE.start_eval_~tmp___2~0#1| 1)) (.cse2 (= ~i~0 0)) (.cse3 (= ~e~0 0)) (.cse4 (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1)) (.cse5 (= ~P_1_ev~0 0)) (.cse6 (= |ULTIMATE.start_main_~count~0#1| 0)) (.cse7 (= ~C_1_pr~0 0)) (.cse8 (= ~max_loop~0 2)) (.cse9 (= ~P_1_i~0 1)) (.cse10 (= ~C_1_pc~0 0)) (.cse12 (= |#NULL.offset| 0)) (.cse13 (not (= |ULTIMATE.start_eval_~tmp___2~0#1| 0))) (.cse14 (<= 0 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse16 (= ~C_1_ev~0 0)) (.cse17 (<= 0 |#StackHeapBarrier|)) (.cse25 (or (= |exists_runnable_thread_#res| 1) (not (= ~C_1_st~0 0)))) (.cse18 (= ~timer~0 0)) (.cse19 (= ~C_1_i~0 1)) (.cse20 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~data_0~0 0) .cse4 (= ~P_1_st~0 0) .cse5 .cse6 .cse7 (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0)) .cse8 .cse9 .cse10 .cse11 (<= 0 ~P_1_pc~0) .cse12 .cse13 .cse14 .cse15 .cse16 (<= |ULTIMATE.start_eval_~tmp~0#1| 0) (<= |ULTIMATE.start_eval_~tmp___1~0#1| 2147483647) .cse17 (<= 0 |ULTIMATE.start_eval_~tmp~0#1|) (= ~data_1~0 0) (<= 0 (+ |ULTIMATE.start_eval_~tmp___1~0#1| 2147483648)) .cse18 (= ~C_1_st~0 1) .cse19 .cse20) (and .cse0 .cse21 .cse22 .cse23 .cse9 .cse11 .cse13 .cse15 .cse24 .cse25 (< ~i~0 2147483646) .cse19) (and .cse21 .cse26 .cse22 .cse27 .cse23 .cse9 (<= ~i~0 2147483646) .cse13 .cse15 .cse24 .cse25 .cse19) (and (<= 1 ~i~0) .cse21 .cse26 .cse22 .cse27 .cse23 (<= ~i~0 1) .cse9 .cse13 .cse15 .cse25 .cse19) (and (<= 0 ~data_0~0) .cse26 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ~P_1_st~0) .cse9 .cse10 (<= 0 ~data_1~0) .cse12 .cse13 .cse14 (<= ~num~0 1) .cse16 .cse17 (<= 1 ~num~0) .cse25 .cse18 .cse19 .cse20))) [2022-11-26 01:12:41,778 INFO L899 garLoopResultBuilder]: For program point L462(line 462) no Hoare annotation was computed. [2022-11-26 01:12:41,778 INFO L902 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: true [2022-11-26 01:12:41,779 INFO L895 garLoopResultBuilder]: At program point L66-1(lines 55 73) the Hoare annotation is: (let ((.cse3 (<= 0 ~num~0)) (.cse5 (<= 1 ~i~0)) (.cse6 (<= ~max_loop~0 2)) (.cse11 (= ~P_1_pc~0 1)) (.cse8 (<= ~e~0 0)) (.cse9 (<= ~i~0 1)) (.cse0 (= ~P_1_i~0 1)) (.cse1 (<= ~num~0 |ULTIMATE.start_write_data_~i___0#1|)) (.cse2 (not (= |ULTIMATE.start_eval_~tmp___2~0#1| 0))) (.cse12 (<= ~num~0 1)) (.cse10 (or (= |exists_runnable_thread_#res| 1) (not (= ~P_1_st~0 0)))) (.cse4 (= ~C_1_i~0 1))) (or (and (<= 0 (+ |ULTIMATE.start_eval_~tmp~0#1| 2147483648)) (= |ULTIMATE.start_write_data_#in~c#1| |ULTIMATE.start_write_data_~c#1|) (= ~C_1_st~0 0) (<= |ULTIMATE.start_eval_~tmp~0#1| 2147483647) (<= |ULTIMATE.start_eval_~tmp___2~0#1| 1) (= ~i~0 0) (= ~e~0 0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (= |ULTIMATE.start_write_data_~i___0#1| 0) (= |ULTIMATE.start_write_data_~c#1| ~data_0~0) (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) (= |ULTIMATE.start_write_data_#in~i___0#1| |ULTIMATE.start_write_data_~i___0#1|) (= ~P_1_ev~0 0) (= |ULTIMATE.start_main_~count~0#1| 0) (= ~P_1_st~0 1) (= ~C_1_pr~0 0) (= ~max_loop~0 2) .cse0 (= |ULTIMATE.start_write_data_#in~c#1| 65) .cse1 (= ~C_1_pc~0 0) (<= 0 ~P_1_pc~0) (= |#NULL.offset| 0) .cse2 (<= 0 |ULTIMATE.start_eval_~tmp___2~0#1|) .cse3 (= ~C_1_ev~0 0) (<= 0 |#StackHeapBarrier|) (= ~data_1~0 0) (= ~timer~0 0) .cse4 (= |#NULL.base| 0)) (and .cse5 .cse6 (let ((.cse7 (= 2 ~C_1_pc~0))) (or (and (<= ~num~0 0) .cse7 .cse8 .cse9 .cse0 .cse1 .cse2 .cse3 .cse10 .cse4) (and .cse7 .cse11 .cse8 .cse9 .cse0 .cse1 .cse2 .cse12 .cse3 .cse10 .cse4)))) (and .cse5 .cse6 (let ((.cse13 (= ~C_1_pc~0 1))) (or (and .cse13 .cse8 .cse9 .cse0 .cse1 (= ~num~0 0) .cse2 .cse10 .cse4) (and .cse13 .cse11 .cse8 .cse9 .cse0 .cse1 .cse2 .cse12 (<= 1 ~num~0) .cse10 .cse4)))))) [2022-11-26 01:12:41,780 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 169) no Hoare annotation was computed. [2022-11-26 01:12:41,780 INFO L899 garLoopResultBuilder]: For program point L282(line 282) no Hoare annotation was computed. [2022-11-26 01:12:41,780 INFO L895 garLoopResultBuilder]: At program point L51(lines 36 53) the Hoare annotation is: (let ((.cse10 (<= ~num~0 0)) (.cse11 (<= 1 ~i~0)) (.cse0 (= ~P_1_pc~0 1)) (.cse1 (<= ~e~0 0)) (.cse2 (<= 0 ~i~0)) (.cse3 (<= ~max_loop~0 2)) (.cse12 (<= ~i~0 1)) (.cse4 (= ~P_1_i~0 1)) (.cse5 (not (= |ULTIMATE.start_eval_~tmp___2~0#1| 0))) (.cse6 (< ~num~0 2147483647)) (.cse7 (<= 0 ~num~0)) (.cse8 (or (= |exists_runnable_thread_#res| 1) (not (= ~C_1_st~0 0)))) (.cse9 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~i~0) .cse8 (< ~i~0 2147483646) .cse9) (and .cse10 (<= ~i~0 0) .cse0 .cse1 .cse2 (not (= 2 ~C_1_pc~0)) .cse3 (<= ~P_1_ev~0 0) (= 2 ~P_1_st~0) .cse4 (<= ~C_1_ev~0 0) .cse5 .cse7 .cse8 .cse9) (and .cse11 .cse10 .cse1 .cse3 .cse12 .cse4 (<= ~P_1_pc~0 0) .cse5 .cse7 .cse8 .cse9) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2022-11-26 01:12:41,780 INFO L895 garLoopResultBuilder]: At program point L464(lines 464 473) the Hoare annotation is: (let ((.cse0 (<= 1 ~i~0)) (.cse6 (<= ~i~0 1)) (.cse10 (= ~num~0 0)) (.cse1 (= ~C_1_pc~0 1)) (.cse8 (<= 1 ~num~0)) (.cse11 (<= ~P_1_pc~0 0)) (.cse14 (< ~i~0 2147483646)) (.cse12 (= 2 ~C_1_pc~0)) (.cse2 (= ~P_1_pc~0 1)) (.cse3 (<= ~e~0 0)) (.cse4 (< ~num~0 2147483648)) (.cse5 (<= ~max_loop~0 2)) (.cse7 (= ~P_1_i~0 1)) (.cse13 (<= 0 ~num~0)) (.cse15 (<= 2 ~i~0)) (.cse9 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse10 .cse11 .cse9) (and .cse0 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse9) (and (or (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse14 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse14 .cse9)) .cse5 .cse15) (and (<= ~num~0 0) .cse12 .cse3 .cse5 .cse7 .cse11 .cse13 .cse15 .cse14 .cse9) (and .cse12 .cse2 .cse3 .cse4 .cse5 .cse7 (<= ~i~0 2147483646) .cse13 .cse15 .cse9))) [2022-11-26 01:12:41,781 INFO L899 garLoopResultBuilder]: For program point L464-2(lines 464 473) no Hoare annotation was computed. [2022-11-26 01:12:41,781 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 15 22) no Hoare annotation was computed. [2022-11-26 01:12:41,781 INFO L902 garLoopResultBuilder]: At program point errorENTRY(lines 15 22) the Hoare annotation is: true [2022-11-26 01:12:41,784 INFO L445 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, 1, 1, 1] [2022-11-26 01:12:41,787 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 01:12:41,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 01:12:41 BoogieIcfgContainer [2022-11-26 01:12:41,904 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 01:12:41,905 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 01:12:41,905 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 01:12:41,905 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 01:12:41,906 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:07:10" (3/4) ... [2022-11-26 01:12:41,909 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-26 01:12:41,915 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2022-11-26 01:12:41,915 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-11-26 01:12:41,915 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2022-11-26 01:12:41,915 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2022-11-26 01:12:41,915 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2022-11-26 01:12:41,916 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2022-11-26 01:12:41,923 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 44 nodes and edges [2022-11-26 01:12:41,925 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2022-11-26 01:12:41,926 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-26 01:12:41,926 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-26 01:12:41,959 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((!(1 <= i) || !(C_1_i == 1)) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(1 <= C_1_pc)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || !(0 <= num)) || !(0 <= i)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(num < 2147483648)) || !(1 <= P_1_pc)) && ((((((((((!(C_1_i == 1) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(2 == C_1_pc)) || !(P_1_pc <= 0)) || !(max_loop <= 2)) || !(num <= 0)) || !(2 <= i)) || !(0 <= num)) || !(i < 2147483646)) || !(P_1_i == 1)) || !(e <= 0))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(1 <= i)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(2 == C_1_pc)) || !(e == 0)) || !(0 <= data_0)) || !(0 <= num)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || __retres1 == 0) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(num < 2147483648)) || !(1 <= P_1_pc)) || !(0 <= timer))) && (((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(1 <= i)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(C_1_pc == 1)) || !(e == 0)) || !(0 <= data_0)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || __retres1 == 0) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(1 <= num)) || !(num < 2147483648)) || !(0 <= timer))) && (((((((((((((!(C_1_i == 1) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(1 <= C_1_pc)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || !(2 <= i)) || !(0 <= num)) || !(0 <= i)) || !(i <= 2147483646)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(num < 2147483648)) || !(1 <= P_1_pc))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(2 == C_1_pc)) || !(e == 0)) || !(0 <= data_0)) || !(2 <= i)) || !(0 <= num)) || !(i < 2147483646)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || __retres1 == 0) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(num < 2147483648)) || !(1 <= P_1_pc)) || !(0 <= timer))) && ((((((((((((((((((((((((((!(\old(P_1_st) == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(C_1_i == 1)) || !(0 <= P_1_pc)) || !(0 <= C_1_pr)) || ((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) && __retres1 == 0)) || !(P_1_pc <= 0)) || !(C_1_pc <= 0)) || !(0 <= P_1_ev)) || !(timer == 0)) || !(0 <= #NULL)) || !(P_1_i == 1)) || !(e <= 0)) || !(max_loop == 2)) || !(C_1_pr <= 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(0 <= C_1_pc)) || !(0 <= C_1_ev)) || !(P_1_ev <= 0)) || !(num == 0)) || !(0 <= e)) || !(data_0 == 0)) || !(#NULL <= 0)) || !(C_1_ev <= 0)) || !(\old(C_1_st) == 0)) || !(i == 0))) && ((((((((((((!(1 <= i) || !(C_1_i == 1)) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(1 <= C_1_pc)) || !(C_1_pc == 1)) || !(max_loop <= 2)) || !(0 <= i)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(1 <= num)) || !(num < 2147483648))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(1 <= i)) || !(C_1_i == 1)) || !(0 <= P_1_pc)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(P_1_pc <= 0)) || !(C_1_pc == 1)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(i <= 1)) || !(P_1_i == 1)) || !(e <= 0)) || !(max_loop == 2)) || __retres1 == 0) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(num == 0)) || !(0 <= e)) || !(data_0 == 0)) || !(0 <= timer))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(C_1_pc == 1)) || !(e == 0)) || !(0 <= data_0)) || !(i < 2147483646)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(1 <= num)) || !(num < 2147483648)) || !(0 <= timer)) && ((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(C_1_pc == 1)) || !(e == 0)) || !(0 <= data_0)) || !(i < 2147483646)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(num == 0)) || !(1 <= P_1_pc)) || !(0 <= timer))) || !(2 <= i)) || __retres1 == 0)) && (((((((((((!(1 <= i) || !(C_1_i == 1)) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(1 <= C_1_pc)) || !(P_1_pc <= 0)) || !(C_1_pc == 1)) || !(max_loop <= 2)) || !(0 <= i)) || !(i <= 1)) || !(P_1_i == 1)) || !(e <= 0)) || !(num == 0))) && ((((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) || !(max_loop <= 2)) || !(2 <= i)) || (((((((((!(C_1_i == 1) || !(1 <= C_1_pc)) || !(C_1_pc == 1)) || !(i < 2147483646)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(num == 0)) || !(1 <= P_1_pc)) && (((((((((!(C_1_i == 1) || !(1 <= C_1_pc)) || !(C_1_pc == 1)) || !(i < 2147483646)) || !(0 <= i)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(1 <= num)) || !(num < 2147483648)))) [2022-11-26 01:12:41,961 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((num <= 0 && 2 == C_1_pc) && e <= 0) && max_loop <= 2) && P_1_i == 1) && P_1_pc <= 0) && !(tmp___2 == 0)) && 0 <= num) && 2 <= i) && (\result == 1 || !(P_1_st == 0))) && i < 2147483646) && C_1_i == 1) || ((max_loop <= 2 && ((((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && num < 2147483648) && P_1_i == 1) && !(tmp___2 == 0)) && 1 <= num) && (\result == 1 || !(P_1_st == 0))) && i < 2147483646) && C_1_i == 1) || ((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && P_1_i == 1) && num == 0) && !(tmp___2 == 0)) && (\result == 1 || !(P_1_st == 0))) && i < 2147483646) && C_1_i == 1))) && 2 <= i)) || ((((((((((1 <= i && C_1_pc == 1) && e <= 0) && max_loop <= 2) && i <= 1) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && !(tmp___2 == 0)) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1)) || (((((((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && P_1_i == 1) && i <= 2147483646) && !(tmp___2 == 0)) && 0 <= num) && 2 <= i) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1)) || (((((((((((1 <= i && C_1_pc == 1) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && !(tmp___2 == 0)) && 1 <= num) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1)) || (((((((((((1 <= i && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && !(tmp___2 == 0)) && 0 <= num) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1)) || (((((((((((((((((((((((((((((((0 <= tmp + 2147483648 && i <= 0) && C_1_st == 0) && tmp <= 2147483647) && tmp___2 <= 1) && e <= 0) && 0 <= e) && data_0 == 0) && 0 <= i) && kernel_st == 1) && !(tmp == 0)) && P_1_ev == 0) && count == 0) && P_1_st == 1) && C_1_pr == 0) && max_loop == 2) && P_1_i == 1) && C_1_ev <= 0) && num == 0) && P_1_pc <= 0) && 0 <= C_1_ev) && 0 <= P_1_pc) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && 0 <= C_1_pc) && C_1_pc <= 0) && 0 <= unknown-#StackHeapBarrier-unknown) && data_1 == 0) && timer == 0) && C_1_i == 1) && #NULL == 0) [2022-11-26 01:12:41,961 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((num <= 0 && tmp___2 <= 1) && i == 0) && e == 0) && data_0 == 0) && kernel_st == 1) && P_1_st == 0) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && !(tmp___1 == 0)) && max_loop == 2) && P_1_i == 1) && C_1_pc == 0) && P_1_pc <= 0) && 0 <= P_1_pc) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && 0 <= num) && C_1_ev == 0) && tmp <= 0) && tmp___1 <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= tmp) && data_1 == 0) && 0 <= tmp___1 + 2147483648) && timer == 0) && C_1_st == 1) && C_1_i == 1) && #NULL == 0) || (((((((((((num <= 0 && 2 == C_1_pc) && e <= 0) && max_loop <= 2) && P_1_i == 1) && P_1_pc <= 0) && !(tmp___2 == 0)) && 0 <= num) && 2 <= i) && (\result == 1 || !(C_1_st == 0))) && i < 2147483646) && C_1_i == 1)) || (((((((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && P_1_i == 1) && i <= 2147483646) && !(tmp___2 == 0)) && 0 <= num) && 2 <= i) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1)) || (((((((((((1 <= i && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && !(tmp___2 == 0)) && 0 <= num) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1)) || ((((((((((((((((((((((((0 <= data_0 && P_1_pc == 1) && tmp___2 <= 1) && i == 0) && e == 0) && kernel_st == 1) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && max_loop == 2) && 2 == P_1_st) && P_1_i == 1) && C_1_pc == 0) && 0 <= data_1) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && num <= 1) && C_1_ev == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 1 <= num) && (\result == 1 || !(C_1_st == 0))) && timer == 0) && C_1_i == 1) && #NULL == 0) [2022-11-26 01:12:41,962 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((C_1_st == \old(C_1_st) && (P_1_st == 0 || \old(P_1_st) == P_1_st)) && __retres1 == 0) || !(1 <= i)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_pc <= 0)) || !(C_1_pc == 1)) || !(max_loop <= 2)) || !(0 <= i)) || !(i <= 1)) || !(P_1_i == 1)) || !(e <= 0)) || !(num == 0)) && ((((((((((((((C_1_st == \old(C_1_st) && (P_1_st == 0 || \old(P_1_st) == P_1_st)) && __retres1 == 0) || !(1 <= i)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(C_1_pc == 1)) || !(max_loop <= 2)) || !(0 <= i)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(1 <= num)) || !(num < 2147483648))) && (((((C_1_st == \old(C_1_st) && (P_1_st == 0 || \old(P_1_st) == P_1_st)) && __retres1 == 0) || !(max_loop <= 2)) || !(2 <= i)) || (((((((((!(C_1_i == 1) || !(1 <= C_1_pc)) || !(C_1_pc == 1)) || !(i < 2147483646)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(num == 0)) || !(1 <= P_1_pc)) && (((((((((!(C_1_i == 1) || !(1 <= C_1_pc)) || !(C_1_pc == 1)) || !(i < 2147483646)) || !(0 <= i)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(1 <= num)) || !(num < 2147483648))))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(1 <= i)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(2 == C_1_pc)) || !(e == 0)) || !(0 <= data_0)) || !(0 <= num)) || !(0 <= i)) || !(#NULL == 0)) || (((tmp == \result && \old(P_1_st) == P_1_st) && __retres1 == 0) && __retres1 == \result)) || !(C_1_ev == 0)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(num < 2147483648)) || !(1 <= P_1_pc)) || !(0 <= timer))) && (((((((((((((!(C_1_i == 1) || ((((0 <= i && C_1_st == \old(C_1_st)) && 1 <= P_1_pc) && (P_1_st == 0 || \old(P_1_st) == P_1_st)) && 1 <= C_1_pc)) || !(1 <= C_1_pc)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || !(2 <= i)) || !(0 <= num)) || !(0 <= i)) || !(i <= 2147483646)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(num < 2147483648)) || !(1 <= P_1_pc))) && ((((((((((((((((((((((((((!(\old(P_1_st) == 0) || !(#NULL == 0)) || !(data_1 == 0)) || ((((((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) && tmp <= 0) && __retres1 == 0) && __retres1 == 0) && __retres1 == \result) && 0 <= tmp)) || !(C_1_i == 1)) || !(0 <= P_1_pc)) || !(0 <= C_1_pr)) || !(P_1_pc <= 0)) || !(C_1_pc <= 0)) || !(0 <= P_1_ev)) || !(timer == 0)) || !(0 <= #NULL)) || !(P_1_i == 1)) || !(e <= 0)) || !(max_loop == 2)) || !(C_1_pr <= 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(0 <= C_1_pc)) || !(0 <= C_1_ev)) || !(P_1_ev <= 0)) || !(num == 0)) || !(0 <= e)) || !(data_0 == 0)) || !(#NULL <= 0)) || !(C_1_ev <= 0)) || !(\old(C_1_st) == 0)) || !(i == 0))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(2 == C_1_pc)) || !(e == 0)) || !(0 <= data_0)) || !(2 <= i)) || !(0 <= num)) || !(i < 2147483646)) || !(0 <= i)) || !(#NULL == 0)) || (((tmp == \result && \old(P_1_st) == P_1_st) && __retres1 == 0) && __retres1 == \result)) || !(C_1_ev == 0)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(num < 2147483648)) || !(1 <= P_1_pc)) || !(0 <= timer))) && (((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(1 <= i)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(C_1_pc == 1)) || !(e == 0)) || !(0 <= data_0)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || ((((\old(P_1_st) == P_1_st && tmp <= 0) && __retres1 == 0) && __retres1 == \result) && 0 <= tmp)) || !(1 <= num)) || !(num < 2147483648)) || !(0 <= timer))) && (((((((((((((((!(C_1_i == 1) || !(1 <= C_1_pc)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || !(2 <= i)) || !(0 <= num)) || !(0 <= i)) || !(i <= 2147483646)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || !(num < 2147483648)) || !(C_1_ev <= 0)) || __retres1 == 0) || !(1 <= P_1_pc))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(1 <= i)) || !(C_1_i == 1)) || !(0 <= P_1_pc)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(P_1_pc <= 0)) || !(C_1_pc == 1)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(i <= 1)) || !(P_1_i == 1)) || !(e <= 0)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || ((((\old(P_1_st) == P_1_st && tmp <= 0) && __retres1 == 0) && __retres1 == \result) && 0 <= tmp)) || !(num == 0)) || !(0 <= e)) || !(data_0 == 0)) || !(0 <= timer))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(C_1_pc == 1)) || !(e == 0)) || !(0 <= data_0)) || !(i < 2147483646)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(1 <= num)) || !(num < 2147483648)) || !(0 <= timer)) && ((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(C_1_pc == 1)) || !(e == 0)) || !(0 <= data_0)) || !(i < 2147483646)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(num == 0)) || !(1 <= P_1_pc)) || !(0 <= timer))) || !(2 <= i)) || ((((\old(P_1_st) == P_1_st && tmp <= 0) && __retres1 == 0) && __retres1 == \result) && 0 <= tmp))) && (((((((((((((!(1 <= i) || !(C_1_i == 1)) || ((((0 <= i && C_1_st == \old(C_1_st)) && 1 <= P_1_pc) && (P_1_st == 0 || \old(P_1_st) == P_1_st)) && 1 <= C_1_pc)) || !(1 <= C_1_pc)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || !(0 <= num)) || !(0 <= i)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(num < 2147483648)) || !(1 <= P_1_pc))) && (((((((((((((((!(1 <= i) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || !(0 <= num)) || !(0 <= i)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || !(num < 2147483648)) || !(C_1_ev <= 0)) || __retres1 == 0) || !(1 <= P_1_pc))) && (((((((((((C_1_st == \old(C_1_st) && (P_1_st == 0 || \old(P_1_st) == P_1_st)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(P_1_pc <= 0)) || !(max_loop <= 2)) || !(num <= 0)) || !(2 <= i)) || !(0 <= num)) || !(i < 2147483646)) || !(P_1_i == 1)) || !(e <= 0)) [2022-11-26 01:12:41,962 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((i <= 0 && 0 <= data_0) && P_1_pc == 1) && tmp___2 <= 1) && e == 0) && 0 <= i) && kernel_st == 1) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && max_loop == 2) && 2 == P_1_st) && P_1_i == 1) && C_1_pc == 0) && 0 <= data_1) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && num <= 1) && C_1_ev == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 1 <= num) && (\result == 1 || !(C_1_st == 0))) && timer == 0) && C_1_i == 1) && #NULL == 0) || (((((((((((((((((((((((((((((C_1_pc == 1 && tmp___2 <= 1) && e == 0) && data_0 == 0) && 0 <= i) && kernel_st == 1) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && !(tmp___1 == 0)) && max_loop == 2) && P_1_i == 1) && C_1_ev <= 0) && 0 <= data_1) && num == 0) && P_1_pc <= 0) && 0 <= C_1_ev) && 0 <= P_1_pc) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && 0 <= timer) && data_1 <= 0) && tmp___1 <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= tmp___1 + 2147483648) && C_1_st == 1) && C_1_i == 1) && !(P_1_st == 0)) && #NULL == 0)) || ((((((((1 <= i && num <= 0) && max_loop <= 2) && i <= 1) && P_1_i == 1) && ((((C_1_pc == 1 && e <= 0) && num == 0) && P_1_pc <= 0) || (((2 == C_1_pc && e <= 0) && P_1_pc <= 0) && 0 <= num))) && !(tmp___2 == 0)) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1)) || ((((((((((((((((((((((((((((0 <= tmp + 2147483648 && C_1_pc == 1) && tmp <= 2147483647) && tmp___2 <= 1) && e == 0) && data_0 == 0) && 0 <= i) && kernel_st == 1) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && !(tmp___1 == 0)) && max_loop == 2) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && 0 <= P_1_pc) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && 0 <= timer) && C_1_ev == 0) && tmp___1 <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && data_1 == 0) && 0 <= tmp___1 + 2147483648) && C_1_st == 1) && C_1_i == 1) && #NULL == 0)) || ((max_loop <= 2 && ((((((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && 0 <= i) && num <= 1) && 0 <= num) || (((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && 0 <= i) && num <= 1) && 0 <= num)) && P_1_i == 1) && !(tmp___2 == 0)) && (\result == 1 || !(C_1_st == 0))) && i < 2147483646) && C_1_i == 1) || ((((((num < 2147483648 && P_1_i == 1) && !(tmp___2 == 0)) && (((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && 0 <= i) && 0 <= num) || ((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && 0 <= i) && 1 <= num))) && (\result == 1 || !(C_1_st == 0))) && i < 2147483646) && C_1_i == 1))) && 2 <= i)) || ((1 <= i && (((((((num < 2147483648 && i <= 1) && P_1_i == 1) && !(tmp___2 == 0)) && (((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && 0 <= i) && 0 <= num) || ((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && 0 <= i) && 1 <= num))) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1) || (((((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && 0 <= i) && num <= 1) && 0 <= num) || (((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && 0 <= i) && num <= 1) && 0 <= num)) && i <= 1) && P_1_i == 1) && !(tmp___2 == 0)) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1))) && max_loop <= 2) [2022-11-26 01:12:41,962 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((1 <= i && C_1_pc == 1) && e <= 0) && max_loop <= 2) && i <= 1) && 2 == P_1_st) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && !(tmp___2 == 0)) && C_1_i == 1) || (((((((((((((((((((((((((((((((((0 <= tmp + 2147483648 && C_1_st == 0) && P_1_pc == 1) && tmp <= 2147483647) && tmp___2 <= 1) && i == 0) && e == 0) && kernel_st == 1) && c == data_0) && !(tmp == 0)) && \old(i___0) == i___0) && P_1_ev == 0) && count == 0) && 65 <= c) && C_1_pr == 0) && max_loop == 2) && 2 == P_1_st) && c <= 65) && P_1_i == 1) && \old(c) == 65) && 0 <= \old(i___0)) && C_1_pc == 0) && 0 <= data_1) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && num <= 1) && \old(i___0) <= 0) && C_1_ev == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 1 <= num) && timer == 0) && C_1_i == 1) && #NULL == 0)) || (((((((((((1 <= i && C_1_pc == 1) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && 2 == P_1_st) && P_1_i == 1) && !(tmp___2 == 0)) && 1 <= num) && C_1_i == 1)) || (((((((((((num <= 0 && 2 == C_1_pc) && e <= 0) && max_loop <= 2) && 2 == P_1_st) && P_1_i == 1) && P_1_pc <= 0) && !(tmp___2 == 0)) && 0 <= num) && 2 <= i) && i < 2147483646) && C_1_i == 1)) || (((((((((((1 <= i && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && 2 == P_1_st) && P_1_i == 1) && !(tmp___2 == 0)) && 0 <= num) && C_1_i == 1)) || ((max_loop <= 2 && (((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && 2 == P_1_st) && P_1_i == 1) && num == 0) && !(tmp___2 == 0)) && i < 2147483646) && C_1_i == 1) || (((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && num < 2147483648) && 2 == P_1_st) && P_1_i == 1) && !(tmp___2 == 0)) && 1 <= num) && i < 2147483646) && C_1_i == 1))) && 2 <= i)) || ((((((((((((((((((((((((((((C_1_pc == 1 && C_1_st == 0) && tmp___2 <= 1) && e <= 0) && 0 <= e) && data_0 == 0) && 0 <= i) && kernel_st == 1) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && i <= 1) && max_loop == 2) && 2 == P_1_st) && P_1_i == 1) && C_1_ev <= 0) && 0 <= data_1) && num == 0) && P_1_pc <= 0) && 0 <= C_1_ev) && 0 <= P_1_pc) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && 0 <= timer) && data_1 <= 0) && 0 <= unknown-#StackHeapBarrier-unknown) && C_1_i == 1) && #NULL == 0)) || (((((((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && 2 == P_1_st) && P_1_i == 1) && i <= 2147483646) && !(tmp___2 == 0)) && 0 <= num) && 2 <= i) && C_1_i == 1) [2022-11-26 01:12:41,964 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((0 <= tmp + 2147483648 && \old(c) == c) && C_1_st == 0) && tmp <= 2147483647) && tmp___2 <= 1) && i == 0) && e == 0) && kernel_st == 1) && i___0 == 0) && c == data_0) && !(tmp == 0)) && \old(i___0) == i___0) && P_1_ev == 0) && count == 0) && P_1_st == 1) && C_1_pr == 0) && max_loop == 2) && P_1_i == 1) && \old(c) == 65) && num <= i___0) && C_1_pc == 0) && 0 <= P_1_pc) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && 0 <= num) && C_1_ev == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && data_1 == 0) && timer == 0) && C_1_i == 1) && #NULL == 0) || ((1 <= i && max_loop <= 2) && ((((((((((num <= 0 && 2 == C_1_pc) && e <= 0) && i <= 1) && P_1_i == 1) && num <= i___0) && !(tmp___2 == 0)) && 0 <= num) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1) || ((((((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && i <= 1) && P_1_i == 1) && num <= i___0) && !(tmp___2 == 0)) && num <= 1) && 0 <= num) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1)))) || ((1 <= i && max_loop <= 2) && (((((((((C_1_pc == 1 && e <= 0) && i <= 1) && P_1_i == 1) && num <= i___0) && num == 0) && !(tmp___2 == 0)) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1) || ((((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && i <= 1) && P_1_i == 1) && num <= i___0) && !(tmp___2 == 0)) && num <= 1) && 1 <= num) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1))) [2022-11-26 01:12:41,968 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((P_1_pc == 1 && e <= 0) && 0 <= i) && max_loop <= 2) && P_1_i == 1) && !(tmp___2 == 0)) && num < 2147483647) && 0 <= num) && 2 <= i) && (\result == 1 || !(C_1_st == 0))) && i < 2147483646) && C_1_i == 1) || ((((((((((((((num <= 0 && i <= 0) && P_1_pc == 1) && e <= 0) && 0 <= i) && !(2 == C_1_pc)) && max_loop <= 2) && P_1_ev <= 0) && 2 == P_1_st) && P_1_i == 1) && C_1_ev <= 0) && !(tmp___2 == 0)) && 0 <= num) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1)) || ((((((((((1 <= i && num <= 0) && e <= 0) && max_loop <= 2) && i <= 1) && P_1_i == 1) && P_1_pc <= 0) && !(tmp___2 == 0)) && 0 <= num) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1)) || (((((((((((1 <= i && P_1_pc == 1) && e <= 0) && 0 <= i) && max_loop <= 2) && i <= 1) && P_1_i == 1) && !(tmp___2 == 0)) && num < 2147483647) && 0 <= num) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1) [2022-11-26 01:12:42,016 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 01:12:42,016 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 01:12:42,017 INFO L158 Benchmark]: Toolchain (without parser) took 332467.61ms. Allocated memory was 159.4MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 116.8MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 729.9MB. Max. memory is 16.1GB. [2022-11-26 01:12:42,019 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 115.3MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 01:12:42,019 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.53ms. Allocated memory is still 159.4MB. Free memory was 116.8MB in the beginning and 121.4MB in the end (delta: -4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-26 01:12:42,021 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.04ms. Allocated memory is still 159.4MB. Free memory was 121.4MB in the beginning and 119.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 01:12:42,021 INFO L158 Benchmark]: Boogie Preprocessor took 25.95ms. Allocated memory is still 159.4MB. Free memory was 119.3MB in the beginning and 117.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 01:12:42,022 INFO L158 Benchmark]: RCFGBuilder took 848.54ms. Allocated memory is still 159.4MB. Free memory was 117.6MB in the beginning and 88.8MB in the end (delta: 28.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-26 01:12:42,025 INFO L158 Benchmark]: TraceAbstraction took 331066.50ms. Allocated memory was 159.4MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 88.2MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2022-11-26 01:12:42,027 INFO L158 Benchmark]: Witness Printer took 111.11ms. Allocated memory is still 2.4GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-26 01:12:42,028 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.28ms. Allocated memory is still 115.3MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.53ms. Allocated memory is still 159.4MB. Free memory was 116.8MB in the beginning and 121.4MB in the end (delta: -4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.04ms. Allocated memory is still 159.4MB. Free memory was 121.4MB in the beginning and 119.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.95ms. Allocated memory is still 159.4MB. Free memory was 119.3MB in the beginning and 117.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 848.54ms. Allocated memory is still 159.4MB. Free memory was 117.6MB in the beginning and 88.8MB in the end (delta: 28.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 331066.50ms. Allocated memory was 159.4MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 88.2MB in the beginning and 1.6GB in the end (delta: -1.6GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 111.11ms. Allocated memory is still 2.4GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 97]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 97]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 160]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 160]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 169]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 169]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 179]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 179]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 89 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 330.9s, OverallIterations: 27, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 60.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 149.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6205 SdHoareTripleChecker+Valid, 14.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6161 mSDsluCounter, 8943 SdHoareTripleChecker+Invalid, 12.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5903 mSDsCounter, 1612 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14874 IncrementalHoareTripleChecker+Invalid, 16486 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1612 mSolverCounterUnsat, 3040 mSDtfsCounter, 14874 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4196 GetRequests, 3374 SyntacticMatches, 90 SemanticMatches, 732 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23194 ImplicationChecksByTransitivity, 98.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20350occurred in iteration=25, InterpolantAutomatonStates: 476, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 21897 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 10324 PreInvPairs, 11310 NumberOfFragments, 9181 HoareAnnotationTreeSize, 10324 FomulaSimplifications, 157516 FormulaSimplificationTreeSizeReduction, 77.1s HoareSimplificationTime, 39 FomulaSimplificationsInter, 897089 FormulaSimplificationTreeSizeReductionInter, 71.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 4374 NumberOfCodeBlocks, 4374 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 5312 ConstructedInterpolants, 0 QuantifiedInterpolants, 10698 SizeOfPredicates, 8 NumberOfNonLiveVariables, 5474 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 49 InterpolantComputations, 19 PerfectInterpolantSequences, 6296/6837 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: OVERALL_TIME: 24.2s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 36, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 553, DAG_INTERPRETER_EARLY_EXITS: 2, TOOLS_POST_APPLICATIONS: 662, TOOLS_POST_TIME: 9.7s, TOOLS_POST_CALL_APPLICATIONS: 382, TOOLS_POST_CALL_TIME: 6.1s, TOOLS_POST_RETURN_APPLICATIONS: 316, TOOLS_POST_RETURN_TIME: 2.5s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 1360, TOOLS_QUANTIFIERELIM_TIME: 17.8s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 1520, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 423, DOMAIN_JOIN_TIME: 4.8s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 7, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 13, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 553, DOMAIN_ISBOTTOM_TIME: 0.7s, LOOP_SUMMARIZER_APPLICATIONS: 6, LOOP_SUMMARIZER_CACHE_MISSES: 6, LOOP_SUMMARIZER_OVERALL_TIME: 12.9s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 12.9s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 13, CALL_SUMMARIZER_APPLICATIONS: 316, CALL_SUMMARIZER_CACHE_MISSES: 30, CALL_SUMMARIZER_OVERALL_TIME: 0.1s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.1s, DAG_COMPRESSION_PROCESSED_NODES: 10678, DAG_COMPRESSION_RETAINED_NODES: 1218, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 417]: Loop Invariant Derived loop invariant: (((((((((((((1 <= i && C_1_pc == 1) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && 1 <= num) && C_1_i == 1) || ((((((((1 <= i && C_1_pc == 1) && e <= 0) && max_loop <= 2) && i <= 1) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && C_1_i == 1)) || (((((((((1 <= i && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && 0 <= num) && C_1_i == 1)) || (((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && P_1_i == 1) && num == 0) && i < 2147483646) && C_1_i == 1) || (((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && num < 2147483648) && P_1_i == 1) && 1 <= num) && i < 2147483646) && C_1_i == 1)) && max_loop <= 2) && 2 <= i)) || (((((((((num <= 0 && 2 == C_1_pc) && e <= 0) && max_loop <= 2) && P_1_i == 1) && P_1_pc <= 0) && 0 <= num) && 2 <= i) && i < 2147483646) && C_1_i == 1)) || (((((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && P_1_i == 1) && i <= 2147483646) && 0 <= num) && 2 <= i) && C_1_i == 1) - InvariantResult [Line: 81]: Loop Invariant Derived loop invariant: ((((((((((((((((num <= 0 && 2 == C_1_pc) && e <= 0) && max_loop <= 2) && P_1_i == 1) && P_1_pc <= 0) && !(tmp___2 == 0)) && 0 <= num) && 2 <= i) && (\result == 1 || !(P_1_st == 0))) && i < 2147483646) && C_1_i == 1) || ((max_loop <= 2 && ((((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && num < 2147483648) && P_1_i == 1) && !(tmp___2 == 0)) && 1 <= num) && (\result == 1 || !(P_1_st == 0))) && i < 2147483646) && C_1_i == 1) || ((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && P_1_i == 1) && num == 0) && !(tmp___2 == 0)) && (\result == 1 || !(P_1_st == 0))) && i < 2147483646) && C_1_i == 1))) && 2 <= i)) || ((((((((((1 <= i && C_1_pc == 1) && e <= 0) && max_loop <= 2) && i <= 1) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && !(tmp___2 == 0)) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1)) || (((((((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && P_1_i == 1) && i <= 2147483646) && !(tmp___2 == 0)) && 0 <= num) && 2 <= i) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1)) || (((((((((((1 <= i && C_1_pc == 1) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && !(tmp___2 == 0)) && 1 <= num) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1)) || (((((((((((1 <= i && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && !(tmp___2 == 0)) && 0 <= num) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1)) || (((((((((((((((((((((((((((((((0 <= tmp + 2147483648 && i <= 0) && C_1_st == 0) && tmp <= 2147483647) && tmp___2 <= 1) && e <= 0) && 0 <= e) && data_0 == 0) && 0 <= i) && kernel_st == 1) && !(tmp == 0)) && P_1_ev == 0) && count == 0) && P_1_st == 1) && C_1_pr == 0) && max_loop == 2) && P_1_i == 1) && C_1_ev <= 0) && num == 0) && P_1_pc <= 0) && 0 <= C_1_ev) && 0 <= P_1_pc) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && 0 <= C_1_pc) && C_1_pc <= 0) && 0 <= unknown-#StackHeapBarrier-unknown) && data_1 == 0) && timer == 0) && C_1_i == 1) && #NULL == 0) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((C_1_st == \old(C_1_st) && (P_1_st == 0 || \old(P_1_st) == P_1_st)) && __retres1 == 0) || !(1 <= i)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_pc <= 0)) || !(C_1_pc == 1)) || !(max_loop <= 2)) || !(0 <= i)) || !(i <= 1)) || !(P_1_i == 1)) || !(e <= 0)) || !(num == 0)) && ((((((((((((((C_1_st == \old(C_1_st) && (P_1_st == 0 || \old(P_1_st) == P_1_st)) && __retres1 == 0) || !(1 <= i)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(C_1_pc == 1)) || !(max_loop <= 2)) || !(0 <= i)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(1 <= num)) || !(num < 2147483648))) && (((((C_1_st == \old(C_1_st) && (P_1_st == 0 || \old(P_1_st) == P_1_st)) && __retres1 == 0) || !(max_loop <= 2)) || !(2 <= i)) || (((((((((!(C_1_i == 1) || !(1 <= C_1_pc)) || !(C_1_pc == 1)) || !(i < 2147483646)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(num == 0)) || !(1 <= P_1_pc)) && (((((((((!(C_1_i == 1) || !(1 <= C_1_pc)) || !(C_1_pc == 1)) || !(i < 2147483646)) || !(0 <= i)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(1 <= num)) || !(num < 2147483648))))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(1 <= i)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(2 == C_1_pc)) || !(e == 0)) || !(0 <= data_0)) || !(0 <= num)) || !(0 <= i)) || !(#NULL == 0)) || (((tmp == \result && \old(P_1_st) == P_1_st) && __retres1 == 0) && __retres1 == \result)) || !(C_1_ev == 0)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(num < 2147483648)) || !(1 <= P_1_pc)) || !(0 <= timer))) && (((((((((((((!(C_1_i == 1) || ((((0 <= i && C_1_st == \old(C_1_st)) && 1 <= P_1_pc) && (P_1_st == 0 || \old(P_1_st) == P_1_st)) && 1 <= C_1_pc)) || !(1 <= C_1_pc)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || !(2 <= i)) || !(0 <= num)) || !(0 <= i)) || !(i <= 2147483646)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(num < 2147483648)) || !(1 <= P_1_pc))) && ((((((((((((((((((((((((((!(\old(P_1_st) == 0) || !(#NULL == 0)) || !(data_1 == 0)) || ((((((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) && tmp <= 0) && __retres1 == 0) && __retres1 == 0) && __retres1 == \result) && 0 <= tmp)) || !(C_1_i == 1)) || !(0 <= P_1_pc)) || !(0 <= C_1_pr)) || !(P_1_pc <= 0)) || !(C_1_pc <= 0)) || !(0 <= P_1_ev)) || !(timer == 0)) || !(0 <= #NULL)) || !(P_1_i == 1)) || !(e <= 0)) || !(max_loop == 2)) || !(C_1_pr <= 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(0 <= C_1_pc)) || !(0 <= C_1_ev)) || !(P_1_ev <= 0)) || !(num == 0)) || !(0 <= e)) || !(data_0 == 0)) || !(#NULL <= 0)) || !(C_1_ev <= 0)) || !(\old(C_1_st) == 0)) || !(i == 0))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(2 == C_1_pc)) || !(e == 0)) || !(0 <= data_0)) || !(2 <= i)) || !(0 <= num)) || !(i < 2147483646)) || !(0 <= i)) || !(#NULL == 0)) || (((tmp == \result && \old(P_1_st) == P_1_st) && __retres1 == 0) && __retres1 == \result)) || !(C_1_ev == 0)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(num < 2147483648)) || !(1 <= P_1_pc)) || !(0 <= timer))) && (((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(1 <= i)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(C_1_pc == 1)) || !(e == 0)) || !(0 <= data_0)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || ((((\old(P_1_st) == P_1_st && tmp <= 0) && __retres1 == 0) && __retres1 == \result) && 0 <= tmp)) || !(1 <= num)) || !(num < 2147483648)) || !(0 <= timer))) && (((((((((((((((!(C_1_i == 1) || !(1 <= C_1_pc)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || !(2 <= i)) || !(0 <= num)) || !(0 <= i)) || !(i <= 2147483646)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || !(num < 2147483648)) || !(C_1_ev <= 0)) || __retres1 == 0) || !(1 <= P_1_pc))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(1 <= i)) || !(C_1_i == 1)) || !(0 <= P_1_pc)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(P_1_pc <= 0)) || !(C_1_pc == 1)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(i <= 1)) || !(P_1_i == 1)) || !(e <= 0)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || ((((\old(P_1_st) == P_1_st && tmp <= 0) && __retres1 == 0) && __retres1 == \result) && 0 <= tmp)) || !(num == 0)) || !(0 <= e)) || !(data_0 == 0)) || !(0 <= timer))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(C_1_pc == 1)) || !(e == 0)) || !(0 <= data_0)) || !(i < 2147483646)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(1 <= num)) || !(num < 2147483648)) || !(0 <= timer)) && ((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(C_1_pc == 1)) || !(e == 0)) || !(0 <= data_0)) || !(i < 2147483646)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(num == 0)) || !(1 <= P_1_pc)) || !(0 <= timer))) || !(2 <= i)) || ((((\old(P_1_st) == P_1_st && tmp <= 0) && __retres1 == 0) && __retres1 == \result) && 0 <= tmp))) && (((((((((((((!(1 <= i) || !(C_1_i == 1)) || ((((0 <= i && C_1_st == \old(C_1_st)) && 1 <= P_1_pc) && (P_1_st == 0 || \old(P_1_st) == P_1_st)) && 1 <= C_1_pc)) || !(1 <= C_1_pc)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || !(0 <= num)) || !(0 <= i)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(num < 2147483648)) || !(1 <= P_1_pc))) && (((((((((((((((!(1 <= i) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || !(0 <= num)) || !(0 <= i)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(P_1_ev <= 0)) || !(num < 2147483648)) || !(C_1_ev <= 0)) || __retres1 == 0) || !(1 <= P_1_pc))) && (((((((((((C_1_st == \old(C_1_st) && (P_1_st == 0 || \old(P_1_st) == P_1_st)) || !(C_1_i == 1)) || !(2 == C_1_pc)) || !(P_1_pc <= 0)) || !(max_loop <= 2)) || !(num <= 0)) || !(2 <= i)) || !(0 <= num)) || !(i < 2147483646)) || !(P_1_i == 1)) || !(e <= 0)) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((((((((((((P_1_pc == 1 && e <= 0) && 0 <= i) && max_loop <= 2) && P_1_i == 1) && !(tmp___2 == 0)) && num < 2147483647) && 0 <= num) && 2 <= i) && (\result == 1 || !(C_1_st == 0))) && i < 2147483646) && C_1_i == 1) || ((((((((((((((num <= 0 && i <= 0) && P_1_pc == 1) && e <= 0) && 0 <= i) && !(2 == C_1_pc)) && max_loop <= 2) && P_1_ev <= 0) && 2 == P_1_st) && P_1_i == 1) && C_1_ev <= 0) && !(tmp___2 == 0)) && 0 <= num) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1)) || ((((((((((1 <= i && num <= 0) && e <= 0) && max_loop <= 2) && i <= 1) && P_1_i == 1) && P_1_pc <= 0) && !(tmp___2 == 0)) && 0 <= num) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1)) || (((((((((((1 <= i && P_1_pc == 1) && e <= 0) && 0 <= i) && max_loop <= 2) && i <= 1) && P_1_i == 1) && !(tmp___2 == 0)) && num < 2147483647) && 0 <= num) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1) - InvariantResult [Line: 464]: Loop Invariant Derived loop invariant: (((((((((((((1 <= i && C_1_pc == 1) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && 1 <= num) && C_1_i == 1) || ((((((((1 <= i && C_1_pc == 1) && e <= 0) && max_loop <= 2) && i <= 1) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && C_1_i == 1)) || (((((((((1 <= i && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && 0 <= num) && C_1_i == 1)) || (((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && P_1_i == 1) && num == 0) && i < 2147483646) && C_1_i == 1) || (((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && num < 2147483648) && P_1_i == 1) && 1 <= num) && i < 2147483646) && C_1_i == 1)) && max_loop <= 2) && 2 <= i)) || (((((((((num <= 0 && 2 == C_1_pc) && e <= 0) && max_loop <= 2) && P_1_i == 1) && P_1_pc <= 0) && 0 <= num) && 2 <= i) && i < 2147483646) && C_1_i == 1)) || (((((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && P_1_i == 1) && i <= 2147483646) && 0 <= num) && 2 <= i) && C_1_i == 1) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(1 <= i) || !(C_1_i == 1)) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(1 <= C_1_pc)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || !(0 <= num)) || !(0 <= i)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(num < 2147483648)) || !(1 <= P_1_pc)) && ((((((((((!(C_1_i == 1) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(2 == C_1_pc)) || !(P_1_pc <= 0)) || !(max_loop <= 2)) || !(num <= 0)) || !(2 <= i)) || !(0 <= num)) || !(i < 2147483646)) || !(P_1_i == 1)) || !(e <= 0))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(1 <= i)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(2 == C_1_pc)) || !(e == 0)) || !(0 <= data_0)) || !(0 <= num)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || __retres1 == 0) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(num < 2147483648)) || !(1 <= P_1_pc)) || !(0 <= timer))) && (((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(1 <= i)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(C_1_pc == 1)) || !(e == 0)) || !(0 <= data_0)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || __retres1 == 0) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(1 <= num)) || !(num < 2147483648)) || !(0 <= timer))) && (((((((((((((!(C_1_i == 1) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(1 <= C_1_pc)) || !(2 == C_1_pc)) || !(max_loop <= 2)) || !(2 <= i)) || !(0 <= num)) || !(0 <= i)) || !(i <= 2147483646)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(num < 2147483648)) || !(1 <= P_1_pc))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(2 == C_1_pc)) || !(e == 0)) || !(0 <= data_0)) || !(2 <= i)) || !(0 <= num)) || !(i < 2147483646)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || __retres1 == 0) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(num < 2147483648)) || !(1 <= P_1_pc)) || !(0 <= timer))) && ((((((((((((((((((((((((((!(\old(P_1_st) == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(C_1_i == 1)) || !(0 <= P_1_pc)) || !(0 <= C_1_pr)) || ((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) && __retres1 == 0)) || !(P_1_pc <= 0)) || !(C_1_pc <= 0)) || !(0 <= P_1_ev)) || !(timer == 0)) || !(0 <= #NULL)) || !(P_1_i == 1)) || !(e <= 0)) || !(max_loop == 2)) || !(C_1_pr <= 0)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(0 <= C_1_pc)) || !(0 <= C_1_ev)) || !(P_1_ev <= 0)) || !(num == 0)) || !(0 <= e)) || !(data_0 == 0)) || !(#NULL <= 0)) || !(C_1_ev <= 0)) || !(\old(C_1_st) == 0)) || !(i == 0))) && ((((((((((((!(1 <= i) || !(C_1_i == 1)) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(1 <= C_1_pc)) || !(C_1_pc == 1)) || !(max_loop <= 2)) || !(0 <= i)) || !(i <= 1)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(1 <= num)) || !(num < 2147483648))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(1 <= i)) || !(C_1_i == 1)) || !(0 <= P_1_pc)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(P_1_pc <= 0)) || !(C_1_pc == 1)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(i <= 1)) || !(P_1_i == 1)) || !(e <= 0)) || !(max_loop == 2)) || __retres1 == 0) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(num == 0)) || !(0 <= e)) || !(data_0 == 0)) || !(0 <= timer))) && ((((((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(C_1_pc == 1)) || !(e == 0)) || !(0 <= data_0)) || !(i < 2147483646)) || !(0 <= i)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(1 <= num)) || !(num < 2147483648)) || !(0 <= timer)) && ((((((((((((((((((!(C_1_pr == 0) || !(#NULL == 0)) || !(data_1 == 0)) || !(C_1_i == 1)) || !(1 <= C_1_pc)) || !(P_1_ev == 0)) || !(C_1_pc == 1)) || !(e == 0)) || !(0 <= data_0)) || !(i < 2147483646)) || !(#NULL == 0)) || !(C_1_ev == 0)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(max_loop == 2)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(num == 0)) || !(1 <= P_1_pc)) || !(0 <= timer))) || !(2 <= i)) || __retres1 == 0)) && (((((((((((!(1 <= i) || !(C_1_i == 1)) || (C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st)) || !(1 <= C_1_pc)) || !(P_1_pc <= 0)) || !(C_1_pc == 1)) || !(max_loop <= 2)) || !(0 <= i)) || !(i <= 1)) || !(P_1_i == 1)) || !(e <= 0)) || !(num == 0))) && ((((C_1_st == \old(C_1_st) && \old(P_1_st) == P_1_st) || !(max_loop <= 2)) || !(2 <= i)) || (((((((((!(C_1_i == 1) || !(1 <= C_1_pc)) || !(C_1_pc == 1)) || !(i < 2147483646)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(num == 0)) || !(1 <= P_1_pc)) && (((((((((!(C_1_i == 1) || !(1 <= C_1_pc)) || !(C_1_pc == 1)) || !(i < 2147483646)) || !(0 <= i)) || !(P_1_i == 1)) || !(P_1_pc == 1)) || !(e <= 0)) || !(1 <= num)) || !(num < 2147483648)))) - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((unknown-#length-unknown[3] == 12 && 13 == unknown-#length-unknown[2]) && C_1_st == 0) && i == 0) && e == 0) && kernel_st == 0) && data_0 == 0) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && P_1_st == 0) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && max_loop == 2) && P_1_i == 1) && \valid[1] == 1) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && C_1_ev == 0) && data_1 == 0) && timer == 0) && C_1_i == 1) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0 - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: ((((((((((((((1 <= i && C_1_pc == 1) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && 1 <= num) && C_1_i == 1) || ((((((((1 <= i && C_1_pc == 1) && e <= 0) && max_loop <= 2) && i <= 1) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && C_1_i == 1)) || (((((((((1 <= i && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && 0 <= num) && C_1_i == 1)) || (((((((((((((((((((((((((((((unknown-#length-unknown[3] == 12 && 13 == unknown-#length-unknown[2]) && C_1_st == 0) && i == 0) && e == 0) && kernel_st == 0) && data_0 == 0) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && P_1_st == 0) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && max_loop == 2) && P_1_i == 1) && \valid[1] == 1) && P_1_pc == 0) && C_1_pc == 0) && num == 0) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && C_1_ev == 0) && data_1 == 0) && timer == 0) && C_1_i == 1) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && P_1_i == 1) && num == 0) && i < 2147483646) && C_1_i == 1) || (((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && num < 2147483648) && P_1_i == 1) && 1 <= num) && i < 2147483646) && C_1_i == 1)) && max_loop <= 2) && 2 <= i)) || (((((((((num <= 0 && 2 == C_1_pc) && e <= 0) && max_loop <= 2) && P_1_i == 1) && P_1_pc <= 0) && 0 <= num) && 2 <= i) && i < 2147483646) && C_1_i == 1)) || (((((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && P_1_i == 1) && i <= 2147483646) && 0 <= num) && 2 <= i) && C_1_i == 1) - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: ((((((((((((((((1 <= i && C_1_pc == 1) && e <= 0) && max_loop <= 2) && i <= 1) && 2 == P_1_st) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && !(tmp___2 == 0)) && C_1_i == 1) || (((((((((((((((((((((((((((((((((0 <= tmp + 2147483648 && C_1_st == 0) && P_1_pc == 1) && tmp <= 2147483647) && tmp___2 <= 1) && i == 0) && e == 0) && kernel_st == 1) && c == data_0) && !(tmp == 0)) && \old(i___0) == i___0) && P_1_ev == 0) && count == 0) && 65 <= c) && C_1_pr == 0) && max_loop == 2) && 2 == P_1_st) && c <= 65) && P_1_i == 1) && \old(c) == 65) && 0 <= \old(i___0)) && C_1_pc == 0) && 0 <= data_1) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && num <= 1) && \old(i___0) <= 0) && C_1_ev == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 1 <= num) && timer == 0) && C_1_i == 1) && #NULL == 0)) || (((((((((((1 <= i && C_1_pc == 1) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && 2 == P_1_st) && P_1_i == 1) && !(tmp___2 == 0)) && 1 <= num) && C_1_i == 1)) || (((((((((((num <= 0 && 2 == C_1_pc) && e <= 0) && max_loop <= 2) && 2 == P_1_st) && P_1_i == 1) && P_1_pc <= 0) && !(tmp___2 == 0)) && 0 <= num) && 2 <= i) && i < 2147483646) && C_1_i == 1)) || (((((((((((1 <= i && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && 2 == P_1_st) && P_1_i == 1) && !(tmp___2 == 0)) && 0 <= num) && C_1_i == 1)) || ((max_loop <= 2 && (((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && 2 == P_1_st) && P_1_i == 1) && num == 0) && !(tmp___2 == 0)) && i < 2147483646) && C_1_i == 1) || (((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && num < 2147483648) && 2 == P_1_st) && P_1_i == 1) && !(tmp___2 == 0)) && 1 <= num) && i < 2147483646) && C_1_i == 1))) && 2 <= i)) || ((((((((((((((((((((((((((((C_1_pc == 1 && C_1_st == 0) && tmp___2 <= 1) && e <= 0) && 0 <= e) && data_0 == 0) && 0 <= i) && kernel_st == 1) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && i <= 1) && max_loop == 2) && 2 == P_1_st) && P_1_i == 1) && C_1_ev <= 0) && 0 <= data_1) && num == 0) && P_1_pc <= 0) && 0 <= C_1_ev) && 0 <= P_1_pc) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && 0 <= timer) && data_1 <= 0) && 0 <= unknown-#StackHeapBarrier-unknown) && C_1_i == 1) && #NULL == 0)) || (((((((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && 2 == P_1_st) && P_1_i == 1) && i <= 2147483646) && !(tmp___2 == 0)) && 0 <= num) && 2 <= i) && C_1_i == 1) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((0 <= tmp + 2147483648 && \old(c) == c) && C_1_st == 0) && tmp <= 2147483647) && tmp___2 <= 1) && i == 0) && e == 0) && kernel_st == 1) && i___0 == 0) && c == data_0) && !(tmp == 0)) && \old(i___0) == i___0) && P_1_ev == 0) && count == 0) && P_1_st == 1) && C_1_pr == 0) && max_loop == 2) && P_1_i == 1) && \old(c) == 65) && num <= i___0) && C_1_pc == 0) && 0 <= P_1_pc) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && 0 <= num) && C_1_ev == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && data_1 == 0) && timer == 0) && C_1_i == 1) && #NULL == 0) || ((1 <= i && max_loop <= 2) && ((((((((((num <= 0 && 2 == C_1_pc) && e <= 0) && i <= 1) && P_1_i == 1) && num <= i___0) && !(tmp___2 == 0)) && 0 <= num) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1) || ((((((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && i <= 1) && P_1_i == 1) && num <= i___0) && !(tmp___2 == 0)) && num <= 1) && 0 <= num) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1)))) || ((1 <= i && max_loop <= 2) && (((((((((C_1_pc == 1 && e <= 0) && i <= 1) && P_1_i == 1) && num <= i___0) && num == 0) && !(tmp___2 == 0)) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1) || ((((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && i <= 1) && P_1_i == 1) && num <= i___0) && !(tmp___2 == 0)) && num <= 1) && 1 <= num) && (\result == 1 || !(P_1_st == 0))) && C_1_i == 1))) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: ((((((((((((((num <= 0 && 2 == C_1_st) && 2 == C_1_pc) && e <= 0) && max_loop <= 2) && P_1_i == 1) && P_1_pc <= 0) && !(tmp___2 == 0)) && 0 <= num) && 2 <= i) && i < 2147483646) && C_1_i == 1) || ((((((((((((((((((((((((((((((1 <= i && 2 == C_1_st) && C_1_pc == 1) && tmp___2 <= 1) && e <= 0) && 0 <= e) && data_0 == 0) && kernel_st == 1) && P_1_st == 0) && P_1_ev == 0) && tmp == 0) && count == 0) && timer == 1) && C_1_pr == 0) && i <= 1) && !(tmp___1 == 0)) && max_loop == 2) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && 0 <= P_1_pc) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && C_1_ev == 0) && tmp___1 <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && data_1 == 0) && 0 <= tmp___1 + 2147483648) && C_1_i == 1) && #NULL == 0)) || (((((((((((2 == C_1_st && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && P_1_i == 1) && i <= 2147483646) && !(tmp___2 == 0)) && 0 <= num) && 2 <= i) && C_1_i == 1)) || ((((((((((2 == C_1_st && C_1_pc == 1) && P_1_pc == 1) && e <= 0) && max_loop <= 2) && P_1_i == 1) && num == 0) && !(tmp___2 == 0)) && 2 <= i) && i < 2147483646) && C_1_i == 1)) || (((((((((((1 <= i && 2 == C_1_st) && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && !(tmp___2 == 0)) && 0 <= num) && C_1_i == 1) - InvariantResult [Line: 468]: Loop Invariant Derived loop invariant: (((((((((((((1 <= i && C_1_pc == 1) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && 1 <= num) && C_1_i == 1) || ((((((((1 <= i && C_1_pc == 1) && e <= 0) && max_loop <= 2) && i <= 1) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && C_1_i == 1)) || (((((((((1 <= i && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && 0 <= num) && C_1_i == 1)) || (((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && P_1_i == 1) && num == 0) && i < 2147483646) && C_1_i == 1) || (((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && num < 2147483648) && P_1_i == 1) && 1 <= num) && i < 2147483646) && C_1_i == 1)) && max_loop <= 2) && 2 <= i)) || (((((((((num <= 0 && 2 == C_1_pc) && e <= 0) && max_loop <= 2) && P_1_i == 1) && P_1_pc <= 0) && 0 <= num) && 2 <= i) && i < 2147483646) && C_1_i == 1)) || (((((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && P_1_i == 1) && i <= 2147483646) && 0 <= num) && 2 <= i) && C_1_i == 1) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((num <= 0 && tmp___2 <= 1) && i == 0) && e == 0) && data_0 == 0) && kernel_st == 1) && P_1_st == 0) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && !(tmp___1 == 0)) && max_loop == 2) && P_1_i == 1) && C_1_pc == 0) && P_1_pc <= 0) && 0 <= P_1_pc) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && 0 <= num) && C_1_ev == 0) && tmp <= 0) && tmp___1 <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= tmp) && data_1 == 0) && 0 <= tmp___1 + 2147483648) && timer == 0) && C_1_st == 1) && C_1_i == 1) && #NULL == 0) || (((((((((((num <= 0 && 2 == C_1_pc) && e <= 0) && max_loop <= 2) && P_1_i == 1) && P_1_pc <= 0) && !(tmp___2 == 0)) && 0 <= num) && 2 <= i) && (\result == 1 || !(C_1_st == 0))) && i < 2147483646) && C_1_i == 1)) || (((((((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && P_1_i == 1) && i <= 2147483646) && !(tmp___2 == 0)) && 0 <= num) && 2 <= i) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1)) || (((((((((((1 <= i && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && !(tmp___2 == 0)) && 0 <= num) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1)) || ((((((((((((((((((((((((0 <= data_0 && P_1_pc == 1) && tmp___2 <= 1) && i == 0) && e == 0) && kernel_st == 1) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && max_loop == 2) && 2 == P_1_st) && P_1_i == 1) && C_1_pc == 0) && 0 <= data_1) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && num <= 1) && C_1_ev == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 1 <= num) && (\result == 1 || !(C_1_st == 0))) && timer == 0) && C_1_i == 1) && #NULL == 0) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((C_1_pc == 1 && C_1_st == 0) && tmp___2 <= 1) && e <= 0) && 0 <= e) && data_0 == 0) && 0 <= i) && kernel_st == 1) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && i <= 1) && max_loop == 2) && 2 == P_1_st) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && 0 <= P_1_pc) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && 0 <= timer) && C_1_ev == 0) && tmp___1 <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && data_1 == 0) && 0 <= tmp___1 + 2147483648) && C_1_i == 1) && #NULL == 0) || (((((((((1 <= i && C_1_pc == 1) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && 1 <= num) && C_1_i == 1)) || ((((((((1 <= i && C_1_pc == 1) && e <= 0) && max_loop <= 2) && i <= 1) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && C_1_i == 1)) || (((((((((1 <= i && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && 0 <= num) && C_1_i == 1)) || ((((((((((((((((((((((((0 <= data_0 && C_1_st == 0) && P_1_pc == 1) && tmp___2 <= 1) && i == 0) && e == 0) && kernel_st == 1) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && max_loop == 2) && 2 == P_1_st) && P_1_i == 1) && C_1_pc == 0) && 0 <= data_1) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && num <= 1) && C_1_ev == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 1 <= num) && timer == 0) && C_1_i == 1) && #NULL == 0)) || (((((((((((((((((((((((i <= 0 && C_1_st == 0) && e <= 0) && 0 <= e) && data_0 == 0) && 0 <= i) && kernel_st == 1) && P_1_st == 0) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && max_loop == 2) && P_1_i == 1) && C_1_pc == 0) && num == 0) && P_1_pc <= 0) && 0 <= P_1_pc) && #NULL == 0) && C_1_ev == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && data_1 == 0) && timer == 0) && C_1_i == 1) && #NULL == 0)) || (((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && P_1_i == 1) && num == 0) && i < 2147483646) && C_1_i == 1) || (((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && num < 2147483648) && P_1_i == 1) && 1 <= num) && i < 2147483646) && C_1_i == 1)) && max_loop <= 2) && 2 <= i)) || (((((((((num <= 0 && 2 == C_1_pc) && e <= 0) && max_loop <= 2) && P_1_i == 1) && P_1_pc <= 0) && 0 <= num) && 2 <= i) && i < 2147483646) && C_1_i == 1)) || (((((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && P_1_i == 1) && i <= 2147483646) && 0 <= num) && 2 <= i) && C_1_i == 1) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: (((((((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && P_1_i == 1) && 0 <= num) && 2 <= i) && i < 2147483646) && C_1_i == 1) || (((((((((1 <= i && C_1_pc == 1) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && 1 <= num) && C_1_i == 1)) || ((((((((1 <= i && C_1_pc == 1) && e <= 0) && max_loop <= 2) && i <= 1) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && C_1_i == 1)) || (((((((((1 <= i && 2 == C_1_pc) && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && i <= 1) && P_1_i == 1) && 0 <= num) && C_1_i == 1)) || (((((((((num <= 0 && 2 == C_1_pc) && e <= 0) && max_loop <= 2) && P_1_i == 1) && P_1_pc <= 0) && 0 <= num) && 2 <= i) && i < 2147483646) && C_1_i == 1)) || (((((((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && num < 2147483648) && max_loop <= 2) && P_1_i == 1) && i <= 2147483646) && 0 <= num) && 2 <= i) && C_1_i == 1) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((i <= 0 && 0 <= data_0) && P_1_pc == 1) && tmp___2 <= 1) && e == 0) && 0 <= i) && kernel_st == 1) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && max_loop == 2) && 2 == P_1_st) && P_1_i == 1) && C_1_pc == 0) && 0 <= data_1) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && num <= 1) && C_1_ev == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 1 <= num) && (\result == 1 || !(C_1_st == 0))) && timer == 0) && C_1_i == 1) && #NULL == 0) || (((((((((((((((((((((((((((((C_1_pc == 1 && tmp___2 <= 1) && e == 0) && data_0 == 0) && 0 <= i) && kernel_st == 1) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && !(tmp___1 == 0)) && max_loop == 2) && P_1_i == 1) && C_1_ev <= 0) && 0 <= data_1) && num == 0) && P_1_pc <= 0) && 0 <= C_1_ev) && 0 <= P_1_pc) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && 0 <= timer) && data_1 <= 0) && tmp___1 <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= tmp___1 + 2147483648) && C_1_st == 1) && C_1_i == 1) && !(P_1_st == 0)) && #NULL == 0)) || ((((((((1 <= i && num <= 0) && max_loop <= 2) && i <= 1) && P_1_i == 1) && ((((C_1_pc == 1 && e <= 0) && num == 0) && P_1_pc <= 0) || (((2 == C_1_pc && e <= 0) && P_1_pc <= 0) && 0 <= num))) && !(tmp___2 == 0)) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1)) || ((((((((((((((((((((((((((((0 <= tmp + 2147483648 && C_1_pc == 1) && tmp <= 2147483647) && tmp___2 <= 1) && e == 0) && data_0 == 0) && 0 <= i) && kernel_st == 1) && P_1_ev == 0) && count == 0) && C_1_pr == 0) && !(tmp___1 == 0)) && max_loop == 2) && P_1_i == 1) && num == 0) && P_1_pc <= 0) && 0 <= P_1_pc) && #NULL == 0) && !(tmp___2 == 0)) && 0 <= tmp___2) && 0 <= timer) && C_1_ev == 0) && tmp___1 <= 2147483647) && 0 <= unknown-#StackHeapBarrier-unknown) && data_1 == 0) && 0 <= tmp___1 + 2147483648) && C_1_st == 1) && C_1_i == 1) && #NULL == 0)) || ((max_loop <= 2 && ((((((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && 0 <= i) && num <= 1) && 0 <= num) || (((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && 0 <= i) && num <= 1) && 0 <= num)) && P_1_i == 1) && !(tmp___2 == 0)) && (\result == 1 || !(C_1_st == 0))) && i < 2147483646) && C_1_i == 1) || ((((((num < 2147483648 && P_1_i == 1) && !(tmp___2 == 0)) && (((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && 0 <= i) && 0 <= num) || ((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && 0 <= i) && 1 <= num))) && (\result == 1 || !(C_1_st == 0))) && i < 2147483646) && C_1_i == 1))) && 2 <= i)) || ((1 <= i && (((((((num < 2147483648 && i <= 1) && P_1_i == 1) && !(tmp___2 == 0)) && (((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && 0 <= i) && 0 <= num) || ((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && 0 <= i) && 1 <= num))) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1) || (((((((((((C_1_pc == 1 && P_1_pc == 1) && e <= 0) && 0 <= i) && num <= 1) && 0 <= num) || (((((2 == C_1_pc && P_1_pc == 1) && e <= 0) && 0 <= i) && num <= 1) && 0 <= num)) && i <= 1) && P_1_i == 1) && !(tmp___2 == 0)) && (\result == 1 || !(C_1_st == 0))) && C_1_i == 1))) && max_loop <= 2) - InvariantResult [Line: 250]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-26 01:12:42,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d5f4f84-a55f-4ded-bd24-9e79194677bc/bin/utaipan-ByfvJB40ur/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