./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654de0a8-3841-4d27-b212-acb3a68a3802/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654de0a8-3841-4d27-b212-acb3a68a3802/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_654de0a8-3841-4d27-b212-acb3a68a3802/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654de0a8-3841-4d27-b212-acb3a68a3802/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654de0a8-3841-4d27-b212-acb3a68a3802/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_654de0a8-3841-4d27-b212-acb3a68a3802/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 78a4cc43ce1234c075e2c73cca2f6f44edddfccbee7278c746f2db07d17136bf --- 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-25 23:48:32,714 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:48:32,716 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:48:32,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:48:32,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:48:32,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:48:32,776 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:48:32,780 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:48:32,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:48:32,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:48:32,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:48:32,784 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:48:32,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:48:32,785 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:48:32,786 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:48:32,787 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:48:32,788 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:48:32,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:48:32,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:48:32,800 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:48:32,803 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:48:32,811 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:48:32,813 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:48:32,814 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:48:32,817 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:48:32,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:48:32,818 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:48:32,819 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:48:32,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:48:32,827 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:48:32,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:48:32,829 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:48:32,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:48:32,832 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:48:32,833 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:48:32,833 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:48:32,834 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:48:32,835 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:48:32,836 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:48:32,836 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:48:32,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:48:32,838 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654de0a8-3841-4d27-b212-acb3a68a3802/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-25 23:48:32,880 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:48:32,881 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:48:32,881 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:48:32,881 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:48:32,882 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:48:32,882 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:48:32,883 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:48:32,883 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:48:32,883 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:48:32,883 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:48:32,884 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:48:32,884 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:48:32,885 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:48:32,885 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:48:32,885 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:48:32,885 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:48:32,885 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:48:32,885 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:48:32,887 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:48:32,887 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:48:32,887 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:48:32,887 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:48:32,887 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:48:32,888 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:48:32,888 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:48:32,888 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:48:32,888 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:48:32,889 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 23:48:32,889 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:48:32,889 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:48:32,889 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:48:32,890 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:48:32,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:48:32,890 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:48:32,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:48:32,890 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:48:32,891 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:48:32,891 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:48:32,891 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:48:32,891 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:48:32,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:48:32,891 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:48:32,892 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:48:32,892 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_654de0a8-3841-4d27-b212-acb3a68a3802/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_654de0a8-3841-4d27-b212-acb3a68a3802/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 -> 78a4cc43ce1234c075e2c73cca2f6f44edddfccbee7278c746f2db07d17136bf [2022-11-25 23:48:33,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:48:33,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:48:33,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:48:33,290 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:48:33,290 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:48:33,291 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654de0a8-3841-4d27-b212-acb3a68a3802/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c [2022-11-25 23:48:36,490 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:48:36,729 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:48:36,729 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654de0a8-3841-4d27-b212-acb3a68a3802/sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c [2022-11-25 23:48:36,739 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654de0a8-3841-4d27-b212-acb3a68a3802/bin/utaipan-ByfvJB40ur/data/faa98e1c5/58dad38692634adbaee1b2e1bc2a9d41/FLAGb33857b77 [2022-11-25 23:48:36,755 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654de0a8-3841-4d27-b212-acb3a68a3802/bin/utaipan-ByfvJB40ur/data/faa98e1c5/58dad38692634adbaee1b2e1bc2a9d41 [2022-11-25 23:48:36,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:48:36,759 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:48:36,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:48:36,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:48:36,765 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:48:36,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:48:36" (1/1) ... [2022-11-25 23:48:36,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@442fe199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:48:36, skipping insertion in model container [2022-11-25 23:48:36,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:48:36" (1/1) ... [2022-11-25 23:48:36,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:48:36,841 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:48:37,119 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_654de0a8-3841-4d27-b212-acb3a68a3802/sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c[6448,6461] [2022-11-25 23:48:37,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:48:37,199 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:48:37,251 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_654de0a8-3841-4d27-b212-acb3a68a3802/sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c[6448,6461] [2022-11-25 23:48:37,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:48:37,310 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:48:37,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:48:37 WrapperNode [2022-11-25 23:48:37,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:48:37,312 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:48:37,312 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:48:37,312 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:48:37,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:48:37" (1/1) ... [2022-11-25 23:48:37,337 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:48:37" (1/1) ... [2022-11-25 23:48:37,388 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1045 [2022-11-25 23:48:37,388 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:48:37,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:48:37,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:48:37,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:48:37,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:48:37" (1/1) ... [2022-11-25 23:48:37,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:48:37" (1/1) ... [2022-11-25 23:48:37,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:48:37" (1/1) ... [2022-11-25 23:48:37,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:48:37" (1/1) ... [2022-11-25 23:48:37,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:48:37" (1/1) ... [2022-11-25 23:48:37,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:48:37" (1/1) ... [2022-11-25 23:48:37,421 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:48:37" (1/1) ... [2022-11-25 23:48:37,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:48:37" (1/1) ... [2022-11-25 23:48:37,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:48:37,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:48:37,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:48:37,430 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:48:37,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:48:37" (1/1) ... [2022-11-25 23:48:37,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:48:37,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654de0a8-3841-4d27-b212-acb3a68a3802/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:48:37,481 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654de0a8-3841-4d27-b212-acb3a68a3802/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:48:37,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654de0a8-3841-4d27-b212-acb3a68a3802/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:48:37,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:48:37,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:48:37,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:48:37,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:48:37,606 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:48:37,608 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:48:39,132 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:48:39,173 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:48:39,173 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 23:48:39,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:48:39 BoogieIcfgContainer [2022-11-25 23:48:39,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:48:39,189 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:48:39,189 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:48:39,194 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:48:39,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:48:36" (1/3) ... [2022-11-25 23:48:39,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c9bbe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:48:39, skipping insertion in model container [2022-11-25 23:48:39,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:48:37" (2/3) ... [2022-11-25 23:48:39,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c9bbe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:48:39, skipping insertion in model container [2022-11-25 23:48:39,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:48:39" (3/3) ... [2022-11-25 23:48:39,199 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+nlh-reducer.c [2022-11-25 23:48:39,226 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:48:39,226 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 408 error locations. [2022-11-25 23:48:39,329 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:48:39,337 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;@6bc20ecb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:48:39,337 INFO L358 AbstractCegarLoop]: Starting to check reachability of 408 error locations. [2022-11-25 23:48:39,345 INFO L276 IsEmpty]: Start isEmpty. Operand has 955 states, 546 states have (on average 1.9963369963369964) internal successors, (1090), 954 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:39,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 23:48:39,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:39,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 23:48:39,354 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:48:39,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:39,361 INFO L85 PathProgramCache]: Analyzing trace with hash 47849408, now seen corresponding path program 1 times [2022-11-25 23:48:39,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:39,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548654181] [2022-11-25 23:48:39,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:39,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:39,617 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-25 23:48:39,618 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:39,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548654181] [2022-11-25 23:48:39,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548654181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:39,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:39,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:48:39,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053497585] [2022-11-25 23:48:39,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:39,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:48:39,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:39,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:48:39,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:48:39,685 INFO L87 Difference]: Start difference. First operand has 955 states, 546 states have (on average 1.9963369963369964) internal successors, (1090), 954 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:41,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:41,085 INFO L93 Difference]: Finished difference Result 1895 states and 2163 transitions. [2022-11-25 23:48:41,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:48:41,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-25 23:48:41,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:41,108 INFO L225 Difference]: With dead ends: 1895 [2022-11-25 23:48:41,108 INFO L226 Difference]: Without dead ends: 943 [2022-11-25 23:48:41,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:48:41,119 INFO L413 NwaCegarLoop]: 1071 mSDtfsCounter, 1 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:41,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1339 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-25 23:48:41,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2022-11-25 23:48:41,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 943. [2022-11-25 23:48:41,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 541 states have (on average 1.866913123844732) internal successors, (1010), 942 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:41,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1010 transitions. [2022-11-25 23:48:41,207 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1010 transitions. Word has length 4 [2022-11-25 23:48:41,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:41,208 INFO L495 AbstractCegarLoop]: Abstraction has 943 states and 1010 transitions. [2022-11-25 23:48:41,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:41,208 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1010 transitions. [2022-11-25 23:48:41,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 23:48:41,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:41,209 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:41,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:48:41,210 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:48:41,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:41,211 INFO L85 PathProgramCache]: Analyzing trace with hash -984085978, now seen corresponding path program 1 times [2022-11-25 23:48:41,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:41,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319242890] [2022-11-25 23:48:41,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:41,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:41,277 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-25 23:48:41,278 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:41,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319242890] [2022-11-25 23:48:41,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319242890] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:41,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:41,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:48:41,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699310450] [2022-11-25 23:48:41,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:41,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:48:41,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:41,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:48:41,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:48:41,283 INFO L87 Difference]: Start difference. First operand 943 states and 1010 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:42,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:42,518 INFO L93 Difference]: Finished difference Result 943 states and 1010 transitions. [2022-11-25 23:48:42,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:48:42,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-25 23:48:42,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:42,522 INFO L225 Difference]: With dead ends: 943 [2022-11-25 23:48:42,522 INFO L226 Difference]: Without dead ends: 809 [2022-11-25 23:48:42,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-25 23:48:42,524 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 735 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:42,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 536 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-25 23:48:42,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-11-25 23:48:42,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 809. [2022-11-25 23:48:42,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 541 states have (on average 1.6192236598890943) internal successors, (876), 808 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:42,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 876 transitions. [2022-11-25 23:48:42,552 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 876 transitions. Word has length 8 [2022-11-25 23:48:42,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:42,552 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 876 transitions. [2022-11-25 23:48:42,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:42,553 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 876 transitions. [2022-11-25 23:48:42,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 23:48:42,553 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:42,554 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:42,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:48:42,554 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:48:42,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:42,555 INFO L85 PathProgramCache]: Analyzing trace with hash -441894193, now seen corresponding path program 1 times [2022-11-25 23:48:42,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:42,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271001957] [2022-11-25 23:48:42,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:42,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:42,589 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-25 23:48:42,590 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:42,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271001957] [2022-11-25 23:48:42,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271001957] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:42,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:42,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:48:42,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849613050] [2022-11-25 23:48:42,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:42,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:48:42,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:42,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:48:42,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:48:42,593 INFO L87 Difference]: Start difference. First operand 809 states and 876 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:43,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:43,305 INFO L93 Difference]: Finished difference Result 809 states and 876 transitions. [2022-11-25 23:48:43,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:48:43,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-25 23:48:43,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:43,308 INFO L225 Difference]: With dead ends: 809 [2022-11-25 23:48:43,308 INFO L226 Difference]: Without dead ends: 675 [2022-11-25 23:48:43,309 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-25 23:48:43,310 INFO L413 NwaCegarLoop]: 335 mSDtfsCounter, 269 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:43,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 603 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:48:43,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-11-25 23:48:43,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 675. [2022-11-25 23:48:43,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 541 states have (on average 1.3715341959334566) internal successors, (742), 674 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:43,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 742 transitions. [2022-11-25 23:48:43,340 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 742 transitions. Word has length 9 [2022-11-25 23:48:43,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:43,341 INFO L495 AbstractCegarLoop]: Abstraction has 675 states and 742 transitions. [2022-11-25 23:48:43,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:43,342 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 742 transitions. [2022-11-25 23:48:43,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 23:48:43,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:43,343 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:43,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:48:43,344 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr402ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:48:43,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:43,346 INFO L85 PathProgramCache]: Analyzing trace with hash -766718520, now seen corresponding path program 1 times [2022-11-25 23:48:43,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:43,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077959386] [2022-11-25 23:48:43,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:43,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:43,443 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-25 23:48:43,443 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:43,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077959386] [2022-11-25 23:48:43,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077959386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:43,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:43,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:48:43,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332062991] [2022-11-25 23:48:43,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:43,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:48:43,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:43,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:48:43,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:48:43,446 INFO L87 Difference]: Start difference. First operand 675 states and 742 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:44,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:44,219 INFO L93 Difference]: Finished difference Result 1335 states and 1468 transitions. [2022-11-25 23:48:44,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:48:44,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-25 23:48:44,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:44,223 INFO L225 Difference]: With dead ends: 1335 [2022-11-25 23:48:44,223 INFO L226 Difference]: Without dead ends: 669 [2022-11-25 23:48:44,224 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-25 23:48:44,226 INFO L413 NwaCegarLoop]: 726 mSDtfsCounter, 2 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:44,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1254 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:48:44,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-11-25 23:48:44,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 669. [2022-11-25 23:48:44,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 537 states have (on average 1.3687150837988826) internal successors, (735), 668 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:44,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 735 transitions. [2022-11-25 23:48:44,247 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 735 transitions. Word has length 10 [2022-11-25 23:48:44,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:44,248 INFO L495 AbstractCegarLoop]: Abstraction has 669 states and 735 transitions. [2022-11-25 23:48:44,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:44,248 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 735 transitions. [2022-11-25 23:48:44,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 23:48:44,249 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:44,249 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:44,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:48:44,250 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr398ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:48:44,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:44,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1672904178, now seen corresponding path program 1 times [2022-11-25 23:48:44,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:44,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205353395] [2022-11-25 23:48:44,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:44,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:44,294 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-25 23:48:44,294 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:44,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205353395] [2022-11-25 23:48:44,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205353395] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:44,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:44,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:48:44,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125276640] [2022-11-25 23:48:44,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:44,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:48:44,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:44,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:48:44,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:48:44,298 INFO L87 Difference]: Start difference. First operand 669 states and 735 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:44,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:44,637 INFO L93 Difference]: Finished difference Result 669 states and 735 transitions. [2022-11-25 23:48:44,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:48:44,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-25 23:48:44,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:44,641 INFO L225 Difference]: With dead ends: 669 [2022-11-25 23:48:44,641 INFO L226 Difference]: Without dead ends: 603 [2022-11-25 23:48:44,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:48:44,642 INFO L413 NwaCegarLoop]: 470 mSDtfsCounter, 590 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:44,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 470 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:48:44,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-11-25 23:48:44,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2022-11-25 23:48:44,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 537 states have (on average 1.2458100558659218) internal successors, (669), 602 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:44,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 669 transitions. [2022-11-25 23:48:44,667 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 669 transitions. Word has length 14 [2022-11-25 23:48:44,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:44,668 INFO L495 AbstractCegarLoop]: Abstraction has 603 states and 669 transitions. [2022-11-25 23:48:44,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:44,673 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 669 transitions. [2022-11-25 23:48:44,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 23:48:44,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:44,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:44,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:48:44,675 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr399ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:48:44,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:44,677 INFO L85 PathProgramCache]: Analyzing trace with hash -320420391, now seen corresponding path program 1 times [2022-11-25 23:48:44,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:44,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142160491] [2022-11-25 23:48:44,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:44,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:44,726 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-25 23:48:44,727 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:44,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142160491] [2022-11-25 23:48:44,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142160491] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:44,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:44,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:48:44,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307506445] [2022-11-25 23:48:44,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:44,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:48:44,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:44,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:48:44,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:48:44,730 INFO L87 Difference]: Start difference. First operand 603 states and 669 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:45,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:45,114 INFO L93 Difference]: Finished difference Result 1188 states and 1319 transitions. [2022-11-25 23:48:45,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:48:45,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-25 23:48:45,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:45,118 INFO L225 Difference]: With dead ends: 1188 [2022-11-25 23:48:45,118 INFO L226 Difference]: Without dead ends: 1122 [2022-11-25 23:48:45,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:48:45,120 INFO L413 NwaCegarLoop]: 535 mSDtfsCounter, 523 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:45,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 990 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:48:45,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2022-11-25 23:48:45,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2022-11-25 23:48:45,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1057 states have (on average 1.185430463576159) internal successors, (1253), 1121 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:45,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1253 transitions. [2022-11-25 23:48:45,155 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1253 transitions. Word has length 15 [2022-11-25 23:48:45,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:45,155 INFO L495 AbstractCegarLoop]: Abstraction has 1122 states and 1253 transitions. [2022-11-25 23:48:45,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:45,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1253 transitions. [2022-11-25 23:48:45,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 23:48:45,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:45,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:45,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 23:48:45,157 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr395ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:48:45,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:45,158 INFO L85 PathProgramCache]: Analyzing trace with hash -140184788, now seen corresponding path program 1 times [2022-11-25 23:48:45,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:45,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706177324] [2022-11-25 23:48:45,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:45,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:45,204 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-25 23:48:45,207 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:45,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706177324] [2022-11-25 23:48:45,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706177324] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:45,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:45,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:48:45,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851196742] [2022-11-25 23:48:45,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:45,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:48:45,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:45,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:48:45,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:48:45,210 INFO L87 Difference]: Start difference. First operand 1122 states and 1253 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:45,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:45,830 INFO L93 Difference]: Finished difference Result 1698 states and 1893 transitions. [2022-11-25 23:48:45,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:48:45,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 23:48:45,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:45,836 INFO L225 Difference]: With dead ends: 1698 [2022-11-25 23:48:45,836 INFO L226 Difference]: Without dead ends: 1633 [2022-11-25 23:48:45,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-25 23:48:45,841 INFO L413 NwaCegarLoop]: 534 mSDtfsCounter, 1038 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:45,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 1437 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:48:45,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2022-11-25 23:48:45,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1633. [2022-11-25 23:48:45,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 1569 states have (on average 1.1650732950924156) internal successors, (1828), 1632 states have internal predecessors, (1828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:45,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 1828 transitions. [2022-11-25 23:48:45,888 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 1828 transitions. Word has length 21 [2022-11-25 23:48:45,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:45,889 INFO L495 AbstractCegarLoop]: Abstraction has 1633 states and 1828 transitions. [2022-11-25 23:48:45,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:45,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 1828 transitions. [2022-11-25 23:48:45,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 23:48:45,891 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:45,891 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] [2022-11-25 23:48:45,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 23:48:45,892 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr391ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:48:45,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:45,893 INFO L85 PathProgramCache]: Analyzing trace with hash 755574792, now seen corresponding path program 1 times [2022-11-25 23:48:45,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:45,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334808583] [2022-11-25 23:48:45,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:45,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:45,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:48:45,993 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:45,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334808583] [2022-11-25 23:48:45,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334808583] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:45,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:45,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:48:45,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453567876] [2022-11-25 23:48:45,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:45,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:48:45,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:45,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:48:45,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:48:45,996 INFO L87 Difference]: Start difference. First operand 1633 states and 1828 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:46,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:46,861 INFO L93 Difference]: Finished difference Result 2200 states and 2458 transitions. [2022-11-25 23:48:46,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:48:46,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-25 23:48:46,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:46,870 INFO L225 Difference]: With dead ends: 2200 [2022-11-25 23:48:46,870 INFO L226 Difference]: Without dead ends: 2136 [2022-11-25 23:48:46,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:48:46,872 INFO L413 NwaCegarLoop]: 533 mSDtfsCounter, 2055 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2055 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:46,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2055 Valid, 1877 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:48:46,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2022-11-25 23:48:46,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 2136. [2022-11-25 23:48:46,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2136 states, 2073 states have (on average 1.1548480463096962) internal successors, (2394), 2135 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:46,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 2394 transitions. [2022-11-25 23:48:46,948 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 2394 transitions. Word has length 27 [2022-11-25 23:48:46,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:46,948 INFO L495 AbstractCegarLoop]: Abstraction has 2136 states and 2394 transitions. [2022-11-25 23:48:46,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:46,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 2394 transitions. [2022-11-25 23:48:46,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 23:48:46,956 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:46,956 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-25 23:48:46,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 23:48:46,956 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr387ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:48:46,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:46,957 INFO L85 PathProgramCache]: Analyzing trace with hash 325573037, now seen corresponding path program 1 times [2022-11-25 23:48:46,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:46,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801830533] [2022-11-25 23:48:46,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:46,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:47,071 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-25 23:48:47,072 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:47,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801830533] [2022-11-25 23:48:47,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801830533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:47,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:47,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:48:47,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348107187] [2022-11-25 23:48:47,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:47,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:48:47,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:47,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:48:47,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:48:47,077 INFO L87 Difference]: Start difference. First operand 2136 states and 2394 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:47,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:47,615 INFO L93 Difference]: Finished difference Result 3710 states and 4157 transitions. [2022-11-25 23:48:47,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:48:47,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-25 23:48:47,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:47,622 INFO L225 Difference]: With dead ends: 3710 [2022-11-25 23:48:47,622 INFO L226 Difference]: Without dead ends: 2107 [2022-11-25 23:48:47,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:48:47,625 INFO L413 NwaCegarLoop]: 647 mSDtfsCounter, 2 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:47,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 839 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:48:47,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2107 states. [2022-11-25 23:48:47,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2107 to 2107. [2022-11-25 23:48:47,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2107 states, 2045 states have (on average 1.154523227383863) internal successors, (2361), 2106 states have internal predecessors, (2361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:47,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 2107 states and 2361 transitions. [2022-11-25 23:48:47,680 INFO L78 Accepts]: Start accepts. Automaton has 2107 states and 2361 transitions. Word has length 33 [2022-11-25 23:48:47,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:47,681 INFO L495 AbstractCegarLoop]: Abstraction has 2107 states and 2361 transitions. [2022-11-25 23:48:47,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:47,681 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 2361 transitions. [2022-11-25 23:48:47,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 23:48:47,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:47,682 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] [2022-11-25 23:48:47,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 23:48:47,682 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr383ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:48:47,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:47,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1922599946, now seen corresponding path program 1 times [2022-11-25 23:48:47,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:47,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216224895] [2022-11-25 23:48:47,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:47,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:47,742 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-25 23:48:47,742 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:47,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216224895] [2022-11-25 23:48:47,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216224895] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:47,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:47,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:48:47,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989821818] [2022-11-25 23:48:47,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:47,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:48:47,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:47,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:48:47,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:48:47,745 INFO L87 Difference]: Start difference. First operand 2107 states and 2361 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:48,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:48,478 INFO L93 Difference]: Finished difference Result 3656 states and 4096 transitions. [2022-11-25 23:48:48,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:48:48,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-25 23:48:48,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:48,485 INFO L225 Difference]: With dead ends: 3656 [2022-11-25 23:48:48,485 INFO L226 Difference]: Without dead ends: 2078 [2022-11-25 23:48:48,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:48:48,488 INFO L413 NwaCegarLoop]: 637 mSDtfsCounter, 2 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:48,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1015 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:48:48,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2022-11-25 23:48:48,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 2078. [2022-11-25 23:48:48,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2078 states, 2017 states have (on average 1.1541893901834408) internal successors, (2328), 2077 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:48,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 2328 transitions. [2022-11-25 23:48:48,549 INFO L78 Accepts]: Start accepts. Automaton has 2078 states and 2328 transitions. Word has length 37 [2022-11-25 23:48:48,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:48,549 INFO L495 AbstractCegarLoop]: Abstraction has 2078 states and 2328 transitions. [2022-11-25 23:48:48,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:48,550 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 2328 transitions. [2022-11-25 23:48:48,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 23:48:48,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:48,552 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] [2022-11-25 23:48:48,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 23:48:48,552 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr379ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:48:48,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:48,554 INFO L85 PathProgramCache]: Analyzing trace with hash 2011930239, now seen corresponding path program 1 times [2022-11-25 23:48:48,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:48,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805843463] [2022-11-25 23:48:48,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:48,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:48,657 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-25 23:48:48,657 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:48,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805843463] [2022-11-25 23:48:48,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805843463] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:48,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:48,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 23:48:48,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948919446] [2022-11-25 23:48:48,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:48,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 23:48:48,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:48,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 23:48:48,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:48:48,660 INFO L87 Difference]: Start difference. First operand 2078 states and 2328 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:49,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:49,377 INFO L93 Difference]: Finished difference Result 3602 states and 4035 transitions. [2022-11-25 23:48:49,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:48:49,379 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-25 23:48:49,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:49,385 INFO L225 Difference]: With dead ends: 3602 [2022-11-25 23:48:49,386 INFO L226 Difference]: Without dead ends: 2049 [2022-11-25 23:48:49,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:48:49,390 INFO L413 NwaCegarLoop]: 627 mSDtfsCounter, 2 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:49,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 999 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:48:49,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2022-11-25 23:48:49,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 2049. [2022-11-25 23:48:49,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2049 states, 1989 states have (on average 1.1538461538461537) internal successors, (2295), 2048 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:49,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2049 states to 2049 states and 2295 transitions. [2022-11-25 23:48:49,453 INFO L78 Accepts]: Start accepts. Automaton has 2049 states and 2295 transitions. Word has length 41 [2022-11-25 23:48:49,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:49,453 INFO L495 AbstractCegarLoop]: Abstraction has 2049 states and 2295 transitions. [2022-11-25 23:48:49,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:49,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2049 states and 2295 transitions. [2022-11-25 23:48:49,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 23:48:49,454 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:49,454 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, 1, 1] [2022-11-25 23:48:49,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 23:48:49,455 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr375ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:48:49,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:49,455 INFO L85 PathProgramCache]: Analyzing trace with hash -508413624, now seen corresponding path program 1 times [2022-11-25 23:48:49,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:49,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506415751] [2022-11-25 23:48:49,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:49,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:49,615 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-25 23:48:49,615 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:49,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506415751] [2022-11-25 23:48:49,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506415751] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:49,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:49,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 23:48:49,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064946973] [2022-11-25 23:48:49,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:49,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 23:48:49,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:49,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 23:48:49,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:48:49,620 INFO L87 Difference]: Start difference. First operand 2049 states and 2295 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:50,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:50,169 INFO L93 Difference]: Finished difference Result 3548 states and 3974 transitions. [2022-11-25 23:48:50,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:48:50,170 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-25 23:48:50,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:50,176 INFO L225 Difference]: With dead ends: 3548 [2022-11-25 23:48:50,176 INFO L226 Difference]: Without dead ends: 2020 [2022-11-25 23:48:50,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:48:50,180 INFO L413 NwaCegarLoop]: 617 mSDtfsCounter, 2 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:50,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 800 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:48:50,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2022-11-25 23:48:50,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 2020. [2022-11-25 23:48:50,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2020 states, 1961 states have (on average 1.1534931157572668) internal successors, (2262), 2019 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:50,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 2262 transitions. [2022-11-25 23:48:50,245 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 2262 transitions. Word has length 45 [2022-11-25 23:48:50,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:50,246 INFO L495 AbstractCegarLoop]: Abstraction has 2020 states and 2262 transitions. [2022-11-25 23:48:50,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:50,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2262 transitions. [2022-11-25 23:48:50,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-25 23:48:50,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:50,247 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, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:50,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 23:48:50,247 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr371ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:48:50,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:50,248 INFO L85 PathProgramCache]: Analyzing trace with hash -2021055407, now seen corresponding path program 1 times [2022-11-25 23:48:50,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:50,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141228538] [2022-11-25 23:48:50,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:50,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:50,407 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-25 23:48:50,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:50,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141228538] [2022-11-25 23:48:50,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141228538] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:50,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:50,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 23:48:50,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152522511] [2022-11-25 23:48:50,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:50,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 23:48:50,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:50,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 23:48:50,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:48:50,410 INFO L87 Difference]: Start difference. First operand 2020 states and 2262 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:51,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:51,382 INFO L93 Difference]: Finished difference Result 3494 states and 3913 transitions. [2022-11-25 23:48:51,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:48:51,383 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-11-25 23:48:51,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:51,388 INFO L225 Difference]: With dead ends: 3494 [2022-11-25 23:48:51,388 INFO L226 Difference]: Without dead ends: 1991 [2022-11-25 23:48:51,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:48:51,391 INFO L413 NwaCegarLoop]: 607 mSDtfsCounter, 2 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:51,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1147 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 23:48:51,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2022-11-25 23:48:51,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1991. [2022-11-25 23:48:51,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1991 states, 1933 states have (on average 1.1531298499741334) internal successors, (2229), 1990 states have internal predecessors, (2229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:51,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 2229 transitions. [2022-11-25 23:48:51,443 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 2229 transitions. Word has length 49 [2022-11-25 23:48:51,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:51,444 INFO L495 AbstractCegarLoop]: Abstraction has 1991 states and 2229 transitions. [2022-11-25 23:48:51,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:51,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 2229 transitions. [2022-11-25 23:48:51,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-25 23:48:51,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:51,445 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:51,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 23:48:51,446 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr367ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:48:51,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:51,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1280196506, now seen corresponding path program 1 times [2022-11-25 23:48:51,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:51,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247346985] [2022-11-25 23:48:51,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:51,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:51,612 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-25 23:48:51,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:51,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247346985] [2022-11-25 23:48:51,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247346985] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:51,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:51,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 23:48:51,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530859125] [2022-11-25 23:48:51,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:51,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:48:51,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:51,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:48:51,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:48:51,615 INFO L87 Difference]: Start difference. First operand 1991 states and 2229 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:52,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:52,746 INFO L93 Difference]: Finished difference Result 3440 states and 3852 transitions. [2022-11-25 23:48:52,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:48:52,747 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-11-25 23:48:52,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:52,754 INFO L225 Difference]: With dead ends: 3440 [2022-11-25 23:48:52,754 INFO L226 Difference]: Without dead ends: 1962 [2022-11-25 23:48:52,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:48:52,757 INFO L413 NwaCegarLoop]: 597 mSDtfsCounter, 2 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 1777 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:52,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1305 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1777 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-25 23:48:52,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2022-11-25 23:48:52,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2022-11-25 23:48:52,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1905 states have (on average 1.152755905511811) internal successors, (2196), 1961 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:52,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2196 transitions. [2022-11-25 23:48:52,806 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2196 transitions. Word has length 53 [2022-11-25 23:48:52,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:52,806 INFO L495 AbstractCegarLoop]: Abstraction has 1962 states and 2196 transitions. [2022-11-25 23:48:52,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:52,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2196 transitions. [2022-11-25 23:48:52,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-25 23:48:52,808 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:52,808 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:52,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 23:48:52,808 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr363ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:48:52,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:52,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1326486749, now seen corresponding path program 1 times [2022-11-25 23:48:52,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:52,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665250991] [2022-11-25 23:48:52,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:52,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:52,989 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-25 23:48:52,989 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:52,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665250991] [2022-11-25 23:48:52,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665250991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:52,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:52,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 23:48:52,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112722188] [2022-11-25 23:48:52,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:52,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 23:48:52,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:52,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 23:48:52,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-11-25 23:48:52,992 INFO L87 Difference]: Start difference. First operand 1962 states and 2196 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:54,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:54,297 INFO L93 Difference]: Finished difference Result 3386 states and 3791 transitions. [2022-11-25 23:48:54,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 23:48:54,297 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-11-25 23:48:54,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:54,304 INFO L225 Difference]: With dead ends: 3386 [2022-11-25 23:48:54,304 INFO L226 Difference]: Without dead ends: 1933 [2022-11-25 23:48:54,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-11-25 23:48:54,306 INFO L413 NwaCegarLoop]: 587 mSDtfsCounter, 2 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 2187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 2187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:54,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1457 Invalid, 2187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2187 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-25 23:48:54,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2022-11-25 23:48:54,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1933. [2022-11-25 23:48:54,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1933 states, 1877 states have (on average 1.1523708044752263) internal successors, (2163), 1932 states have internal predecessors, (2163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:54,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1933 states and 2163 transitions. [2022-11-25 23:48:54,353 INFO L78 Accepts]: Start accepts. Automaton has 1933 states and 2163 transitions. Word has length 57 [2022-11-25 23:48:54,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:54,353 INFO L495 AbstractCegarLoop]: Abstraction has 1933 states and 2163 transitions. [2022-11-25 23:48:54,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:54,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2163 transitions. [2022-11-25 23:48:54,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-25 23:48:54,355 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:54,355 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:54,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 23:48:54,355 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr359ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:48:54,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:54,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1282049772, now seen corresponding path program 1 times [2022-11-25 23:48:54,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:54,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263823296] [2022-11-25 23:48:54,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:54,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:54,519 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-25 23:48:54,519 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:54,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263823296] [2022-11-25 23:48:54,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263823296] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:54,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:54,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 23:48:54,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074442400] [2022-11-25 23:48:54,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:54,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 23:48:54,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:54,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 23:48:54,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-11-25 23:48:54,522 INFO L87 Difference]: Start difference. First operand 1933 states and 2163 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:55,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:55,526 INFO L93 Difference]: Finished difference Result 3332 states and 3730 transitions. [2022-11-25 23:48:55,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 23:48:55,526 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-11-25 23:48:55,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:55,533 INFO L225 Difference]: With dead ends: 3332 [2022-11-25 23:48:55,533 INFO L226 Difference]: Without dead ends: 1904 [2022-11-25 23:48:55,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-11-25 23:48:55,536 INFO L413 NwaCegarLoop]: 577 mSDtfsCounter, 2 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 1729 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:55,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1261 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1729 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 23:48:55,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2022-11-25 23:48:55,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1904. [2022-11-25 23:48:55,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1904 states, 1849 states have (on average 1.1519740400216334) internal successors, (2130), 1903 states have internal predecessors, (2130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:55,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 2130 transitions. [2022-11-25 23:48:55,577 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 2130 transitions. Word has length 61 [2022-11-25 23:48:55,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:55,577 INFO L495 AbstractCegarLoop]: Abstraction has 1904 states and 2130 transitions. [2022-11-25 23:48:55,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:55,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 2130 transitions. [2022-11-25 23:48:55,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-25 23:48:55,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:55,579 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:55,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 23:48:55,579 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr355ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:48:55,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:55,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1137537781, now seen corresponding path program 1 times [2022-11-25 23:48:55,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:55,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846429831] [2022-11-25 23:48:55,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:55,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:55,741 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-25 23:48:55,741 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:55,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846429831] [2022-11-25 23:48:55,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846429831] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:55,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:55,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 23:48:55,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057100445] [2022-11-25 23:48:55,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:55,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 23:48:55,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:55,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 23:48:55,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:48:55,744 INFO L87 Difference]: Start difference. First operand 1904 states and 2130 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:56,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:56,810 INFO L93 Difference]: Finished difference Result 3278 states and 3669 transitions. [2022-11-25 23:48:56,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 23:48:56,810 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-11-25 23:48:56,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:56,813 INFO L225 Difference]: With dead ends: 3278 [2022-11-25 23:48:56,814 INFO L226 Difference]: Without dead ends: 1875 [2022-11-25 23:48:56,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:48:56,816 INFO L413 NwaCegarLoop]: 567 mSDtfsCounter, 2 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 2161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 2161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:56,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1407 Invalid, 2161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2161 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-25 23:48:56,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2022-11-25 23:48:56,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1875. [2022-11-25 23:48:56,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1875 states, 1821 states have (on average 1.1515650741350907) internal successors, (2097), 1874 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:56,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2097 transitions. [2022-11-25 23:48:56,856 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 2097 transitions. Word has length 65 [2022-11-25 23:48:56,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:56,856 INFO L495 AbstractCegarLoop]: Abstraction has 1875 states and 2097 transitions. [2022-11-25 23:48:56,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:56,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2097 transitions. [2022-11-25 23:48:56,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-25 23:48:56,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:56,858 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, 1, 1, 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-25 23:48:56,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 23:48:56,858 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr351ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:48:56,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:56,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1036644546, now seen corresponding path program 1 times [2022-11-25 23:48:56,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:56,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697198091] [2022-11-25 23:48:56,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:56,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:57,056 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-25 23:48:57,057 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:57,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697198091] [2022-11-25 23:48:57,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697198091] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:57,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:57,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-25 23:48:57,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12501466] [2022-11-25 23:48:57,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:57,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 23:48:57,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:57,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 23:48:57,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2022-11-25 23:48:57,059 INFO L87 Difference]: Start difference. First operand 1875 states and 2097 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:57,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:57,902 INFO L93 Difference]: Finished difference Result 3224 states and 3608 transitions. [2022-11-25 23:48:57,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 23:48:57,902 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-11-25 23:48:57,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:57,907 INFO L225 Difference]: With dead ends: 3224 [2022-11-25 23:48:57,908 INFO L226 Difference]: Without dead ends: 1846 [2022-11-25 23:48:57,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2022-11-25 23:48:57,910 INFO L413 NwaCegarLoop]: 557 mSDtfsCounter, 2 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:57,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1052 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1344 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 23:48:57,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2022-11-25 23:48:57,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1846. [2022-11-25 23:48:57,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1846 states, 1793 states have (on average 1.151143335192415) internal successors, (2064), 1845 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:57,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1846 states and 2064 transitions. [2022-11-25 23:48:57,947 INFO L78 Accepts]: Start accepts. Automaton has 1846 states and 2064 transitions. Word has length 69 [2022-11-25 23:48:57,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:57,947 INFO L495 AbstractCegarLoop]: Abstraction has 1846 states and 2064 transitions. [2022-11-25 23:48:57,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:57,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2064 transitions. [2022-11-25 23:48:57,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-25 23:48:57,948 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:57,949 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, 1, 1, 1, 1, 1, 1, 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-25 23:48:57,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 23:48:57,949 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr347ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:48:57,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:57,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1892826055, now seen corresponding path program 1 times [2022-11-25 23:48:57,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:57,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235643528] [2022-11-25 23:48:57,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:57,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:58,177 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-25 23:48:58,177 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:58,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235643528] [2022-11-25 23:48:58,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235643528] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:58,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:58,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-25 23:48:58,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406527813] [2022-11-25 23:48:58,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:58,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 23:48:58,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:58,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 23:48:58,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2022-11-25 23:48:58,183 INFO L87 Difference]: Start difference. First operand 1846 states and 2064 transitions. Second operand has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 14 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:58,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:58,907 INFO L93 Difference]: Finished difference Result 3170 states and 3547 transitions. [2022-11-25 23:48:58,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 23:48:58,908 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 14 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2022-11-25 23:48:58,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:58,913 INFO L225 Difference]: With dead ends: 3170 [2022-11-25 23:48:58,913 INFO L226 Difference]: Without dead ends: 1817 [2022-11-25 23:48:58,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2022-11-25 23:48:58,915 INFO L413 NwaCegarLoop]: 547 mSDtfsCounter, 2 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:58,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1033 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1335 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:48:58,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2022-11-25 23:48:58,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1817. [2022-11-25 23:48:58,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1817 states, 1765 states have (on average 1.1507082152974504) internal successors, (2031), 1816 states have internal predecessors, (2031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:58,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2031 transitions. [2022-11-25 23:48:58,953 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2031 transitions. Word has length 73 [2022-11-25 23:48:58,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:58,954 INFO L495 AbstractCegarLoop]: Abstraction has 1817 states and 2031 transitions. [2022-11-25 23:48:58,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 14 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:58,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2031 transitions. [2022-11-25 23:48:58,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-25 23:48:58,955 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:58,955 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:48:58,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 23:48:58,956 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr343ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:48:58,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:58,956 INFO L85 PathProgramCache]: Analyzing trace with hash -287319920, now seen corresponding path program 1 times [2022-11-25 23:48:58,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:58,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736773023] [2022-11-25 23:48:58,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:58,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:59,219 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-25 23:48:59,220 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:59,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736773023] [2022-11-25 23:48:59,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736773023] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:48:59,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:48:59,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-25 23:48:59,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91983853] [2022-11-25 23:48:59,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:59,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 23:48:59,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:59,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 23:48:59,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2022-11-25 23:48:59,223 INFO L87 Difference]: Start difference. First operand 1817 states and 2031 transitions. Second operand has 16 states, 16 states have (on average 4.8125) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:00,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:00,013 INFO L93 Difference]: Finished difference Result 3116 states and 3486 transitions. [2022-11-25 23:49:00,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 23:49:00,014 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-11-25 23:49:00,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:00,018 INFO L225 Difference]: With dead ends: 3116 [2022-11-25 23:49:00,018 INFO L226 Difference]: Without dead ends: 1788 [2022-11-25 23:49:00,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2022-11-25 23:49:00,020 INFO L413 NwaCegarLoop]: 537 mSDtfsCounter, 2 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 1306 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:00,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1014 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1306 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:49:00,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2022-11-25 23:49:00,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1788. [2022-11-25 23:49:00,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1788 states, 1737 states have (on average 1.150259067357513) internal successors, (1998), 1787 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:00,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 1998 transitions. [2022-11-25 23:49:00,070 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 1998 transitions. Word has length 77 [2022-11-25 23:49:00,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:00,070 INFO L495 AbstractCegarLoop]: Abstraction has 1788 states and 1998 transitions. [2022-11-25 23:49:00,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:00,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 1998 transitions. [2022-11-25 23:49:00,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-25 23:49:00,072 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:00,072 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:00,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 23:49:00,072 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr339ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:00,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:00,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1236059545, now seen corresponding path program 1 times [2022-11-25 23:49:00,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:00,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076513616] [2022-11-25 23:49:00,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:00,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:00,380 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-25 23:49:00,380 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:00,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076513616] [2022-11-25 23:49:00,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076513616] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:00,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:00,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-25 23:49:00,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162918297] [2022-11-25 23:49:00,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:00,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 23:49:00,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:00,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 23:49:00,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2022-11-25 23:49:00,383 INFO L87 Difference]: Start difference. First operand 1788 states and 1998 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:01,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:01,079 INFO L93 Difference]: Finished difference Result 3062 states and 3425 transitions. [2022-11-25 23:49:01,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 23:49:01,079 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-11-25 23:49:01,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:01,084 INFO L225 Difference]: With dead ends: 3062 [2022-11-25 23:49:01,084 INFO L226 Difference]: Without dead ends: 1759 [2022-11-25 23:49:01,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2022-11-25 23:49:01,087 INFO L413 NwaCegarLoop]: 527 mSDtfsCounter, 2 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:01,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 995 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1277 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:49:01,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2022-11-25 23:49:01,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1759. [2022-11-25 23:49:01,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1709 states have (on average 1.14979520187244) internal successors, (1965), 1758 states have internal predecessors, (1965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:01,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 1965 transitions. [2022-11-25 23:49:01,133 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 1965 transitions. Word has length 81 [2022-11-25 23:49:01,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:01,133 INFO L495 AbstractCegarLoop]: Abstraction has 1759 states and 1965 transitions. [2022-11-25 23:49:01,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:01,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 1965 transitions. [2022-11-25 23:49:01,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-25 23:49:01,135 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:01,135 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:01,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 23:49:01,135 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr335ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:01,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:01,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1956045538, now seen corresponding path program 1 times [2022-11-25 23:49:01,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:01,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660103432] [2022-11-25 23:49:01,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:01,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:01,444 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-25 23:49:01,444 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:01,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660103432] [2022-11-25 23:49:01,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660103432] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:01,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:01,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-25 23:49:01,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052566641] [2022-11-25 23:49:01,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:01,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 23:49:01,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:01,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 23:49:01,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:49:01,447 INFO L87 Difference]: Start difference. First operand 1759 states and 1965 transitions. Second operand has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:02,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:02,293 INFO L93 Difference]: Finished difference Result 3008 states and 3364 transitions. [2022-11-25 23:49:02,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 23:49:02,295 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2022-11-25 23:49:02,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:02,299 INFO L225 Difference]: With dead ends: 3008 [2022-11-25 23:49:02,299 INFO L226 Difference]: Without dead ends: 1730 [2022-11-25 23:49:02,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:49:02,301 INFO L413 NwaCegarLoop]: 517 mSDtfsCounter, 2 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 1689 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 1689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:02,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1129 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1689 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 23:49:02,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2022-11-25 23:49:02,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1730. [2022-11-25 23:49:02,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1730 states, 1681 states have (on average 1.1493158834027364) internal successors, (1932), 1729 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:02,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 1932 transitions. [2022-11-25 23:49:02,337 INFO L78 Accepts]: Start accepts. Automaton has 1730 states and 1932 transitions. Word has length 85 [2022-11-25 23:49:02,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:02,338 INFO L495 AbstractCegarLoop]: Abstraction has 1730 states and 1932 transitions. [2022-11-25 23:49:02,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:02,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 1932 transitions. [2022-11-25 23:49:02,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-25 23:49:02,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:02,339 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:02,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-25 23:49:02,340 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr331ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:02,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:02,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1056173973, now seen corresponding path program 1 times [2022-11-25 23:49:02,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:02,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288942677] [2022-11-25 23:49:02,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:02,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:02,665 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-25 23:49:02,666 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:02,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288942677] [2022-11-25 23:49:02,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288942677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:02,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:02,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-25 23:49:02,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685399490] [2022-11-25 23:49:02,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:02,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 23:49:02,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:02,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 23:49:02,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2022-11-25 23:49:02,668 INFO L87 Difference]: Start difference. First operand 1730 states and 1932 transitions. Second operand has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 18 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:03,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:03,335 INFO L93 Difference]: Finished difference Result 2954 states and 3303 transitions. [2022-11-25 23:49:03,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 23:49:03,335 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 18 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2022-11-25 23:49:03,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:03,338 INFO L225 Difference]: With dead ends: 2954 [2022-11-25 23:49:03,338 INFO L226 Difference]: Without dead ends: 1701 [2022-11-25 23:49:03,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2022-11-25 23:49:03,341 INFO L413 NwaCegarLoop]: 507 mSDtfsCounter, 2 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 1291 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:03,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 957 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1291 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:49:03,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2022-11-25 23:49:03,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1701. [2022-11-25 23:49:03,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1653 states have (on average 1.148820326678766) internal successors, (1899), 1700 states have internal predecessors, (1899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:03,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 1899 transitions. [2022-11-25 23:49:03,375 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 1899 transitions. Word has length 89 [2022-11-25 23:49:03,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:03,375 INFO L495 AbstractCegarLoop]: Abstraction has 1701 states and 1899 transitions. [2022-11-25 23:49:03,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 18 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:03,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 1899 transitions. [2022-11-25 23:49:03,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-25 23:49:03,377 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:03,377 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:03,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 23:49:03,377 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr327ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:03,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:03,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1451896372, now seen corresponding path program 1 times [2022-11-25 23:49:03,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:03,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042277057] [2022-11-25 23:49:03,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:03,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:03,722 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-25 23:49:03,722 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:03,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042277057] [2022-11-25 23:49:03,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042277057] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:03,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:03,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-25 23:49:03,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594613059] [2022-11-25 23:49:03,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:03,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-25 23:49:03,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:03,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 23:49:03,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2022-11-25 23:49:03,724 INFO L87 Difference]: Start difference. First operand 1701 states and 1899 transitions. Second operand has 20 states, 20 states have (on average 4.65) internal successors, (93), 19 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:04,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:04,545 INFO L93 Difference]: Finished difference Result 2900 states and 3242 transitions. [2022-11-25 23:49:04,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 23:49:04,546 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.65) internal successors, (93), 19 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2022-11-25 23:49:04,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:04,548 INFO L225 Difference]: With dead ends: 2900 [2022-11-25 23:49:04,549 INFO L226 Difference]: Without dead ends: 1672 [2022-11-25 23:49:04,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2022-11-25 23:49:04,556 INFO L413 NwaCegarLoop]: 497 mSDtfsCounter, 2 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 1645 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 1645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:04,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1085 Invalid, 1645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1645 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 23:49:04,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2022-11-25 23:49:04,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1672. [2022-11-25 23:49:04,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1625 states have (on average 1.1483076923076923) internal successors, (1866), 1671 states have internal predecessors, (1866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:04,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1866 transitions. [2022-11-25 23:49:04,596 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1866 transitions. Word has length 93 [2022-11-25 23:49:04,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:04,596 INFO L495 AbstractCegarLoop]: Abstraction has 1672 states and 1866 transitions. [2022-11-25 23:49:04,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.65) internal successors, (93), 19 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:04,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1866 transitions. [2022-11-25 23:49:04,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-25 23:49:04,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:04,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:04,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-25 23:49:04,598 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr323ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:04,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:04,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1432413123, now seen corresponding path program 1 times [2022-11-25 23:49:04,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:04,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146748058] [2022-11-25 23:49:04,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:04,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:04,984 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-25 23:49:04,985 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:04,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146748058] [2022-11-25 23:49:04,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146748058] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:04,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:04,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-11-25 23:49:04,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934105471] [2022-11-25 23:49:04,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:04,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-25 23:49:04,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:04,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-25 23:49:04,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2022-11-25 23:49:04,987 INFO L87 Difference]: Start difference. First operand 1672 states and 1866 transitions. Second operand has 21 states, 21 states have (on average 4.619047619047619) internal successors, (97), 20 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:06,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:06,336 INFO L93 Difference]: Finished difference Result 2846 states and 3181 transitions. [2022-11-25 23:49:06,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 23:49:06,336 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.619047619047619) internal successors, (97), 20 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-11-25 23:49:06,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:06,339 INFO L225 Difference]: With dead ends: 2846 [2022-11-25 23:49:06,339 INFO L226 Difference]: Without dead ends: 1643 [2022-11-25 23:49:06,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2022-11-25 23:49:06,340 INFO L413 NwaCegarLoop]: 487 mSDtfsCounter, 2 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 3077 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 3077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:06,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1639 Invalid, 3077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3077 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-25 23:49:06,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2022-11-25 23:49:06,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1643. [2022-11-25 23:49:06,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1643 states, 1597 states have (on average 1.147777082028804) internal successors, (1833), 1642 states have internal predecessors, (1833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:06,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 1833 transitions. [2022-11-25 23:49:06,371 INFO L78 Accepts]: Start accepts. Automaton has 1643 states and 1833 transitions. Word has length 97 [2022-11-25 23:49:06,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:06,372 INFO L495 AbstractCegarLoop]: Abstraction has 1643 states and 1833 transitions. [2022-11-25 23:49:06,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.619047619047619) internal successors, (97), 20 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:06,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 1833 transitions. [2022-11-25 23:49:06,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-25 23:49:06,373 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:06,373 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:06,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-25 23:49:06,374 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr319ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:06,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:06,374 INFO L85 PathProgramCache]: Analyzing trace with hash -118965626, now seen corresponding path program 1 times [2022-11-25 23:49:06,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:06,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069274843] [2022-11-25 23:49:06,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:06,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:06,770 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-25 23:49:06,770 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:06,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069274843] [2022-11-25 23:49:06,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069274843] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:06,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:06,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-11-25 23:49:06,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000986812] [2022-11-25 23:49:06,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:06,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-25 23:49:06,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:06,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-25 23:49:06,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2022-11-25 23:49:06,776 INFO L87 Difference]: Start difference. First operand 1643 states and 1833 transitions. Second operand has 22 states, 22 states have (on average 4.590909090909091) internal successors, (101), 21 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:07,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:07,690 INFO L93 Difference]: Finished difference Result 2792 states and 3120 transitions. [2022-11-25 23:49:07,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-25 23:49:07,691 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.590909090909091) internal successors, (101), 21 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2022-11-25 23:49:07,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:07,693 INFO L225 Difference]: With dead ends: 2792 [2022-11-25 23:49:07,693 INFO L226 Difference]: Without dead ends: 1614 [2022-11-25 23:49:07,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2022-11-25 23:49:07,696 INFO L413 NwaCegarLoop]: 477 mSDtfsCounter, 2 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 2002 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 2002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:07,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1182 Invalid, 2002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2002 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 23:49:07,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2022-11-25 23:49:07,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1614. [2022-11-25 23:49:07,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1569 states have (on average 1.147227533460803) internal successors, (1800), 1613 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:07,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 1800 transitions. [2022-11-25 23:49:07,726 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 1800 transitions. Word has length 101 [2022-11-25 23:49:07,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:07,726 INFO L495 AbstractCegarLoop]: Abstraction has 1614 states and 1800 transitions. [2022-11-25 23:49:07,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.590909090909091) internal successors, (101), 21 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:07,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 1800 transitions. [2022-11-25 23:49:07,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-25 23:49:07,728 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:07,728 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:07,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-25 23:49:07,729 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr315ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:07,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:07,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1156257521, now seen corresponding path program 1 times [2022-11-25 23:49:07,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:07,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821736497] [2022-11-25 23:49:07,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:07,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:08,147 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-25 23:49:08,147 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:08,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821736497] [2022-11-25 23:49:08,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821736497] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:08,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:08,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-11-25 23:49:08,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376840386] [2022-11-25 23:49:08,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:08,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 23:49:08,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:08,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 23:49:08,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2022-11-25 23:49:08,150 INFO L87 Difference]: Start difference. First operand 1614 states and 1800 transitions. Second operand has 23 states, 23 states have (on average 4.565217391304348) internal successors, (105), 22 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:08,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:08,832 INFO L93 Difference]: Finished difference Result 2738 states and 3059 transitions. [2022-11-25 23:49:08,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 23:49:08,833 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.565217391304348) internal successors, (105), 22 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-11-25 23:49:08,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:08,835 INFO L225 Difference]: With dead ends: 2738 [2022-11-25 23:49:08,835 INFO L226 Difference]: Without dead ends: 1585 [2022-11-25 23:49:08,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2022-11-25 23:49:08,837 INFO L413 NwaCegarLoop]: 467 mSDtfsCounter, 2 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:08,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 881 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:49:08,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2022-11-25 23:49:08,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1585. [2022-11-25 23:49:08,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1541 states have (on average 1.1466580142764438) internal successors, (1767), 1584 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:08,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 1767 transitions. [2022-11-25 23:49:08,881 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 1767 transitions. Word has length 105 [2022-11-25 23:49:08,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:08,882 INFO L495 AbstractCegarLoop]: Abstraction has 1585 states and 1767 transitions. [2022-11-25 23:49:08,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.565217391304348) internal successors, (105), 22 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:08,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 1767 transitions. [2022-11-25 23:49:08,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-25 23:49:08,883 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:08,884 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:08,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-25 23:49:08,884 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr311ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:08,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:08,885 INFO L85 PathProgramCache]: Analyzing trace with hash 551651288, now seen corresponding path program 1 times [2022-11-25 23:49:08,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:08,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947570297] [2022-11-25 23:49:08,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:08,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:09,356 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-25 23:49:09,357 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:09,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947570297] [2022-11-25 23:49:09,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947570297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:09,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:09,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-11-25 23:49:09,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763884358] [2022-11-25 23:49:09,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:09,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-25 23:49:09,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:09,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-25 23:49:09,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2022-11-25 23:49:09,359 INFO L87 Difference]: Start difference. First operand 1585 states and 1767 transitions. Second operand has 24 states, 24 states have (on average 4.541666666666667) internal successors, (109), 23 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:10,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:10,382 INFO L93 Difference]: Finished difference Result 2684 states and 2998 transitions. [2022-11-25 23:49:10,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-25 23:49:10,383 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.541666666666667) internal successors, (109), 23 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-11-25 23:49:10,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:10,384 INFO L225 Difference]: With dead ends: 2684 [2022-11-25 23:49:10,385 INFO L226 Difference]: Without dead ends: 1556 [2022-11-25 23:49:10,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2022-11-25 23:49:10,386 INFO L413 NwaCegarLoop]: 457 mSDtfsCounter, 2 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 1964 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 1964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:10,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1132 Invalid, 1964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1964 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 23:49:10,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2022-11-25 23:49:10,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1556. [2022-11-25 23:49:10,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1513 states have (on average 1.146067415730337) internal successors, (1734), 1555 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:10,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 1734 transitions. [2022-11-25 23:49:10,415 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 1734 transitions. Word has length 109 [2022-11-25 23:49:10,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:10,415 INFO L495 AbstractCegarLoop]: Abstraction has 1556 states and 1734 transitions. [2022-11-25 23:49:10,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.541666666666667) internal successors, (109), 23 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:10,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 1734 transitions. [2022-11-25 23:49:10,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-25 23:49:10,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:10,417 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:10,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-25 23:49:10,418 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr307ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:10,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:10,418 INFO L85 PathProgramCache]: Analyzing trace with hash -2011400479, now seen corresponding path program 1 times [2022-11-25 23:49:10,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:10,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738392571] [2022-11-25 23:49:10,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:10,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:10,924 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-25 23:49:10,924 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:10,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738392571] [2022-11-25 23:49:10,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738392571] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:10,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:10,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-11-25 23:49:10,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865662531] [2022-11-25 23:49:10,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:10,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-25 23:49:10,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:10,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-25 23:49:10,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-11-25 23:49:10,927 INFO L87 Difference]: Start difference. First operand 1556 states and 1734 transitions. Second operand has 25 states, 25 states have (on average 4.52) internal successors, (113), 24 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:11,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:11,787 INFO L93 Difference]: Finished difference Result 2630 states and 2937 transitions. [2022-11-25 23:49:11,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-25 23:49:11,788 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.52) internal successors, (113), 24 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2022-11-25 23:49:11,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:11,790 INFO L225 Difference]: With dead ends: 2630 [2022-11-25 23:49:11,791 INFO L226 Difference]: Without dead ends: 1527 [2022-11-25 23:49:11,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-11-25 23:49:11,793 INFO L413 NwaCegarLoop]: 447 mSDtfsCounter, 2 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:11,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 975 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 23:49:11,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2022-11-25 23:49:11,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1527. [2022-11-25 23:49:11,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1527 states, 1485 states have (on average 1.1454545454545455) internal successors, (1701), 1526 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:11,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 1701 transitions. [2022-11-25 23:49:11,823 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 1701 transitions. Word has length 113 [2022-11-25 23:49:11,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:11,824 INFO L495 AbstractCegarLoop]: Abstraction has 1527 states and 1701 transitions. [2022-11-25 23:49:11,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.52) internal successors, (113), 24 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:11,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 1701 transitions. [2022-11-25 23:49:11,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-25 23:49:11,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:11,826 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:11,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-25 23:49:11,826 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr303ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:11,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:11,827 INFO L85 PathProgramCache]: Analyzing trace with hash -190605782, now seen corresponding path program 1 times [2022-11-25 23:49:11,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:11,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301487534] [2022-11-25 23:49:11,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:11,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:12,409 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-25 23:49:12,409 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:12,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301487534] [2022-11-25 23:49:12,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301487534] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:12,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:12,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-11-25 23:49:12,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138104933] [2022-11-25 23:49:12,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:12,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 23:49:12,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:12,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 23:49:12,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2022-11-25 23:49:12,412 INFO L87 Difference]: Start difference. First operand 1527 states and 1701 transitions. Second operand has 26 states, 26 states have (on average 4.5) internal successors, (117), 25 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:13,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:13,140 INFO L93 Difference]: Finished difference Result 2576 states and 2876 transitions. [2022-11-25 23:49:13,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-25 23:49:13,141 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.5) internal successors, (117), 25 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2022-11-25 23:49:13,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:13,143 INFO L225 Difference]: With dead ends: 2576 [2022-11-25 23:49:13,144 INFO L226 Difference]: Without dead ends: 1498 [2022-11-25 23:49:13,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2022-11-25 23:49:13,146 INFO L413 NwaCegarLoop]: 437 mSDtfsCounter, 2 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:13,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 824 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:49:13,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2022-11-25 23:49:13,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1498. [2022-11-25 23:49:13,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1457 states have (on average 1.1448181194234728) internal successors, (1668), 1497 states have internal predecessors, (1668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:13,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1668 transitions. [2022-11-25 23:49:13,173 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 1668 transitions. Word has length 117 [2022-11-25 23:49:13,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:13,174 INFO L495 AbstractCegarLoop]: Abstraction has 1498 states and 1668 transitions. [2022-11-25 23:49:13,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.5) internal successors, (117), 25 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:13,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1668 transitions. [2022-11-25 23:49:13,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-11-25 23:49:13,175 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:13,175 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:13,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-25 23:49:13,176 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr299ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:13,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:13,176 INFO L85 PathProgramCache]: Analyzing trace with hash -2006661709, now seen corresponding path program 1 times [2022-11-25 23:49:13,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:13,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916550773] [2022-11-25 23:49:13,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:13,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:13,736 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-25 23:49:13,736 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:13,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916550773] [2022-11-25 23:49:13,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916550773] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:13,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:13,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-11-25 23:49:13,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336493751] [2022-11-25 23:49:13,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:13,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-25 23:49:13,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:13,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-25 23:49:13,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2022-11-25 23:49:13,738 INFO L87 Difference]: Start difference. First operand 1498 states and 1668 transitions. Second operand has 27 states, 27 states have (on average 4.481481481481482) internal successors, (121), 26 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:14,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:14,435 INFO L93 Difference]: Finished difference Result 2522 states and 2815 transitions. [2022-11-25 23:49:14,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-25 23:49:14,436 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.481481481481482) internal successors, (121), 26 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-11-25 23:49:14,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:14,438 INFO L225 Difference]: With dead ends: 2522 [2022-11-25 23:49:14,438 INFO L226 Difference]: Without dead ends: 1469 [2022-11-25 23:49:14,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2022-11-25 23:49:14,440 INFO L413 NwaCegarLoop]: 427 mSDtfsCounter, 2 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:14,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 805 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:49:14,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2022-11-25 23:49:14,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1469. [2022-11-25 23:49:14,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 1429 states have (on average 1.1441567529741077) internal successors, (1635), 1468 states have internal predecessors, (1635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:14,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 1635 transitions. [2022-11-25 23:49:14,468 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 1635 transitions. Word has length 121 [2022-11-25 23:49:14,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:14,469 INFO L495 AbstractCegarLoop]: Abstraction has 1469 states and 1635 transitions. [2022-11-25 23:49:14,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.481481481481482) internal successors, (121), 26 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:14,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 1635 transitions. [2022-11-25 23:49:14,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-11-25 23:49:14,470 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:14,471 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:14,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-25 23:49:14,471 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr295ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:14,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:14,472 INFO L85 PathProgramCache]: Analyzing trace with hash -77732484, now seen corresponding path program 1 times [2022-11-25 23:49:14,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:14,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115825545] [2022-11-25 23:49:14,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:14,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:15,093 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-25 23:49:15,093 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:15,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115825545] [2022-11-25 23:49:15,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115825545] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:15,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:15,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-11-25 23:49:15,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936398962] [2022-11-25 23:49:15,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:15,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-25 23:49:15,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:15,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 23:49:15,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2022-11-25 23:49:15,096 INFO L87 Difference]: Start difference. First operand 1469 states and 1635 transitions. Second operand has 28 states, 28 states have (on average 4.464285714285714) internal successors, (125), 27 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:15,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:15,844 INFO L93 Difference]: Finished difference Result 2468 states and 2754 transitions. [2022-11-25 23:49:15,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-25 23:49:15,844 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.464285714285714) internal successors, (125), 27 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2022-11-25 23:49:15,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:15,846 INFO L225 Difference]: With dead ends: 2468 [2022-11-25 23:49:15,847 INFO L226 Difference]: Without dead ends: 1440 [2022-11-25 23:49:15,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2022-11-25 23:49:15,849 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 2 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 1569 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:15,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 909 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1569 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:49:15,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2022-11-25 23:49:15,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1440. [2022-11-25 23:49:15,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 1401 states have (on average 1.1434689507494646) internal successors, (1602), 1439 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:15,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 1602 transitions. [2022-11-25 23:49:15,875 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 1602 transitions. Word has length 125 [2022-11-25 23:49:15,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:15,876 INFO L495 AbstractCegarLoop]: Abstraction has 1440 states and 1602 transitions. [2022-11-25 23:49:15,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.464285714285714) internal successors, (125), 27 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:15,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 1602 transitions. [2022-11-25 23:49:15,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-11-25 23:49:15,877 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:15,878 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:15,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-25 23:49:15,878 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr291ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:15,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:15,879 INFO L85 PathProgramCache]: Analyzing trace with hash 329045381, now seen corresponding path program 1 times [2022-11-25 23:49:15,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:15,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445856150] [2022-11-25 23:49:15,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:15,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:16,488 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-25 23:49:16,489 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:16,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445856150] [2022-11-25 23:49:16,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445856150] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:16,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:16,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-11-25 23:49:16,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025336813] [2022-11-25 23:49:16,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:16,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-25 23:49:16,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:16,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 23:49:16,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2022-11-25 23:49:16,491 INFO L87 Difference]: Start difference. First operand 1440 states and 1602 transitions. Second operand has 29 states, 29 states have (on average 4.448275862068965) internal successors, (129), 28 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:17,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:17,170 INFO L93 Difference]: Finished difference Result 2414 states and 2693 transitions. [2022-11-25 23:49:17,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-25 23:49:17,171 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.448275862068965) internal successors, (129), 28 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2022-11-25 23:49:17,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:17,173 INFO L225 Difference]: With dead ends: 2414 [2022-11-25 23:49:17,173 INFO L226 Difference]: Without dead ends: 1411 [2022-11-25 23:49:17,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2022-11-25 23:49:17,175 INFO L413 NwaCegarLoop]: 407 mSDtfsCounter, 2 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 1349 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:17,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 767 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1349 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:49:17,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2022-11-25 23:49:17,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1411. [2022-11-25 23:49:17,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1411 states, 1373 states have (on average 1.1427530954115077) internal successors, (1569), 1410 states have internal predecessors, (1569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:17,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1569 transitions. [2022-11-25 23:49:17,202 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1569 transitions. Word has length 129 [2022-11-25 23:49:17,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:17,203 INFO L495 AbstractCegarLoop]: Abstraction has 1411 states and 1569 transitions. [2022-11-25 23:49:17,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.448275862068965) internal successors, (129), 28 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:17,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1569 transitions. [2022-11-25 23:49:17,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-11-25 23:49:17,205 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:17,205 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:17,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-25 23:49:17,205 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr287ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:17,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:17,206 INFO L85 PathProgramCache]: Analyzing trace with hash 490698190, now seen corresponding path program 1 times [2022-11-25 23:49:17,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:17,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234223889] [2022-11-25 23:49:17,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:17,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:17,831 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-25 23:49:17,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:17,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234223889] [2022-11-25 23:49:17,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234223889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:17,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:17,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-11-25 23:49:17,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146214578] [2022-11-25 23:49:17,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:17,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-25 23:49:17,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:17,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-25 23:49:17,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2022-11-25 23:49:17,834 INFO L87 Difference]: Start difference. First operand 1411 states and 1569 transitions. Second operand has 30 states, 30 states have (on average 4.433333333333334) internal successors, (133), 29 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:18,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:18,789 INFO L93 Difference]: Finished difference Result 2360 states and 2632 transitions. [2022-11-25 23:49:18,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-25 23:49:18,790 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.433333333333334) internal successors, (133), 29 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2022-11-25 23:49:18,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:18,791 INFO L225 Difference]: With dead ends: 2360 [2022-11-25 23:49:18,791 INFO L226 Difference]: Without dead ends: 1382 [2022-11-25 23:49:18,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2022-11-25 23:49:18,792 INFO L413 NwaCegarLoop]: 397 mSDtfsCounter, 2 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 2159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 2159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:18,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1099 Invalid, 2159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2159 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 23:49:18,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2022-11-25 23:49:18,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1382. [2022-11-25 23:49:18,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1382 states, 1345 states have (on average 1.142007434944238) internal successors, (1536), 1381 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:18,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1536 transitions. [2022-11-25 23:49:18,816 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1536 transitions. Word has length 133 [2022-11-25 23:49:18,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:18,817 INFO L495 AbstractCegarLoop]: Abstraction has 1382 states and 1536 transitions. [2022-11-25 23:49:18,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.433333333333334) internal successors, (133), 29 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:18,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1536 transitions. [2022-11-25 23:49:18,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-25 23:49:18,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:18,819 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:18,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-25 23:49:18,819 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr283ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:18,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:18,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1651746391, now seen corresponding path program 1 times [2022-11-25 23:49:18,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:18,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515845802] [2022-11-25 23:49:18,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:18,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:19,565 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-25 23:49:19,566 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:19,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515845802] [2022-11-25 23:49:19,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515845802] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:19,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:19,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-11-25 23:49:19,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115414964] [2022-11-25 23:49:19,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:19,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-25 23:49:19,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:19,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-25 23:49:19,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2022-11-25 23:49:19,568 INFO L87 Difference]: Start difference. First operand 1382 states and 1536 transitions. Second operand has 31 states, 31 states have (on average 4.419354838709677) internal successors, (137), 30 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:20,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:20,231 INFO L93 Difference]: Finished difference Result 2306 states and 2571 transitions. [2022-11-25 23:49:20,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-25 23:49:20,231 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.419354838709677) internal successors, (137), 30 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2022-11-25 23:49:20,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:20,234 INFO L225 Difference]: With dead ends: 2306 [2022-11-25 23:49:20,234 INFO L226 Difference]: Without dead ends: 1353 [2022-11-25 23:49:20,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2022-11-25 23:49:20,236 INFO L413 NwaCegarLoop]: 387 mSDtfsCounter, 2 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:20,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 729 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:49:20,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2022-11-25 23:49:20,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1353. [2022-11-25 23:49:20,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1317 states have (on average 1.14123006833713) internal successors, (1503), 1352 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:20,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1503 transitions. [2022-11-25 23:49:20,261 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1503 transitions. Word has length 137 [2022-11-25 23:49:20,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:20,261 INFO L495 AbstractCegarLoop]: Abstraction has 1353 states and 1503 transitions. [2022-11-25 23:49:20,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.419354838709677) internal successors, (137), 30 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:20,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1503 transitions. [2022-11-25 23:49:20,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-25 23:49:20,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:20,263 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:20,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-25 23:49:20,264 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr279ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:20,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:20,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1552464096, now seen corresponding path program 1 times [2022-11-25 23:49:20,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:20,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300911550] [2022-11-25 23:49:20,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:20,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:21,025 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-25 23:49:21,025 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:21,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300911550] [2022-11-25 23:49:21,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300911550] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:21,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:21,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-11-25 23:49:21,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063134296] [2022-11-25 23:49:21,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:21,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-25 23:49:21,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:21,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-25 23:49:21,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2022-11-25 23:49:21,027 INFO L87 Difference]: Start difference. First operand 1353 states and 1503 transitions. Second operand has 32 states, 32 states have (on average 4.40625) internal successors, (141), 31 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:21,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:21,774 INFO L93 Difference]: Finished difference Result 2252 states and 2510 transitions. [2022-11-25 23:49:21,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-25 23:49:21,775 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.40625) internal successors, (141), 31 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2022-11-25 23:49:21,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:21,777 INFO L225 Difference]: With dead ends: 2252 [2022-11-25 23:49:21,777 INFO L226 Difference]: Without dead ends: 1324 [2022-11-25 23:49:21,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2022-11-25 23:49:21,779 INFO L413 NwaCegarLoop]: 377 mSDtfsCounter, 2 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 1501 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:21,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 821 Invalid, 1501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1501 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:49:21,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2022-11-25 23:49:21,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1324. [2022-11-25 23:49:21,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 1289 states have (on average 1.1404189294026377) internal successors, (1470), 1323 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:21,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1470 transitions. [2022-11-25 23:49:21,797 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1470 transitions. Word has length 141 [2022-11-25 23:49:21,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:21,797 INFO L495 AbstractCegarLoop]: Abstraction has 1324 states and 1470 transitions. [2022-11-25 23:49:21,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.40625) internal successors, (141), 31 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:21,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1470 transitions. [2022-11-25 23:49:21,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-25 23:49:21,799 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:21,799 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:21,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-25 23:49:21,800 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr275ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:21,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:21,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1902626775, now seen corresponding path program 1 times [2022-11-25 23:49:21,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:21,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92026477] [2022-11-25 23:49:21,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:21,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:22,644 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-25 23:49:22,644 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:22,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92026477] [2022-11-25 23:49:22,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92026477] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:22,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:22,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-11-25 23:49:22,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150216115] [2022-11-25 23:49:22,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:22,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-25 23:49:22,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:22,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-25 23:49:22,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2022-11-25 23:49:22,646 INFO L87 Difference]: Start difference. First operand 1324 states and 1470 transitions. Second operand has 33 states, 33 states have (on average 4.393939393939394) internal successors, (145), 32 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:23,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:23,411 INFO L93 Difference]: Finished difference Result 2198 states and 2449 transitions. [2022-11-25 23:49:23,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-25 23:49:23,411 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.393939393939394) internal successors, (145), 32 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2022-11-25 23:49:23,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:23,413 INFO L225 Difference]: With dead ends: 2198 [2022-11-25 23:49:23,413 INFO L226 Difference]: Without dead ends: 1295 [2022-11-25 23:49:23,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2022-11-25 23:49:23,415 INFO L413 NwaCegarLoop]: 367 mSDtfsCounter, 2 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:23,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 799 Invalid, 1573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:49:23,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2022-11-25 23:49:23,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1295. [2022-11-25 23:49:23,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1295 states, 1261 states have (on average 1.1395717684377478) internal successors, (1437), 1294 states have internal predecessors, (1437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:23,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1437 transitions. [2022-11-25 23:49:23,438 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1437 transitions. Word has length 145 [2022-11-25 23:49:23,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:23,439 INFO L495 AbstractCegarLoop]: Abstraction has 1295 states and 1437 transitions. [2022-11-25 23:49:23,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.393939393939394) internal successors, (145), 32 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:23,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1437 transitions. [2022-11-25 23:49:23,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-11-25 23:49:23,440 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:23,440 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:23,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-25 23:49:23,441 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr271ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:23,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:23,442 INFO L85 PathProgramCache]: Analyzing trace with hash 942954866, now seen corresponding path program 1 times [2022-11-25 23:49:23,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:23,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961285399] [2022-11-25 23:49:23,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:23,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:24,252 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-25 23:49:24,252 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:24,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961285399] [2022-11-25 23:49:24,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961285399] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:24,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:24,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-11-25 23:49:24,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980872449] [2022-11-25 23:49:24,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:24,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-25 23:49:24,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:24,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-25 23:49:24,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2022-11-25 23:49:24,259 INFO L87 Difference]: Start difference. First operand 1295 states and 1437 transitions. Second operand has 34 states, 34 states have (on average 4.382352941176471) internal successors, (149), 33 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:24,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:24,815 INFO L93 Difference]: Finished difference Result 2144 states and 2388 transitions. [2022-11-25 23:49:24,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-25 23:49:24,815 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.382352941176471) internal successors, (149), 33 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2022-11-25 23:49:24,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:24,817 INFO L225 Difference]: With dead ends: 2144 [2022-11-25 23:49:24,817 INFO L226 Difference]: Without dead ends: 1266 [2022-11-25 23:49:24,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2022-11-25 23:49:24,819 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 2 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:24,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 567 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:49:24,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2022-11-25 23:49:24,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1266. [2022-11-25 23:49:24,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1233 states have (on average 1.1386861313868613) internal successors, (1404), 1265 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:24,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1404 transitions. [2022-11-25 23:49:24,840 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1404 transitions. Word has length 149 [2022-11-25 23:49:24,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:24,840 INFO L495 AbstractCegarLoop]: Abstraction has 1266 states and 1404 transitions. [2022-11-25 23:49:24,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.382352941176471) internal successors, (149), 33 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:24,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1404 transitions. [2022-11-25 23:49:24,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-11-25 23:49:24,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:24,842 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:24,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-25 23:49:24,842 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr267ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:24,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:24,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1833334021, now seen corresponding path program 1 times [2022-11-25 23:49:24,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:24,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123492586] [2022-11-25 23:49:24,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:24,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:25,700 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-25 23:49:25,700 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:25,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123492586] [2022-11-25 23:49:25,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123492586] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:25,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:25,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-11-25 23:49:25,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124491576] [2022-11-25 23:49:25,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:25,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-25 23:49:25,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:25,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-25 23:49:25,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2022-11-25 23:49:25,703 INFO L87 Difference]: Start difference. First operand 1266 states and 1404 transitions. Second operand has 35 states, 35 states have (on average 4.371428571428571) internal successors, (153), 34 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:26,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:26,413 INFO L93 Difference]: Finished difference Result 2090 states and 2327 transitions. [2022-11-25 23:49:26,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-25 23:49:26,414 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.371428571428571) internal successors, (153), 34 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2022-11-25 23:49:26,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:26,415 INFO L225 Difference]: With dead ends: 2090 [2022-11-25 23:49:26,415 INFO L226 Difference]: Without dead ends: 1237 [2022-11-25 23:49:26,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2022-11-25 23:49:26,416 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 2 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:26,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 755 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:49:26,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2022-11-25 23:49:26,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1237. [2022-11-25 23:49:26,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1205 states have (on average 1.137759336099585) internal successors, (1371), 1236 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:26,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1371 transitions. [2022-11-25 23:49:26,433 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1371 transitions. Word has length 153 [2022-11-25 23:49:26,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:26,434 INFO L495 AbstractCegarLoop]: Abstraction has 1237 states and 1371 transitions. [2022-11-25 23:49:26,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.371428571428571) internal successors, (153), 34 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:26,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1371 transitions. [2022-11-25 23:49:26,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-11-25 23:49:26,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:26,436 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:26,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-25 23:49:26,436 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr263ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:26,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:26,437 INFO L85 PathProgramCache]: Analyzing trace with hash -425349948, now seen corresponding path program 1 times [2022-11-25 23:49:26,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:26,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631685024] [2022-11-25 23:49:26,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:26,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:27,286 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-25 23:49:27,286 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:27,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631685024] [2022-11-25 23:49:27,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631685024] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:27,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:27,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-11-25 23:49:27,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632048935] [2022-11-25 23:49:27,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:27,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-25 23:49:27,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:27,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-25 23:49:27,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2022-11-25 23:49:27,291 INFO L87 Difference]: Start difference. First operand 1237 states and 1371 transitions. Second operand has 36 states, 36 states have (on average 4.361111111111111) internal successors, (157), 35 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:28,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:28,039 INFO L93 Difference]: Finished difference Result 2036 states and 2266 transitions. [2022-11-25 23:49:28,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-25 23:49:28,040 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.361111111111111) internal successors, (157), 35 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2022-11-25 23:49:28,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:28,041 INFO L225 Difference]: With dead ends: 2036 [2022-11-25 23:49:28,041 INFO L226 Difference]: Without dead ends: 1208 [2022-11-25 23:49:28,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2022-11-25 23:49:28,043 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 2 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 1505 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:28,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 733 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1505 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:49:28,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2022-11-25 23:49:28,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1208. [2022-11-25 23:49:28,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 1177 states have (on average 1.1367884451996602) internal successors, (1338), 1207 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:28,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1338 transitions. [2022-11-25 23:49:28,057 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1338 transitions. Word has length 157 [2022-11-25 23:49:28,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:28,058 INFO L495 AbstractCegarLoop]: Abstraction has 1208 states and 1338 transitions. [2022-11-25 23:49:28,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.361111111111111) internal successors, (157), 35 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:28,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1338 transitions. [2022-11-25 23:49:28,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-11-25 23:49:28,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:28,059 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:28,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-25 23:49:28,059 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr259ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:28,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:28,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1250336461, now seen corresponding path program 1 times [2022-11-25 23:49:28,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:28,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016079766] [2022-11-25 23:49:28,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:28,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:28,978 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-25 23:49:28,978 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:28,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016079766] [2022-11-25 23:49:28,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016079766] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:28,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:28,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-11-25 23:49:28,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952964092] [2022-11-25 23:49:28,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:28,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-25 23:49:28,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:28,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-25 23:49:28,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2022-11-25 23:49:28,986 INFO L87 Difference]: Start difference. First operand 1208 states and 1338 transitions. Second operand has 37 states, 37 states have (on average 4.351351351351352) internal successors, (161), 36 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:29,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:29,699 INFO L93 Difference]: Finished difference Result 1982 states and 2205 transitions. [2022-11-25 23:49:29,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-25 23:49:29,699 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 4.351351351351352) internal successors, (161), 36 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2022-11-25 23:49:29,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:29,701 INFO L225 Difference]: With dead ends: 1982 [2022-11-25 23:49:29,701 INFO L226 Difference]: Without dead ends: 1179 [2022-11-25 23:49:29,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2022-11-25 23:49:29,703 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 2 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 1513 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:29,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 711 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1513 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:49:29,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2022-11-25 23:49:29,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1179. [2022-11-25 23:49:29,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 1149 states have (on average 1.1357702349869452) internal successors, (1305), 1178 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:29,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1305 transitions. [2022-11-25 23:49:29,718 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1305 transitions. Word has length 161 [2022-11-25 23:49:29,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:29,718 INFO L495 AbstractCegarLoop]: Abstraction has 1179 states and 1305 transitions. [2022-11-25 23:49:29,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.351351351351352) internal successors, (161), 36 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:29,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1305 transitions. [2022-11-25 23:49:29,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-11-25 23:49:29,720 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:29,720 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:29,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-25 23:49:29,720 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr255ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:29,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:29,721 INFO L85 PathProgramCache]: Analyzing trace with hash 452608278, now seen corresponding path program 1 times [2022-11-25 23:49:29,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:29,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731308546] [2022-11-25 23:49:29,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:29,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:30,732 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-25 23:49:30,733 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:30,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731308546] [2022-11-25 23:49:30,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731308546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:30,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:30,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-11-25 23:49:30,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277945717] [2022-11-25 23:49:30,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:30,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-25 23:49:30,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:30,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-25 23:49:30,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2022-11-25 23:49:30,735 INFO L87 Difference]: Start difference. First operand 1179 states and 1305 transitions. Second operand has 38 states, 38 states have (on average 4.342105263157895) internal successors, (165), 37 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:31,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:31,488 INFO L93 Difference]: Finished difference Result 1928 states and 2144 transitions. [2022-11-25 23:49:31,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-25 23:49:31,488 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 4.342105263157895) internal successors, (165), 37 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-11-25 23:49:31,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:31,489 INFO L225 Difference]: With dead ends: 1928 [2022-11-25 23:49:31,489 INFO L226 Difference]: Without dead ends: 1150 [2022-11-25 23:49:31,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2022-11-25 23:49:31,491 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 2 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:31,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 689 Invalid, 1577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:49:31,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2022-11-25 23:49:31,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1150. [2022-11-25 23:49:31,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 1121 states have (on average 1.134701159678858) internal successors, (1272), 1149 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:31,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1272 transitions. [2022-11-25 23:49:31,511 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1272 transitions. Word has length 165 [2022-11-25 23:49:31,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:31,511 INFO L495 AbstractCegarLoop]: Abstraction has 1150 states and 1272 transitions. [2022-11-25 23:49:31,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.342105263157895) internal successors, (165), 37 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:31,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1272 transitions. [2022-11-25 23:49:31,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-25 23:49:31,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:31,513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:31,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-25 23:49:31,514 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr251ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:31,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:31,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1924035487, now seen corresponding path program 1 times [2022-11-25 23:49:31,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:31,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472598850] [2022-11-25 23:49:31,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:31,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:32,498 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-25 23:49:32,498 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:32,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472598850] [2022-11-25 23:49:32,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472598850] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:32,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:32,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-11-25 23:49:32,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161956235] [2022-11-25 23:49:32,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:32,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-25 23:49:32,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:32,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-25 23:49:32,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2022-11-25 23:49:32,502 INFO L87 Difference]: Start difference. First operand 1150 states and 1272 transitions. Second operand has 39 states, 39 states have (on average 4.333333333333333) internal successors, (169), 38 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:33,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:33,728 INFO L93 Difference]: Finished difference Result 1874 states and 2083 transitions. [2022-11-25 23:49:33,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-25 23:49:33,729 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 4.333333333333333) internal successors, (169), 38 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2022-11-25 23:49:33,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:33,731 INFO L225 Difference]: With dead ends: 1874 [2022-11-25 23:49:33,731 INFO L226 Difference]: Without dead ends: 1121 [2022-11-25 23:49:33,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2022-11-25 23:49:33,733 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 2 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 2755 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:33,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1117 Invalid, 2755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2755 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-25 23:49:33,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2022-11-25 23:49:33,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1121. [2022-11-25 23:49:33,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1093 states have (on average 1.1335773101555353) internal successors, (1239), 1120 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:33,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1239 transitions. [2022-11-25 23:49:33,757 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1239 transitions. Word has length 169 [2022-11-25 23:49:33,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:33,757 INFO L495 AbstractCegarLoop]: Abstraction has 1121 states and 1239 transitions. [2022-11-25 23:49:33,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.333333333333333) internal successors, (169), 38 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:33,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1239 transitions. [2022-11-25 23:49:33,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-11-25 23:49:33,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:33,760 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:33,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-25 23:49:33,760 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr247ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:33,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:33,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1570695576, now seen corresponding path program 1 times [2022-11-25 23:49:33,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:33,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449535802] [2022-11-25 23:49:33,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:33,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:35,069 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-25 23:49:35,070 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:35,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449535802] [2022-11-25 23:49:35,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449535802] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:35,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:35,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-11-25 23:49:35,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437478307] [2022-11-25 23:49:35,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:35,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-25 23:49:35,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:35,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-25 23:49:35,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2022-11-25 23:49:35,073 INFO L87 Difference]: Start difference. First operand 1121 states and 1239 transitions. Second operand has 40 states, 40 states have (on average 4.325) internal successors, (173), 39 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:35,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:35,803 INFO L93 Difference]: Finished difference Result 1820 states and 2022 transitions. [2022-11-25 23:49:35,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-25 23:49:35,803 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 4.325) internal successors, (173), 39 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173 [2022-11-25 23:49:35,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:35,805 INFO L225 Difference]: With dead ends: 1820 [2022-11-25 23:49:35,805 INFO L226 Difference]: Without dead ends: 1092 [2022-11-25 23:49:35,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2022-11-25 23:49:35,808 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 2 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:35,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 471 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:49:35,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2022-11-25 23:49:35,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1092. [2022-11-25 23:49:35,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1065 states have (on average 1.1323943661971831) internal successors, (1206), 1091 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:35,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1206 transitions. [2022-11-25 23:49:35,822 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1206 transitions. Word has length 173 [2022-11-25 23:49:35,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:35,822 INFO L495 AbstractCegarLoop]: Abstraction has 1092 states and 1206 transitions. [2022-11-25 23:49:35,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.325) internal successors, (173), 39 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:35,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1206 transitions. [2022-11-25 23:49:35,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-11-25 23:49:35,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:35,824 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:35,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-25 23:49:35,824 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr243ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:35,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:35,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1461712527, now seen corresponding path program 1 times [2022-11-25 23:49:35,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:35,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085834350] [2022-11-25 23:49:35,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:35,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:36,983 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-25 23:49:36,984 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:36,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085834350] [2022-11-25 23:49:36,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085834350] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:36,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:36,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-11-25 23:49:36,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043368512] [2022-11-25 23:49:36,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:36,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-25 23:49:36,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:36,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-25 23:49:36,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2022-11-25 23:49:36,987 INFO L87 Difference]: Start difference. First operand 1092 states and 1206 transitions. Second operand has 41 states, 41 states have (on average 4.317073170731708) internal successors, (177), 40 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:37,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:37,685 INFO L93 Difference]: Finished difference Result 1766 states and 1961 transitions. [2022-11-25 23:49:37,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-25 23:49:37,686 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 4.317073170731708) internal successors, (177), 40 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 177 [2022-11-25 23:49:37,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:37,687 INFO L225 Difference]: With dead ends: 1766 [2022-11-25 23:49:37,687 INFO L226 Difference]: Without dead ends: 1063 [2022-11-25 23:49:37,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2022-11-25 23:49:37,689 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 2 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:37,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 623 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:49:37,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2022-11-25 23:49:37,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1063. [2022-11-25 23:49:37,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 1037 states have (on average 1.1311475409836065) internal successors, (1173), 1062 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:37,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1173 transitions. [2022-11-25 23:49:37,706 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1173 transitions. Word has length 177 [2022-11-25 23:49:37,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:37,706 INFO L495 AbstractCegarLoop]: Abstraction has 1063 states and 1173 transitions. [2022-11-25 23:49:37,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.317073170731708) internal successors, (177), 40 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:37,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1173 transitions. [2022-11-25 23:49:37,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-11-25 23:49:37,708 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:37,708 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:37,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-25 23:49:37,709 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr239ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:37,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:37,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1425462086, now seen corresponding path program 1 times [2022-11-25 23:49:37,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:37,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304313990] [2022-11-25 23:49:37,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:37,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:38,937 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-25 23:49:38,938 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:38,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304313990] [2022-11-25 23:49:38,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304313990] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:38,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:38,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-11-25 23:49:38,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739158912] [2022-11-25 23:49:38,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:38,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-25 23:49:38,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:38,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-25 23:49:38,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2022-11-25 23:49:38,941 INFO L87 Difference]: Start difference. First operand 1063 states and 1173 transitions. Second operand has 42 states, 42 states have (on average 4.309523809523809) internal successors, (181), 41 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:39,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:39,678 INFO L93 Difference]: Finished difference Result 1712 states and 1900 transitions. [2022-11-25 23:49:39,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-25 23:49:39,678 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 4.309523809523809) internal successors, (181), 41 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 181 [2022-11-25 23:49:39,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:39,680 INFO L225 Difference]: With dead ends: 1712 [2022-11-25 23:49:39,680 INFO L226 Difference]: Without dead ends: 1034 [2022-11-25 23:49:39,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2022-11-25 23:49:39,682 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 2 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:39,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 601 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:49:39,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2022-11-25 23:49:39,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2022-11-25 23:49:39,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1009 states have (on average 1.1298315163528245) internal successors, (1140), 1033 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:39,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1140 transitions. [2022-11-25 23:49:39,694 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1140 transitions. Word has length 181 [2022-11-25 23:49:39,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:39,694 INFO L495 AbstractCegarLoop]: Abstraction has 1034 states and 1140 transitions. [2022-11-25 23:49:39,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.309523809523809) internal successors, (181), 41 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:39,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1140 transitions. [2022-11-25 23:49:39,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-11-25 23:49:39,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:39,696 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:39,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-25 23:49:39,696 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr235ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:39,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:39,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1808425027, now seen corresponding path program 1 times [2022-11-25 23:49:39,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:39,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812818938] [2022-11-25 23:49:39,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:39,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:40,935 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-25 23:49:40,935 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:40,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812818938] [2022-11-25 23:49:40,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812818938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:40,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:40,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-11-25 23:49:40,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545160103] [2022-11-25 23:49:40,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:40,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-25 23:49:40,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:40,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-25 23:49:40,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2022-11-25 23:49:40,938 INFO L87 Difference]: Start difference. First operand 1034 states and 1140 transitions. Second operand has 43 states, 43 states have (on average 4.3023255813953485) internal successors, (185), 42 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:41,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:41,713 INFO L93 Difference]: Finished difference Result 1658 states and 1839 transitions. [2022-11-25 23:49:41,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-25 23:49:41,714 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 4.3023255813953485) internal successors, (185), 42 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 185 [2022-11-25 23:49:41,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:41,715 INFO L225 Difference]: With dead ends: 1658 [2022-11-25 23:49:41,715 INFO L226 Difference]: Without dead ends: 1005 [2022-11-25 23:49:41,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2022-11-25 23:49:41,717 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 2 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:41,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 657 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:49:41,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2022-11-25 23:49:41,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 1005. [2022-11-25 23:49:41,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 981 states have (on average 1.128440366972477) internal successors, (1107), 1004 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:41,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1107 transitions. [2022-11-25 23:49:41,729 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1107 transitions. Word has length 185 [2022-11-25 23:49:41,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:41,730 INFO L495 AbstractCegarLoop]: Abstraction has 1005 states and 1107 transitions. [2022-11-25 23:49:41,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 4.3023255813953485) internal successors, (185), 42 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:41,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1107 transitions. [2022-11-25 23:49:41,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-11-25 23:49:41,731 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:41,732 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:41,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-25 23:49:41,732 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr231ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:41,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:41,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1004436468, now seen corresponding path program 1 times [2022-11-25 23:49:41,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:41,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868782958] [2022-11-25 23:49:41,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:41,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:43,051 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-25 23:49:43,052 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:43,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868782958] [2022-11-25 23:49:43,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868782958] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:43,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:43,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-11-25 23:49:43,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773355432] [2022-11-25 23:49:43,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:43,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-25 23:49:43,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:43,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-25 23:49:43,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2022-11-25 23:49:43,055 INFO L87 Difference]: Start difference. First operand 1005 states and 1107 transitions. Second operand has 44 states, 44 states have (on average 4.295454545454546) internal successors, (189), 43 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:43,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:43,974 INFO L93 Difference]: Finished difference Result 1604 states and 1778 transitions. [2022-11-25 23:49:43,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-25 23:49:43,974 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 4.295454545454546) internal successors, (189), 43 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 189 [2022-11-25 23:49:43,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:43,976 INFO L225 Difference]: With dead ends: 1604 [2022-11-25 23:49:43,976 INFO L226 Difference]: Without dead ends: 976 [2022-11-25 23:49:43,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2022-11-25 23:49:43,978 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 2 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 2095 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 2095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:43,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 707 Invalid, 2095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2095 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 23:49:43,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2022-11-25 23:49:43,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2022-11-25 23:49:43,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 953 states have (on average 1.1269674711437565) internal successors, (1074), 975 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:43,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1074 transitions. [2022-11-25 23:49:43,992 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1074 transitions. Word has length 189 [2022-11-25 23:49:43,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:43,993 INFO L495 AbstractCegarLoop]: Abstraction has 976 states and 1074 transitions. [2022-11-25 23:49:43,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 4.295454545454546) internal successors, (189), 43 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:43,993 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1074 transitions. [2022-11-25 23:49:43,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-11-25 23:49:43,995 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:43,995 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:43,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-11-25 23:49:43,995 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr227ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:43,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:43,996 INFO L85 PathProgramCache]: Analyzing trace with hash 454850581, now seen corresponding path program 1 times [2022-11-25 23:49:43,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:43,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209411725] [2022-11-25 23:49:43,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:43,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:45,511 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-25 23:49:45,511 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:45,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209411725] [2022-11-25 23:49:45,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209411725] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:45,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:45,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-11-25 23:49:45,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83449520] [2022-11-25 23:49:45,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:45,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-25 23:49:45,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:45,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-25 23:49:45,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2022-11-25 23:49:45,514 INFO L87 Difference]: Start difference. First operand 976 states and 1074 transitions. Second operand has 45 states, 45 states have (on average 4.288888888888889) internal successors, (193), 44 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:46,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:46,092 INFO L93 Difference]: Finished difference Result 1550 states and 1717 transitions. [2022-11-25 23:49:46,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-25 23:49:46,093 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 4.288888888888889) internal successors, (193), 44 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 193 [2022-11-25 23:49:46,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:46,094 INFO L225 Difference]: With dead ends: 1550 [2022-11-25 23:49:46,094 INFO L226 Difference]: Without dead ends: 947 [2022-11-25 23:49:46,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2022-11-25 23:49:46,096 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 2 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:46,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 391 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:49:46,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2022-11-25 23:49:46,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 947. [2022-11-25 23:49:46,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 925 states have (on average 1.1254054054054055) internal successors, (1041), 946 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:46,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1041 transitions. [2022-11-25 23:49:46,110 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1041 transitions. Word has length 193 [2022-11-25 23:49:46,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:46,111 INFO L495 AbstractCegarLoop]: Abstraction has 947 states and 1041 transitions. [2022-11-25 23:49:46,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 4.288888888888889) internal successors, (193), 44 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:46,111 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1041 transitions. [2022-11-25 23:49:46,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-11-25 23:49:46,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:46,112 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:46,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-11-25 23:49:46,112 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr223ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:46,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:46,112 INFO L85 PathProgramCache]: Analyzing trace with hash -572973986, now seen corresponding path program 1 times [2022-11-25 23:49:46,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:46,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170297193] [2022-11-25 23:49:46,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:46,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:47,564 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-25 23:49:47,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:47,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170297193] [2022-11-25 23:49:47,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170297193] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:47,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:47,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-11-25 23:49:47,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644877675] [2022-11-25 23:49:47,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:47,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-25 23:49:47,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:47,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-25 23:49:47,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2022-11-25 23:49:47,567 INFO L87 Difference]: Start difference. First operand 947 states and 1041 transitions. Second operand has 46 states, 46 states have (on average 4.282608695652174) internal successors, (197), 45 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:48,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:48,289 INFO L93 Difference]: Finished difference Result 1496 states and 1656 transitions. [2022-11-25 23:49:48,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-25 23:49:48,290 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.282608695652174) internal successors, (197), 45 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 197 [2022-11-25 23:49:48,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:48,291 INFO L225 Difference]: With dead ends: 1496 [2022-11-25 23:49:48,291 INFO L226 Difference]: Without dead ends: 918 [2022-11-25 23:49:48,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2022-11-25 23:49:48,292 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 2 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 1518 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:48,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 582 Invalid, 1518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1518 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:49:48,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2022-11-25 23:49:48,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 918. [2022-11-25 23:49:48,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 897 states have (on average 1.1237458193979932) internal successors, (1008), 917 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:48,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1008 transitions. [2022-11-25 23:49:48,301 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1008 transitions. Word has length 197 [2022-11-25 23:49:48,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:48,302 INFO L495 AbstractCegarLoop]: Abstraction has 918 states and 1008 transitions. [2022-11-25 23:49:48,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 4.282608695652174) internal successors, (197), 45 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:48,302 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1008 transitions. [2022-11-25 23:49:48,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-11-25 23:49:48,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:48,303 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:48,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-11-25 23:49:48,304 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr219ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:48,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:48,304 INFO L85 PathProgramCache]: Analyzing trace with hash -142257945, now seen corresponding path program 1 times [2022-11-25 23:49:48,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:48,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665692066] [2022-11-25 23:49:48,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:48,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:49,701 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-25 23:49:49,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:49,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665692066] [2022-11-25 23:49:49,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665692066] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:49,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:49,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-11-25 23:49:49,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458177738] [2022-11-25 23:49:49,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:49,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-25 23:49:49,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:49,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-25 23:49:49,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2022-11-25 23:49:49,704 INFO L87 Difference]: Start difference. First operand 918 states and 1008 transitions. Second operand has 47 states, 47 states have (on average 4.276595744680851) internal successors, (201), 46 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:50,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:50,381 INFO L93 Difference]: Finished difference Result 1442 states and 1595 transitions. [2022-11-25 23:49:50,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-25 23:49:50,382 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 4.276595744680851) internal successors, (201), 46 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 201 [2022-11-25 23:49:50,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:50,383 INFO L225 Difference]: With dead ends: 1442 [2022-11-25 23:49:50,383 INFO L226 Difference]: Without dead ends: 889 [2022-11-25 23:49:50,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2022-11-25 23:49:50,385 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 2 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:50,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 491 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1409 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:49:50,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2022-11-25 23:49:50,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 889. [2022-11-25 23:49:50,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 869 states have (on average 1.1219792865362486) internal successors, (975), 888 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:50,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 975 transitions. [2022-11-25 23:49:50,398 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 975 transitions. Word has length 201 [2022-11-25 23:49:50,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:50,398 INFO L495 AbstractCegarLoop]: Abstraction has 889 states and 975 transitions. [2022-11-25 23:49:50,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 4.276595744680851) internal successors, (201), 46 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:50,399 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 975 transitions. [2022-11-25 23:49:50,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-11-25 23:49:50,400 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:50,400 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:50,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-11-25 23:49:50,401 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr215ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:50,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:50,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1230960048, now seen corresponding path program 1 times [2022-11-25 23:49:50,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:50,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046148924] [2022-11-25 23:49:50,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:50,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:51,785 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-25 23:49:51,786 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:51,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046148924] [2022-11-25 23:49:51,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046148924] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:51,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:51,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-11-25 23:49:51,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82060352] [2022-11-25 23:49:51,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:51,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-25 23:49:51,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:51,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-25 23:49:51,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2022-11-25 23:49:51,788 INFO L87 Difference]: Start difference. First operand 889 states and 975 transitions. Second operand has 48 states, 48 states have (on average 4.270833333333333) internal successors, (205), 47 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:52,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:52,478 INFO L93 Difference]: Finished difference Result 1388 states and 1534 transitions. [2022-11-25 23:49:52,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-25 23:49:52,479 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 4.270833333333333) internal successors, (205), 47 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2022-11-25 23:49:52,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:52,480 INFO L225 Difference]: With dead ends: 1388 [2022-11-25 23:49:52,480 INFO L226 Difference]: Without dead ends: 860 [2022-11-25 23:49:52,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2022-11-25 23:49:52,481 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 2 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:52,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 532 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1436 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:49:52,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-11-25 23:49:52,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 860. [2022-11-25 23:49:52,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 841 states have (on average 1.1200951248513675) internal successors, (942), 859 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:52,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 942 transitions. [2022-11-25 23:49:52,493 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 942 transitions. Word has length 205 [2022-11-25 23:49:52,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:52,493 INFO L495 AbstractCegarLoop]: Abstraction has 860 states and 942 transitions. [2022-11-25 23:49:52,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 4.270833333333333) internal successors, (205), 47 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:52,493 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 942 transitions. [2022-11-25 23:49:52,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-11-25 23:49:52,494 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:52,495 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:52,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-11-25 23:49:52,495 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr211ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:52,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:52,495 INFO L85 PathProgramCache]: Analyzing trace with hash 582216377, now seen corresponding path program 1 times [2022-11-25 23:49:52,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:52,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617912611] [2022-11-25 23:49:52,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:52,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:53,941 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-25 23:49:53,941 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:53,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617912611] [2022-11-25 23:49:53,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617912611] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:53,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:53,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-11-25 23:49:53,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520961764] [2022-11-25 23:49:53,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:53,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-25 23:49:53,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:53,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-25 23:49:53,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-11-25 23:49:53,945 INFO L87 Difference]: Start difference. First operand 860 states and 942 transitions. Second operand has 49 states, 49 states have (on average 4.26530612244898) internal successors, (209), 48 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:54,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:54,800 INFO L93 Difference]: Finished difference Result 1334 states and 1473 transitions. [2022-11-25 23:49:54,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-11-25 23:49:54,801 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 4.26530612244898) internal successors, (209), 48 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 209 [2022-11-25 23:49:54,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:54,802 INFO L225 Difference]: With dead ends: 1334 [2022-11-25 23:49:54,802 INFO L226 Difference]: Without dead ends: 831 [2022-11-25 23:49:54,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-11-25 23:49:54,804 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 2 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 1913 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:54,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 567 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1913 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 23:49:54,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2022-11-25 23:49:54,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 831. [2022-11-25 23:49:54,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 813 states have (on average 1.118081180811808) internal successors, (909), 830 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:54,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 909 transitions. [2022-11-25 23:49:54,815 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 909 transitions. Word has length 209 [2022-11-25 23:49:54,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:54,815 INFO L495 AbstractCegarLoop]: Abstraction has 831 states and 909 transitions. [2022-11-25 23:49:54,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 4.26530612244898) internal successors, (209), 48 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:54,816 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 909 transitions. [2022-11-25 23:49:54,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-11-25 23:49:54,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:54,817 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:54,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-11-25 23:49:54,817 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr207ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:54,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:54,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1193144318, now seen corresponding path program 1 times [2022-11-25 23:49:54,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:54,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815661455] [2022-11-25 23:49:54,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:54,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:56,374 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-25 23:49:56,374 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:56,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815661455] [2022-11-25 23:49:56,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815661455] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:56,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:56,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-11-25 23:49:56,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771638246] [2022-11-25 23:49:56,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:56,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-25 23:49:56,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:56,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-25 23:49:56,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2022-11-25 23:49:56,377 INFO L87 Difference]: Start difference. First operand 831 states and 909 transitions. Second operand has 50 states, 50 states have (on average 4.26) internal successors, (213), 49 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:56,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:56,990 INFO L93 Difference]: Finished difference Result 1280 states and 1412 transitions. [2022-11-25 23:49:56,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-25 23:49:56,990 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.26) internal successors, (213), 49 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 213 [2022-11-25 23:49:56,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:56,991 INFO L225 Difference]: With dead ends: 1280 [2022-11-25 23:49:56,991 INFO L226 Difference]: Without dead ends: 802 [2022-11-25 23:49:56,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2022-11-25 23:49:56,993 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 2 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:56,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 368 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:49:56,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-11-25 23:49:57,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 802. [2022-11-25 23:49:57,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 785 states have (on average 1.1159235668789809) internal successors, (876), 801 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:57,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 876 transitions. [2022-11-25 23:49:57,007 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 876 transitions. Word has length 213 [2022-11-25 23:49:57,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:57,007 INFO L495 AbstractCegarLoop]: Abstraction has 802 states and 876 transitions. [2022-11-25 23:49:57,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.26) internal successors, (213), 49 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:57,008 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 876 transitions. [2022-11-25 23:49:57,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-11-25 23:49:57,009 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:57,009 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:57,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-11-25 23:49:57,010 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr203ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:57,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:57,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1621670517, now seen corresponding path program 1 times [2022-11-25 23:49:57,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:57,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056111223] [2022-11-25 23:49:57,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:57,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:49:58,497 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-25 23:49:58,497 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:49:58,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056111223] [2022-11-25 23:49:58,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056111223] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:49:58,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:49:58,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-11-25 23:49:58,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958428134] [2022-11-25 23:49:58,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:49:58,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-25 23:49:58,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:58,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-25 23:49:58,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2022-11-25 23:49:58,500 INFO L87 Difference]: Start difference. First operand 802 states and 876 transitions. Second operand has 51 states, 51 states have (on average 4.254901960784314) internal successors, (217), 50 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:59,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:59,208 INFO L93 Difference]: Finished difference Result 1226 states and 1351 transitions. [2022-11-25 23:49:59,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-25 23:49:59,209 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 4.254901960784314) internal successors, (217), 50 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 217 [2022-11-25 23:49:59,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:59,210 INFO L225 Difference]: With dead ends: 1226 [2022-11-25 23:49:59,210 INFO L226 Difference]: Without dead ends: 773 [2022-11-25 23:49:59,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2022-11-25 23:49:59,211 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 2 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 1491 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:59,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 457 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1491 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:49:59,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2022-11-25 23:49:59,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 773. [2022-11-25 23:49:59,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 757 states have (on average 1.1136063408190224) internal successors, (843), 772 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:59,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 843 transitions. [2022-11-25 23:49:59,220 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 843 transitions. Word has length 217 [2022-11-25 23:49:59,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:59,220 INFO L495 AbstractCegarLoop]: Abstraction has 773 states and 843 transitions. [2022-11-25 23:49:59,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 4.254901960784314) internal successors, (217), 50 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:49:59,220 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 843 transitions. [2022-11-25 23:49:59,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-11-25 23:49:59,221 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:49:59,222 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:49:59,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-11-25 23:49:59,222 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr199ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:49:59,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:49:59,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1066494804, now seen corresponding path program 1 times [2022-11-25 23:49:59,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:49:59,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897755655] [2022-11-25 23:49:59,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:49:59,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:49:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:00,700 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-25 23:50:00,701 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:00,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897755655] [2022-11-25 23:50:00,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897755655] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:00,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:00,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-11-25 23:50:00,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915600322] [2022-11-25 23:50:00,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:00,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-25 23:50:00,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:00,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-25 23:50:00,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2022-11-25 23:50:00,703 INFO L87 Difference]: Start difference. First operand 773 states and 843 transitions. Second operand has 52 states, 52 states have (on average 4.25) internal successors, (221), 51 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:01,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:01,377 INFO L93 Difference]: Finished difference Result 1172 states and 1290 transitions. [2022-11-25 23:50:01,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-25 23:50:01,378 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 4.25) internal successors, (221), 51 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 221 [2022-11-25 23:50:01,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:01,379 INFO L225 Difference]: With dead ends: 1172 [2022-11-25 23:50:01,379 INFO L226 Difference]: Without dead ends: 744 [2022-11-25 23:50:01,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2022-11-25 23:50:01,381 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 20 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:01,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 345 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1389 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:50:01,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2022-11-25 23:50:01,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2022-11-25 23:50:01,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 729 states have (on average 1.1111111111111112) internal successors, (810), 743 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:01,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 810 transitions. [2022-11-25 23:50:01,393 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 810 transitions. Word has length 221 [2022-11-25 23:50:01,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:01,393 INFO L495 AbstractCegarLoop]: Abstraction has 744 states and 810 transitions. [2022-11-25 23:50:01,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 4.25) internal successors, (221), 51 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:01,393 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 810 transitions. [2022-11-25 23:50:01,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-11-25 23:50:01,395 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:01,395 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:50:01,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-11-25 23:50:01,395 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr195ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:50:01,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:01,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1360945501, now seen corresponding path program 1 times [2022-11-25 23:50:01,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:01,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169120275] [2022-11-25 23:50:01,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:01,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:01,502 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-25 23:50:01,502 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:01,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169120275] [2022-11-25 23:50:01,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169120275] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:01,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:01,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:50:01,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087865602] [2022-11-25 23:50:01,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:01,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:50:01,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:01,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:50:01,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:50:01,505 INFO L87 Difference]: Start difference. First operand 744 states and 810 transitions. Second operand has 6 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:01,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:01,710 INFO L93 Difference]: Finished difference Result 870 states and 950 transitions. [2022-11-25 23:50:01,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:50:01,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2022-11-25 23:50:01,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:01,712 INFO L225 Difference]: With dead ends: 870 [2022-11-25 23:50:01,712 INFO L226 Difference]: Without dead ends: 855 [2022-11-25 23:50:01,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:50:01,713 INFO L413 NwaCegarLoop]: 340 mSDtfsCounter, 997 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:01,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [997 Valid, 774 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:50:01,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2022-11-25 23:50:01,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2022-11-25 23:50:01,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 841 states have (on average 1.1117717003567182) internal successors, (935), 854 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:01,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 935 transitions. [2022-11-25 23:50:01,751 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 935 transitions. Word has length 225 [2022-11-25 23:50:01,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:01,751 INFO L495 AbstractCegarLoop]: Abstraction has 855 states and 935 transitions. [2022-11-25 23:50:01,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:01,752 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 935 transitions. [2022-11-25 23:50:01,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2022-11-25 23:50:01,753 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:01,753 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:50:01,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-11-25 23:50:01,754 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr191ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:50:01,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:01,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1571940027, now seen corresponding path program 1 times [2022-11-25 23:50:01,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:01,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204502932] [2022-11-25 23:50:01,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:01,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:01,862 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-25 23:50:01,862 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:01,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204502932] [2022-11-25 23:50:01,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204502932] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:01,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:01,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:50:01,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222353860] [2022-11-25 23:50:01,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:01,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 23:50:01,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:01,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 23:50:01,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:50:01,865 INFO L87 Difference]: Start difference. First operand 855 states and 935 transitions. Second operand has 7 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:02,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:02,120 INFO L93 Difference]: Finished difference Result 972 states and 1065 transitions. [2022-11-25 23:50:02,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:50:02,127 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 231 [2022-11-25 23:50:02,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:02,128 INFO L225 Difference]: With dead ends: 972 [2022-11-25 23:50:02,129 INFO L226 Difference]: Without dead ends: 958 [2022-11-25 23:50:02,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:50:02,129 INFO L413 NwaCegarLoop]: 339 mSDtfsCounter, 725 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:02,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 864 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:50:02,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2022-11-25 23:50:02,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 958. [2022-11-25 23:50:02,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 945 states have (on average 1.1121693121693121) internal successors, (1051), 957 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:02,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1051 transitions. [2022-11-25 23:50:02,140 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1051 transitions. Word has length 231 [2022-11-25 23:50:02,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:02,140 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1051 transitions. [2022-11-25 23:50:02,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:02,141 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1051 transitions. [2022-11-25 23:50:02,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-11-25 23:50:02,142 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:02,142 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:50:02,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-11-25 23:50:02,142 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr187ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:50:02,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:02,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1955725470, now seen corresponding path program 1 times [2022-11-25 23:50:02,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:02,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559897361] [2022-11-25 23:50:02,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:02,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:02,291 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-25 23:50:02,292 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:02,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559897361] [2022-11-25 23:50:02,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559897361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:02,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:02,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 23:50:02,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513555434] [2022-11-25 23:50:02,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:02,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 23:50:02,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:02,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 23:50:02,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:50:02,294 INFO L87 Difference]: Start difference. First operand 958 states and 1051 transitions. Second operand has 8 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:02,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:02,569 INFO L93 Difference]: Finished difference Result 1066 states and 1171 transitions. [2022-11-25 23:50:02,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:50:02,569 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 237 [2022-11-25 23:50:02,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:02,572 INFO L225 Difference]: With dead ends: 1066 [2022-11-25 23:50:02,572 INFO L226 Difference]: Without dead ends: 1053 [2022-11-25 23:50:02,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:50:02,574 INFO L413 NwaCegarLoop]: 338 mSDtfsCounter, 1427 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1427 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:02,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1427 Valid, 947 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:50:02,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2022-11-25 23:50:02,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1053. [2022-11-25 23:50:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 1041 states have (on average 1.1123919308357348) internal successors, (1158), 1052 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:02,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1158 transitions. [2022-11-25 23:50:02,591 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1158 transitions. Word has length 237 [2022-11-25 23:50:02,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:02,592 INFO L495 AbstractCegarLoop]: Abstraction has 1053 states and 1158 transitions. [2022-11-25 23:50:02,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:02,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1158 transitions. [2022-11-25 23:50:02,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-11-25 23:50:02,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:02,594 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:50:02,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-11-25 23:50:02,595 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr183ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:50:02,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:02,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1509994350, now seen corresponding path program 1 times [2022-11-25 23:50:02,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:02,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776576780] [2022-11-25 23:50:02,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:02,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:02,799 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-25 23:50:02,799 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:02,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776576780] [2022-11-25 23:50:02,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776576780] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:02,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:02,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 23:50:02,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126101917] [2022-11-25 23:50:02,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:02,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 23:50:02,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:02,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 23:50:02,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:50:02,801 INFO L87 Difference]: Start difference. First operand 1053 states and 1158 transitions. Second operand has 9 states, 8 states have (on average 30.375) internal successors, (243), 8 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:03,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:03,144 INFO L93 Difference]: Finished difference Result 1152 states and 1268 transitions. [2022-11-25 23:50:03,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:50:03,145 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 30.375) internal successors, (243), 8 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 243 [2022-11-25 23:50:03,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:03,146 INFO L225 Difference]: With dead ends: 1152 [2022-11-25 23:50:03,146 INFO L226 Difference]: Without dead ends: 1140 [2022-11-25 23:50:03,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:50:03,147 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 1025 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:03,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 1023 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:50:03,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2022-11-25 23:50:03,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1140. [2022-11-25 23:50:03,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1129 states have (on average 1.112488928255093) internal successors, (1256), 1139 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:03,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1256 transitions. [2022-11-25 23:50:03,166 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1256 transitions. Word has length 243 [2022-11-25 23:50:03,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:03,166 INFO L495 AbstractCegarLoop]: Abstraction has 1140 states and 1256 transitions. [2022-11-25 23:50:03,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 30.375) internal successors, (243), 8 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:03,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1256 transitions. [2022-11-25 23:50:03,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-11-25 23:50:03,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:03,169 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:50:03,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-11-25 23:50:03,169 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr179ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:50:03,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:03,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1512992885, now seen corresponding path program 1 times [2022-11-25 23:50:03,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:03,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862038275] [2022-11-25 23:50:03,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:03,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:03,367 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-25 23:50:03,367 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:03,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862038275] [2022-11-25 23:50:03,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862038275] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:03,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:03,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 23:50:03,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330968894] [2022-11-25 23:50:03,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:03,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:50:03,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:03,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:50:03,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:50:03,369 INFO L87 Difference]: Start difference. First operand 1140 states and 1256 transitions. Second operand has 10 states, 9 states have (on average 27.666666666666668) internal successors, (249), 9 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:03,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:03,721 INFO L93 Difference]: Finished difference Result 1230 states and 1356 transitions. [2022-11-25 23:50:03,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:50:03,721 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 27.666666666666668) internal successors, (249), 9 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 249 [2022-11-25 23:50:03,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:03,723 INFO L225 Difference]: With dead ends: 1230 [2022-11-25 23:50:03,723 INFO L226 Difference]: Without dead ends: 1219 [2022-11-25 23:50:03,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:50:03,724 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 1568 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1568 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:03,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1568 Valid, 1092 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:50:03,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2022-11-25 23:50:03,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1219. [2022-11-25 23:50:03,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 1209 states have (on average 1.1124896608767576) internal successors, (1345), 1218 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:03,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1345 transitions. [2022-11-25 23:50:03,738 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1345 transitions. Word has length 249 [2022-11-25 23:50:03,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:03,739 INFO L495 AbstractCegarLoop]: Abstraction has 1219 states and 1345 transitions. [2022-11-25 23:50:03,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 27.666666666666668) internal successors, (249), 9 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:03,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1345 transitions. [2022-11-25 23:50:03,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2022-11-25 23:50:03,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:03,741 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:50:03,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-11-25 23:50:03,742 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr175ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:50:03,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:03,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1216577933, now seen corresponding path program 1 times [2022-11-25 23:50:03,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:03,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595413211] [2022-11-25 23:50:03,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:03,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:03,979 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-25 23:50:03,979 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:03,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595413211] [2022-11-25 23:50:03,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595413211] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:03,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:03,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 23:50:03,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051526096] [2022-11-25 23:50:03,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:03,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 23:50:03,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:03,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 23:50:03,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-11-25 23:50:03,982 INFO L87 Difference]: Start difference. First operand 1219 states and 1345 transitions. Second operand has 11 states, 10 states have (on average 25.5) internal successors, (255), 10 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:04,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:04,398 INFO L93 Difference]: Finished difference Result 1300 states and 1435 transitions. [2022-11-25 23:50:04,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 23:50:04,399 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 25.5) internal successors, (255), 10 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 255 [2022-11-25 23:50:04,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:04,401 INFO L225 Difference]: With dead ends: 1300 [2022-11-25 23:50:04,401 INFO L226 Difference]: Without dead ends: 1290 [2022-11-25 23:50:04,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-11-25 23:50:04,402 INFO L413 NwaCegarLoop]: 335 mSDtfsCounter, 1683 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1683 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:04,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1683 Valid, 1154 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:50:04,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2022-11-25 23:50:04,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2022-11-25 23:50:04,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 1281 states have (on average 1.1124121779859484) internal successors, (1425), 1289 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:04,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1425 transitions. [2022-11-25 23:50:04,422 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1425 transitions. Word has length 255 [2022-11-25 23:50:04,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:04,423 INFO L495 AbstractCegarLoop]: Abstraction has 1290 states and 1425 transitions. [2022-11-25 23:50:04,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 25.5) internal successors, (255), 10 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:04,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1425 transitions. [2022-11-25 23:50:04,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2022-11-25 23:50:04,426 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:04,426 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:50:04,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-11-25 23:50:04,427 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr171ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:50:04,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:04,427 INFO L85 PathProgramCache]: Analyzing trace with hash -2107966504, now seen corresponding path program 1 times [2022-11-25 23:50:04,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:04,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467400442] [2022-11-25 23:50:04,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:04,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:04,643 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-25 23:50:04,643 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:04,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467400442] [2022-11-25 23:50:04,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467400442] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:04,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:04,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 23:50:04,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301424424] [2022-11-25 23:50:04,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:04,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 23:50:04,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:04,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 23:50:04,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-11-25 23:50:04,646 INFO L87 Difference]: Start difference. First operand 1290 states and 1425 transitions. Second operand has 12 states, 11 states have (on average 23.727272727272727) internal successors, (261), 11 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:05,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:05,052 INFO L93 Difference]: Finished difference Result 1362 states and 1505 transitions. [2022-11-25 23:50:05,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 23:50:05,052 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 23.727272727272727) internal successors, (261), 11 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 261 [2022-11-25 23:50:05,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:05,053 INFO L225 Difference]: With dead ends: 1362 [2022-11-25 23:50:05,054 INFO L226 Difference]: Without dead ends: 1353 [2022-11-25 23:50:05,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-11-25 23:50:05,054 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 2111 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2111 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:05,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2111 Valid, 1209 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:50:05,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2022-11-25 23:50:05,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1353. [2022-11-25 23:50:05,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1345 states have (on average 1.112267657992565) internal successors, (1496), 1352 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:05,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1496 transitions. [2022-11-25 23:50:05,079 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1496 transitions. Word has length 261 [2022-11-25 23:50:05,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:05,079 INFO L495 AbstractCegarLoop]: Abstraction has 1353 states and 1496 transitions. [2022-11-25 23:50:05,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 23.727272727272727) internal successors, (261), 11 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:05,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1496 transitions. [2022-11-25 23:50:05,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-11-25 23:50:05,081 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:05,081 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:50:05,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-11-25 23:50:05,082 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr167ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:50:05,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:05,082 INFO L85 PathProgramCache]: Analyzing trace with hash 146334636, now seen corresponding path program 1 times [2022-11-25 23:50:05,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:05,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693376516] [2022-11-25 23:50:05,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:05,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:05,285 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-25 23:50:05,285 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:05,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693376516] [2022-11-25 23:50:05,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693376516] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:05,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:05,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 23:50:05,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491481120] [2022-11-25 23:50:05,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:05,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 23:50:05,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:05,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 23:50:05,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:50:05,288 INFO L87 Difference]: Start difference. First operand 1353 states and 1496 transitions. Second operand has 13 states, 12 states have (on average 22.25) internal successors, (267), 12 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:05,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:05,716 INFO L93 Difference]: Finished difference Result 1416 states and 1566 transitions. [2022-11-25 23:50:05,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 23:50:05,716 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 22.25) internal successors, (267), 12 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 267 [2022-11-25 23:50:05,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:05,718 INFO L225 Difference]: With dead ends: 1416 [2022-11-25 23:50:05,718 INFO L226 Difference]: Without dead ends: 1408 [2022-11-25 23:50:05,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:50:05,719 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 1940 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1940 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:05,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1940 Valid, 1257 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:50:05,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2022-11-25 23:50:05,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1408. [2022-11-25 23:50:05,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1408 states, 1401 states have (on average 1.1120628122769451) internal successors, (1558), 1407 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:05,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 1558 transitions. [2022-11-25 23:50:05,737 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 1558 transitions. Word has length 267 [2022-11-25 23:50:05,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:05,738 INFO L495 AbstractCegarLoop]: Abstraction has 1408 states and 1558 transitions. [2022-11-25 23:50:05,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 22.25) internal successors, (267), 12 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:05,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1558 transitions. [2022-11-25 23:50:05,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2022-11-25 23:50:05,740 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:05,741 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:50:05,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-11-25 23:50:05,741 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr163ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:50:05,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:05,742 INFO L85 PathProgramCache]: Analyzing trace with hash 898444873, now seen corresponding path program 1 times [2022-11-25 23:50:05,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:05,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146926791] [2022-11-25 23:50:05,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:05,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:06,009 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:06,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146926791] [2022-11-25 23:50:06,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146926791] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:06,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:06,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 23:50:06,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212731271] [2022-11-25 23:50:06,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:06,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 23:50:06,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:06,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 23:50:06,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2022-11-25 23:50:06,011 INFO L87 Difference]: Start difference. First operand 1408 states and 1558 transitions. Second operand has 14 states, 13 states have (on average 21.0) internal successors, (273), 13 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:06,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:06,478 INFO L93 Difference]: Finished difference Result 1462 states and 1618 transitions. [2022-11-25 23:50:06,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 23:50:06,479 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 21.0) internal successors, (273), 13 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 273 [2022-11-25 23:50:06,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:06,481 INFO L225 Difference]: With dead ends: 1462 [2022-11-25 23:50:06,481 INFO L226 Difference]: Without dead ends: 1455 [2022-11-25 23:50:06,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2022-11-25 23:50:06,482 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 2683 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2683 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:06,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2683 Valid, 1298 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:50:06,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2022-11-25 23:50:06,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1455. [2022-11-25 23:50:06,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1455 states, 1449 states have (on average 1.1118012422360248) internal successors, (1611), 1454 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:06,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 1611 transitions. [2022-11-25 23:50:06,506 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 1611 transitions. Word has length 273 [2022-11-25 23:50:06,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:06,506 INFO L495 AbstractCegarLoop]: Abstraction has 1455 states and 1611 transitions. [2022-11-25 23:50:06,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 21.0) internal successors, (273), 13 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:06,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 1611 transitions. [2022-11-25 23:50:06,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-11-25 23:50:06,509 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:06,509 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:50:06,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-11-25 23:50:06,510 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr159ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:50:06,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:06,510 INFO L85 PathProgramCache]: Analyzing trace with hash -2083856145, now seen corresponding path program 1 times [2022-11-25 23:50:06,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:06,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302001667] [2022-11-25 23:50:06,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:06,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:06,847 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-25 23:50:06,847 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:06,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302001667] [2022-11-25 23:50:06,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302001667] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:06,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:06,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-25 23:50:06,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12619139] [2022-11-25 23:50:06,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:06,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 23:50:06,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:06,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 23:50:06,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2022-11-25 23:50:06,850 INFO L87 Difference]: Start difference. First operand 1455 states and 1611 transitions. Second operand has 15 states, 14 states have (on average 19.928571428571427) internal successors, (279), 14 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:07,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:07,316 INFO L93 Difference]: Finished difference Result 1500 states and 1661 transitions. [2022-11-25 23:50:07,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 23:50:07,316 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 19.928571428571427) internal successors, (279), 14 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 279 [2022-11-25 23:50:07,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:07,318 INFO L225 Difference]: With dead ends: 1500 [2022-11-25 23:50:07,318 INFO L226 Difference]: Without dead ends: 1494 [2022-11-25 23:50:07,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2022-11-25 23:50:07,319 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 2345 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2345 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:07,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2345 Valid, 1332 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:50:07,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2022-11-25 23:50:07,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1494. [2022-11-25 23:50:07,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 1489 states have (on average 1.1114842175957018) internal successors, (1655), 1493 states have internal predecessors, (1655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:07,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1655 transitions. [2022-11-25 23:50:07,335 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1655 transitions. Word has length 279 [2022-11-25 23:50:07,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:07,335 INFO L495 AbstractCegarLoop]: Abstraction has 1494 states and 1655 transitions. [2022-11-25 23:50:07,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 19.928571428571427) internal successors, (279), 14 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:07,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1655 transitions. [2022-11-25 23:50:07,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2022-11-25 23:50:07,337 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:07,337 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:50:07,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-11-25 23:50:07,337 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr155ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:50:07,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:07,338 INFO L85 PathProgramCache]: Analyzing trace with hash -455339810, now seen corresponding path program 1 times [2022-11-25 23:50:07,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:07,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097129476] [2022-11-25 23:50:07,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:07,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:07,606 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-25 23:50:07,606 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:07,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097129476] [2022-11-25 23:50:07,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097129476] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:07,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:07,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-25 23:50:07,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254151924] [2022-11-25 23:50:07,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:07,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 23:50:07,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:07,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 23:50:07,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2022-11-25 23:50:07,608 INFO L87 Difference]: Start difference. First operand 1494 states and 1655 transitions. Second operand has 16 states, 15 states have (on average 19.0) internal successors, (285), 15 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:08,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:08,115 INFO L93 Difference]: Finished difference Result 1530 states and 1695 transitions. [2022-11-25 23:50:08,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 23:50:08,116 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 19.0) internal successors, (285), 15 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 285 [2022-11-25 23:50:08,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:08,117 INFO L225 Difference]: With dead ends: 1530 [2022-11-25 23:50:08,118 INFO L226 Difference]: Without dead ends: 1525 [2022-11-25 23:50:08,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2022-11-25 23:50:08,118 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 2605 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2605 SdHoareTripleChecker+Valid, 1359 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:08,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2605 Valid, 1359 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:50:08,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2022-11-25 23:50:08,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1525. [2022-11-25 23:50:08,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1521 states have (on average 1.1111111111111112) internal successors, (1690), 1524 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:08,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 1690 transitions. [2022-11-25 23:50:08,137 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 1690 transitions. Word has length 285 [2022-11-25 23:50:08,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:08,137 INFO L495 AbstractCegarLoop]: Abstraction has 1525 states and 1690 transitions. [2022-11-25 23:50:08,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 19.0) internal successors, (285), 15 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:08,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1690 transitions. [2022-11-25 23:50:08,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2022-11-25 23:50:08,140 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:08,140 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:50:08,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-11-25 23:50:08,141 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr151ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:50:08,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:08,141 INFO L85 PathProgramCache]: Analyzing trace with hash 789963606, now seen corresponding path program 1 times [2022-11-25 23:50:08,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:08,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56843366] [2022-11-25 23:50:08,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:08,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:08,482 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-25 23:50:08,482 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:08,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56843366] [2022-11-25 23:50:08,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56843366] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:08,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:08,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-25 23:50:08,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475304334] [2022-11-25 23:50:08,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:08,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 23:50:08,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:08,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 23:50:08,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2022-11-25 23:50:08,485 INFO L87 Difference]: Start difference. First operand 1525 states and 1690 transitions. Second operand has 17 states, 16 states have (on average 18.1875) internal successors, (291), 16 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:09,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:09,039 INFO L93 Difference]: Finished difference Result 1552 states and 1720 transitions. [2022-11-25 23:50:09,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 23:50:09,040 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 18.1875) internal successors, (291), 16 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 291 [2022-11-25 23:50:09,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:09,041 INFO L225 Difference]: With dead ends: 1552 [2022-11-25 23:50:09,042 INFO L226 Difference]: Without dead ends: 1548 [2022-11-25 23:50:09,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2022-11-25 23:50:09,042 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 3643 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 392 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3643 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 392 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:09,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3643 Valid, 1379 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [392 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:50:09,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2022-11-25 23:50:09,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1548. [2022-11-25 23:50:09,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1548 states, 1545 states have (on average 1.1106796116504853) internal successors, (1716), 1547 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:09,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 1716 transitions. [2022-11-25 23:50:09,068 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 1716 transitions. Word has length 291 [2022-11-25 23:50:09,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:09,068 INFO L495 AbstractCegarLoop]: Abstraction has 1548 states and 1716 transitions. [2022-11-25 23:50:09,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 18.1875) internal successors, (291), 16 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:09,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 1716 transitions. [2022-11-25 23:50:09,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2022-11-25 23:50:09,072 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:09,072 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:50:09,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-11-25 23:50:09,072 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr147ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:50:09,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:09,073 INFO L85 PathProgramCache]: Analyzing trace with hash -450065001, now seen corresponding path program 1 times [2022-11-25 23:50:09,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:09,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119118252] [2022-11-25 23:50:09,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:09,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:09,399 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-25 23:50:09,399 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:09,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119118252] [2022-11-25 23:50:09,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119118252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:09,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:09,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-25 23:50:09,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443946285] [2022-11-25 23:50:09,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:09,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 23:50:09,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:09,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 23:50:09,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:50:09,401 INFO L87 Difference]: Start difference. First operand 1548 states and 1716 transitions. Second operand has 18 states, 17 states have (on average 17.470588235294116) internal successors, (297), 17 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:09,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:09,948 INFO L93 Difference]: Finished difference Result 1566 states and 1736 transitions. [2022-11-25 23:50:09,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 23:50:09,949 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 17.470588235294116) internal successors, (297), 17 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 297 [2022-11-25 23:50:09,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:09,951 INFO L225 Difference]: With dead ends: 1566 [2022-11-25 23:50:09,951 INFO L226 Difference]: Without dead ends: 1563 [2022-11-25 23:50:09,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2022-11-25 23:50:09,952 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 3018 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3018 SdHoareTripleChecker+Valid, 1392 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:09,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3018 Valid, 1392 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:50:09,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2022-11-25 23:50:09,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1563. [2022-11-25 23:50:09,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 1561 states have (on average 1.1101857783472133) internal successors, (1733), 1562 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:09,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 1733 transitions. [2022-11-25 23:50:09,967 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 1733 transitions. Word has length 297 [2022-11-25 23:50:09,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:09,967 INFO L495 AbstractCegarLoop]: Abstraction has 1563 states and 1733 transitions. [2022-11-25 23:50:09,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 17.470588235294116) internal successors, (297), 17 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:09,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1733 transitions. [2022-11-25 23:50:09,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2022-11-25 23:50:09,971 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:09,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:50:09,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-11-25 23:50:09,972 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr143ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:50:09,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:09,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1767418655, now seen corresponding path program 1 times [2022-11-25 23:50:09,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:09,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353065637] [2022-11-25 23:50:09,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:09,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:10,325 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-25 23:50:10,325 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:10,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353065637] [2022-11-25 23:50:10,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353065637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:10,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:10,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-25 23:50:10,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838926944] [2022-11-25 23:50:10,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:10,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 23:50:10,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:10,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 23:50:10,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2022-11-25 23:50:10,327 INFO L87 Difference]: Start difference. First operand 1563 states and 1733 transitions. Second operand has 19 states, 18 states have (on average 16.833333333333332) internal successors, (303), 18 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:10,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:10,862 INFO L93 Difference]: Finished difference Result 1572 states and 1743 transitions. [2022-11-25 23:50:10,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 23:50:10,862 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 16.833333333333332) internal successors, (303), 18 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 303 [2022-11-25 23:50:10,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:10,864 INFO L225 Difference]: With dead ends: 1572 [2022-11-25 23:50:10,864 INFO L226 Difference]: Without dead ends: 1570 [2022-11-25 23:50:10,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2022-11-25 23:50:10,865 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 2273 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2273 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:10,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2273 Valid, 1398 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:50:10,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2022-11-25 23:50:10,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1570. [2022-11-25 23:50:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1569 states have (on average 1.1096239643084767) internal successors, (1741), 1569 states have internal predecessors, (1741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 1741 transitions. [2022-11-25 23:50:10,893 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 1741 transitions. Word has length 303 [2022-11-25 23:50:10,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:10,894 INFO L495 AbstractCegarLoop]: Abstraction has 1570 states and 1741 transitions. [2022-11-25 23:50:10,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 16.833333333333332) internal successors, (303), 18 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:10,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 1741 transitions. [2022-11-25 23:50:10,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2022-11-25 23:50:10,897 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:10,898 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:50:10,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-11-25 23:50:10,898 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:50:10,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:10,899 INFO L85 PathProgramCache]: Analyzing trace with hash 420200367, now seen corresponding path program 1 times [2022-11-25 23:50:10,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:10,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433617811] [2022-11-25 23:50:10,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:10,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:11,419 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-25 23:50:11,419 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:11,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433617811] [2022-11-25 23:50:11,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433617811] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:11,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:11,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-25 23:50:11,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340016731] [2022-11-25 23:50:11,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:11,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-25 23:50:11,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:11,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 23:50:11,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2022-11-25 23:50:11,421 INFO L87 Difference]: Start difference. First operand 1570 states and 1741 transitions. Second operand has 20 states, 19 states have (on average 16.263157894736842) internal successors, (309), 19 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:11,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:11,982 INFO L93 Difference]: Finished difference Result 1579 states and 1751 transitions. [2022-11-25 23:50:11,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 23:50:11,983 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 16.263157894736842) internal successors, (309), 19 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 309 [2022-11-25 23:50:11,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:11,985 INFO L225 Difference]: With dead ends: 1579 [2022-11-25 23:50:11,985 INFO L226 Difference]: Without dead ends: 1578 [2022-11-25 23:50:11,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2022-11-25 23:50:11,986 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 2880 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2880 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:11,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2880 Valid, 1405 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:50:11,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2022-11-25 23:50:12,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1578. [2022-11-25 23:50:12,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1577 states have (on average 1.1097019657577678) internal successors, (1750), 1577 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:12,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 1750 transitions. [2022-11-25 23:50:12,005 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 1750 transitions. Word has length 309 [2022-11-25 23:50:12,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:12,005 INFO L495 AbstractCegarLoop]: Abstraction has 1578 states and 1750 transitions. [2022-11-25 23:50:12,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 16.263157894736842) internal successors, (309), 19 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:12,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 1750 transitions. [2022-11-25 23:50:12,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2022-11-25 23:50:12,007 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:12,008 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:50:12,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-11-25 23:50:12,008 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:50:12,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:12,008 INFO L85 PathProgramCache]: Analyzing trace with hash 641488893, now seen corresponding path program 1 times [2022-11-25 23:50:12,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:12,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673368938] [2022-11-25 23:50:12,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:12,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:12,540 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:12,541 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:12,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673368938] [2022-11-25 23:50:12,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673368938] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:50:12,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566997666] [2022-11-25 23:50:12,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:12,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:50:12,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654de0a8-3841-4d27-b212-acb3a68a3802/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:50:12,543 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654de0a8-3841-4d27-b212-acb3a68a3802/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:50:12,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654de0a8-3841-4d27-b212-acb3a68a3802/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:50:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:12,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-25 23:50:12,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:50:13,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:13,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:50:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:14,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566997666] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:50:14,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [453068833] [2022-11-25 23:50:14,354 INFO L159 IcfgInterpreter]: Started Sifa with 310 locations of interest [2022-11-25 23:50:14,354 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:50:14,365 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:50:14,374 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:50:14,374 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:50:17,202 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:50:26,503 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '280842#(and (= ~__return_1121~0 0) (< 2147483646 |ULTIMATE.start_main_~main__y~0#1|) (= |#NULL.offset| 0) (<= 68 |ULTIMATE.start_main_~main__x~0#1|) (<= 0 |#StackHeapBarrier|) (= ~__return_main~0 0) (= |#NULL.base| 0))' at error location [2022-11-25 23:50:26,503 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:50:26,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:50:26,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 38 [2022-11-25 23:50:26,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105073187] [2022-11-25 23:50:26,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:50:26,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-25 23:50:26,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:26,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-25 23:50:26,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3878, Invalid=12378, Unknown=0, NotChecked=0, Total=16256 [2022-11-25 23:50:26,510 INFO L87 Difference]: Start difference. First operand 1578 states and 1750 transitions. Second operand has 40 states, 39 states have (on average 16.153846153846153) internal successors, (630), 39 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:28,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:28,046 INFO L93 Difference]: Finished difference Result 1739 states and 1950 transitions. [2022-11-25 23:50:28,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-25 23:50:28,046 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 16.153846153846153) internal successors, (630), 39 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 315 [2022-11-25 23:50:28,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:28,048 INFO L225 Difference]: With dead ends: 1739 [2022-11-25 23:50:28,049 INFO L226 Difference]: Without dead ends: 1738 [2022-11-25 23:50:28,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 962 GetRequests, 836 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8561 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=3878, Invalid=12378, Unknown=0, NotChecked=0, Total=16256 [2022-11-25 23:50:28,051 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 4356 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 431 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4356 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 431 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:28,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4356 Valid, 1545 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [431 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:50:28,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2022-11-25 23:50:28,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1738. [2022-11-25 23:50:28,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1737 states have (on average 1.1111111111111112) internal successors, (1930), 1737 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:28,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 1930 transitions. [2022-11-25 23:50:28,083 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 1930 transitions. Word has length 315 [2022-11-25 23:50:28,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:28,084 INFO L495 AbstractCegarLoop]: Abstraction has 1738 states and 1930 transitions. [2022-11-25 23:50:28,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 16.153846153846153) internal successors, (630), 39 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:28,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 1930 transitions. [2022-11-25 23:50:28,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2022-11-25 23:50:28,089 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:28,090 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:50:28,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654de0a8-3841-4d27-b212-acb3a68a3802/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:50:28,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654de0a8-3841-4d27-b212-acb3a68a3802/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:50:28,297 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:50:28,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:28,298 INFO L85 PathProgramCache]: Analyzing trace with hash -735244011, now seen corresponding path program 2 times [2022-11-25 23:50:28,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:28,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628215022] [2022-11-25 23:50:28,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:28,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:29,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1386 backedges. 0 proven. 1386 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:29,935 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:29,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628215022] [2022-11-25 23:50:29,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628215022] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:50:29,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186229093] [2022-11-25 23:50:29,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:50:29,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:50:29,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654de0a8-3841-4d27-b212-acb3a68a3802/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:50:29,944 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654de0a8-3841-4d27-b212-acb3a68a3802/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:50:29,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654de0a8-3841-4d27-b212-acb3a68a3802/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:50:30,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2022-11-25 23:50:30,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:50:30,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-25 23:50:30,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:50:30,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1386 backedges. 0 proven. 1386 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:30,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:50:33,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1386 backedges. 0 proven. 1386 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:33,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186229093] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:50:33,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1612835953] [2022-11-25 23:50:33,654 INFO L159 IcfgInterpreter]: Started Sifa with 310 locations of interest [2022-11-25 23:50:33,655 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:50:33,655 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:50:33,656 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:50:33,656 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:50:36,173 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:50:45,884 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '287573#(and (= ~__return_1121~0 0) (< 2147483646 |ULTIMATE.start_main_~main__y~0#1|) (= |#NULL.offset| 0) (<= 68 |ULTIMATE.start_main_~main__x~0#1|) (<= 0 |#StackHeapBarrier|) (= ~__return_main~0 0) (= |#NULL.base| 0))' at error location [2022-11-25 23:50:45,884 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:50:45,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:50:45,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 78 [2022-11-25 23:50:45,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344230363] [2022-11-25 23:50:45,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:50:45,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-11-25 23:50:45,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:45,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-11-25 23:50:45,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9618, Invalid=18438, Unknown=0, NotChecked=0, Total=28056 [2022-11-25 23:50:45,894 INFO L87 Difference]: Start difference. First operand 1738 states and 1930 transitions. Second operand has 80 states, 79 states have (on average 11.012658227848101) internal successors, (870), 79 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:49,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:49,360 INFO L93 Difference]: Finished difference Result 2059 states and 2330 transitions. [2022-11-25 23:50:49,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-11-25 23:50:49,360 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 79 states have (on average 11.012658227848101) internal successors, (870), 79 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 435 [2022-11-25 23:50:49,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:49,362 INFO L225 Difference]: With dead ends: 2059 [2022-11-25 23:50:49,363 INFO L226 Difference]: Without dead ends: 2058 [2022-11-25 23:50:49,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1342 GetRequests, 1176 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15521 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=9618, Invalid=18438, Unknown=0, NotChecked=0, Total=28056 [2022-11-25 23:50:49,366 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 4067 mSDsluCounter, 1498 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 353 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4067 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:49,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4067 Valid, 1825 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [353 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:50:49,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2022-11-25 23:50:49,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 2058. [2022-11-25 23:50:49,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2058 states, 2057 states have (on average 1.113271754982985) internal successors, (2290), 2057 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:49,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 2290 transitions. [2022-11-25 23:50:49,393 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 2290 transitions. Word has length 435 [2022-11-25 23:50:49,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:49,393 INFO L495 AbstractCegarLoop]: Abstraction has 2058 states and 2290 transitions. [2022-11-25 23:50:49,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 79 states have (on average 11.012658227848101) internal successors, (870), 79 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:49,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 2290 transitions. [2022-11-25 23:50:49,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2022-11-25 23:50:49,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:49,399 INFO L195 NwaCegarLoop]: trace histogram [62, 62, 62, 62, 62, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:50:49,405 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654de0a8-3841-4d27-b212-acb3a68a3802/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:50:49,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654de0a8-3841-4d27-b212-acb3a68a3802/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable72 [2022-11-25 23:50:49,600 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 405 more)] === [2022-11-25 23:50:49,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:49,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1762511685, now seen corresponding path program 3 times [2022-11-25 23:50:49,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:49,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569971697] [2022-11-25 23:50:49,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:49,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:55,308 INFO L134 CoverageAnalysis]: Checked inductivity of 11346 backedges. 0 proven. 11346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:55,308 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:55,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569971697] [2022-11-25 23:50:55,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569971697] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:50:55,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553681582] [2022-11-25 23:50:55,309 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:50:55,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:50:55,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654de0a8-3841-4d27-b212-acb3a68a3802/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:50:55,318 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654de0a8-3841-4d27-b212-acb3a68a3802/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:50:55,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654de0a8-3841-4d27-b212-acb3a68a3802/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:50:55,530 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:50:55,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:50:55,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-25 23:50:55,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:50:59,425 INFO L134 CoverageAnalysis]: Checked inductivity of 11346 backedges. 8938 proven. 0 refuted. 0 times theorem prover too weak. 2408 trivial. 0 not checked. [2022-11-25 23:50:59,425 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:50:59,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553681582] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:59,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:50:59,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [79] total 132 [2022-11-25 23:50:59,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839092875] [2022-11-25 23:50:59,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:59,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-25 23:50:59,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:59,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-25 23:50:59,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4617, Invalid=12675, Unknown=0, NotChecked=0, Total=17292 [2022-11-25 23:50:59,429 INFO L87 Difference]: Start difference. First operand 2058 states and 2290 transitions. Second operand has 53 states, 53 states have (on average 9.60377358490566) internal successors, (509), 53 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:02,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:51:02,356 INFO L93 Difference]: Finished difference Result 3073 states and 3474 transitions. [2022-11-25 23:51:02,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-25 23:51:02,357 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 9.60377358490566) internal successors, (509), 53 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 675 [2022-11-25 23:51:02,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:51:02,357 INFO L225 Difference]: With dead ends: 3073 [2022-11-25 23:51:02,357 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 23:51:02,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 753 GetRequests, 623 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3978 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=4617, Invalid=12675, Unknown=0, NotChecked=0, Total=17292 [2022-11-25 23:51:02,362 INFO L413 NwaCegarLoop]: 696 mSDtfsCounter, 731 mSDsluCounter, 1442 mSDsCounter, 0 mSdLazyCounter, 4966 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 5153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 4966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:51:02,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 2138 Invalid, 5153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 4966 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-25 23:51:02,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 23:51:02,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 23:51:02,363 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-25 23:51:02,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 23:51:02,364 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 675 [2022-11-25 23:51:02,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:51:02,364 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 23:51:02,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 9.60377358490566) internal successors, (509), 53 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:02,365 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 23:51:02,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 23:51:02,368 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (407 of 408 remaining) [2022-11-25 23:51:02,368 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (406 of 408 remaining) [2022-11-25 23:51:02,369 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (405 of 408 remaining) [2022-11-25 23:51:02,369 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (404 of 408 remaining) [2022-11-25 23:51:02,369 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (403 of 408 remaining) [2022-11-25 23:51:02,369 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (402 of 408 remaining) [2022-11-25 23:51:02,369 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (401 of 408 remaining) [2022-11-25 23:51:02,369 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (400 of 408 remaining) [2022-11-25 23:51:02,369 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (399 of 408 remaining) [2022-11-25 23:51:02,370 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (398 of 408 remaining) [2022-11-25 23:51:02,370 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (397 of 408 remaining) [2022-11-25 23:51:02,370 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (396 of 408 remaining) [2022-11-25 23:51:02,370 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (395 of 408 remaining) [2022-11-25 23:51:02,370 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (394 of 408 remaining) [2022-11-25 23:51:02,370 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (393 of 408 remaining) [2022-11-25 23:51:02,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (392 of 408 remaining) [2022-11-25 23:51:02,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (391 of 408 remaining) [2022-11-25 23:51:02,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (390 of 408 remaining) [2022-11-25 23:51:02,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (389 of 408 remaining) [2022-11-25 23:51:02,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (388 of 408 remaining) [2022-11-25 23:51:02,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (387 of 408 remaining) [2022-11-25 23:51:02,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (386 of 408 remaining) [2022-11-25 23:51:02,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (385 of 408 remaining) [2022-11-25 23:51:02,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (384 of 408 remaining) [2022-11-25 23:51:02,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (383 of 408 remaining) [2022-11-25 23:51:02,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (382 of 408 remaining) [2022-11-25 23:51:02,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (381 of 408 remaining) [2022-11-25 23:51:02,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (380 of 408 remaining) [2022-11-25 23:51:02,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (379 of 408 remaining) [2022-11-25 23:51:02,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (378 of 408 remaining) [2022-11-25 23:51:02,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (377 of 408 remaining) [2022-11-25 23:51:02,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (376 of 408 remaining) [2022-11-25 23:51:02,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (375 of 408 remaining) [2022-11-25 23:51:02,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (374 of 408 remaining) [2022-11-25 23:51:02,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (373 of 408 remaining) [2022-11-25 23:51:02,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (372 of 408 remaining) [2022-11-25 23:51:02,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (371 of 408 remaining) [2022-11-25 23:51:02,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (370 of 408 remaining) [2022-11-25 23:51:02,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (369 of 408 remaining) [2022-11-25 23:51:02,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (368 of 408 remaining) [2022-11-25 23:51:02,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (367 of 408 remaining) [2022-11-25 23:51:02,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (366 of 408 remaining) [2022-11-25 23:51:02,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (365 of 408 remaining) [2022-11-25 23:51:02,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (364 of 408 remaining) [2022-11-25 23:51:02,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (363 of 408 remaining) [2022-11-25 23:51:02,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (362 of 408 remaining) [2022-11-25 23:51:02,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (361 of 408 remaining) [2022-11-25 23:51:02,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (360 of 408 remaining) [2022-11-25 23:51:02,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (359 of 408 remaining) [2022-11-25 23:51:02,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (358 of 408 remaining) [2022-11-25 23:51:02,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (357 of 408 remaining) [2022-11-25 23:51:02,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (356 of 408 remaining) [2022-11-25 23:51:02,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (355 of 408 remaining) [2022-11-25 23:51:02,375 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (354 of 408 remaining) [2022-11-25 23:51:02,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (353 of 408 remaining) [2022-11-25 23:51:02,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (352 of 408 remaining) [2022-11-25 23:51:02,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (351 of 408 remaining) [2022-11-25 23:51:02,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (350 of 408 remaining) [2022-11-25 23:51:02,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (349 of 408 remaining) [2022-11-25 23:51:02,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (348 of 408 remaining) [2022-11-25 23:51:02,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (347 of 408 remaining) [2022-11-25 23:51:02,376 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (346 of 408 remaining) [2022-11-25 23:51:02,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (345 of 408 remaining) [2022-11-25 23:51:02,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (344 of 408 remaining) [2022-11-25 23:51:02,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (343 of 408 remaining) [2022-11-25 23:51:02,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (342 of 408 remaining) [2022-11-25 23:51:02,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (341 of 408 remaining) [2022-11-25 23:51:02,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (340 of 408 remaining) [2022-11-25 23:51:02,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (339 of 408 remaining) [2022-11-25 23:51:02,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (338 of 408 remaining) [2022-11-25 23:51:02,378 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (337 of 408 remaining) [2022-11-25 23:51:02,378 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (336 of 408 remaining) [2022-11-25 23:51:02,378 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (335 of 408 remaining) [2022-11-25 23:51:02,378 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (334 of 408 remaining) [2022-11-25 23:51:02,378 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (333 of 408 remaining) [2022-11-25 23:51:02,378 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (332 of 408 remaining) [2022-11-25 23:51:02,378 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (331 of 408 remaining) [2022-11-25 23:51:02,378 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (330 of 408 remaining) [2022-11-25 23:51:02,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (329 of 408 remaining) [2022-11-25 23:51:02,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (328 of 408 remaining) [2022-11-25 23:51:02,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (327 of 408 remaining) [2022-11-25 23:51:02,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (326 of 408 remaining) [2022-11-25 23:51:02,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (325 of 408 remaining) [2022-11-25 23:51:02,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (324 of 408 remaining) [2022-11-25 23:51:02,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (323 of 408 remaining) [2022-11-25 23:51:02,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (322 of 408 remaining) [2022-11-25 23:51:02,380 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (321 of 408 remaining) [2022-11-25 23:51:02,380 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (320 of 408 remaining) [2022-11-25 23:51:02,380 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (319 of 408 remaining) [2022-11-25 23:51:02,380 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (318 of 408 remaining) [2022-11-25 23:51:02,380 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (317 of 408 remaining) [2022-11-25 23:51:02,381 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (316 of 408 remaining) [2022-11-25 23:51:02,381 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (315 of 408 remaining) [2022-11-25 23:51:02,381 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (314 of 408 remaining) [2022-11-25 23:51:02,381 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (313 of 408 remaining) [2022-11-25 23:51:02,381 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (312 of 408 remaining) [2022-11-25 23:51:02,381 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (311 of 408 remaining) [2022-11-25 23:51:02,381 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (310 of 408 remaining) [2022-11-25 23:51:02,382 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW (309 of 408 remaining) [2022-11-25 23:51:02,382 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW (308 of 408 remaining) [2022-11-25 23:51:02,382 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW (307 of 408 remaining) [2022-11-25 23:51:02,382 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW (306 of 408 remaining) [2022-11-25 23:51:02,382 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW (305 of 408 remaining) [2022-11-25 23:51:02,382 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW (304 of 408 remaining) [2022-11-25 23:51:02,382 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr104ASSERT_VIOLATIONINTEGER_OVERFLOW (303 of 408 remaining) [2022-11-25 23:51:02,382 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr105ASSERT_VIOLATIONINTEGER_OVERFLOW (302 of 408 remaining) [2022-11-25 23:51:02,382 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW (301 of 408 remaining) [2022-11-25 23:51:02,383 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW (300 of 408 remaining) [2022-11-25 23:51:02,383 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr108ASSERT_VIOLATIONINTEGER_OVERFLOW (299 of 408 remaining) [2022-11-25 23:51:02,383 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr109ASSERT_VIOLATIONINTEGER_OVERFLOW (298 of 408 remaining) [2022-11-25 23:51:02,383 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW (297 of 408 remaining) [2022-11-25 23:51:02,383 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW (296 of 408 remaining) [2022-11-25 23:51:02,383 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr112ASSERT_VIOLATIONINTEGER_OVERFLOW (295 of 408 remaining) [2022-11-25 23:51:02,383 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr113ASSERT_VIOLATIONINTEGER_OVERFLOW (294 of 408 remaining) [2022-11-25 23:51:02,383 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW (293 of 408 remaining) [2022-11-25 23:51:02,384 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW (292 of 408 remaining) [2022-11-25 23:51:02,384 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW (291 of 408 remaining) [2022-11-25 23:51:02,384 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW (290 of 408 remaining) [2022-11-25 23:51:02,384 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW (289 of 408 remaining) [2022-11-25 23:51:02,384 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW (288 of 408 remaining) [2022-11-25 23:51:02,384 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW (287 of 408 remaining) [2022-11-25 23:51:02,384 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr121ASSERT_VIOLATIONINTEGER_OVERFLOW (286 of 408 remaining) [2022-11-25 23:51:02,384 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr122ASSERT_VIOLATIONINTEGER_OVERFLOW (285 of 408 remaining) [2022-11-25 23:51:02,384 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr123ASSERT_VIOLATIONINTEGER_OVERFLOW (284 of 408 remaining) [2022-11-25 23:51:02,385 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr124ASSERT_VIOLATIONINTEGER_OVERFLOW (283 of 408 remaining) [2022-11-25 23:51:02,385 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr125ASSERT_VIOLATIONINTEGER_OVERFLOW (282 of 408 remaining) [2022-11-25 23:51:02,385 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW (281 of 408 remaining) [2022-11-25 23:51:02,385 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr127ASSERT_VIOLATIONINTEGER_OVERFLOW (280 of 408 remaining) [2022-11-25 23:51:02,385 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr128ASSERT_VIOLATIONINTEGER_OVERFLOW (279 of 408 remaining) [2022-11-25 23:51:02,385 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr129ASSERT_VIOLATIONINTEGER_OVERFLOW (278 of 408 remaining) [2022-11-25 23:51:02,385 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW (277 of 408 remaining) [2022-11-25 23:51:02,385 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr131ASSERT_VIOLATIONINTEGER_OVERFLOW (276 of 408 remaining) [2022-11-25 23:51:02,386 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr132ASSERT_VIOLATIONINTEGER_OVERFLOW (275 of 408 remaining) [2022-11-25 23:51:02,386 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr133ASSERT_VIOLATIONINTEGER_OVERFLOW (274 of 408 remaining) [2022-11-25 23:51:02,386 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW (273 of 408 remaining) [2022-11-25 23:51:02,386 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr135ASSERT_VIOLATIONINTEGER_OVERFLOW (272 of 408 remaining) [2022-11-25 23:51:02,386 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW (271 of 408 remaining) [2022-11-25 23:51:02,387 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW (270 of 408 remaining) [2022-11-25 23:51:02,387 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr138ASSERT_VIOLATIONINTEGER_OVERFLOW (269 of 408 remaining) [2022-11-25 23:51:02,387 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW (268 of 408 remaining) [2022-11-25 23:51:02,387 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr140ASSERT_VIOLATIONINTEGER_OVERFLOW (267 of 408 remaining) [2022-11-25 23:51:02,387 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr141ASSERT_VIOLATIONINTEGER_OVERFLOW (266 of 408 remaining) [2022-11-25 23:51:02,388 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr142ASSERT_VIOLATIONINTEGER_OVERFLOW (265 of 408 remaining) [2022-11-25 23:51:02,388 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr143ASSERT_VIOLATIONINTEGER_OVERFLOW (264 of 408 remaining) [2022-11-25 23:51:02,388 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW (263 of 408 remaining) [2022-11-25 23:51:02,388 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr145ASSERT_VIOLATIONINTEGER_OVERFLOW (262 of 408 remaining) [2022-11-25 23:51:02,388 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr146ASSERT_VIOLATIONINTEGER_OVERFLOW (261 of 408 remaining) [2022-11-25 23:51:02,389 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr147ASSERT_VIOLATIONINTEGER_OVERFLOW (260 of 408 remaining) [2022-11-25 23:51:02,389 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr148ASSERT_VIOLATIONINTEGER_OVERFLOW (259 of 408 remaining) [2022-11-25 23:51:02,389 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr149ASSERT_VIOLATIONINTEGER_OVERFLOW (258 of 408 remaining) [2022-11-25 23:51:02,389 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr150ASSERT_VIOLATIONINTEGER_OVERFLOW (257 of 408 remaining) [2022-11-25 23:51:02,389 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr151ASSERT_VIOLATIONINTEGER_OVERFLOW (256 of 408 remaining) [2022-11-25 23:51:02,390 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr152ASSERT_VIOLATIONINTEGER_OVERFLOW (255 of 408 remaining) [2022-11-25 23:51:02,390 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr153ASSERT_VIOLATIONINTEGER_OVERFLOW (254 of 408 remaining) [2022-11-25 23:51:02,390 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr154ASSERT_VIOLATIONINTEGER_OVERFLOW (253 of 408 remaining) [2022-11-25 23:51:02,390 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr155ASSERT_VIOLATIONINTEGER_OVERFLOW (252 of 408 remaining) [2022-11-25 23:51:02,390 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr156ASSERT_VIOLATIONINTEGER_OVERFLOW (251 of 408 remaining) [2022-11-25 23:51:02,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr157ASSERT_VIOLATIONINTEGER_OVERFLOW (250 of 408 remaining) [2022-11-25 23:51:02,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr158ASSERT_VIOLATIONINTEGER_OVERFLOW (249 of 408 remaining) [2022-11-25 23:51:02,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr159ASSERT_VIOLATIONINTEGER_OVERFLOW (248 of 408 remaining) [2022-11-25 23:51:02,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr160ASSERT_VIOLATIONINTEGER_OVERFLOW (247 of 408 remaining) [2022-11-25 23:51:02,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr161ASSERT_VIOLATIONINTEGER_OVERFLOW (246 of 408 remaining) [2022-11-25 23:51:02,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr162ASSERT_VIOLATIONINTEGER_OVERFLOW (245 of 408 remaining) [2022-11-25 23:51:02,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr163ASSERT_VIOLATIONINTEGER_OVERFLOW (244 of 408 remaining) [2022-11-25 23:51:02,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr164ASSERT_VIOLATIONINTEGER_OVERFLOW (243 of 408 remaining) [2022-11-25 23:51:02,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr165ASSERT_VIOLATIONINTEGER_OVERFLOW (242 of 408 remaining) [2022-11-25 23:51:02,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr166ASSERT_VIOLATIONINTEGER_OVERFLOW (241 of 408 remaining) [2022-11-25 23:51:02,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr167ASSERT_VIOLATIONINTEGER_OVERFLOW (240 of 408 remaining) [2022-11-25 23:51:02,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr168ASSERT_VIOLATIONINTEGER_OVERFLOW (239 of 408 remaining) [2022-11-25 23:51:02,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr169ASSERT_VIOLATIONINTEGER_OVERFLOW (238 of 408 remaining) [2022-11-25 23:51:02,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr170ASSERT_VIOLATIONINTEGER_OVERFLOW (237 of 408 remaining) [2022-11-25 23:51:02,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr171ASSERT_VIOLATIONINTEGER_OVERFLOW (236 of 408 remaining) [2022-11-25 23:51:02,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr172ASSERT_VIOLATIONINTEGER_OVERFLOW (235 of 408 remaining) [2022-11-25 23:51:02,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr173ASSERT_VIOLATIONINTEGER_OVERFLOW (234 of 408 remaining) [2022-11-25 23:51:02,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr174ASSERT_VIOLATIONINTEGER_OVERFLOW (233 of 408 remaining) [2022-11-25 23:51:02,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr175ASSERT_VIOLATIONINTEGER_OVERFLOW (232 of 408 remaining) [2022-11-25 23:51:02,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr176ASSERT_VIOLATIONINTEGER_OVERFLOW (231 of 408 remaining) [2022-11-25 23:51:02,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr177ASSERT_VIOLATIONINTEGER_OVERFLOW (230 of 408 remaining) [2022-11-25 23:51:02,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr178ASSERT_VIOLATIONINTEGER_OVERFLOW (229 of 408 remaining) [2022-11-25 23:51:02,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr179ASSERT_VIOLATIONINTEGER_OVERFLOW (228 of 408 remaining) [2022-11-25 23:51:02,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr180ASSERT_VIOLATIONINTEGER_OVERFLOW (227 of 408 remaining) [2022-11-25 23:51:02,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr181ASSERT_VIOLATIONINTEGER_OVERFLOW (226 of 408 remaining) [2022-11-25 23:51:02,396 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr182ASSERT_VIOLATIONINTEGER_OVERFLOW (225 of 408 remaining) [2022-11-25 23:51:02,396 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr183ASSERT_VIOLATIONINTEGER_OVERFLOW (224 of 408 remaining) [2022-11-25 23:51:02,396 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr184ASSERT_VIOLATIONINTEGER_OVERFLOW (223 of 408 remaining) [2022-11-25 23:51:02,396 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr185ASSERT_VIOLATIONINTEGER_OVERFLOW (222 of 408 remaining) [2022-11-25 23:51:02,396 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr186ASSERT_VIOLATIONINTEGER_OVERFLOW (221 of 408 remaining) [2022-11-25 23:51:02,397 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr187ASSERT_VIOLATIONINTEGER_OVERFLOW (220 of 408 remaining) [2022-11-25 23:51:02,397 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr188ASSERT_VIOLATIONINTEGER_OVERFLOW (219 of 408 remaining) [2022-11-25 23:51:02,397 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr189ASSERT_VIOLATIONINTEGER_OVERFLOW (218 of 408 remaining) [2022-11-25 23:51:02,397 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr190ASSERT_VIOLATIONINTEGER_OVERFLOW (217 of 408 remaining) [2022-11-25 23:51:02,397 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr191ASSERT_VIOLATIONINTEGER_OVERFLOW (216 of 408 remaining) [2022-11-25 23:51:02,398 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr192ASSERT_VIOLATIONINTEGER_OVERFLOW (215 of 408 remaining) [2022-11-25 23:51:02,398 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr193ASSERT_VIOLATIONINTEGER_OVERFLOW (214 of 408 remaining) [2022-11-25 23:51:02,398 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr194ASSERT_VIOLATIONINTEGER_OVERFLOW (213 of 408 remaining) [2022-11-25 23:51:02,398 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr195ASSERT_VIOLATIONINTEGER_OVERFLOW (212 of 408 remaining) [2022-11-25 23:51:02,398 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr196ASSERT_VIOLATIONINTEGER_OVERFLOW (211 of 408 remaining) [2022-11-25 23:51:02,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr197ASSERT_VIOLATIONINTEGER_OVERFLOW (210 of 408 remaining) [2022-11-25 23:51:02,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr198ASSERT_VIOLATIONINTEGER_OVERFLOW (209 of 408 remaining) [2022-11-25 23:51:02,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr199ASSERT_VIOLATIONINTEGER_OVERFLOW (208 of 408 remaining) [2022-11-25 23:51:02,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr200ASSERT_VIOLATIONINTEGER_OVERFLOW (207 of 408 remaining) [2022-11-25 23:51:02,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr201ASSERT_VIOLATIONINTEGER_OVERFLOW (206 of 408 remaining) [2022-11-25 23:51:02,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr202ASSERT_VIOLATIONINTEGER_OVERFLOW (205 of 408 remaining) [2022-11-25 23:51:02,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr203ASSERT_VIOLATIONINTEGER_OVERFLOW (204 of 408 remaining) [2022-11-25 23:51:02,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr204ASSERT_VIOLATIONINTEGER_OVERFLOW (203 of 408 remaining) [2022-11-25 23:51:02,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr205ASSERT_VIOLATIONINTEGER_OVERFLOW (202 of 408 remaining) [2022-11-25 23:51:02,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr206ASSERT_VIOLATIONINTEGER_OVERFLOW (201 of 408 remaining) [2022-11-25 23:51:02,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr207ASSERT_VIOLATIONINTEGER_OVERFLOW (200 of 408 remaining) [2022-11-25 23:51:02,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr208ASSERT_VIOLATIONINTEGER_OVERFLOW (199 of 408 remaining) [2022-11-25 23:51:02,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr209ASSERT_VIOLATIONINTEGER_OVERFLOW (198 of 408 remaining) [2022-11-25 23:51:02,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr210ASSERT_VIOLATIONINTEGER_OVERFLOW (197 of 408 remaining) [2022-11-25 23:51:02,402 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr211ASSERT_VIOLATIONINTEGER_OVERFLOW (196 of 408 remaining) [2022-11-25 23:51:02,402 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr212ASSERT_VIOLATIONINTEGER_OVERFLOW (195 of 408 remaining) [2022-11-25 23:51:02,402 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr213ASSERT_VIOLATIONINTEGER_OVERFLOW (194 of 408 remaining) [2022-11-25 23:51:02,402 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr214ASSERT_VIOLATIONINTEGER_OVERFLOW (193 of 408 remaining) [2022-11-25 23:51:02,402 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr215ASSERT_VIOLATIONINTEGER_OVERFLOW (192 of 408 remaining) [2022-11-25 23:51:02,403 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr216ASSERT_VIOLATIONINTEGER_OVERFLOW (191 of 408 remaining) [2022-11-25 23:51:02,403 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr217ASSERT_VIOLATIONINTEGER_OVERFLOW (190 of 408 remaining) [2022-11-25 23:51:02,403 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr218ASSERT_VIOLATIONINTEGER_OVERFLOW (189 of 408 remaining) [2022-11-25 23:51:02,403 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr219ASSERT_VIOLATIONINTEGER_OVERFLOW (188 of 408 remaining) [2022-11-25 23:51:02,403 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr220ASSERT_VIOLATIONINTEGER_OVERFLOW (187 of 408 remaining) [2022-11-25 23:51:02,404 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr221ASSERT_VIOLATIONINTEGER_OVERFLOW (186 of 408 remaining) [2022-11-25 23:51:02,404 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr222ASSERT_VIOLATIONINTEGER_OVERFLOW (185 of 408 remaining) [2022-11-25 23:51:02,404 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr223ASSERT_VIOLATIONINTEGER_OVERFLOW (184 of 408 remaining) [2022-11-25 23:51:02,404 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr224ASSERT_VIOLATIONINTEGER_OVERFLOW (183 of 408 remaining) [2022-11-25 23:51:02,404 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr225ASSERT_VIOLATIONINTEGER_OVERFLOW (182 of 408 remaining) [2022-11-25 23:51:02,405 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr226ASSERT_VIOLATIONINTEGER_OVERFLOW (181 of 408 remaining) [2022-11-25 23:51:02,405 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr227ASSERT_VIOLATIONINTEGER_OVERFLOW (180 of 408 remaining) [2022-11-25 23:51:02,405 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr228ASSERT_VIOLATIONINTEGER_OVERFLOW (179 of 408 remaining) [2022-11-25 23:51:02,405 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr229ASSERT_VIOLATIONINTEGER_OVERFLOW (178 of 408 remaining) [2022-11-25 23:51:02,405 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr230ASSERT_VIOLATIONINTEGER_OVERFLOW (177 of 408 remaining) [2022-11-25 23:51:02,406 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr231ASSERT_VIOLATIONINTEGER_OVERFLOW (176 of 408 remaining) [2022-11-25 23:51:02,406 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr232ASSERT_VIOLATIONINTEGER_OVERFLOW (175 of 408 remaining) [2022-11-25 23:51:02,406 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr233ASSERT_VIOLATIONINTEGER_OVERFLOW (174 of 408 remaining) [2022-11-25 23:51:02,406 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr234ASSERT_VIOLATIONINTEGER_OVERFLOW (173 of 408 remaining) [2022-11-25 23:51:02,407 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr235ASSERT_VIOLATIONINTEGER_OVERFLOW (172 of 408 remaining) [2022-11-25 23:51:02,407 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr236ASSERT_VIOLATIONINTEGER_OVERFLOW (171 of 408 remaining) [2022-11-25 23:51:02,407 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr237ASSERT_VIOLATIONINTEGER_OVERFLOW (170 of 408 remaining) [2022-11-25 23:51:02,407 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr238ASSERT_VIOLATIONINTEGER_OVERFLOW (169 of 408 remaining) [2022-11-25 23:51:02,407 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr239ASSERT_VIOLATIONINTEGER_OVERFLOW (168 of 408 remaining) [2022-11-25 23:51:02,408 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr240ASSERT_VIOLATIONINTEGER_OVERFLOW (167 of 408 remaining) [2022-11-25 23:51:02,408 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr241ASSERT_VIOLATIONINTEGER_OVERFLOW (166 of 408 remaining) [2022-11-25 23:51:02,408 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr242ASSERT_VIOLATIONINTEGER_OVERFLOW (165 of 408 remaining) [2022-11-25 23:51:02,408 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr243ASSERT_VIOLATIONINTEGER_OVERFLOW (164 of 408 remaining) [2022-11-25 23:51:02,408 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr244ASSERT_VIOLATIONINTEGER_OVERFLOW (163 of 408 remaining) [2022-11-25 23:51:02,409 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr245ASSERT_VIOLATIONINTEGER_OVERFLOW (162 of 408 remaining) [2022-11-25 23:51:02,409 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr246ASSERT_VIOLATIONINTEGER_OVERFLOW (161 of 408 remaining) [2022-11-25 23:51:02,409 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr247ASSERT_VIOLATIONINTEGER_OVERFLOW (160 of 408 remaining) [2022-11-25 23:51:02,409 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr248ASSERT_VIOLATIONINTEGER_OVERFLOW (159 of 408 remaining) [2022-11-25 23:51:02,409 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr249ASSERT_VIOLATIONINTEGER_OVERFLOW (158 of 408 remaining) [2022-11-25 23:51:02,410 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr250ASSERT_VIOLATIONINTEGER_OVERFLOW (157 of 408 remaining) [2022-11-25 23:51:02,410 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr251ASSERT_VIOLATIONINTEGER_OVERFLOW (156 of 408 remaining) [2022-11-25 23:51:02,410 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr252ASSERT_VIOLATIONINTEGER_OVERFLOW (155 of 408 remaining) [2022-11-25 23:51:02,410 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr253ASSERT_VIOLATIONINTEGER_OVERFLOW (154 of 408 remaining) [2022-11-25 23:51:02,410 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr254ASSERT_VIOLATIONINTEGER_OVERFLOW (153 of 408 remaining) [2022-11-25 23:51:02,411 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr255ASSERT_VIOLATIONINTEGER_OVERFLOW (152 of 408 remaining) [2022-11-25 23:51:02,411 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr256ASSERT_VIOLATIONINTEGER_OVERFLOW (151 of 408 remaining) [2022-11-25 23:51:02,411 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr257ASSERT_VIOLATIONINTEGER_OVERFLOW (150 of 408 remaining) [2022-11-25 23:51:02,411 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr258ASSERT_VIOLATIONINTEGER_OVERFLOW (149 of 408 remaining) [2022-11-25 23:51:02,412 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr259ASSERT_VIOLATIONINTEGER_OVERFLOW (148 of 408 remaining) [2022-11-25 23:51:02,412 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr260ASSERT_VIOLATIONINTEGER_OVERFLOW (147 of 408 remaining) [2022-11-25 23:51:02,412 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr261ASSERT_VIOLATIONINTEGER_OVERFLOW (146 of 408 remaining) [2022-11-25 23:51:02,412 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr262ASSERT_VIOLATIONINTEGER_OVERFLOW (145 of 408 remaining) [2022-11-25 23:51:02,412 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr263ASSERT_VIOLATIONINTEGER_OVERFLOW (144 of 408 remaining) [2022-11-25 23:51:02,413 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr264ASSERT_VIOLATIONINTEGER_OVERFLOW (143 of 408 remaining) [2022-11-25 23:51:02,413 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr265ASSERT_VIOLATIONINTEGER_OVERFLOW (142 of 408 remaining) [2022-11-25 23:51:02,413 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr266ASSERT_VIOLATIONINTEGER_OVERFLOW (141 of 408 remaining) [2022-11-25 23:51:02,413 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr267ASSERT_VIOLATIONINTEGER_OVERFLOW (140 of 408 remaining) [2022-11-25 23:51:02,413 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr268ASSERT_VIOLATIONINTEGER_OVERFLOW (139 of 408 remaining) [2022-11-25 23:51:02,414 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr269ASSERT_VIOLATIONINTEGER_OVERFLOW (138 of 408 remaining) [2022-11-25 23:51:02,414 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr270ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 408 remaining) [2022-11-25 23:51:02,414 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr271ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 408 remaining) [2022-11-25 23:51:02,414 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr272ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 408 remaining) [2022-11-25 23:51:02,414 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr273ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 408 remaining) [2022-11-25 23:51:02,415 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr274ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 408 remaining) [2022-11-25 23:51:02,415 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr275ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 408 remaining) [2022-11-25 23:51:02,415 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr276ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 408 remaining) [2022-11-25 23:51:02,415 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr277ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 408 remaining) [2022-11-25 23:51:02,415 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr278ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 408 remaining) [2022-11-25 23:51:02,416 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr279ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 408 remaining) [2022-11-25 23:51:02,416 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr280ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 408 remaining) [2022-11-25 23:51:02,416 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr281ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 408 remaining) [2022-11-25 23:51:02,416 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr282ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 408 remaining) [2022-11-25 23:51:02,416 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr283ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 408 remaining) [2022-11-25 23:51:02,417 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr284ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 408 remaining) [2022-11-25 23:51:02,417 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr285ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 408 remaining) [2022-11-25 23:51:02,417 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr286ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 408 remaining) [2022-11-25 23:51:02,417 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr287ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 408 remaining) [2022-11-25 23:51:02,417 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr288ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 408 remaining) [2022-11-25 23:51:02,418 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr289ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 408 remaining) [2022-11-25 23:51:02,418 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr290ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 408 remaining) [2022-11-25 23:51:02,418 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr291ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 408 remaining) [2022-11-25 23:51:02,418 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr292ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 408 remaining) [2022-11-25 23:51:02,418 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr293ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 408 remaining) [2022-11-25 23:51:02,419 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr294ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 408 remaining) [2022-11-25 23:51:02,419 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr295ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 408 remaining) [2022-11-25 23:51:02,419 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr296ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 408 remaining) [2022-11-25 23:51:02,419 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr297ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 408 remaining) [2022-11-25 23:51:02,419 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr298ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 408 remaining) [2022-11-25 23:51:02,420 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr299ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 408 remaining) [2022-11-25 23:51:02,420 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr300ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 408 remaining) [2022-11-25 23:51:02,420 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr301ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 408 remaining) [2022-11-25 23:51:02,420 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr302ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 408 remaining) [2022-11-25 23:51:02,420 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr303ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 408 remaining) [2022-11-25 23:51:02,421 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr304ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 408 remaining) [2022-11-25 23:51:02,421 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr305ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 408 remaining) [2022-11-25 23:51:02,421 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr306ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 408 remaining) [2022-11-25 23:51:02,421 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr307ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 408 remaining) [2022-11-25 23:51:02,421 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr308ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 408 remaining) [2022-11-25 23:51:02,422 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr309ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 408 remaining) [2022-11-25 23:51:02,422 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr310ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 408 remaining) [2022-11-25 23:51:02,422 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr311ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 408 remaining) [2022-11-25 23:51:02,422 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr312ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 408 remaining) [2022-11-25 23:51:02,422 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr313ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 408 remaining) [2022-11-25 23:51:02,423 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr314ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 408 remaining) [2022-11-25 23:51:02,423 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr315ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 408 remaining) [2022-11-25 23:51:02,423 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr316ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 408 remaining) [2022-11-25 23:51:02,423 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr317ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 408 remaining) [2022-11-25 23:51:02,424 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr318ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 408 remaining) [2022-11-25 23:51:02,424 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr319ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 408 remaining) [2022-11-25 23:51:02,424 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr320ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 408 remaining) [2022-11-25 23:51:02,424 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr321ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 408 remaining) [2022-11-25 23:51:02,424 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr322ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 408 remaining) [2022-11-25 23:51:02,425 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr323ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 408 remaining) [2022-11-25 23:51:02,425 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr324ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 408 remaining) [2022-11-25 23:51:02,425 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr325ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 408 remaining) [2022-11-25 23:51:02,425 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr326ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 408 remaining) [2022-11-25 23:51:02,425 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr327ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 408 remaining) [2022-11-25 23:51:02,426 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr328ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 408 remaining) [2022-11-25 23:51:02,426 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr329ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 408 remaining) [2022-11-25 23:51:02,426 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr330ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 408 remaining) [2022-11-25 23:51:02,426 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr331ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 408 remaining) [2022-11-25 23:51:02,426 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr332ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 408 remaining) [2022-11-25 23:51:02,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr333ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 408 remaining) [2022-11-25 23:51:02,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr334ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 408 remaining) [2022-11-25 23:51:02,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr335ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 408 remaining) [2022-11-25 23:51:02,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr336ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 408 remaining) [2022-11-25 23:51:02,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr337ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 408 remaining) [2022-11-25 23:51:02,428 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr338ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 408 remaining) [2022-11-25 23:51:02,428 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr339ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 408 remaining) [2022-11-25 23:51:02,428 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr340ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 408 remaining) [2022-11-25 23:51:02,428 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr341ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 408 remaining) [2022-11-25 23:51:02,429 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr342ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 408 remaining) [2022-11-25 23:51:02,429 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr343ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 408 remaining) [2022-11-25 23:51:02,429 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr344ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 408 remaining) [2022-11-25 23:51:02,429 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr345ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 408 remaining) [2022-11-25 23:51:02,429 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr346ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 408 remaining) [2022-11-25 23:51:02,430 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr347ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 408 remaining) [2022-11-25 23:51:02,430 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr348ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 408 remaining) [2022-11-25 23:51:02,430 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr349ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 408 remaining) [2022-11-25 23:51:02,430 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr350ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 408 remaining) [2022-11-25 23:51:02,430 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr351ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 408 remaining) [2022-11-25 23:51:02,431 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr352ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 408 remaining) [2022-11-25 23:51:02,431 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr353ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 408 remaining) [2022-11-25 23:51:02,431 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr354ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 408 remaining) [2022-11-25 23:51:02,431 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr355ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 408 remaining) [2022-11-25 23:51:02,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr356ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 408 remaining) [2022-11-25 23:51:02,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr357ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 408 remaining) [2022-11-25 23:51:02,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr358ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 408 remaining) [2022-11-25 23:51:02,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr359ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 408 remaining) [2022-11-25 23:51:02,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr360ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 408 remaining) [2022-11-25 23:51:02,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr361ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 408 remaining) [2022-11-25 23:51:02,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr362ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 408 remaining) [2022-11-25 23:51:02,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr363ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 408 remaining) [2022-11-25 23:51:02,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr364ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 408 remaining) [2022-11-25 23:51:02,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr365ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 408 remaining) [2022-11-25 23:51:02,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr366ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 408 remaining) [2022-11-25 23:51:02,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr367ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 408 remaining) [2022-11-25 23:51:02,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr368ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 408 remaining) [2022-11-25 23:51:02,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr369ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 408 remaining) [2022-11-25 23:51:02,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr370ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 408 remaining) [2022-11-25 23:51:02,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr371ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 408 remaining) [2022-11-25 23:51:02,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr372ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 408 remaining) [2022-11-25 23:51:02,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr373ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 408 remaining) [2022-11-25 23:51:02,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr374ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 408 remaining) [2022-11-25 23:51:02,436 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr375ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 408 remaining) [2022-11-25 23:51:02,436 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr376ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 408 remaining) [2022-11-25 23:51:02,436 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr377ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 408 remaining) [2022-11-25 23:51:02,436 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr378ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 408 remaining) [2022-11-25 23:51:02,436 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr379ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 408 remaining) [2022-11-25 23:51:02,437 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr380ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 408 remaining) [2022-11-25 23:51:02,437 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr381ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 408 remaining) [2022-11-25 23:51:02,437 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr382ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 408 remaining) [2022-11-25 23:51:02,437 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr383ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 408 remaining) [2022-11-25 23:51:02,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr384ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 408 remaining) [2022-11-25 23:51:02,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr385ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 408 remaining) [2022-11-25 23:51:02,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr386ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 408 remaining) [2022-11-25 23:51:02,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr387ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 408 remaining) [2022-11-25 23:51:02,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr388ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 408 remaining) [2022-11-25 23:51:02,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr389ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 408 remaining) [2022-11-25 23:51:02,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr390ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 408 remaining) [2022-11-25 23:51:02,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr391ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 408 remaining) [2022-11-25 23:51:02,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr392ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 408 remaining) [2022-11-25 23:51:02,440 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr393ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 408 remaining) [2022-11-25 23:51:02,440 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr394ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 408 remaining) [2022-11-25 23:51:02,440 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr395ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 408 remaining) [2022-11-25 23:51:02,440 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr396ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 408 remaining) [2022-11-25 23:51:02,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr397ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 408 remaining) [2022-11-25 23:51:02,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr398ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 408 remaining) [2022-11-25 23:51:02,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr399ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 408 remaining) [2022-11-25 23:51:02,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr400ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 408 remaining) [2022-11-25 23:51:02,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr401ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 408 remaining) [2022-11-25 23:51:02,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr402ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 408 remaining) [2022-11-25 23:51:02,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr403ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 408 remaining) [2022-11-25 23:51:02,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr404ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 408 remaining) [2022-11-25 23:51:02,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr405ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 408 remaining) [2022-11-25 23:51:02,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr406ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 408 remaining) [2022-11-25 23:51:02,443 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr407ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 408 remaining) [2022-11-25 23:51:02,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654de0a8-3841-4d27-b212-acb3a68a3802/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 23:51:02,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654de0a8-3841-4d27-b212-acb3a68a3802/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable73 [2022-11-25 23:51:02,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 23:51:04,546 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr133ASSERT_VIOLATIONINTEGER_OVERFLOW(line 417) no Hoare annotation was computed. [2022-11-25 23:51:04,546 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2022-11-25 23:51:04,546 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr393ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1213) no Hoare annotation was computed. [2022-11-25 23:51:04,547 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr382ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1178) no Hoare annotation was computed. [2022-11-25 23:51:04,547 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr263ASSERT_VIOLATIONINTEGER_OVERFLOW(line 818) no Hoare annotation was computed. [2022-11-25 23:51:04,547 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr122ASSERT_VIOLATIONINTEGER_OVERFLOW(line 387) no Hoare annotation was computed. [2022-11-25 23:51:04,547 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 63) no Hoare annotation was computed. [2022-11-25 23:51:04,547 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr252ASSERT_VIOLATIONINTEGER_OVERFLOW(line 793) no Hoare annotation was computed. [2022-11-25 23:51:04,547 INFO L899 garLoopResultBuilder]: For program point L1225(line 1225) no Hoare annotation was computed. [2022-11-25 23:51:04,547 INFO L899 garLoopResultBuilder]: For program point L1225-1(line 1225) no Hoare annotation was computed. [2022-11-25 23:51:04,547 INFO L899 garLoopResultBuilder]: For program point L1093(line 1093) no Hoare annotation was computed. [2022-11-25 23:51:04,547 INFO L899 garLoopResultBuilder]: For program point L1093-1(line 1093) no Hoare annotation was computed. [2022-11-25 23:51:04,547 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW(line 351) no Hoare annotation was computed. [2022-11-25 23:51:04,548 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr155ASSERT_VIOLATIONINTEGER_OVERFLOW(line 494) no Hoare annotation was computed. [2022-11-25 23:51:04,548 INFO L899 garLoopResultBuilder]: For program point L961(line 961) no Hoare annotation was computed. [2022-11-25 23:51:04,548 INFO L899 garLoopResultBuilder]: For program point L961-1(line 961) no Hoare annotation was computed. [2022-11-25 23:51:04,548 INFO L899 garLoopResultBuilder]: For program point L829(line 829) no Hoare annotation was computed. [2022-11-25 23:51:04,548 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr241ASSERT_VIOLATIONINTEGER_OVERFLOW(line 757) no Hoare annotation was computed. [2022-11-25 23:51:04,548 INFO L899 garLoopResultBuilder]: For program point L829-1(line 829) no Hoare annotation was computed. [2022-11-25 23:51:04,548 INFO L899 garLoopResultBuilder]: For program point L697(line 697) no Hoare annotation was computed. [2022-11-25 23:51:04,548 INFO L899 garLoopResultBuilder]: For program point L697-1(line 697) no Hoare annotation was computed. [2022-11-25 23:51:04,548 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr371ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1142) no Hoare annotation was computed. [2022-11-25 23:51:04,548 INFO L899 garLoopResultBuilder]: For program point L565(line 565) no Hoare annotation was computed. [2022-11-25 23:51:04,548 INFO L899 garLoopResultBuilder]: For program point L565-1(line 565) no Hoare annotation was computed. [2022-11-25 23:51:04,549 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW(line 93) no Hoare annotation was computed. [2022-11-25 23:51:04,549 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr166ASSERT_VIOLATIONINTEGER_OVERFLOW(line 530) no Hoare annotation was computed. [2022-11-25 23:51:04,549 INFO L899 garLoopResultBuilder]: For program point L367(lines 367 556) no Hoare annotation was computed. [2022-11-25 23:51:04,549 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr296ASSERT_VIOLATIONINTEGER_OVERFLOW(line 925) no Hoare annotation was computed. [2022-11-25 23:51:04,549 INFO L899 garLoopResultBuilder]: For program point L301(lines 301 688) no Hoare annotation was computed. [2022-11-25 23:51:04,549 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW(line 129) no Hoare annotation was computed. [2022-11-25 23:51:04,549 INFO L899 garLoopResultBuilder]: For program point L235(lines 235 820) no Hoare annotation was computed. [2022-11-25 23:51:04,549 INFO L899 garLoopResultBuilder]: For program point L1226(line 1226) no Hoare annotation was computed. [2022-11-25 23:51:04,549 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 952) no Hoare annotation was computed. [2022-11-25 23:51:04,549 INFO L899 garLoopResultBuilder]: For program point L1226-1(line 1226) no Hoare annotation was computed. [2022-11-25 23:51:04,550 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 1084) no Hoare annotation was computed. [2022-11-25 23:51:04,550 INFO L899 garLoopResultBuilder]: For program point L1094(line 1094) no Hoare annotation was computed. [2022-11-25 23:51:04,550 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 1216) no Hoare annotation was computed. [2022-11-25 23:51:04,550 INFO L899 garLoopResultBuilder]: For program point L1094-1(line 1094) no Hoare annotation was computed. [2022-11-25 23:51:04,550 INFO L899 garLoopResultBuilder]: For program point L962(line 962) no Hoare annotation was computed. [2022-11-25 23:51:04,550 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW(line 285) no Hoare annotation was computed. [2022-11-25 23:51:04,550 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr177ASSERT_VIOLATIONINTEGER_OVERFLOW(line 565) no Hoare annotation was computed. [2022-11-25 23:51:04,550 INFO L899 garLoopResultBuilder]: For program point L962-1(line 962) no Hoare annotation was computed. [2022-11-25 23:51:04,550 INFO L899 garLoopResultBuilder]: For program point L830(line 830) no Hoare annotation was computed. [2022-11-25 23:51:04,550 INFO L899 garLoopResultBuilder]: For program point L830-1(line 830) no Hoare annotation was computed. [2022-11-25 23:51:04,550 INFO L899 garLoopResultBuilder]: For program point L698(line 698) no Hoare annotation was computed. [2022-11-25 23:51:04,551 INFO L899 garLoopResultBuilder]: For program point L698-1(line 698) no Hoare annotation was computed. [2022-11-25 23:51:04,551 INFO L899 garLoopResultBuilder]: For program point L566(line 566) no Hoare annotation was computed. [2022-11-25 23:51:04,551 INFO L899 garLoopResultBuilder]: For program point L566-1(line 566) no Hoare annotation was computed. [2022-11-25 23:51:04,551 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW(line 321) no Hoare annotation was computed. [2022-11-25 23:51:04,551 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr360ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1117) no Hoare annotation was computed. [2022-11-25 23:51:04,552 INFO L895 garLoopResultBuilder]: At program point L1227(lines 31 1228) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 3)) [2022-11-25 23:51:04,552 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr338ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1046) no Hoare annotation was computed. [2022-11-25 23:51:04,552 INFO L895 garLoopResultBuilder]: At program point L1095(lines 97 1096) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 14) (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-11-25 23:51:04,552 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr285ASSERT_VIOLATIONINTEGER_OVERFLOW(line 889) no Hoare annotation was computed. [2022-11-25 23:51:04,553 INFO L895 garLoopResultBuilder]: At program point L963(lines 163 964) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 25) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-11-25 23:51:04,555 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr199ASSERT_VIOLATIONINTEGER_OVERFLOW(line 626) no Hoare annotation was computed. [2022-11-25 23:51:04,555 INFO L895 garLoopResultBuilder]: At program point L831(lines 229 832) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= |ULTIMATE.start_main_~main__x~0#1| 36) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-11-25 23:51:04,555 INFO L895 garLoopResultBuilder]: At program point L699(lines 295 700) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 47) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-11-25 23:51:04,557 INFO L895 garLoopResultBuilder]: At program point L567(lines 361 568) the Hoare annotation is: (let ((.cse0 (<= 50 |ULTIMATE.start_main_~main__y~0#1|))) (or (and (<= 56 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 56) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 58) (<= 58 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 55) .cse0 (<= 55 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 57) (<= 57 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 51) .cse0 (<= 51 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 53) (<= 53 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 52) .cse0 (<= 52 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 54) .cse0 (<= 54 |ULTIMATE.start_main_~main__x~0#1|)))) [2022-11-25 23:51:04,557 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW(line 255) no Hoare annotation was computed. [2022-11-25 23:51:04,557 INFO L899 garLoopResultBuilder]: For program point L369(line 369) no Hoare annotation was computed. [2022-11-25 23:51:04,558 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr188ASSERT_VIOLATIONINTEGER_OVERFLOW(line 601) no Hoare annotation was computed. [2022-11-25 23:51:04,558 INFO L899 garLoopResultBuilder]: For program point L369-1(line 369) no Hoare annotation was computed. [2022-11-25 23:51:04,558 INFO L899 garLoopResultBuilder]: For program point L303(line 303) no Hoare annotation was computed. [2022-11-25 23:51:04,558 INFO L899 garLoopResultBuilder]: For program point L303-1(line 303) no Hoare annotation was computed. [2022-11-25 23:51:04,558 INFO L899 garLoopResultBuilder]: For program point L237(line 237) no Hoare annotation was computed. [2022-11-25 23:51:04,558 INFO L899 garLoopResultBuilder]: For program point L237-1(line 237) no Hoare annotation was computed. [2022-11-25 23:51:04,558 INFO L899 garLoopResultBuilder]: For program point L171(line 171) no Hoare annotation was computed. [2022-11-25 23:51:04,559 INFO L899 garLoopResultBuilder]: For program point L171-1(line 171) no Hoare annotation was computed. [2022-11-25 23:51:04,559 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr274ASSERT_VIOLATIONINTEGER_OVERFLOW(line 854) no Hoare annotation was computed. [2022-11-25 23:51:04,559 INFO L899 garLoopResultBuilder]: For program point L105(line 105) no Hoare annotation was computed. [2022-11-25 23:51:04,559 INFO L899 garLoopResultBuilder]: For program point L105-1(line 105) no Hoare annotation was computed. [2022-11-25 23:51:04,559 INFO L899 garLoopResultBuilder]: For program point L39(line 39) no Hoare annotation was computed. [2022-11-25 23:51:04,559 INFO L899 garLoopResultBuilder]: For program point L39-1(line 39) no Hoare annotation was computed. [2022-11-25 23:51:04,560 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr349ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1081) no Hoare annotation was computed. [2022-11-25 23:51:04,560 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW(line 153) no Hoare annotation was computed. [2022-11-25 23:51:04,560 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr221ASSERT_VIOLATIONINTEGER_OVERFLOW(line 697) no Hoare annotation was computed. [2022-11-25 23:51:04,560 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr210ASSERT_VIOLATIONINTEGER_OVERFLOW(line 662) no Hoare annotation was computed. [2022-11-25 23:51:04,560 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr232ASSERT_VIOLATIONINTEGER_OVERFLOW(line 733) no Hoare annotation was computed. [2022-11-25 23:51:04,560 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr340ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1057) no Hoare annotation was computed. [2022-11-25 23:51:04,561 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr362ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1118) no Hoare annotation was computed. [2022-11-25 23:51:04,561 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW(line 219) no Hoare annotation was computed. [2022-11-25 23:51:04,561 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr142ASSERT_VIOLATIONINTEGER_OVERFLOW(line 458) no Hoare annotation was computed. [2022-11-25 23:51:04,561 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW(line 189) no Hoare annotation was computed. [2022-11-25 23:51:04,561 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr351ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1082) no Hoare annotation was computed. [2022-11-25 23:51:04,561 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr265ASSERT_VIOLATIONINTEGER_OVERFLOW(line 829) no Hoare annotation was computed. [2022-11-25 23:51:04,562 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr131ASSERT_VIOLATIONINTEGER_OVERFLOW(line 411) no Hoare annotation was computed. [2022-11-25 23:51:04,562 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr307ASSERT_VIOLATIONINTEGER_OVERFLOW(line 950) no Hoare annotation was computed. [2022-11-25 23:51:04,562 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 57) no Hoare annotation was computed. [2022-11-25 23:51:04,562 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr254ASSERT_VIOLATIONINTEGER_OVERFLOW(line 794) no Hoare annotation was computed. [2022-11-25 23:51:04,562 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW(line 381) no Hoare annotation was computed. [2022-11-25 23:51:04,562 INFO L899 garLoopResultBuilder]: For program point L1165(line 1165) no Hoare annotation was computed. [2022-11-25 23:51:04,563 INFO L899 garLoopResultBuilder]: For program point L1165-1(line 1165) no Hoare annotation was computed. [2022-11-25 23:51:04,563 INFO L899 garLoopResultBuilder]: For program point L1033(line 1033) no Hoare annotation was computed. [2022-11-25 23:51:04,563 INFO L899 garLoopResultBuilder]: For program point L1033-1(line 1033) no Hoare annotation was computed. [2022-11-25 23:51:04,563 INFO L899 garLoopResultBuilder]: For program point L901(line 901) no Hoare annotation was computed. [2022-11-25 23:51:04,563 INFO L899 garLoopResultBuilder]: For program point L901-1(line 901) no Hoare annotation was computed. [2022-11-25 23:51:04,563 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW(line 87) no Hoare annotation was computed. [2022-11-25 23:51:04,564 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr243ASSERT_VIOLATIONINTEGER_OVERFLOW(line 758) no Hoare annotation was computed. [2022-11-25 23:51:04,564 INFO L899 garLoopResultBuilder]: For program point L769(line 769) no Hoare annotation was computed. [2022-11-25 23:51:04,564 INFO L899 garLoopResultBuilder]: For program point L769-1(line 769) no Hoare annotation was computed. [2022-11-25 23:51:04,564 INFO L899 garLoopResultBuilder]: For program point L637(line 637) no Hoare annotation was computed. [2022-11-25 23:51:04,564 INFO L899 garLoopResultBuilder]: For program point L637-1(line 637) no Hoare annotation was computed. [2022-11-25 23:51:04,564 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr329ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1021) no Hoare annotation was computed. [2022-11-25 23:51:04,565 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr157ASSERT_VIOLATIONINTEGER_OVERFLOW(line 505) no Hoare annotation was computed. [2022-11-25 23:51:04,565 INFO L899 garLoopResultBuilder]: For program point L505(line 505) no Hoare annotation was computed. [2022-11-25 23:51:04,565 INFO L899 garLoopResultBuilder]: For program point L505-1(line 505) no Hoare annotation was computed. [2022-11-25 23:51:04,565 INFO L899 garLoopResultBuilder]: For program point L373(lines 373 544) no Hoare annotation was computed. [2022-11-25 23:51:04,565 INFO L899 garLoopResultBuilder]: For program point L307(lines 307 676) no Hoare annotation was computed. [2022-11-25 23:51:04,565 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr318ASSERT_VIOLATIONINTEGER_OVERFLOW(line 986) no Hoare annotation was computed. [2022-11-25 23:51:04,566 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW(line 123) no Hoare annotation was computed. [2022-11-25 23:51:04,566 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 808) no Hoare annotation was computed. [2022-11-25 23:51:04,566 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 940) no Hoare annotation was computed. [2022-11-25 23:51:04,566 INFO L899 garLoopResultBuilder]: For program point L1166(line 1166) no Hoare annotation was computed. [2022-11-25 23:51:04,566 INFO L899 garLoopResultBuilder]: For program point L109(lines 109 1072) no Hoare annotation was computed. [2022-11-25 23:51:04,567 INFO L899 garLoopResultBuilder]: For program point L1166-1(line 1166) no Hoare annotation was computed. [2022-11-25 23:51:04,567 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 1204) no Hoare annotation was computed. [2022-11-25 23:51:04,567 INFO L899 garLoopResultBuilder]: For program point L1034(line 1034) no Hoare annotation was computed. [2022-11-25 23:51:04,567 INFO L899 garLoopResultBuilder]: For program point L1034-1(line 1034) no Hoare annotation was computed. [2022-11-25 23:51:04,567 INFO L899 garLoopResultBuilder]: For program point L902(line 902) no Hoare annotation was computed. [2022-11-25 23:51:04,567 INFO L899 garLoopResultBuilder]: For program point L902-1(line 902) no Hoare annotation was computed. [2022-11-25 23:51:04,567 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr109ASSERT_VIOLATIONINTEGER_OVERFLOW(line 345) no Hoare annotation was computed. [2022-11-25 23:51:04,568 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr168ASSERT_VIOLATIONINTEGER_OVERFLOW(line 541) no Hoare annotation was computed. [2022-11-25 23:51:04,568 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr404ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1249) no Hoare annotation was computed. [2022-11-25 23:51:04,568 INFO L899 garLoopResultBuilder]: For program point L770(line 770) no Hoare annotation was computed. [2022-11-25 23:51:04,568 INFO L899 garLoopResultBuilder]: For program point L770-1(line 770) no Hoare annotation was computed. [2022-11-25 23:51:04,569 INFO L899 garLoopResultBuilder]: For program point L638(line 638) no Hoare annotation was computed. [2022-11-25 23:51:04,569 INFO L899 garLoopResultBuilder]: For program point L638-1(line 638) no Hoare annotation was computed. [2022-11-25 23:51:04,569 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr217ASSERT_VIOLATIONINTEGER_OVERFLOW(line 685) no Hoare annotation was computed. [2022-11-25 23:51:04,569 INFO L899 garLoopResultBuilder]: For program point L506(line 506) no Hoare annotation was computed. [2022-11-25 23:51:04,569 INFO L899 garLoopResultBuilder]: For program point L506-1(line 506) no Hoare annotation was computed. [2022-11-25 23:51:04,569 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr206ASSERT_VIOLATIONINTEGER_OVERFLOW(line 650) no Hoare annotation was computed. [2022-11-25 23:51:04,570 INFO L895 garLoopResultBuilder]: At program point L1167(lines 61 1168) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 8) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-11-25 23:51:04,570 INFO L895 garLoopResultBuilder]: At program point L1035(lines 127 1036) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 19) (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-11-25 23:51:04,570 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr336ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1045) no Hoare annotation was computed. [2022-11-25 23:51:04,570 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr358ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1106) no Hoare annotation was computed. [2022-11-25 23:51:04,570 INFO L895 garLoopResultBuilder]: At program point L903(lines 193 904) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= |ULTIMATE.start_main_~main__x~0#1| 30) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-11-25 23:51:04,571 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW(line 165) no Hoare annotation was computed. [2022-11-25 23:51:04,571 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr228ASSERT_VIOLATIONINTEGER_OVERFLOW(line 721) no Hoare annotation was computed. [2022-11-25 23:51:04,571 INFO L895 garLoopResultBuilder]: At program point L771(lines 259 772) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 41) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-11-25 23:51:04,571 INFO L895 garLoopResultBuilder]: At program point L639(lines 325 640) the Hoare annotation is: (let ((.cse0 (<= 50 |ULTIMATE.start_main_~main__y~0#1|))) (or (and (<= |ULTIMATE.start_main_~main__y~0#1| 51) .cse0 (<= 51 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 52) .cse0 (<= 52 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) .cse0))) [2022-11-25 23:51:04,571 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW(line 231) no Hoare annotation was computed. [2022-11-25 23:51:04,573 INFO L895 garLoopResultBuilder]: At program point L507(lines 391 508) the Hoare annotation is: (let ((.cse0 (<= 50 |ULTIMATE.start_main_~main__y~0#1|))) (or (and (<= |ULTIMATE.start_main_~main__y~0#1| 60) (<= 60 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= 56 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 56) .cse0) (and (<= 61 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 61)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 58) (<= 58 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 59) (<= 59 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 55) .cse0 (<= 55 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 62) (<= 62 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= 63 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 63)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 57) (<= 57 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 51) .cse0 (<= 51 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 53) (<= 53 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 52) .cse0 (<= 52 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 54) .cse0 (<= 54 |ULTIMATE.start_main_~main__x~0#1|)))) [2022-11-25 23:51:04,573 INFO L899 garLoopResultBuilder]: For program point L375(line 375) no Hoare annotation was computed. [2022-11-25 23:51:04,573 INFO L899 garLoopResultBuilder]: For program point L375-1(line 375) no Hoare annotation was computed. [2022-11-25 23:51:04,573 INFO L899 garLoopResultBuilder]: For program point L309(line 309) no Hoare annotation was computed. [2022-11-25 23:51:04,573 INFO L899 garLoopResultBuilder]: For program point L309-1(line 309) no Hoare annotation was computed. [2022-11-25 23:51:04,573 INFO L899 garLoopResultBuilder]: For program point L243(line 243) no Hoare annotation was computed. [2022-11-25 23:51:04,574 INFO L899 garLoopResultBuilder]: For program point L243-1(line 243) no Hoare annotation was computed. [2022-11-25 23:51:04,574 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-11-25 23:51:04,574 INFO L899 garLoopResultBuilder]: For program point L177-1(line 177) no Hoare annotation was computed. [2022-11-25 23:51:04,574 INFO L899 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-11-25 23:51:04,574 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr146ASSERT_VIOLATIONINTEGER_OVERFLOW(line 470) no Hoare annotation was computed. [2022-11-25 23:51:04,574 INFO L899 garLoopResultBuilder]: For program point L111-1(line 111) no Hoare annotation was computed. [2022-11-25 23:51:04,575 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2022-11-25 23:51:04,575 INFO L899 garLoopResultBuilder]: For program point L45-1(line 45) no Hoare annotation was computed. [2022-11-25 23:51:04,575 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW(line 201) no Hoare annotation was computed. [2022-11-25 23:51:04,575 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr347ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1070) no Hoare annotation was computed. [2022-11-25 23:51:04,575 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr135ASSERT_VIOLATIONINTEGER_OVERFLOW(line 424) no Hoare annotation was computed. [2022-11-25 23:51:04,575 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr250ASSERT_VIOLATIONINTEGER_OVERFLOW(line 782) no Hoare annotation was computed. [2022-11-25 23:51:04,576 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2022-11-25 23:51:04,576 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr261ASSERT_VIOLATIONINTEGER_OVERFLOW(line 817) no Hoare annotation was computed. [2022-11-25 23:51:04,576 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr124ASSERT_VIOLATIONINTEGER_OVERFLOW(line 393) no Hoare annotation was computed. [2022-11-25 23:51:04,576 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr303ASSERT_VIOLATIONINTEGER_OVERFLOW(line 938) no Hoare annotation was computed. [2022-11-25 23:51:04,576 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr153ASSERT_VIOLATIONINTEGER_OVERFLOW(line 493) no Hoare annotation was computed. [2022-11-25 23:51:04,576 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr314ASSERT_VIOLATIONINTEGER_OVERFLOW(line 974) no Hoare annotation was computed. [2022-11-25 23:51:04,577 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr325ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1009) no Hoare annotation was computed. [2022-11-25 23:51:04,577 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW(line 99) no Hoare annotation was computed. [2022-11-25 23:51:04,577 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr164ASSERT_VIOLATIONINTEGER_OVERFLOW(line 529) no Hoare annotation was computed. [2022-11-25 23:51:04,577 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW(line 135) no Hoare annotation was computed. [2022-11-25 23:51:04,577 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr239ASSERT_VIOLATIONINTEGER_OVERFLOW(line 746) no Hoare annotation was computed. [2022-11-25 23:51:04,577 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr400ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1237) no Hoare annotation was computed. [2022-11-25 23:51:04,578 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr113ASSERT_VIOLATIONINTEGER_OVERFLOW(line 357) no Hoare annotation was computed. [2022-11-25 23:51:04,578 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW(line 291) no Hoare annotation was computed. [2022-11-25 23:51:04,578 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr305ASSERT_VIOLATIONINTEGER_OVERFLOW(line 949) no Hoare annotation was computed. [2022-11-25 23:51:04,578 INFO L899 garLoopResultBuilder]: For program point L1237(line 1237) no Hoare annotation was computed. [2022-11-25 23:51:04,578 INFO L899 garLoopResultBuilder]: For program point L1237-1(line 1237) no Hoare annotation was computed. [2022-11-25 23:51:04,578 INFO L899 garLoopResultBuilder]: For program point L1105(line 1105) no Hoare annotation was computed. [2022-11-25 23:51:04,578 INFO L899 garLoopResultBuilder]: For program point L1105-1(line 1105) no Hoare annotation was computed. [2022-11-25 23:51:04,579 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW(line 327) no Hoare annotation was computed. [2022-11-25 23:51:04,579 INFO L899 garLoopResultBuilder]: For program point L973(line 973) no Hoare annotation was computed. [2022-11-25 23:51:04,579 INFO L899 garLoopResultBuilder]: For program point L973-1(line 973) no Hoare annotation was computed. [2022-11-25 23:51:04,579 INFO L899 garLoopResultBuilder]: For program point L841(line 841) no Hoare annotation was computed. [2022-11-25 23:51:04,579 INFO L899 garLoopResultBuilder]: For program point L841-1(line 841) no Hoare annotation was computed. [2022-11-25 23:51:04,579 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr283ASSERT_VIOLATIONINTEGER_OVERFLOW(line 878) no Hoare annotation was computed. [2022-11-25 23:51:04,580 INFO L899 garLoopResultBuilder]: For program point L709(line 709) no Hoare annotation was computed. [2022-11-25 23:51:04,580 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr175ASSERT_VIOLATIONINTEGER_OVERFLOW(line 554) no Hoare annotation was computed. [2022-11-25 23:51:04,581 INFO L899 garLoopResultBuilder]: For program point L709-1(line 709) no Hoare annotation was computed. [2022-11-25 23:51:04,581 INFO L899 garLoopResultBuilder]: For program point L577(line 577) no Hoare annotation was computed. [2022-11-25 23:51:04,581 INFO L899 garLoopResultBuilder]: For program point L577-1(line 577) no Hoare annotation was computed. [2022-11-25 23:51:04,581 INFO L899 garLoopResultBuilder]: For program point L379(lines 379 532) no Hoare annotation was computed. [2022-11-25 23:51:04,581 INFO L899 garLoopResultBuilder]: For program point L313(lines 313 664) no Hoare annotation was computed. [2022-11-25 23:51:04,581 INFO L899 garLoopResultBuilder]: For program point L247(lines 247 796) no Hoare annotation was computed. [2022-11-25 23:51:04,582 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr327ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1010) no Hoare annotation was computed. [2022-11-25 23:51:04,582 INFO L899 garLoopResultBuilder]: For program point L1238(line 1238) no Hoare annotation was computed. [2022-11-25 23:51:04,582 INFO L899 garLoopResultBuilder]: For program point L181(lines 181 928) no Hoare annotation was computed. [2022-11-25 23:51:04,582 INFO L899 garLoopResultBuilder]: For program point L1238-1(line 1238) no Hoare annotation was computed. [2022-11-25 23:51:04,582 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr197ASSERT_VIOLATIONINTEGER_OVERFLOW(line 625) no Hoare annotation was computed. [2022-11-25 23:51:04,582 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 1060) no Hoare annotation was computed. [2022-11-25 23:51:04,583 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW(line 261) no Hoare annotation was computed. [2022-11-25 23:51:04,583 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr316ASSERT_VIOLATIONINTEGER_OVERFLOW(line 985) no Hoare annotation was computed. [2022-11-25 23:51:04,583 INFO L899 garLoopResultBuilder]: For program point L1106(line 1106) no Hoare annotation was computed. [2022-11-25 23:51:04,583 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 1192) no Hoare annotation was computed. [2022-11-25 23:51:04,583 INFO L899 garLoopResultBuilder]: For program point L1106-1(line 1106) no Hoare annotation was computed. [2022-11-25 23:51:04,583 INFO L899 garLoopResultBuilder]: For program point L974(line 974) no Hoare annotation was computed. [2022-11-25 23:51:04,583 INFO L899 garLoopResultBuilder]: For program point L974-1(line 974) no Hoare annotation was computed. [2022-11-25 23:51:04,584 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr272ASSERT_VIOLATIONINTEGER_OVERFLOW(line 853) no Hoare annotation was computed. [2022-11-25 23:51:04,584 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr186ASSERT_VIOLATIONINTEGER_OVERFLOW(line 590) no Hoare annotation was computed. [2022-11-25 23:51:04,584 INFO L899 garLoopResultBuilder]: For program point L842(line 842) no Hoare annotation was computed. [2022-11-25 23:51:04,584 INFO L899 garLoopResultBuilder]: For program point L842-1(line 842) no Hoare annotation was computed. [2022-11-25 23:51:04,584 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr402ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1238) no Hoare annotation was computed. [2022-11-25 23:51:04,584 INFO L899 garLoopResultBuilder]: For program point L710(line 710) no Hoare annotation was computed. [2022-11-25 23:51:04,585 INFO L899 garLoopResultBuilder]: For program point L710-1(line 710) no Hoare annotation was computed. [2022-11-25 23:51:04,585 INFO L899 garLoopResultBuilder]: For program point L578(line 578) no Hoare annotation was computed. [2022-11-25 23:51:04,585 INFO L899 garLoopResultBuilder]: For program point L578-1(line 578) no Hoare annotation was computed. [2022-11-25 23:51:04,585 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW(line 159) no Hoare annotation was computed. [2022-11-25 23:51:04,585 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-11-25 23:51:04,585 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr219ASSERT_VIOLATIONINTEGER_OVERFLOW(line 686) no Hoare annotation was computed. [2022-11-25 23:51:04,585 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr380ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1177) no Hoare annotation was computed. [2022-11-25 23:51:04,586 INFO L895 garLoopResultBuilder]: At program point L1239(lines 25 1240) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 2) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-11-25 23:51:04,586 INFO L895 garLoopResultBuilder]: At program point L1107(lines 91 1108) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 13)) [2022-11-25 23:51:04,586 INFO L895 garLoopResultBuilder]: At program point L975(lines 157 976) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= |ULTIMATE.start_main_~main__x~0#1| 24) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-11-25 23:51:04,586 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr208ASSERT_VIOLATIONINTEGER_OVERFLOW(line 661) no Hoare annotation was computed. [2022-11-25 23:51:04,586 INFO L895 garLoopResultBuilder]: At program point L843(lines 223 844) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 35)) [2022-11-25 23:51:04,587 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr391ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1202) no Hoare annotation was computed. [2022-11-25 23:51:04,587 INFO L895 garLoopResultBuilder]: At program point L711(lines 289 712) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 46) (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-11-25 23:51:04,587 INFO L895 garLoopResultBuilder]: At program point L579(lines 355 580) the Hoare annotation is: (let ((.cse0 (<= 50 |ULTIMATE.start_main_~main__y~0#1|))) (or (and (<= 56 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 56) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 55) .cse0 (<= 55 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 57) (<= 57 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 51) .cse0 (<= 51 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 53) (<= 53 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 52) .cse0 (<= 52 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 54) .cse0 (<= 54 |ULTIMATE.start_main_~main__x~0#1|)))) [2022-11-25 23:51:04,587 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr230ASSERT_VIOLATIONINTEGER_OVERFLOW(line 722) no Hoare annotation was computed. [2022-11-25 23:51:04,587 INFO L899 garLoopResultBuilder]: For program point L381(line 381) no Hoare annotation was computed. [2022-11-25 23:51:04,588 INFO L899 garLoopResultBuilder]: For program point L381-1(line 381) no Hoare annotation was computed. [2022-11-25 23:51:04,588 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW(line 225) no Hoare annotation was computed. [2022-11-25 23:51:04,588 INFO L899 garLoopResultBuilder]: For program point L315(line 315) no Hoare annotation was computed. [2022-11-25 23:51:04,588 INFO L899 garLoopResultBuilder]: For program point L315-1(line 315) no Hoare annotation was computed. [2022-11-25 23:51:04,588 INFO L899 garLoopResultBuilder]: For program point L249(line 249) no Hoare annotation was computed. [2022-11-25 23:51:04,588 INFO L899 garLoopResultBuilder]: For program point L249-1(line 249) no Hoare annotation was computed. [2022-11-25 23:51:04,588 INFO L899 garLoopResultBuilder]: For program point L183(line 183) no Hoare annotation was computed. [2022-11-25 23:51:04,589 INFO L899 garLoopResultBuilder]: For program point L183-1(line 183) no Hoare annotation was computed. [2022-11-25 23:51:04,589 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr369ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1141) no Hoare annotation was computed. [2022-11-25 23:51:04,589 INFO L899 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2022-11-25 23:51:04,589 INFO L899 garLoopResultBuilder]: For program point L117-1(line 117) no Hoare annotation was computed. [2022-11-25 23:51:04,589 INFO L899 garLoopResultBuilder]: For program point L51(line 51) no Hoare annotation was computed. [2022-11-25 23:51:04,589 INFO L899 garLoopResultBuilder]: For program point L51-1(line 51) no Hoare annotation was computed. [2022-11-25 23:51:04,590 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr144ASSERT_VIOLATIONINTEGER_OVERFLOW(line 469) no Hoare annotation was computed. [2022-11-25 23:51:04,590 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW(line 195) no Hoare annotation was computed. [2022-11-25 23:51:04,590 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr294ASSERT_VIOLATIONINTEGER_OVERFLOW(line 914) no Hoare annotation was computed. [2022-11-25 23:51:04,590 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW(line 141) no Hoare annotation was computed. [2022-11-25 23:51:04,590 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW(line 111) no Hoare annotation was computed. [2022-11-25 23:51:04,590 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr279ASSERT_VIOLATIONINTEGER_OVERFLOW(line 866) no Hoare annotation was computed. [2022-11-25 23:51:04,590 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr301ASSERT_VIOLATIONINTEGER_OVERFLOW(line 937) no Hoare annotation was computed. [2022-11-25 23:51:04,591 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr171ASSERT_VIOLATIONINTEGER_OVERFLOW(line 542) no Hoare annotation was computed. [2022-11-25 23:51:04,591 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr398ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1226) no Hoare annotation was computed. [2022-11-25 23:51:04,591 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr268ASSERT_VIOLATIONINTEGER_OVERFLOW(line 841) no Hoare annotation was computed. [2022-11-25 23:51:04,592 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr138ASSERT_VIOLATIONINTEGER_OVERFLOW(line 431) no Hoare annotation was computed. [2022-11-25 23:51:04,592 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr193ASSERT_VIOLATIONINTEGER_OVERFLOW(line 613) no Hoare annotation was computed. [2022-11-25 23:51:04,592 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr312ASSERT_VIOLATIONINTEGER_OVERFLOW(line 973) no Hoare annotation was computed. [2022-11-25 23:51:04,594 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr323ASSERT_VIOLATIONINTEGER_OVERFLOW(line 998) no Hoare annotation was computed. [2022-11-25 23:51:04,594 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr127ASSERT_VIOLATIONINTEGER_OVERFLOW(line 399) no Hoare annotation was computed. [2022-11-25 23:51:04,594 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr182ASSERT_VIOLATIONINTEGER_OVERFLOW(line 578) no Hoare annotation was computed. [2022-11-25 23:51:04,594 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW(line 177) no Hoare annotation was computed. [2022-11-25 23:51:04,594 INFO L899 garLoopResultBuilder]: For program point L1177(line 1177) no Hoare annotation was computed. [2022-11-25 23:51:04,595 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr204ASSERT_VIOLATIONINTEGER_OVERFLOW(line 649) no Hoare annotation was computed. [2022-11-25 23:51:04,595 INFO L899 garLoopResultBuilder]: For program point L1177-1(line 1177) no Hoare annotation was computed. [2022-11-25 23:51:04,595 INFO L899 garLoopResultBuilder]: For program point L1045(line 1045) no Hoare annotation was computed. [2022-11-25 23:51:04,595 INFO L899 garLoopResultBuilder]: For program point L1045-1(line 1045) no Hoare annotation was computed. [2022-11-25 23:51:04,595 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr376ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1165) no Hoare annotation was computed. [2022-11-25 23:51:04,595 INFO L899 garLoopResultBuilder]: For program point L913(line 913) no Hoare annotation was computed. [2022-11-25 23:51:04,595 INFO L899 garLoopResultBuilder]: For program point L913-1(line 913) no Hoare annotation was computed. [2022-11-25 23:51:04,596 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr387ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1190) no Hoare annotation was computed. [2022-11-25 23:51:04,596 INFO L899 garLoopResultBuilder]: For program point L781(line 781) no Hoare annotation was computed. [2022-11-25 23:51:04,596 INFO L899 garLoopResultBuilder]: For program point L781-1(line 781) no Hoare annotation was computed. [2022-11-25 23:51:04,596 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2022-11-25 23:51:04,596 INFO L899 garLoopResultBuilder]: For program point L649(line 649) no Hoare annotation was computed. [2022-11-25 23:51:04,596 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW(line 369) no Hoare annotation was computed. [2022-11-25 23:51:04,596 INFO L899 garLoopResultBuilder]: For program point L649-1(line 649) no Hoare annotation was computed. [2022-11-25 23:51:04,597 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr226ASSERT_VIOLATIONINTEGER_OVERFLOW(line 710) no Hoare annotation was computed. [2022-11-25 23:51:04,597 INFO L899 garLoopResultBuilder]: For program point L517(line 517) no Hoare annotation was computed. [2022-11-25 23:51:04,597 INFO L899 garLoopResultBuilder]: For program point L517-1(line 517) no Hoare annotation was computed. [2022-11-25 23:51:04,597 INFO L899 garLoopResultBuilder]: For program point L385(lines 385 520) no Hoare annotation was computed. [2022-11-25 23:51:04,597 INFO L899 garLoopResultBuilder]: For program point L319(lines 319 652) no Hoare annotation was computed. [2022-11-25 23:51:04,597 INFO L899 garLoopResultBuilder]: For program point L253(lines 253 784) no Hoare annotation was computed. [2022-11-25 23:51:04,598 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 916) no Hoare annotation was computed. [2022-11-25 23:51:04,598 INFO L899 garLoopResultBuilder]: For program point L1178(line 1178) no Hoare annotation was computed. [2022-11-25 23:51:04,598 INFO L899 garLoopResultBuilder]: For program point L121(lines 121 1048) no Hoare annotation was computed. [2022-11-25 23:51:04,598 INFO L899 garLoopResultBuilder]: For program point L1178-1(line 1178) no Hoare annotation was computed. [2022-11-25 23:51:04,598 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW(line 303) no Hoare annotation was computed. [2022-11-25 23:51:04,598 INFO L899 garLoopResultBuilder]: For program point L55(lines 55 1180) no Hoare annotation was computed. [2022-11-25 23:51:04,598 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW(line 75) no Hoare annotation was computed. [2022-11-25 23:51:04,598 INFO L899 garLoopResultBuilder]: For program point L1046(line 1046) no Hoare annotation was computed. [2022-11-25 23:51:04,599 INFO L899 garLoopResultBuilder]: For program point L1046-1(line 1046) no Hoare annotation was computed. [2022-11-25 23:51:04,599 INFO L899 garLoopResultBuilder]: For program point L914(line 914) no Hoare annotation was computed. [2022-11-25 23:51:04,599 INFO L899 garLoopResultBuilder]: For program point L914-1(line 914) no Hoare annotation was computed. [2022-11-25 23:51:04,599 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr365ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1129) no Hoare annotation was computed. [2022-11-25 23:51:04,599 INFO L899 garLoopResultBuilder]: For program point L782(line 782) no Hoare annotation was computed. [2022-11-25 23:51:04,599 INFO L899 garLoopResultBuilder]: For program point L782-1(line 782) no Hoare annotation was computed. [2022-11-25 23:51:04,599 INFO L899 garLoopResultBuilder]: For program point L650(line 650) no Hoare annotation was computed. [2022-11-25 23:51:04,600 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr215ASSERT_VIOLATIONINTEGER_OVERFLOW(line 674) no Hoare annotation was computed. [2022-11-25 23:51:04,600 INFO L899 garLoopResultBuilder]: For program point L650-1(line 650) no Hoare annotation was computed. [2022-11-25 23:51:04,600 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr105ASSERT_VIOLATIONINTEGER_OVERFLOW(line 333) no Hoare annotation was computed. [2022-11-25 23:51:04,600 INFO L899 garLoopResultBuilder]: For program point L518(line 518) no Hoare annotation was computed. [2022-11-25 23:51:04,600 INFO L899 garLoopResultBuilder]: For program point L518-1(line 518) no Hoare annotation was computed. [2022-11-25 23:51:04,600 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr290ASSERT_VIOLATIONINTEGER_OVERFLOW(line 902) no Hoare annotation was computed. [2022-11-25 23:51:04,601 INFO L895 garLoopResultBuilder]: At program point L1179(lines 55 1180) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 7)) [2022-11-25 23:51:04,601 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW(line 237) no Hoare annotation was computed. [2022-11-25 23:51:04,601 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr248ASSERT_VIOLATIONINTEGER_OVERFLOW(line 781) no Hoare annotation was computed. [2022-11-25 23:51:04,601 INFO L895 garLoopResultBuilder]: At program point L1047(lines 121 1048) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= |ULTIMATE.start_main_~main__x~0#1| 18) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-11-25 23:51:04,601 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr378ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1166) no Hoare annotation was computed. [2022-11-25 23:51:04,601 INFO L895 garLoopResultBuilder]: At program point L915(lines 187 916) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 29)) [2022-11-25 23:51:04,601 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW(line 267) no Hoare annotation was computed. [2022-11-25 23:51:04,602 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr259ASSERT_VIOLATIONINTEGER_OVERFLOW(line 806) no Hoare annotation was computed. [2022-11-25 23:51:04,602 INFO L895 garLoopResultBuilder]: At program point L783(lines 253 784) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 40) (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-11-25 23:51:04,602 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr389ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1201) no Hoare annotation was computed. [2022-11-25 23:51:04,602 INFO L895 garLoopResultBuilder]: At program point L651(lines 319 652) the Hoare annotation is: (let ((.cse0 (<= 50 |ULTIMATE.start_main_~main__y~0#1|))) (or (and (<= |ULTIMATE.start_main_~main__y~0#1| 51) .cse0 (<= 51 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) .cse0))) [2022-11-25 23:51:04,603 INFO L895 garLoopResultBuilder]: At program point L519(lines 385 520) the Hoare annotation is: (let ((.cse0 (<= 50 |ULTIMATE.start_main_~main__y~0#1|))) (or (and (<= |ULTIMATE.start_main_~main__y~0#1| 60) (<= 60 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= 56 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 56) .cse0) (and (<= 61 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 61)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 58) (<= 58 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 59) (<= 59 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 55) .cse0 (<= 55 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 62) (<= 62 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 57) (<= 57 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 51) .cse0 (<= 51 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 53) (<= 53 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 52) .cse0 (<= 52 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 54) .cse0 (<= 54 |ULTIMATE.start_main_~main__x~0#1|)))) [2022-11-25 23:51:04,603 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW(line 201) no Hoare annotation was computed. [2022-11-25 23:51:04,603 INFO L899 garLoopResultBuilder]: For program point L387(line 387) no Hoare annotation was computed. [2022-11-25 23:51:04,603 INFO L899 garLoopResultBuilder]: For program point L387-1(line 387) no Hoare annotation was computed. [2022-11-25 23:51:04,603 INFO L899 garLoopResultBuilder]: For program point L321(line 321) no Hoare annotation was computed. [2022-11-25 23:51:04,603 INFO L899 garLoopResultBuilder]: For program point L321-1(line 321) no Hoare annotation was computed. [2022-11-25 23:51:04,603 INFO L899 garLoopResultBuilder]: For program point L255(line 255) no Hoare annotation was computed. [2022-11-25 23:51:04,604 INFO L899 garLoopResultBuilder]: For program point L255-1(line 255) no Hoare annotation was computed. [2022-11-25 23:51:04,604 INFO L899 garLoopResultBuilder]: For program point L189(line 189) no Hoare annotation was computed. [2022-11-25 23:51:04,604 INFO L899 garLoopResultBuilder]: For program point L189-1(line 189) no Hoare annotation was computed. [2022-11-25 23:51:04,604 INFO L899 garLoopResultBuilder]: For program point L123(line 123) no Hoare annotation was computed. [2022-11-25 23:51:04,604 INFO L899 garLoopResultBuilder]: For program point L123-1(line 123) no Hoare annotation was computed. [2022-11-25 23:51:04,604 INFO L899 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2022-11-25 23:51:04,604 INFO L899 garLoopResultBuilder]: For program point L57-1(line 57) no Hoare annotation was computed. [2022-11-25 23:51:04,605 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr151ASSERT_VIOLATIONINTEGER_OVERFLOW(line 482) no Hoare annotation was computed. [2022-11-25 23:51:04,605 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr367ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1130) no Hoare annotation was computed. [2022-11-25 23:51:04,605 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr292ASSERT_VIOLATIONINTEGER_OVERFLOW(line 913) no Hoare annotation was computed. [2022-11-25 23:51:04,605 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr162ASSERT_VIOLATIONINTEGER_OVERFLOW(line 518) no Hoare annotation was computed. [2022-11-25 23:51:04,605 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr237ASSERT_VIOLATIONINTEGER_OVERFLOW(line 745) no Hoare annotation was computed. [2022-11-25 23:51:04,605 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 23:51:04,605 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr334ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1034) no Hoare annotation was computed. [2022-11-25 23:51:04,606 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW(line 105) no Hoare annotation was computed. [2022-11-25 23:51:04,606 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW(line 135) no Hoare annotation was computed. [2022-11-25 23:51:04,606 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr281ASSERT_VIOLATIONINTEGER_OVERFLOW(line 877) no Hoare annotation was computed. [2022-11-25 23:51:04,606 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr173ASSERT_VIOLATIONINTEGER_OVERFLOW(line 553) no Hoare annotation was computed. [2022-11-25 23:51:04,606 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr356ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1105) no Hoare annotation was computed. [2022-11-25 23:51:04,606 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr270ASSERT_VIOLATIONINTEGER_OVERFLOW(line 842) no Hoare annotation was computed. [2022-11-25 23:51:04,606 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr195ASSERT_VIOLATIONINTEGER_OVERFLOW(line 614) no Hoare annotation was computed. [2022-11-25 23:51:04,607 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW(line 430) no Hoare annotation was computed. [2022-11-25 23:51:04,607 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr125ASSERT_VIOLATIONINTEGER_OVERFLOW(line 393) no Hoare annotation was computed. [2022-11-25 23:51:04,607 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr184ASSERT_VIOLATIONINTEGER_OVERFLOW(line 589) no Hoare annotation was computed. [2022-11-25 23:51:04,607 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW(line 171) no Hoare annotation was computed. [2022-11-25 23:51:04,607 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr345ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1069) no Hoare annotation was computed. [2022-11-25 23:51:04,607 INFO L899 garLoopResultBuilder]: For program point L1249(line 1249) no Hoare annotation was computed. [2022-11-25 23:51:04,607 INFO L899 garLoopResultBuilder]: For program point L1249-1(line 1249) no Hoare annotation was computed. [2022-11-25 23:51:04,608 INFO L899 garLoopResultBuilder]: For program point L1117(line 1117) no Hoare annotation was computed. [2022-11-25 23:51:04,608 INFO L899 garLoopResultBuilder]: For program point L1117-1(line 1117) no Hoare annotation was computed. [2022-11-25 23:51:04,608 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr244ASSERT_VIOLATIONINTEGER_OVERFLOW(line 769) no Hoare annotation was computed. [2022-11-25 23:51:04,608 INFO L899 garLoopResultBuilder]: For program point L985(line 985) no Hoare annotation was computed. [2022-11-25 23:51:04,608 INFO L899 garLoopResultBuilder]: For program point L985-1(line 985) no Hoare annotation was computed. [2022-11-25 23:51:04,608 INFO L899 garLoopResultBuilder]: For program point L853(line 853) no Hoare annotation was computed. [2022-11-25 23:51:04,608 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW(line 279) no Hoare annotation was computed. [2022-11-25 23:51:04,609 INFO L899 garLoopResultBuilder]: For program point L853-1(line 853) no Hoare annotation was computed. [2022-11-25 23:51:04,609 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr374ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1154) no Hoare annotation was computed. [2022-11-25 23:51:04,609 INFO L899 garLoopResultBuilder]: For program point L721(line 721) no Hoare annotation was computed. [2022-11-25 23:51:04,609 INFO L899 garLoopResultBuilder]: For program point L721-1(line 721) no Hoare annotation was computed. [2022-11-25 23:51:04,609 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr385ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1189) no Hoare annotation was computed. [2022-11-25 23:51:04,609 INFO L899 garLoopResultBuilder]: For program point L589(line 589) no Hoare annotation was computed. [2022-11-25 23:51:04,609 INFO L899 garLoopResultBuilder]: For program point L589-1(line 589) no Hoare annotation was computed. [2022-11-25 23:51:04,610 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW(line 315) no Hoare annotation was computed. [2022-11-25 23:51:04,610 INFO L899 garLoopResultBuilder]: For program point L457(line 457) no Hoare annotation was computed. [2022-11-25 23:51:04,610 INFO L899 garLoopResultBuilder]: For program point L457-1(line 457) no Hoare annotation was computed. [2022-11-25 23:51:04,610 INFO L899 garLoopResultBuilder]: For program point L391(lines 391 508) no Hoare annotation was computed. [2022-11-25 23:51:04,610 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 640) no Hoare annotation was computed. [2022-11-25 23:51:04,610 INFO L899 garLoopResultBuilder]: For program point L259(lines 259 772) no Hoare annotation was computed. [2022-11-25 23:51:04,610 INFO L899 garLoopResultBuilder]: For program point L1250(line 1250) no Hoare annotation was computed. [2022-11-25 23:51:04,610 INFO L899 garLoopResultBuilder]: For program point L193(lines 193 904) no Hoare annotation was computed. [2022-11-25 23:51:04,611 INFO L899 garLoopResultBuilder]: For program point L1250-1(line 1250) no Hoare annotation was computed. [2022-11-25 23:51:04,611 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 1036) no Hoare annotation was computed. [2022-11-25 23:51:04,611 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr222ASSERT_VIOLATIONINTEGER_OVERFLOW(line 698) no Hoare annotation was computed. [2022-11-25 23:51:04,611 INFO L899 garLoopResultBuilder]: For program point L1118(line 1118) no Hoare annotation was computed. [2022-11-25 23:51:04,611 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 1168) no Hoare annotation was computed. [2022-11-25 23:51:04,611 INFO L899 garLoopResultBuilder]: For program point L1118-1(line 1118) no Hoare annotation was computed. [2022-11-25 23:51:04,611 INFO L899 garLoopResultBuilder]: For program point L986(line 986) no Hoare annotation was computed. [2022-11-25 23:51:04,612 INFO L899 garLoopResultBuilder]: For program point L986-1(line 986) no Hoare annotation was computed. [2022-11-25 23:51:04,612 INFO L899 garLoopResultBuilder]: For program point L854(line 854) no Hoare annotation was computed. [2022-11-25 23:51:04,612 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr147ASSERT_VIOLATIONINTEGER_OVERFLOW(line 470) no Hoare annotation was computed. [2022-11-25 23:51:04,612 INFO L899 garLoopResultBuilder]: For program point L854-1(line 854) no Hoare annotation was computed. [2022-11-25 23:51:04,612 INFO L899 garLoopResultBuilder]: For program point L722(line 722) no Hoare annotation was computed. [2022-11-25 23:51:04,612 INFO L899 garLoopResultBuilder]: For program point L722-1(line 722) no Hoare annotation was computed. [2022-11-25 23:51:04,612 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr233ASSERT_VIOLATIONINTEGER_OVERFLOW(line 733) no Hoare annotation was computed. [2022-11-25 23:51:04,613 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW(line 249) no Hoare annotation was computed. [2022-11-25 23:51:04,613 INFO L899 garLoopResultBuilder]: For program point L590(line 590) no Hoare annotation was computed. [2022-11-25 23:51:04,613 INFO L899 garLoopResultBuilder]: For program point L590-1(line 590) no Hoare annotation was computed. [2022-11-25 23:51:04,613 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr363ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1118) no Hoare annotation was computed. [2022-11-25 23:51:04,613 INFO L899 garLoopResultBuilder]: For program point L458(line 458) no Hoare annotation was computed. [2022-11-25 23:51:04,613 INFO L899 garLoopResultBuilder]: For program point L458-1(line 458) no Hoare annotation was computed. [2022-11-25 23:51:04,613 INFO L895 garLoopResultBuilder]: At program point L1251(lines 19 1252) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 1)) [2022-11-25 23:51:04,614 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr288ASSERT_VIOLATIONINTEGER_OVERFLOW(line 901) no Hoare annotation was computed. [2022-11-25 23:51:04,614 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2022-11-25 23:51:04,614 INFO L895 garLoopResultBuilder]: At program point L1119(lines 85 1120) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 12) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-11-25 23:51:04,614 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr158ASSERT_VIOLATIONINTEGER_OVERFLOW(line 506) no Hoare annotation was computed. [2022-11-25 23:51:04,614 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW(line 147) no Hoare annotation was computed. [2022-11-25 23:51:04,614 INFO L895 garLoopResultBuilder]: At program point L987(lines 151 988) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 23)) [2022-11-25 23:51:04,615 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr330ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1022) no Hoare annotation was computed. [2022-11-25 23:51:04,615 INFO L895 garLoopResultBuilder]: At program point L855(lines 217 856) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 34)) [2022-11-25 23:51:04,615 INFO L895 garLoopResultBuilder]: At program point L723(lines 283 724) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 45) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-11-25 23:51:04,615 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr319ASSERT_VIOLATIONINTEGER_OVERFLOW(line 986) no Hoare annotation was computed. [2022-11-25 23:51:04,615 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr277ASSERT_VIOLATIONINTEGER_OVERFLOW(line 865) no Hoare annotation was computed. [2022-11-25 23:51:04,615 INFO L895 garLoopResultBuilder]: At program point L591(lines 349 592) the Hoare annotation is: (let ((.cse0 (<= 50 |ULTIMATE.start_main_~main__y~0#1|))) (or (and (<= 56 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 56) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 55) .cse0 (<= 55 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 51) .cse0 (<= 51 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 53) (<= 53 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 52) .cse0 (<= 52 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 54) .cse0 (<= 54 |ULTIMATE.start_main_~main__x~0#1|)))) [2022-11-25 23:51:04,616 INFO L895 garLoopResultBuilder]: At program point L459(lines 415 460) the Hoare annotation is: (let ((.cse0 (<= 50 |ULTIMATE.start_main_~main__y~0#1|))) (or (and (<= 85 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 85) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 82) .cse0 (<= 82 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 60) (<= 60 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= 56 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 56) .cse0) (and .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 87) (<= 87 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 83) (<= 83 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= 61 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 61)) (and (<= 71 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 71) .cse0) (and (< |ULTIMATE.start_main_~main__y~0#1| 2147483615) (<= 95 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= 79 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 79)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 58) (<= 58 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= 80 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 80) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 74) (<= 74 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= 78 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 78) .cse0) (and .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 59) (<= 59 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 84 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 84) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 55) .cse0 (<= 55 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 75 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 75)) (and .cse0 (<= 65 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 65)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 68) .cse0 (<= 68 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 62) (<= 62 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= 92 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (< |ULTIMATE.start_main_~main__y~0#1| 2147483612)) (and (<= 98 |ULTIMATE.start_main_~main__x~0#1|) (< |ULTIMATE.start_main_~main__y~0#1| 2147483618) .cse0) (and (<= 63 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 63)) (and (<= 100 |ULTIMATE.start_main_~main__x~0#1|) (< |ULTIMATE.start_main_~main__y~0#1| 2147483620) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 81) .cse0 (<= 81 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 76) (<= 76 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= 93 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (< |ULTIMATE.start_main_~main__y~0#1| 2147483613)) (and (<= 94 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (< |ULTIMATE.start_main_~main__y~0#1| 2147483614)) (and (< |ULTIMATE.start_main_~main__y~0#1| 2147483610) .cse0 (<= 90 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 77 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 77) .cse0) (and (<= 91 |ULTIMATE.start_main_~main__x~0#1|) (< |ULTIMATE.start_main_~main__y~0#1| 2147483611) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 57) (<= 57 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (< |ULTIMATE.start_main_~main__y~0#1| 2147483616) .cse0 (<= 96 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 66) .cse0 (<= 66 |ULTIMATE.start_main_~main__x~0#1|)) (and (< |ULTIMATE.start_main_~main__y~0#1| 2147483619) (<= 99 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= 88 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 88)) (and (<= 70 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 70)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 51) .cse0 (<= 51 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 86 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 86)) (and (<= 64 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 64)) (and (<= 67 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 67) .cse0) (and (<= 72 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 72) .cse0) (and .cse0 (<= 69 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 69)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 73) .cse0 (<= 73 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 53) (<= 53 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (< |ULTIMATE.start_main_~main__y~0#1| 2147483609) .cse0 (<= 89 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 52) .cse0 (<= 52 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) .cse0) (and (< |ULTIMATE.start_main_~main__y~0#1| 2147483617) .cse0 (<= 97 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 54) .cse0 (<= 54 |ULTIMATE.start_main_~main__x~0#1|)))) [2022-11-25 23:51:04,617 INFO L899 garLoopResultBuilder]: For program point L393(line 393) no Hoare annotation was computed. [2022-11-25 23:51:04,617 INFO L899 garLoopResultBuilder]: For program point L393-1(line 393) no Hoare annotation was computed. [2022-11-25 23:51:04,617 INFO L899 garLoopResultBuilder]: For program point L327(line 327) no Hoare annotation was computed. [2022-11-25 23:51:04,617 INFO L899 garLoopResultBuilder]: For program point L327-1(line 327) no Hoare annotation was computed. [2022-11-25 23:51:04,617 INFO L899 garLoopResultBuilder]: For program point L261(line 261) no Hoare annotation was computed. [2022-11-25 23:51:04,617 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr169ASSERT_VIOLATIONINTEGER_OVERFLOW(line 541) no Hoare annotation was computed. [2022-11-25 23:51:04,617 INFO L899 garLoopResultBuilder]: For program point L261-1(line 261) no Hoare annotation was computed. [2022-11-25 23:51:04,618 INFO L899 garLoopResultBuilder]: For program point L195(line 195) no Hoare annotation was computed. [2022-11-25 23:51:04,618 INFO L899 garLoopResultBuilder]: For program point L195-1(line 195) no Hoare annotation was computed. [2022-11-25 23:51:04,618 INFO L899 garLoopResultBuilder]: For program point L129(line 129) no Hoare annotation was computed. [2022-11-25 23:51:04,618 INFO L899 garLoopResultBuilder]: For program point L129-1(line 129) no Hoare annotation was computed. [2022-11-25 23:51:04,618 INFO L899 garLoopResultBuilder]: For program point L63(line 63) no Hoare annotation was computed. [2022-11-25 23:51:04,618 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr352ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1093) no Hoare annotation was computed. [2022-11-25 23:51:04,618 INFO L899 garLoopResultBuilder]: For program point L63-1(line 63) no Hoare annotation was computed. [2022-11-25 23:51:04,618 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr266ASSERT_VIOLATIONINTEGER_OVERFLOW(line 830) no Hoare annotation was computed. [2022-11-25 23:51:04,619 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr180ASSERT_VIOLATIONINTEGER_OVERFLOW(line 577) no Hoare annotation was computed. [2022-11-25 23:51:04,619 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW(line 213) no Hoare annotation was computed. [2022-11-25 23:51:04,619 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr140ASSERT_VIOLATIONINTEGER_OVERFLOW(line 457) no Hoare annotation was computed. [2022-11-25 23:51:04,619 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr255ASSERT_VIOLATIONINTEGER_OVERFLOW(line 794) no Hoare annotation was computed. [2022-11-25 23:51:04,619 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr341ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1057) no Hoare annotation was computed. [2022-11-25 23:51:04,619 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW(line 183) no Hoare annotation was computed. [2022-11-25 23:51:04,619 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr129ASSERT_VIOLATIONINTEGER_OVERFLOW(line 405) no Hoare annotation was computed. [2022-11-25 23:51:04,620 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr332ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1033) no Hoare annotation was computed. [2022-11-25 23:51:04,620 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr202ASSERT_VIOLATIONINTEGER_OVERFLOW(line 638) no Hoare annotation was computed. [2022-11-25 23:51:04,620 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr191ASSERT_VIOLATIONINTEGER_OVERFLOW(line 602) no Hoare annotation was computed. [2022-11-25 23:51:04,620 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2022-11-25 23:51:04,620 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW(line 375) no Hoare annotation was computed. [2022-11-25 23:51:04,620 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr224ASSERT_VIOLATIONINTEGER_OVERFLOW(line 709) no Hoare annotation was computed. [2022-11-25 23:51:04,620 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr354ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1094) no Hoare annotation was computed. [2022-11-25 23:51:04,621 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW(line 81) no Hoare annotation was computed. [2022-11-25 23:51:04,621 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr343ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1058) no Hoare annotation was computed. [2022-11-25 23:51:04,621 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW(line 117) no Hoare annotation was computed. [2022-11-25 23:51:04,621 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr213ASSERT_VIOLATIONINTEGER_OVERFLOW(line 673) no Hoare annotation was computed. [2022-11-25 23:51:04,621 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW(line 339) no Hoare annotation was computed. [2022-11-25 23:51:04,621 INFO L899 garLoopResultBuilder]: For program point L1189(line 1189) no Hoare annotation was computed. [2022-11-25 23:51:04,621 INFO L899 garLoopResultBuilder]: For program point L1189-1(line 1189) no Hoare annotation was computed. [2022-11-25 23:51:04,622 INFO L899 garLoopResultBuilder]: For program point L1057(line 1057) no Hoare annotation was computed. [2022-11-25 23:51:04,622 INFO L899 garLoopResultBuilder]: For program point L1057-1(line 1057) no Hoare annotation was computed. [2022-11-25 23:51:04,622 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr246ASSERT_VIOLATIONINTEGER_OVERFLOW(line 770) no Hoare annotation was computed. [2022-11-25 23:51:04,622 INFO L899 garLoopResultBuilder]: For program point L925(line 925) no Hoare annotation was computed. [2022-11-25 23:51:04,622 INFO L899 garLoopResultBuilder]: For program point L925-1(line 925) no Hoare annotation was computed. [2022-11-25 23:51:04,623 INFO L899 garLoopResultBuilder]: For program point L793(line 793) no Hoare annotation was computed. [2022-11-25 23:51:04,623 INFO L899 garLoopResultBuilder]: For program point L793-1(line 793) no Hoare annotation was computed. [2022-11-25 23:51:04,623 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW(line 243) no Hoare annotation was computed. [2022-11-25 23:51:04,624 INFO L899 garLoopResultBuilder]: For program point L661(line 661) no Hoare annotation was computed. [2022-11-25 23:51:04,624 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr257ASSERT_VIOLATIONINTEGER_OVERFLOW(line 805) no Hoare annotation was computed. [2022-11-25 23:51:04,624 INFO L899 garLoopResultBuilder]: For program point L661-1(line 661) no Hoare annotation was computed. [2022-11-25 23:51:04,624 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW(line 273) no Hoare annotation was computed. [2022-11-25 23:51:04,624 INFO L899 garLoopResultBuilder]: For program point L529(line 529) no Hoare annotation was computed. [2022-11-25 23:51:04,624 INFO L899 garLoopResultBuilder]: For program point L529-1(line 529) no Hoare annotation was computed. [2022-11-25 23:51:04,624 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr299ASSERT_VIOLATIONINTEGER_OVERFLOW(line 926) no Hoare annotation was computed. [2022-11-25 23:51:04,625 INFO L899 garLoopResultBuilder]: For program point L397(lines 397 496) no Hoare annotation was computed. [2022-11-25 23:51:04,625 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW(line 309) no Hoare annotation was computed. [2022-11-25 23:51:04,625 INFO L899 garLoopResultBuilder]: For program point L331(lines 331 628) no Hoare annotation was computed. [2022-11-25 23:51:04,625 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 760) no Hoare annotation was computed. [2022-11-25 23:51:04,625 INFO L902 garLoopResultBuilder]: At program point L1256(lines 13 1258) the Hoare annotation is: true [2022-11-25 23:51:04,625 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 892) no Hoare annotation was computed. [2022-11-25 23:51:04,625 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW(line 207) no Hoare annotation was computed. [2022-11-25 23:51:04,626 INFO L899 garLoopResultBuilder]: For program point L1190(line 1190) no Hoare annotation was computed. [2022-11-25 23:51:04,626 INFO L899 garLoopResultBuilder]: For program point L133(lines 133 1024) no Hoare annotation was computed. [2022-11-25 23:51:04,626 INFO L899 garLoopResultBuilder]: For program point L1190-1(line 1190) no Hoare annotation was computed. [2022-11-25 23:51:04,626 INFO L899 garLoopResultBuilder]: For program point L67(lines 67 1156) no Hoare annotation was computed. [2022-11-25 23:51:04,626 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr407ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1250) no Hoare annotation was computed. [2022-11-25 23:51:04,626 INFO L899 garLoopResultBuilder]: For program point L1058(line 1058) no Hoare annotation was computed. [2022-11-25 23:51:04,626 INFO L899 garLoopResultBuilder]: For program point L1058-1(line 1058) no Hoare annotation was computed. [2022-11-25 23:51:04,626 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr396ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1225) no Hoare annotation was computed. [2022-11-25 23:51:04,627 INFO L899 garLoopResultBuilder]: For program point L926(line 926) no Hoare annotation was computed. [2022-11-25 23:51:04,627 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr310ASSERT_VIOLATIONINTEGER_OVERFLOW(line 962) no Hoare annotation was computed. [2022-11-25 23:51:04,627 INFO L899 garLoopResultBuilder]: For program point L926-1(line 926) no Hoare annotation was computed. [2022-11-25 23:51:04,627 INFO L899 garLoopResultBuilder]: For program point L794(line 794) no Hoare annotation was computed. [2022-11-25 23:51:04,627 INFO L899 garLoopResultBuilder]: For program point L794-1(line 794) no Hoare annotation was computed. [2022-11-25 23:51:04,627 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr149ASSERT_VIOLATIONINTEGER_OVERFLOW(line 481) no Hoare annotation was computed. [2022-11-25 23:51:04,627 INFO L899 garLoopResultBuilder]: For program point L662(line 662) no Hoare annotation was computed. [2022-11-25 23:51:04,628 INFO L899 garLoopResultBuilder]: For program point L662-1(line 662) no Hoare annotation was computed. [2022-11-25 23:51:04,628 INFO L899 garLoopResultBuilder]: For program point L530(line 530) no Hoare annotation was computed. [2022-11-25 23:51:04,628 INFO L899 garLoopResultBuilder]: For program point L530-1(line 530) no Hoare annotation was computed. [2022-11-25 23:51:04,628 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr321ASSERT_VIOLATIONINTEGER_OVERFLOW(line 997) no Hoare annotation was computed. [2022-11-25 23:51:04,628 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr160ASSERT_VIOLATIONINTEGER_OVERFLOW(line 517) no Hoare annotation was computed. [2022-11-25 23:51:04,628 INFO L895 garLoopResultBuilder]: At program point L1191(lines 49 1192) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 6)) [2022-11-25 23:51:04,628 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr235ASSERT_VIOLATIONINTEGER_OVERFLOW(line 734) no Hoare annotation was computed. [2022-11-25 23:51:04,629 INFO L895 garLoopResultBuilder]: At program point L1059(lines 115 1060) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 17)) [2022-11-25 23:51:04,629 INFO L895 garLoopResultBuilder]: At program point L927(lines 181 928) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= |ULTIMATE.start_main_~main__x~0#1| 28) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-11-25 23:51:04,629 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr328ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1021) no Hoare annotation was computed. [2022-11-25 23:51:04,629 INFO L895 garLoopResultBuilder]: At program point L795(lines 247 796) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 39)) [2022-11-25 23:51:04,629 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW(line 225) no Hoare annotation was computed. [2022-11-25 23:51:04,629 INFO L895 garLoopResultBuilder]: At program point L663(lines 313 664) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-11-25 23:51:04,630 INFO L895 garLoopResultBuilder]: At program point L531(lines 379 532) the Hoare annotation is: (let ((.cse0 (<= 50 |ULTIMATE.start_main_~main__y~0#1|))) (or (and (<= |ULTIMATE.start_main_~main__y~0#1| 60) (<= 60 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= 56 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 56) .cse0) (and (<= 61 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 61)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 58) (<= 58 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 59) (<= 59 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 55) .cse0 (<= 55 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 57) (<= 57 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 51) .cse0 (<= 51 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 53) (<= 53 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 52) .cse0 (<= 52 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 54) .cse0 (<= 54 |ULTIMATE.start_main_~main__x~0#1|)))) [2022-11-25 23:51:04,630 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr198ASSERT_VIOLATIONINTEGER_OVERFLOW(line 626) no Hoare annotation was computed. [2022-11-25 23:51:04,630 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr317ASSERT_VIOLATIONINTEGER_OVERFLOW(line 985) no Hoare annotation was computed. [2022-11-25 23:51:04,630 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW(line 189) no Hoare annotation was computed. [2022-11-25 23:51:04,630 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW(line 255) no Hoare annotation was computed. [2022-11-25 23:51:04,631 INFO L899 garLoopResultBuilder]: For program point L399(line 399) no Hoare annotation was computed. [2022-11-25 23:51:04,631 INFO L899 garLoopResultBuilder]: For program point L399-1(line 399) no Hoare annotation was computed. [2022-11-25 23:51:04,631 INFO L899 garLoopResultBuilder]: For program point L333(line 333) no Hoare annotation was computed. [2022-11-25 23:51:04,631 INFO L899 garLoopResultBuilder]: For program point L333-1(line 333) no Hoare annotation was computed. [2022-11-25 23:51:04,631 INFO L899 garLoopResultBuilder]: For program point L267(line 267) no Hoare annotation was computed. [2022-11-25 23:51:04,631 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr187ASSERT_VIOLATIONINTEGER_OVERFLOW(line 590) no Hoare annotation was computed. [2022-11-25 23:51:04,631 INFO L899 garLoopResultBuilder]: For program point L267-1(line 267) no Hoare annotation was computed. [2022-11-25 23:51:04,631 INFO L899 garLoopResultBuilder]: For program point L201(line 201) no Hoare annotation was computed. [2022-11-25 23:51:04,632 INFO L899 garLoopResultBuilder]: For program point L201-1(line 201) no Hoare annotation was computed. [2022-11-25 23:51:04,632 INFO L899 garLoopResultBuilder]: For program point L135(line 135) no Hoare annotation was computed. [2022-11-25 23:51:04,632 INFO L899 garLoopResultBuilder]: For program point L135-1(line 135) no Hoare annotation was computed. [2022-11-25 23:51:04,632 INFO L899 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2022-11-25 23:51:04,632 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2022-11-25 23:51:04,632 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr209ASSERT_VIOLATIONINTEGER_OVERFLOW(line 661) no Hoare annotation was computed. [2022-11-25 23:51:04,632 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr339ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1046) no Hoare annotation was computed. [2022-11-25 23:51:04,633 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr284ASSERT_VIOLATIONINTEGER_OVERFLOW(line 889) no Hoare annotation was computed. [2022-11-25 23:51:04,633 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr242ASSERT_VIOLATIONINTEGER_OVERFLOW(line 758) no Hoare annotation was computed. [2022-11-25 23:51:04,633 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr143ASSERT_VIOLATIONINTEGER_OVERFLOW(line 458) no Hoare annotation was computed. [2022-11-25 23:51:04,633 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW(line 93) no Hoare annotation was computed. [2022-11-25 23:51:04,633 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW(line 123) no Hoare annotation was computed. [2022-11-25 23:51:04,633 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr403ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1238) no Hoare annotation was computed. [2022-11-25 23:51:04,633 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr295ASSERT_VIOLATIONINTEGER_OVERFLOW(line 914) no Hoare annotation was computed. [2022-11-25 23:51:04,634 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr132ASSERT_VIOLATIONINTEGER_OVERFLOW(line 417) no Hoare annotation was computed. [2022-11-25 23:51:04,634 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr220ASSERT_VIOLATIONINTEGER_OVERFLOW(line 697) no Hoare annotation was computed. [2022-11-25 23:51:04,634 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW(line 159) no Hoare annotation was computed. [2022-11-25 23:51:04,634 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr306ASSERT_VIOLATIONINTEGER_OVERFLOW(line 950) no Hoare annotation was computed. [2022-11-25 23:51:04,634 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr381ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1177) no Hoare annotation was computed. [2022-11-25 23:51:04,634 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr121ASSERT_VIOLATIONINTEGER_OVERFLOW(line 381) no Hoare annotation was computed. [2022-11-25 23:51:04,634 INFO L899 garLoopResultBuilder]: For program point L1129(line 1129) no Hoare annotation was computed. [2022-11-25 23:51:04,634 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr392ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1213) no Hoare annotation was computed. [2022-11-25 23:51:04,635 INFO L899 garLoopResultBuilder]: For program point L1129-1(line 1129) no Hoare annotation was computed. [2022-11-25 23:51:04,635 INFO L899 garLoopResultBuilder]: For program point L997(line 997) no Hoare annotation was computed. [2022-11-25 23:51:04,635 INFO L899 garLoopResultBuilder]: For program point L997-1(line 997) no Hoare annotation was computed. [2022-11-25 23:51:04,635 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr231ASSERT_VIOLATIONINTEGER_OVERFLOW(line 722) no Hoare annotation was computed. [2022-11-25 23:51:04,635 INFO L899 garLoopResultBuilder]: For program point L865(line 865) no Hoare annotation was computed. [2022-11-25 23:51:04,635 INFO L899 garLoopResultBuilder]: For program point L865-1(line 865) no Hoare annotation was computed. [2022-11-25 23:51:04,635 INFO L899 garLoopResultBuilder]: For program point L733(line 733) no Hoare annotation was computed. [2022-11-25 23:51:04,636 INFO L899 garLoopResultBuilder]: For program point L733-1(line 733) no Hoare annotation was computed. [2022-11-25 23:51:04,636 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr156ASSERT_VIOLATIONINTEGER_OVERFLOW(line 505) no Hoare annotation was computed. [2022-11-25 23:51:04,636 INFO L899 garLoopResultBuilder]: For program point L601(line 601) no Hoare annotation was computed. [2022-11-25 23:51:04,636 INFO L899 garLoopResultBuilder]: For program point L601-1(line 601) no Hoare annotation was computed. [2022-11-25 23:51:04,636 INFO L899 garLoopResultBuilder]: For program point L469(line 469) no Hoare annotation was computed. [2022-11-25 23:51:04,636 INFO L899 garLoopResultBuilder]: For program point L469-1(line 469) no Hoare annotation was computed. [2022-11-25 23:51:04,636 INFO L899 garLoopResultBuilder]: For program point L403(lines 403 484) no Hoare annotation was computed. [2022-11-25 23:51:04,636 INFO L899 garLoopResultBuilder]: For program point L337(lines 337 616) no Hoare annotation was computed. [2022-11-25 23:51:04,637 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr167ASSERT_VIOLATIONINTEGER_OVERFLOW(line 530) no Hoare annotation was computed. [2022-11-25 23:51:04,637 INFO L899 garLoopResultBuilder]: For program point L271(lines 271 748) no Hoare annotation was computed. [2022-11-25 23:51:04,637 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr297ASSERT_VIOLATIONINTEGER_OVERFLOW(line 925) no Hoare annotation was computed. [2022-11-25 23:51:04,637 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 880) no Hoare annotation was computed. [2022-11-25 23:51:04,637 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 1012) no Hoare annotation was computed. [2022-11-25 23:51:04,637 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr275ASSERT_VIOLATIONINTEGER_OVERFLOW(line 854) no Hoare annotation was computed. [2022-11-25 23:51:04,637 INFO L899 garLoopResultBuilder]: For program point L1130(line 1130) no Hoare annotation was computed. [2022-11-25 23:51:04,638 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 1144) no Hoare annotation was computed. [2022-11-25 23:51:04,638 INFO L899 garLoopResultBuilder]: For program point L1130-1(line 1130) no Hoare annotation was computed. [2022-11-25 23:51:04,638 INFO L899 garLoopResultBuilder]: For program point L998(line 998) no Hoare annotation was computed. [2022-11-25 23:51:04,638 INFO L899 garLoopResultBuilder]: For program point L998-1(line 998) no Hoare annotation was computed. [2022-11-25 23:51:04,638 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW(line 351) no Hoare annotation was computed. [2022-11-25 23:51:04,638 INFO L899 garLoopResultBuilder]: For program point L866(line 866) no Hoare annotation was computed. [2022-11-25 23:51:04,638 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr405ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1249) no Hoare annotation was computed. [2022-11-25 23:51:04,638 INFO L899 garLoopResultBuilder]: For program point L866-1(line 866) no Hoare annotation was computed. [2022-11-25 23:51:04,639 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW(line 285) no Hoare annotation was computed. [2022-11-25 23:51:04,639 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr264ASSERT_VIOLATIONINTEGER_OVERFLOW(line 829) no Hoare annotation was computed. [2022-11-25 23:51:04,639 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr308ASSERT_VIOLATIONINTEGER_OVERFLOW(line 961) no Hoare annotation was computed. [2022-11-25 23:51:04,639 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr178ASSERT_VIOLATIONINTEGER_OVERFLOW(line 566) no Hoare annotation was computed. [2022-11-25 23:51:04,639 INFO L899 garLoopResultBuilder]: For program point L734(line 734) no Hoare annotation was computed. [2022-11-25 23:51:04,639 INFO L899 garLoopResultBuilder]: For program point L734-1(line 734) no Hoare annotation was computed. [2022-11-25 23:51:04,639 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr394ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1214) no Hoare annotation was computed. [2022-11-25 23:51:04,640 INFO L899 garLoopResultBuilder]: For program point L602(line 602) no Hoare annotation was computed. [2022-11-25 23:51:04,640 INFO L899 garLoopResultBuilder]: For program point L602-1(line 602) no Hoare annotation was computed. [2022-11-25 23:51:04,640 INFO L899 garLoopResultBuilder]: For program point L470(line 470) no Hoare annotation was computed. [2022-11-25 23:51:04,640 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr383ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1178) no Hoare annotation was computed. [2022-11-25 23:51:04,640 INFO L899 garLoopResultBuilder]: For program point L470-1(line 470) no Hoare annotation was computed. [2022-11-25 23:51:04,640 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 57) no Hoare annotation was computed. [2022-11-25 23:51:04,640 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr253ASSERT_VIOLATIONINTEGER_OVERFLOW(line 793) no Hoare annotation was computed. [2022-11-25 23:51:04,641 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW(line 315) no Hoare annotation was computed. [2022-11-25 23:51:04,641 INFO L895 garLoopResultBuilder]: At program point L1131(lines 79 1132) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 11) (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-11-25 23:51:04,641 INFO L895 garLoopResultBuilder]: At program point L999(lines 145 1000) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 22)) [2022-11-25 23:51:04,641 INFO L895 garLoopResultBuilder]: At program point L867(lines 211 868) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 33) (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-11-25 23:51:04,641 INFO L895 garLoopResultBuilder]: At program point L735(lines 277 736) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 44) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-11-25 23:51:04,641 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW(line 219) no Hoare annotation was computed. [2022-11-25 23:51:04,642 INFO L895 garLoopResultBuilder]: At program point L603(lines 343 604) the Hoare annotation is: (let ((.cse0 (<= 50 |ULTIMATE.start_main_~main__y~0#1|))) (or (and (<= |ULTIMATE.start_main_~main__y~0#1| 55) .cse0 (<= 55 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 51) .cse0 (<= 51 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 53) (<= 53 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 52) .cse0 (<= 52 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 54) .cse0 (<= 54 |ULTIMATE.start_main_~main__x~0#1|)))) [2022-11-25 23:51:04,642 INFO L895 garLoopResultBuilder]: At program point L471(lines 409 472) the Hoare annotation is: (let ((.cse0 (<= 50 |ULTIMATE.start_main_~main__y~0#1|))) (or (and (<= |ULTIMATE.start_main_~main__y~0#1| 60) (<= 60 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= 56 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 56) .cse0) (and (<= 61 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 61)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 58) (<= 58 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 59) (<= 59 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 55) .cse0 (<= 55 |ULTIMATE.start_main_~main__x~0#1|)) (and .cse0 (<= 65 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 65)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 62) (<= 62 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= 63 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 63)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 57) (<= 57 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 66) .cse0 (<= 66 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 51) .cse0 (<= 51 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 64 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 64)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 53) (<= 53 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 52) .cse0 (<= 52 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 54) .cse0 (<= 54 |ULTIMATE.start_main_~main__x~0#1|)))) [2022-11-25 23:51:04,642 INFO L899 garLoopResultBuilder]: For program point L405(line 405) no Hoare annotation was computed. [2022-11-25 23:51:04,642 INFO L899 garLoopResultBuilder]: For program point L405-1(line 405) no Hoare annotation was computed. [2022-11-25 23:51:04,643 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr372ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1153) no Hoare annotation was computed. [2022-11-25 23:51:04,643 INFO L899 garLoopResultBuilder]: For program point L339(line 339) no Hoare annotation was computed. [2022-11-25 23:51:04,643 INFO L899 garLoopResultBuilder]: For program point L339-1(line 339) no Hoare annotation was computed. [2022-11-25 23:51:04,643 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr200ASSERT_VIOLATIONINTEGER_OVERFLOW(line 637) no Hoare annotation was computed. [2022-11-25 23:51:04,643 INFO L899 garLoopResultBuilder]: For program point L273(line 273) no Hoare annotation was computed. [2022-11-25 23:51:04,643 INFO L899 garLoopResultBuilder]: For program point L273-1(line 273) no Hoare annotation was computed. [2022-11-25 23:51:04,643 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr189ASSERT_VIOLATIONINTEGER_OVERFLOW(line 601) no Hoare annotation was computed. [2022-11-25 23:51:04,644 INFO L899 garLoopResultBuilder]: For program point L207(line 207) no Hoare annotation was computed. [2022-11-25 23:51:04,644 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW(line 249) no Hoare annotation was computed. [2022-11-25 23:51:04,644 INFO L899 garLoopResultBuilder]: For program point L207-1(line 207) no Hoare annotation was computed. [2022-11-25 23:51:04,644 INFO L899 garLoopResultBuilder]: For program point L141(line 141) no Hoare annotation was computed. [2022-11-25 23:51:04,644 INFO L899 garLoopResultBuilder]: For program point L141-1(line 141) no Hoare annotation was computed. [2022-11-25 23:51:04,644 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2022-11-25 23:51:04,644 INFO L899 garLoopResultBuilder]: For program point L75-1(line 75) no Hoare annotation was computed. [2022-11-25 23:51:04,645 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr350ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1082) no Hoare annotation was computed. [2022-11-25 23:51:04,645 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW(line 183) no Hoare annotation was computed. [2022-11-25 23:51:04,645 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2022-11-25 23:51:04,645 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr211ASSERT_VIOLATIONINTEGER_OVERFLOW(line 662) no Hoare annotation was computed. [2022-11-25 23:51:04,645 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr361ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1117) no Hoare annotation was computed. [2022-11-25 23:51:04,645 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr286ASSERT_VIOLATIONINTEGER_OVERFLOW(line 890) no Hoare annotation was computed. [2022-11-25 23:51:04,645 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr152ASSERT_VIOLATIONINTEGER_OVERFLOW(line 493) no Hoare annotation was computed. [2022-11-25 23:51:04,646 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr271ASSERT_VIOLATIONINTEGER_OVERFLOW(line 842) no Hoare annotation was computed. [2022-11-25 23:51:04,646 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr293ASSERT_VIOLATIONINTEGER_OVERFLOW(line 913) no Hoare annotation was computed. [2022-11-25 23:51:04,646 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-11-25 23:51:04,646 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr163ASSERT_VIOLATIONINTEGER_OVERFLOW(line 518) no Hoare annotation was computed. [2022-11-25 23:51:04,646 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW(line 363) no Hoare annotation was computed. [2022-11-25 23:51:04,646 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr401ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1237) no Hoare annotation was computed. [2022-11-25 23:51:04,646 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW(line 297) no Hoare annotation was computed. [2022-11-25 23:51:04,647 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr249ASSERT_VIOLATIONINTEGER_OVERFLOW(line 781) no Hoare annotation was computed. [2022-11-25 23:51:04,647 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr260ASSERT_VIOLATIONINTEGER_OVERFLOW(line 817) no Hoare annotation was computed. [2022-11-25 23:51:04,647 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr304ASSERT_VIOLATIONINTEGER_OVERFLOW(line 949) no Hoare annotation was computed. [2022-11-25 23:51:04,647 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 69) no Hoare annotation was computed. [2022-11-25 23:51:04,647 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr379ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1166) no Hoare annotation was computed. [2022-11-25 23:51:04,647 INFO L899 garLoopResultBuilder]: For program point L1201(line 1201) no Hoare annotation was computed. [2022-11-25 23:51:04,647 INFO L899 garLoopResultBuilder]: For program point L1201-1(line 1201) no Hoare annotation was computed. [2022-11-25 23:51:04,648 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW(line 327) no Hoare annotation was computed. [2022-11-25 23:51:04,648 INFO L899 garLoopResultBuilder]: For program point L1069(line 1069) no Hoare annotation was computed. [2022-11-25 23:51:04,648 INFO L899 garLoopResultBuilder]: For program point L1069-1(line 1069) no Hoare annotation was computed. [2022-11-25 23:51:04,648 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr390ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1202) no Hoare annotation was computed. [2022-11-25 23:51:04,648 INFO L899 garLoopResultBuilder]: For program point L937(line 937) no Hoare annotation was computed. [2022-11-25 23:51:04,648 INFO L899 garLoopResultBuilder]: For program point L937-1(line 937) no Hoare annotation was computed. [2022-11-25 23:51:04,648 INFO L899 garLoopResultBuilder]: For program point L805(line 805) no Hoare annotation was computed. [2022-11-25 23:51:04,649 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr174ASSERT_VIOLATIONINTEGER_OVERFLOW(line 554) no Hoare annotation was computed. [2022-11-25 23:51:04,649 INFO L899 garLoopResultBuilder]: For program point L805-1(line 805) no Hoare annotation was computed. [2022-11-25 23:51:04,649 INFO L899 garLoopResultBuilder]: For program point L673(line 673) no Hoare annotation was computed. [2022-11-25 23:51:04,649 INFO L899 garLoopResultBuilder]: For program point L673-1(line 673) no Hoare annotation was computed. [2022-11-25 23:51:04,649 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW(line 231) no Hoare annotation was computed. [2022-11-25 23:51:04,649 INFO L899 garLoopResultBuilder]: For program point L541(line 541) no Hoare annotation was computed. [2022-11-25 23:51:04,649 INFO L899 garLoopResultBuilder]: For program point L541-1(line 541) no Hoare annotation was computed. [2022-11-25 23:51:04,650 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr357ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1105) no Hoare annotation was computed. [2022-11-25 23:51:04,650 INFO L899 garLoopResultBuilder]: For program point L409(lines 409 472) no Hoare annotation was computed. [2022-11-25 23:51:04,650 INFO L899 garLoopResultBuilder]: For program point L343(lines 343 604) no Hoare annotation was computed. [2022-11-25 23:51:04,650 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr368ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1141) no Hoare annotation was computed. [2022-11-25 23:51:04,650 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW(line 261) no Hoare annotation was computed. [2022-11-25 23:51:04,650 INFO L899 garLoopResultBuilder]: For program point L277(lines 277 736) no Hoare annotation was computed. [2022-11-25 23:51:04,650 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr196ASSERT_VIOLATIONINTEGER_OVERFLOW(line 625) no Hoare annotation was computed. [2022-11-25 23:51:04,651 INFO L899 garLoopResultBuilder]: For program point L211(lines 211 868) no Hoare annotation was computed. [2022-11-25 23:51:04,651 INFO L899 garLoopResultBuilder]: For program point L1202(line 1202) no Hoare annotation was computed. [2022-11-25 23:51:04,651 INFO L899 garLoopResultBuilder]: For program point L145(lines 145 1000) no Hoare annotation was computed. [2022-11-25 23:51:04,651 INFO L899 garLoopResultBuilder]: For program point L1202-1(line 1202) no Hoare annotation was computed. [2022-11-25 23:51:04,651 INFO L899 garLoopResultBuilder]: For program point L79(lines 79 1132) no Hoare annotation was computed. [2022-11-25 23:51:04,651 INFO L899 garLoopResultBuilder]: For program point L1070(line 1070) no Hoare annotation was computed. [2022-11-25 23:51:04,651 INFO L899 garLoopResultBuilder]: For program point L1070-1(line 1070) no Hoare annotation was computed. [2022-11-25 23:51:04,652 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr185ASSERT_VIOLATIONINTEGER_OVERFLOW(line 589) no Hoare annotation was computed. [2022-11-25 23:51:04,652 INFO L899 garLoopResultBuilder]: For program point L938(line 938) no Hoare annotation was computed. [2022-11-25 23:51:04,652 INFO L899 garLoopResultBuilder]: For program point L938-1(line 938) no Hoare annotation was computed. [2022-11-25 23:51:04,652 INFO L899 garLoopResultBuilder]: For program point L806(line 806) no Hoare annotation was computed. [2022-11-25 23:51:04,652 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW(line 195) no Hoare annotation was computed. [2022-11-25 23:51:04,652 INFO L899 garLoopResultBuilder]: For program point L806-1(line 806) no Hoare annotation was computed. [2022-11-25 23:51:04,652 INFO L899 garLoopResultBuilder]: For program point L674(line 674) no Hoare annotation was computed. [2022-11-25 23:51:04,653 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr346ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1070) no Hoare annotation was computed. [2022-11-25 23:51:04,653 INFO L899 garLoopResultBuilder]: For program point L674-1(line 674) no Hoare annotation was computed. [2022-11-25 23:51:04,653 INFO L899 garLoopResultBuilder]: For program point L542(line 542) no Hoare annotation was computed. [2022-11-25 23:51:04,653 INFO L899 garLoopResultBuilder]: For program point L542-1(line 542) no Hoare annotation was computed. [2022-11-25 23:51:04,653 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr207ASSERT_VIOLATIONINTEGER_OVERFLOW(line 650) no Hoare annotation was computed. [2022-11-25 23:51:04,653 INFO L895 garLoopResultBuilder]: At program point L1203(lines 43 1204) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 5) (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-11-25 23:51:04,653 INFO L895 garLoopResultBuilder]: At program point L1071(lines 109 1072) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= |ULTIMATE.start_main_~main__x~0#1| 16) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-11-25 23:51:04,654 INFO L895 garLoopResultBuilder]: At program point L939(lines 175 940) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 27) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-11-25 23:51:04,654 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr282ASSERT_VIOLATIONINTEGER_OVERFLOW(line 878) no Hoare annotation was computed. [2022-11-25 23:51:04,654 INFO L895 garLoopResultBuilder]: At program point L807(lines 241 808) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 38) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-11-25 23:51:04,654 INFO L895 garLoopResultBuilder]: At program point L675(lines 307 676) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 49)) [2022-11-25 23:51:04,655 INFO L895 garLoopResultBuilder]: At program point L543(lines 373 544) the Hoare annotation is: (let ((.cse0 (<= 50 |ULTIMATE.start_main_~main__y~0#1|))) (or (and (<= |ULTIMATE.start_main_~main__y~0#1| 60) (<= 60 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= 56 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 56) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 58) (<= 58 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 59) (<= 59 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 55) .cse0 (<= 55 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 57) (<= 57 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 51) .cse0 (<= 51 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 53) (<= 53 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 52) .cse0 (<= 52 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 54) .cse0 (<= 54 |ULTIMATE.start_main_~main__x~0#1|)))) [2022-11-25 23:51:04,655 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr240ASSERT_VIOLATIONINTEGER_OVERFLOW(line 757) no Hoare annotation was computed. [2022-11-25 23:51:04,655 INFO L899 garLoopResultBuilder]: For program point L411(line 411) no Hoare annotation was computed. [2022-11-25 23:51:04,655 INFO L899 garLoopResultBuilder]: For program point L411-1(line 411) no Hoare annotation was computed. [2022-11-25 23:51:04,655 INFO L899 garLoopResultBuilder]: For program point L345(line 345) no Hoare annotation was computed. [2022-11-25 23:51:04,655 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr370ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1142) no Hoare annotation was computed. [2022-11-25 23:51:04,655 INFO L899 garLoopResultBuilder]: For program point L345-1(line 345) no Hoare annotation was computed. [2022-11-25 23:51:04,656 INFO L899 garLoopResultBuilder]: For program point L279(line 279) no Hoare annotation was computed. [2022-11-25 23:51:04,656 INFO L899 garLoopResultBuilder]: For program point L279-1(line 279) no Hoare annotation was computed. [2022-11-25 23:51:04,656 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW(line 99) no Hoare annotation was computed. [2022-11-25 23:51:04,656 INFO L899 garLoopResultBuilder]: For program point L213(line 213) no Hoare annotation was computed. [2022-11-25 23:51:04,656 INFO L899 garLoopResultBuilder]: For program point L213-1(line 213) no Hoare annotation was computed. [2022-11-25 23:51:04,656 INFO L899 garLoopResultBuilder]: For program point L147(line 147) no Hoare annotation was computed. [2022-11-25 23:51:04,656 INFO L899 garLoopResultBuilder]: For program point L147-1(line 147) no Hoare annotation was computed. [2022-11-25 23:51:04,657 INFO L899 garLoopResultBuilder]: For program point L81(line 81) no Hoare annotation was computed. [2022-11-25 23:51:04,657 INFO L899 garLoopResultBuilder]: For program point L81-1(line 81) no Hoare annotation was computed. [2022-11-25 23:51:04,657 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr145ASSERT_VIOLATIONINTEGER_OVERFLOW(line 469) no Hoare annotation was computed. [2022-11-25 23:51:04,657 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW(line 129) no Hoare annotation was computed. [2022-11-25 23:51:04,657 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr348ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1081) no Hoare annotation was computed. [2022-11-25 23:51:04,657 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW(line 424) no Hoare annotation was computed. [2022-11-25 23:51:04,657 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2022-11-25 23:51:04,658 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr218ASSERT_VIOLATIONINTEGER_OVERFLOW(line 686) no Hoare annotation was computed. [2022-11-25 23:51:04,658 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr123ASSERT_VIOLATIONINTEGER_OVERFLOW(line 387) no Hoare annotation was computed. [2022-11-25 23:51:04,658 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr359ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1106) no Hoare annotation was computed. [2022-11-25 23:51:04,658 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW(line 165) no Hoare annotation was computed. [2022-11-25 23:51:04,658 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr229ASSERT_VIOLATIONINTEGER_OVERFLOW(line 721) no Hoare annotation was computed. [2022-11-25 23:51:04,658 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr154ASSERT_VIOLATIONINTEGER_OVERFLOW(line 494) no Hoare annotation was computed. [2022-11-25 23:51:04,658 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr315ASSERT_VIOLATIONINTEGER_OVERFLOW(line 974) no Hoare annotation was computed. [2022-11-25 23:51:04,659 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr326ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1010) no Hoare annotation was computed. [2022-11-25 23:51:04,659 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 1257) no Hoare annotation was computed. [2022-11-25 23:51:04,659 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr165ASSERT_VIOLATIONINTEGER_OVERFLOW(line 529) no Hoare annotation was computed. [2022-11-25 23:51:04,659 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr273ASSERT_VIOLATIONINTEGER_OVERFLOW(line 853) no Hoare annotation was computed. [2022-11-25 23:51:04,659 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr112ASSERT_VIOLATIONINTEGER_OVERFLOW(line 357) no Hoare annotation was computed. [2022-11-25 23:51:04,659 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr176ASSERT_VIOLATIONINTEGER_OVERFLOW(line 565) no Hoare annotation was computed. [2022-11-25 23:51:04,660 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW(line 291) no Hoare annotation was computed. [2022-11-25 23:51:04,660 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr251ASSERT_VIOLATIONINTEGER_OVERFLOW(line 782) no Hoare annotation was computed. [2022-11-25 23:51:04,660 INFO L899 garLoopResultBuilder]: For program point L1141(line 1141) no Hoare annotation was computed. [2022-11-25 23:51:04,660 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr262ASSERT_VIOLATIONINTEGER_OVERFLOW(line 818) no Hoare annotation was computed. [2022-11-25 23:51:04,660 INFO L899 garLoopResultBuilder]: For program point L1141-1(line 1141) no Hoare annotation was computed. [2022-11-25 23:51:04,660 INFO L899 garLoopResultBuilder]: For program point L1009(line 1009) no Hoare annotation was computed. [2022-11-25 23:51:04,660 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW(line 321) no Hoare annotation was computed. [2022-11-25 23:51:04,661 INFO L899 garLoopResultBuilder]: For program point L1009-1(line 1009) no Hoare annotation was computed. [2022-11-25 23:51:04,661 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 63) no Hoare annotation was computed. [2022-11-25 23:51:04,661 INFO L899 garLoopResultBuilder]: For program point L877(line 877) no Hoare annotation was computed. [2022-11-25 23:51:04,661 INFO L899 garLoopResultBuilder]: For program point L877-1(line 877) no Hoare annotation was computed. [2022-11-25 23:51:04,661 INFO L899 garLoopResultBuilder]: For program point L745(line 745) no Hoare annotation was computed. [2022-11-25 23:51:04,661 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr337ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1045) no Hoare annotation was computed. [2022-11-25 23:51:04,661 INFO L899 garLoopResultBuilder]: For program point L745-1(line 745) no Hoare annotation was computed. [2022-11-25 23:51:04,662 INFO L899 garLoopResultBuilder]: For program point L613(line 613) no Hoare annotation was computed. [2022-11-25 23:51:04,662 INFO L899 garLoopResultBuilder]: For program point L613-1(line 613) no Hoare annotation was computed. [2022-11-25 23:51:04,662 INFO L899 garLoopResultBuilder]: For program point L481(line 481) no Hoare annotation was computed. [2022-11-25 23:51:04,662 INFO L899 garLoopResultBuilder]: For program point L481-1(line 481) no Hoare annotation was computed. [2022-11-25 23:51:04,662 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 460) no Hoare annotation was computed. [2022-11-25 23:51:04,662 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr355ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1094) no Hoare annotation was computed. [2022-11-25 23:51:04,662 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 592) no Hoare annotation was computed. [2022-11-25 23:51:04,663 INFO L899 garLoopResultBuilder]: For program point L283(lines 283 724) no Hoare annotation was computed. [2022-11-25 23:51:04,663 INFO L899 garLoopResultBuilder]: For program point L217(lines 217 856) no Hoare annotation was computed. [2022-11-25 23:51:04,663 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW(line 303) no Hoare annotation was computed. [2022-11-25 23:51:04,663 INFO L899 garLoopResultBuilder]: For program point L151(lines 151 988) no Hoare annotation was computed. [2022-11-25 23:51:04,663 INFO L899 garLoopResultBuilder]: For program point L1142(line 1142) no Hoare annotation was computed. [2022-11-25 23:51:04,663 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 1120) no Hoare annotation was computed. [2022-11-25 23:51:04,663 INFO L899 garLoopResultBuilder]: For program point L1142-1(line 1142) no Hoare annotation was computed. [2022-11-25 23:51:04,664 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 1252) no Hoare annotation was computed. [2022-11-25 23:51:04,664 INFO L899 garLoopResultBuilder]: For program point L1010(line 1010) no Hoare annotation was computed. [2022-11-25 23:51:04,664 INFO L899 garLoopResultBuilder]: For program point L1010-1(line 1010) no Hoare annotation was computed. [2022-11-25 23:51:04,664 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr366ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1130) no Hoare annotation was computed. [2022-11-25 23:51:04,664 INFO L899 garLoopResultBuilder]: For program point L878(line 878) no Hoare annotation was computed. [2022-11-25 23:51:04,664 INFO L899 garLoopResultBuilder]: For program point L878-1(line 878) no Hoare annotation was computed. [2022-11-25 23:51:04,664 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr214ASSERT_VIOLATIONINTEGER_OVERFLOW(line 674) no Hoare annotation was computed. [2022-11-25 23:51:04,665 INFO L899 garLoopResultBuilder]: For program point L746(line 746) no Hoare annotation was computed. [2022-11-25 23:51:04,665 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW(line 339) no Hoare annotation was computed. [2022-11-25 23:51:04,665 INFO L899 garLoopResultBuilder]: For program point L746-1(line 746) no Hoare annotation was computed. [2022-11-25 23:51:04,665 INFO L899 garLoopResultBuilder]: For program point L614(line 614) no Hoare annotation was computed. [2022-11-25 23:51:04,665 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr236ASSERT_VIOLATIONINTEGER_OVERFLOW(line 745) no Hoare annotation was computed. [2022-11-25 23:51:04,665 INFO L899 garLoopResultBuilder]: For program point L614-1(line 614) no Hoare annotation was computed. [2022-11-25 23:51:04,665 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr344ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1069) no Hoare annotation was computed. [2022-11-25 23:51:04,666 INFO L899 garLoopResultBuilder]: For program point L482(line 482) no Hoare annotation was computed. [2022-11-25 23:51:04,666 INFO L899 garLoopResultBuilder]: For program point L482-1(line 482) no Hoare annotation was computed. [2022-11-25 23:51:04,666 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 23:51:04,666 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW(line 273) no Hoare annotation was computed. [2022-11-25 23:51:04,666 INFO L895 garLoopResultBuilder]: At program point L1143(lines 73 1144) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= |ULTIMATE.start_main_~main__x~0#1| 10) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-11-25 23:51:04,666 INFO L895 garLoopResultBuilder]: At program point L1011(lines 139 1012) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 21)) [2022-11-25 23:51:04,667 INFO L895 garLoopResultBuilder]: At program point L879(lines 205 880) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 32)) [2022-11-25 23:51:04,667 INFO L895 garLoopResultBuilder]: At program point L747(lines 271 748) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 43)) [2022-11-25 23:51:04,667 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2022-11-25 23:51:04,667 INFO L895 garLoopResultBuilder]: At program point L615(lines 337 616) the Hoare annotation is: (let ((.cse0 (<= 50 |ULTIMATE.start_main_~main__y~0#1|))) (or (and (<= |ULTIMATE.start_main_~main__y~0#1| 51) .cse0 (<= 51 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 53) (<= 53 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 52) .cse0 (<= 52 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 54) .cse0 (<= 54 |ULTIMATE.start_main_~main__x~0#1|)))) [2022-11-25 23:51:04,667 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr225ASSERT_VIOLATIONINTEGER_OVERFLOW(line 709) no Hoare annotation was computed. [2022-11-25 23:51:04,668 INFO L895 garLoopResultBuilder]: At program point L483(lines 403 484) the Hoare annotation is: (let ((.cse0 (<= 50 |ULTIMATE.start_main_~main__y~0#1|))) (or (and (<= |ULTIMATE.start_main_~main__y~0#1| 60) (<= 60 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= 56 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 56) .cse0) (and (<= 61 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 61)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 58) (<= 58 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 59) (<= 59 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 55) .cse0 (<= 55 |ULTIMATE.start_main_~main__x~0#1|)) (and .cse0 (<= 65 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 65)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 62) (<= 62 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= 63 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 63)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 57) (<= 57 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 51) .cse0 (<= 51 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 64 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 64)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 53) (<= 53 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 52) .cse0 (<= 52 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 54) .cse0 (<= 54 |ULTIMATE.start_main_~main__x~0#1|)))) [2022-11-25 23:51:04,668 INFO L899 garLoopResultBuilder]: For program point L417(line 417) no Hoare annotation was computed. [2022-11-25 23:51:04,668 INFO L899 garLoopResultBuilder]: For program point L417-1(line 417) no Hoare annotation was computed. [2022-11-25 23:51:04,668 INFO L899 garLoopResultBuilder]: For program point L351(line 351) no Hoare annotation was computed. [2022-11-25 23:51:04,669 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr311ASSERT_VIOLATIONINTEGER_OVERFLOW(line 962) no Hoare annotation was computed. [2022-11-25 23:51:04,669 INFO L899 garLoopResultBuilder]: For program point L351-1(line 351) no Hoare annotation was computed. [2022-11-25 23:51:04,669 INFO L899 garLoopResultBuilder]: For program point L285(line 285) no Hoare annotation was computed. [2022-11-25 23:51:04,669 INFO L899 garLoopResultBuilder]: For program point L285-1(line 285) no Hoare annotation was computed. [2022-11-25 23:51:04,669 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr269ASSERT_VIOLATIONINTEGER_OVERFLOW(line 841) no Hoare annotation was computed. [2022-11-25 23:51:04,669 INFO L899 garLoopResultBuilder]: For program point L219(line 219) no Hoare annotation was computed. [2022-11-25 23:51:04,669 INFO L899 garLoopResultBuilder]: For program point L219-1(line 219) no Hoare annotation was computed. [2022-11-25 23:51:04,670 INFO L899 garLoopResultBuilder]: For program point L153(line 153) no Hoare annotation was computed. [2022-11-25 23:51:04,670 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr150ASSERT_VIOLATIONINTEGER_OVERFLOW(line 482) no Hoare annotation was computed. [2022-11-25 23:51:04,670 INFO L899 garLoopResultBuilder]: For program point L153-1(line 153) no Hoare annotation was computed. [2022-11-25 23:51:04,670 INFO L899 garLoopResultBuilder]: For program point L87(line 87) no Hoare annotation was computed. [2022-11-25 23:51:04,670 INFO L899 garLoopResultBuilder]: For program point L87-1(line 87) no Hoare annotation was computed. [2022-11-25 23:51:04,670 INFO L899 garLoopResultBuilder]: For program point L21(line 21) no Hoare annotation was computed. [2022-11-25 23:51:04,670 INFO L899 garLoopResultBuilder]: For program point L21-1(line 21) no Hoare annotation was computed. [2022-11-25 23:51:04,671 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr322ASSERT_VIOLATIONINTEGER_OVERFLOW(line 998) no Hoare annotation was computed. [2022-11-25 23:51:04,671 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW(line 171) no Hoare annotation was computed. [2022-11-25 23:51:04,671 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr161ASSERT_VIOLATIONINTEGER_OVERFLOW(line 517) no Hoare annotation was computed. [2022-11-25 23:51:04,671 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr247ASSERT_VIOLATIONINTEGER_OVERFLOW(line 770) no Hoare annotation was computed. [2022-11-25 23:51:04,671 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr333ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1033) no Hoare annotation was computed. [2022-11-25 23:51:04,671 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW(line 237) no Hoare annotation was computed. [2022-11-25 23:51:04,672 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr258ASSERT_VIOLATIONINTEGER_OVERFLOW(line 806) no Hoare annotation was computed. [2022-11-25 23:51:04,672 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW(line 207) no Hoare annotation was computed. [2022-11-25 23:51:04,672 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr172ASSERT_VIOLATIONINTEGER_OVERFLOW(line 553) no Hoare annotation was computed. [2022-11-25 23:51:04,672 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW(line 75) no Hoare annotation was computed. [2022-11-25 23:51:04,672 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr194ASSERT_VIOLATIONINTEGER_OVERFLOW(line 614) no Hoare annotation was computed. [2022-11-25 23:51:04,672 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr324ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1009) no Hoare annotation was computed. [2022-11-25 23:51:04,673 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW(line 430) no Hoare annotation was computed. [2022-11-25 23:51:04,673 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr313ASSERT_VIOLATIONINTEGER_OVERFLOW(line 973) no Hoare annotation was computed. [2022-11-25 23:51:04,673 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW(line 399) no Hoare annotation was computed. [2022-11-25 23:51:04,673 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr183ASSERT_VIOLATIONINTEGER_OVERFLOW(line 578) no Hoare annotation was computed. [2022-11-25 23:51:04,673 INFO L899 garLoopResultBuilder]: For program point L1213(line 1213) no Hoare annotation was computed. [2022-11-25 23:51:04,673 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr335ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1034) no Hoare annotation was computed. [2022-11-25 23:51:04,673 INFO L899 garLoopResultBuilder]: For program point L1213-1(line 1213) no Hoare annotation was computed. [2022-11-25 23:51:04,674 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW(line 105) no Hoare annotation was computed. [2022-11-25 23:51:04,674 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr205ASSERT_VIOLATIONINTEGER_OVERFLOW(line 649) no Hoare annotation was computed. [2022-11-25 23:51:04,674 INFO L899 garLoopResultBuilder]: For program point L1081(line 1081) no Hoare annotation was computed. [2022-11-25 23:51:04,674 INFO L899 garLoopResultBuilder]: For program point L1081-1(line 1081) no Hoare annotation was computed. [2022-11-25 23:51:04,674 INFO L899 garLoopResultBuilder]: For program point L949(line 949) no Hoare annotation was computed. [2022-11-25 23:51:04,674 INFO L899 garLoopResultBuilder]: For program point L949-1(line 949) no Hoare annotation was computed. [2022-11-25 23:51:04,674 INFO L899 garLoopResultBuilder]: For program point L817(line 817) no Hoare annotation was computed. [2022-11-25 23:51:04,675 INFO L899 garLoopResultBuilder]: For program point L817-1(line 817) no Hoare annotation was computed. [2022-11-25 23:51:04,675 INFO L899 garLoopResultBuilder]: For program point L685(line 685) no Hoare annotation was computed. [2022-11-25 23:51:04,675 INFO L899 garLoopResultBuilder]: For program point L685-1(line 685) no Hoare annotation was computed. [2022-11-25 23:51:04,675 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW(line 141) no Hoare annotation was computed. [2022-11-25 23:51:04,675 INFO L899 garLoopResultBuilder]: For program point L553(line 553) no Hoare annotation was computed. [2022-11-25 23:51:04,675 INFO L899 garLoopResultBuilder]: For program point L553-1(line 553) no Hoare annotation was computed. [2022-11-25 23:51:04,676 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr280ASSERT_VIOLATIONINTEGER_OVERFLOW(line 877) no Hoare annotation was computed. [2022-11-25 23:51:04,676 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW(line 363) no Hoare annotation was computed. [2022-11-25 23:51:04,676 INFO L899 garLoopResultBuilder]: For program point L355(lines 355 580) no Hoare annotation was computed. [2022-11-25 23:51:04,676 INFO L899 garLoopResultBuilder]: For program point L289(lines 289 712) no Hoare annotation was computed. [2022-11-25 23:51:04,676 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 844) no Hoare annotation was computed. [2022-11-25 23:51:04,676 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr399ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1226) no Hoare annotation was computed. [2022-11-25 23:51:04,676 INFO L899 garLoopResultBuilder]: For program point L1214(line 1214) no Hoare annotation was computed. [2022-11-25 23:51:04,677 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 976) no Hoare annotation was computed. [2022-11-25 23:51:04,677 INFO L899 garLoopResultBuilder]: For program point L1214-1(line 1214) no Hoare annotation was computed. [2022-11-25 23:51:04,677 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW(line 297) no Hoare annotation was computed. [2022-11-25 23:51:04,677 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 1108) no Hoare annotation was computed. [2022-11-25 23:51:04,677 INFO L899 garLoopResultBuilder]: For program point L1082(line 1082) no Hoare annotation was computed. [2022-11-25 23:51:04,677 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 1240) no Hoare annotation was computed. [2022-11-25 23:51:04,677 INFO L899 garLoopResultBuilder]: For program point L1082-1(line 1082) no Hoare annotation was computed. [2022-11-25 23:51:04,678 INFO L899 garLoopResultBuilder]: For program point L950(line 950) no Hoare annotation was computed. [2022-11-25 23:51:04,678 INFO L899 garLoopResultBuilder]: For program point L950-1(line 950) no Hoare annotation was computed. [2022-11-25 23:51:04,678 INFO L899 garLoopResultBuilder]: For program point L818(line 818) no Hoare annotation was computed. [2022-11-25 23:51:04,678 INFO L899 garLoopResultBuilder]: For program point L818-1(line 818) no Hoare annotation was computed. [2022-11-25 23:51:04,678 INFO L899 garLoopResultBuilder]: For program point L686(line 686) no Hoare annotation was computed. [2022-11-25 23:51:04,678 INFO L899 garLoopResultBuilder]: For program point L686-1(line 686) no Hoare annotation was computed. [2022-11-25 23:51:04,678 INFO L899 garLoopResultBuilder]: For program point L554(line 554) no Hoare annotation was computed. [2022-11-25 23:51:04,679 INFO L899 garLoopResultBuilder]: For program point L554-1(line 554) no Hoare annotation was computed. [2022-11-25 23:51:04,679 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr216ASSERT_VIOLATIONINTEGER_OVERFLOW(line 685) no Hoare annotation was computed. [2022-11-25 23:51:04,679 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr238ASSERT_VIOLATIONINTEGER_OVERFLOW(line 746) no Hoare annotation was computed. [2022-11-25 23:51:04,679 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr104ASSERT_VIOLATIONINTEGER_OVERFLOW(line 333) no Hoare annotation was computed. [2022-11-25 23:51:04,679 INFO L899 garLoopResultBuilder]: For program point L422(lines 422 433) no Hoare annotation was computed. [2022-11-25 23:51:04,679 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr291ASSERT_VIOLATIONINTEGER_OVERFLOW(line 902) no Hoare annotation was computed. [2022-11-25 23:51:04,680 INFO L895 garLoopResultBuilder]: At program point L1215(lines 37 1216) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= |ULTIMATE.start_main_~main__x~0#1| 4) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-11-25 23:51:04,680 INFO L895 garLoopResultBuilder]: At program point L1083(lines 103 1084) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 15)) [2022-11-25 23:51:04,680 INFO L895 garLoopResultBuilder]: At program point L951(lines 169 952) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= |ULTIMATE.start_main_~main__x~0#1| 26) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-11-25 23:51:04,680 INFO L895 garLoopResultBuilder]: At program point L819(lines 235 820) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 37)) [2022-11-25 23:51:04,680 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr377ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1165) no Hoare annotation was computed. [2022-11-25 23:51:04,681 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW(line 267) no Hoare annotation was computed. [2022-11-25 23:51:04,681 INFO L895 garLoopResultBuilder]: At program point L687(lines 301 688) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 48)) [2022-11-25 23:51:04,681 INFO L895 garLoopResultBuilder]: At program point L555(lines 367 556) the Hoare annotation is: (let ((.cse0 (<= 50 |ULTIMATE.start_main_~main__y~0#1|))) (or (and (<= 56 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 56) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 58) (<= 58 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 59) (<= 59 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 55) .cse0 (<= 55 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 57) (<= 57 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 51) .cse0 (<= 51 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 53) (<= 53 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 52) .cse0 (<= 52 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 54) .cse0 (<= 54 |ULTIMATE.start_main_~main__x~0#1|)))) [2022-11-25 23:51:04,681 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr388ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1201) no Hoare annotation was computed. [2022-11-25 23:51:04,682 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr302ASSERT_VIOLATIONINTEGER_OVERFLOW(line 938) no Hoare annotation was computed. [2022-11-25 23:51:04,682 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2022-11-25 23:51:04,682 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr227ASSERT_VIOLATIONINTEGER_OVERFLOW(line 710) no Hoare annotation was computed. [2022-11-25 23:51:04,682 INFO L899 garLoopResultBuilder]: For program point L357(line 357) no Hoare annotation was computed. [2022-11-25 23:51:04,682 INFO L899 garLoopResultBuilder]: For program point L357-1(line 357) no Hoare annotation was computed. [2022-11-25 23:51:04,682 INFO L899 garLoopResultBuilder]: For program point L291(line 291) no Hoare annotation was computed. [2022-11-25 23:51:04,682 INFO L899 garLoopResultBuilder]: For program point L291-1(line 291) no Hoare annotation was computed. [2022-11-25 23:51:04,683 INFO L899 garLoopResultBuilder]: For program point L225(line 225) no Hoare annotation was computed. [2022-11-25 23:51:04,683 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr309ASSERT_VIOLATIONINTEGER_OVERFLOW(line 961) no Hoare annotation was computed. [2022-11-25 23:51:04,683 INFO L899 garLoopResultBuilder]: For program point L225-1(line 225) no Hoare annotation was computed. [2022-11-25 23:51:04,683 INFO L899 garLoopResultBuilder]: For program point L159(line 159) no Hoare annotation was computed. [2022-11-25 23:51:04,683 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr179ASSERT_VIOLATIONINTEGER_OVERFLOW(line 566) no Hoare annotation was computed. [2022-11-25 23:51:04,683 INFO L899 garLoopResultBuilder]: For program point L159-1(line 159) no Hoare annotation was computed. [2022-11-25 23:51:04,684 INFO L899 garLoopResultBuilder]: For program point L93(line 93) no Hoare annotation was computed. [2022-11-25 23:51:04,684 INFO L899 garLoopResultBuilder]: For program point L93-1(line 93) no Hoare annotation was computed. [2022-11-25 23:51:04,684 INFO L899 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2022-11-25 23:51:04,684 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-11-25 23:51:04,684 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW(line 87) no Hoare annotation was computed. [2022-11-25 23:51:04,684 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr141ASSERT_VIOLATIONINTEGER_OVERFLOW(line 457) no Hoare annotation was computed. [2022-11-25 23:51:04,685 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr320ASSERT_VIOLATIONINTEGER_OVERFLOW(line 997) no Hoare annotation was computed. [2022-11-25 23:51:04,685 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW(line 117) no Hoare annotation was computed. [2022-11-25 23:51:04,685 INFO L899 garLoopResultBuilder]: For program point L424(line 424) no Hoare annotation was computed. [2022-11-25 23:51:04,685 INFO L899 garLoopResultBuilder]: For program point L424-1(line 424) no Hoare annotation was computed. [2022-11-25 23:51:04,685 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr331ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1022) no Hoare annotation was computed. [2022-11-25 23:51:04,685 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2022-11-25 23:51:04,686 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW(line 153) no Hoare annotation was computed. [2022-11-25 23:51:04,686 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW(line 411) no Hoare annotation was computed. [2022-11-25 23:51:04,686 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr201ASSERT_VIOLATIONINTEGER_OVERFLOW(line 637) no Hoare annotation was computed. [2022-11-25 23:51:04,686 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr276ASSERT_VIOLATIONINTEGER_OVERFLOW(line 865) no Hoare annotation was computed. [2022-11-25 23:51:04,686 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr190ASSERT_VIOLATIONINTEGER_OVERFLOW(line 602) no Hoare annotation was computed. [2022-11-25 23:51:04,686 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW(line 375) no Hoare annotation was computed. [2022-11-25 23:51:04,687 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr406ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1250) no Hoare annotation was computed. [2022-11-25 23:51:04,687 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr223ASSERT_VIOLATIONINTEGER_OVERFLOW(line 698) no Hoare annotation was computed. [2022-11-25 23:51:04,687 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr395ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1214) no Hoare annotation was computed. [2022-11-25 23:51:04,687 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr234ASSERT_VIOLATIONINTEGER_OVERFLOW(line 734) no Hoare annotation was computed. [2022-11-25 23:51:04,687 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr212ASSERT_VIOLATIONINTEGER_OVERFLOW(line 673) no Hoare annotation was computed. [2022-11-25 23:51:04,687 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr108ASSERT_VIOLATIONINTEGER_OVERFLOW(line 345) no Hoare annotation was computed. [2022-11-25 23:51:04,688 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr287ASSERT_VIOLATIONINTEGER_OVERFLOW(line 890) no Hoare annotation was computed. [2022-11-25 23:51:04,688 INFO L899 garLoopResultBuilder]: For program point L1153(line 1153) no Hoare annotation was computed. [2022-11-25 23:51:04,688 INFO L899 garLoopResultBuilder]: For program point L1153-1(line 1153) no Hoare annotation was computed. [2022-11-25 23:51:04,688 INFO L899 garLoopResultBuilder]: For program point L1021(line 1021) no Hoare annotation was computed. [2022-11-25 23:51:04,688 INFO L899 garLoopResultBuilder]: For program point L1021-1(line 1021) no Hoare annotation was computed. [2022-11-25 23:51:04,688 INFO L899 garLoopResultBuilder]: For program point L889(line 889) no Hoare annotation was computed. [2022-11-25 23:51:04,688 INFO L899 garLoopResultBuilder]: For program point L889-1(line 889) no Hoare annotation was computed. [2022-11-25 23:51:04,689 INFO L899 garLoopResultBuilder]: For program point L757(line 757) no Hoare annotation was computed. [2022-11-25 23:51:04,689 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW(line 279) no Hoare annotation was computed. [2022-11-25 23:51:04,689 INFO L899 garLoopResultBuilder]: For program point L757-1(line 757) no Hoare annotation was computed. [2022-11-25 23:51:04,689 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr373ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1153) no Hoare annotation was computed. [2022-11-25 23:51:04,689 INFO L899 garLoopResultBuilder]: For program point L625(line 625) no Hoare annotation was computed. [2022-11-25 23:51:04,689 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr298ASSERT_VIOLATIONINTEGER_OVERFLOW(line 926) no Hoare annotation was computed. [2022-11-25 23:51:04,690 INFO L899 garLoopResultBuilder]: For program point L625-1(line 625) no Hoare annotation was computed. [2022-11-25 23:51:04,690 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr384ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1189) no Hoare annotation was computed. [2022-11-25 23:51:04,690 INFO L899 garLoopResultBuilder]: For program point L493(line 493) no Hoare annotation was computed. [2022-11-25 23:51:04,690 INFO L899 garLoopResultBuilder]: For program point L493-1(line 493) no Hoare annotation was computed. [2022-11-25 23:51:04,690 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2022-11-25 23:51:04,690 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW(line 309) no Hoare annotation was computed. [2022-11-25 23:51:04,691 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 568) no Hoare annotation was computed. [2022-11-25 23:51:04,691 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 700) no Hoare annotation was computed. [2022-11-25 23:51:04,691 INFO L899 garLoopResultBuilder]: For program point L229(lines 229 832) no Hoare annotation was computed. [2022-11-25 23:51:04,691 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 964) no Hoare annotation was computed. [2022-11-25 23:51:04,691 INFO L899 garLoopResultBuilder]: For program point L1154(line 1154) no Hoare annotation was computed. [2022-11-25 23:51:04,691 INFO L899 garLoopResultBuilder]: For program point L97(lines 97 1096) no Hoare annotation was computed. [2022-11-25 23:51:04,692 INFO L899 garLoopResultBuilder]: For program point L1154-1(line 1154) no Hoare annotation was computed. [2022-11-25 23:51:04,692 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr397ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1225) no Hoare annotation was computed. [2022-11-25 23:51:04,692 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 1228) no Hoare annotation was computed. [2022-11-25 23:51:04,692 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr267ASSERT_VIOLATIONINTEGER_OVERFLOW(line 830) no Hoare annotation was computed. [2022-11-25 23:51:04,692 INFO L899 garLoopResultBuilder]: For program point L1022(line 1022) no Hoare annotation was computed. [2022-11-25 23:51:04,692 INFO L899 garLoopResultBuilder]: For program point L1022-1(line 1022) no Hoare annotation was computed. [2022-11-25 23:51:04,693 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW(line 213) no Hoare annotation was computed. [2022-11-25 23:51:04,693 INFO L899 garLoopResultBuilder]: For program point L890(line 890) no Hoare annotation was computed. [2022-11-25 23:51:04,693 INFO L899 garLoopResultBuilder]: For program point L890-1(line 890) no Hoare annotation was computed. [2022-11-25 23:51:04,693 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr148ASSERT_VIOLATIONINTEGER_OVERFLOW(line 481) no Hoare annotation was computed. [2022-11-25 23:51:04,693 INFO L899 garLoopResultBuilder]: For program point L758(line 758) no Hoare annotation was computed. [2022-11-25 23:51:04,693 INFO L899 garLoopResultBuilder]: For program point L758-1(line 758) no Hoare annotation was computed. [2022-11-25 23:51:04,693 INFO L899 garLoopResultBuilder]: For program point L626(line 626) no Hoare annotation was computed. [2022-11-25 23:51:04,694 INFO L899 garLoopResultBuilder]: For program point L626-1(line 626) no Hoare annotation was computed. [2022-11-25 23:51:04,694 INFO L899 garLoopResultBuilder]: For program point L494(line 494) no Hoare annotation was computed. [2022-11-25 23:51:04,694 INFO L899 garLoopResultBuilder]: For program point L494-1(line 494) no Hoare annotation was computed. [2022-11-25 23:51:04,694 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr289ASSERT_VIOLATIONINTEGER_OVERFLOW(line 901) no Hoare annotation was computed. [2022-11-25 23:51:04,694 INFO L895 garLoopResultBuilder]: At program point L1155(lines 67 1156) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 9) (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-11-25 23:51:04,695 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW(line 177) no Hoare annotation was computed. [2022-11-25 23:51:04,695 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr375ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1154) no Hoare annotation was computed. [2022-11-25 23:51:04,695 INFO L895 garLoopResultBuilder]: At program point L1023(lines 133 1024) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= |ULTIMATE.start_main_~main__x~0#1| 20) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-11-25 23:51:04,695 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr159ASSERT_VIOLATIONINTEGER_OVERFLOW(line 506) no Hoare annotation was computed. [2022-11-25 23:51:04,695 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr245ASSERT_VIOLATIONINTEGER_OVERFLOW(line 769) no Hoare annotation was computed. [2022-11-25 23:51:04,696 INFO L895 garLoopResultBuilder]: At program point L891(lines 199 892) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 31)) [2022-11-25 23:51:04,696 INFO L895 garLoopResultBuilder]: At program point L759(lines 265 760) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 42)) [2022-11-25 23:51:04,696 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW(line 243) no Hoare annotation was computed. [2022-11-25 23:51:04,696 INFO L895 garLoopResultBuilder]: At program point L627(lines 331 628) the Hoare annotation is: (let ((.cse0 (<= 50 |ULTIMATE.start_main_~main__y~0#1|))) (or (and (<= |ULTIMATE.start_main_~main__y~0#1| 51) .cse0 (<= 51 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 53) (<= 53 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 52) .cse0 (<= 52 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) .cse0))) [2022-11-25 23:51:04,696 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr256ASSERT_VIOLATIONINTEGER_OVERFLOW(line 805) no Hoare annotation was computed. [2022-11-25 23:51:04,697 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr386ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1190) no Hoare annotation was computed. [2022-11-25 23:51:04,697 INFO L895 garLoopResultBuilder]: At program point L495(lines 397 496) the Hoare annotation is: (let ((.cse0 (<= 50 |ULTIMATE.start_main_~main__y~0#1|))) (or (and (<= |ULTIMATE.start_main_~main__y~0#1| 60) (<= 60 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= 56 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 56) .cse0) (and (<= 61 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 61)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 58) (<= 58 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 59) (<= 59 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 55) .cse0 (<= 55 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 62) (<= 62 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= 63 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 63)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 57) (<= 57 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 51) .cse0 (<= 51 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 64 |ULTIMATE.start_main_~main__x~0#1|) .cse0 (<= |ULTIMATE.start_main_~main__y~0#1| 64)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 53) (<= 53 |ULTIMATE.start_main_~main__x~0#1|) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 52) .cse0 (<= 52 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) .cse0) (and (<= |ULTIMATE.start_main_~main__y~0#1| 54) .cse0 (<= 54 |ULTIMATE.start_main_~main__x~0#1|)))) [2022-11-25 23:51:04,697 INFO L899 garLoopResultBuilder]: For program point L363(line 363) no Hoare annotation was computed. [2022-11-25 23:51:04,697 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr300ASSERT_VIOLATIONINTEGER_OVERFLOW(line 937) no Hoare annotation was computed. [2022-11-25 23:51:04,698 INFO L899 garLoopResultBuilder]: For program point L363-1(line 363) no Hoare annotation was computed. [2022-11-25 23:51:04,698 INFO L899 garLoopResultBuilder]: For program point L297(line 297) no Hoare annotation was computed. [2022-11-25 23:51:04,698 INFO L899 garLoopResultBuilder]: For program point L297-1(line 297) no Hoare annotation was computed. [2022-11-25 23:51:04,698 INFO L899 garLoopResultBuilder]: For program point L231(line 231) no Hoare annotation was computed. [2022-11-25 23:51:04,698 INFO L899 garLoopResultBuilder]: For program point L231-1(line 231) no Hoare annotation was computed. [2022-11-25 23:51:04,698 INFO L899 garLoopResultBuilder]: For program point L165(line 165) no Hoare annotation was computed. [2022-11-25 23:51:04,698 INFO L899 garLoopResultBuilder]: For program point L165-1(line 165) no Hoare annotation was computed. [2022-11-25 23:51:04,699 INFO L899 garLoopResultBuilder]: For program point L99(line 99) no Hoare annotation was computed. [2022-11-25 23:51:04,699 INFO L899 garLoopResultBuilder]: For program point L99-1(line 99) no Hoare annotation was computed. [2022-11-25 23:51:04,699 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr170ASSERT_VIOLATIONINTEGER_OVERFLOW(line 542) no Hoare annotation was computed. [2022-11-25 23:51:04,699 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-11-25 23:51:04,699 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr353ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1093) no Hoare annotation was computed. [2022-11-25 23:51:04,699 INFO L899 garLoopResultBuilder]: For program point L33-1(line 33) no Hoare annotation was computed. [2022-11-25 23:51:04,700 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr181ASSERT_VIOLATIONINTEGER_OVERFLOW(line 577) no Hoare annotation was computed. [2022-11-25 23:51:04,700 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW(line 431) no Hoare annotation was computed. [2022-11-25 23:51:04,700 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr192ASSERT_VIOLATIONINTEGER_OVERFLOW(line 613) no Hoare annotation was computed. [2022-11-25 23:51:04,700 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW(line 81) no Hoare annotation was computed. [2022-11-25 23:51:04,700 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr342ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1058) no Hoare annotation was computed. [2022-11-25 23:51:04,700 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr364ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1129) no Hoare annotation was computed. [2022-11-25 23:51:04,701 INFO L899 garLoopResultBuilder]: For program point L430(line 430) no Hoare annotation was computed. [2022-11-25 23:51:04,701 INFO L899 garLoopResultBuilder]: For program point L430-1(line 430) no Hoare annotation was computed. [2022-11-25 23:51:04,701 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW(line 147) no Hoare annotation was computed. [2022-11-25 23:51:04,701 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr128ASSERT_VIOLATIONINTEGER_OVERFLOW(line 405) no Hoare annotation was computed. [2022-11-25 23:51:04,701 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW(line 111) no Hoare annotation was computed. [2022-11-25 23:51:04,701 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr203ASSERT_VIOLATIONINTEGER_OVERFLOW(line 638) no Hoare annotation was computed. [2022-11-25 23:51:04,702 INFO L899 garLoopResultBuilder]: For program point L431(line 431) no Hoare annotation was computed. [2022-11-25 23:51:04,702 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr278ASSERT_VIOLATIONINTEGER_OVERFLOW(line 866) no Hoare annotation was computed. [2022-11-25 23:51:04,702 INFO L899 garLoopResultBuilder]: For program point L431-1(line 431) no Hoare annotation was computed. [2022-11-25 23:51:04,702 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW(line 369) no Hoare annotation was computed. [2022-11-25 23:51:04,706 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 23:51:04,715 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 23:51:04,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 11:51:04 BoogieIcfgContainer [2022-11-25 23:51:04,814 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 23:51:04,815 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 23:51:04,815 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 23:51:04,815 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 23:51:04,816 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:48:39" (3/4) ... [2022-11-25 23:51:04,820 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 23:51:04,860 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-11-25 23:51:04,862 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-25 23:51:04,864 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-25 23:51:04,867 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 23:51:05,032 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654de0a8-3841-4d27-b212-acb3a68a3802/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-25 23:51:05,032 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 23:51:05,033 INFO L158 Benchmark]: Toolchain (without parser) took 148273.87ms. Allocated memory was 169.9MB in the beginning and 901.8MB in the end (delta: 731.9MB). Free memory was 135.9MB in the beginning and 735.8MB in the end (delta: -600.0MB). Peak memory consumption was 131.7MB. Max. memory is 16.1GB. [2022-11-25 23:51:05,033 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 115.3MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:51:05,033 INFO L158 Benchmark]: CACSL2BoogieTranslator took 550.43ms. Allocated memory is still 169.9MB. Free memory was 135.9MB in the beginning and 131.2MB in the end (delta: 4.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 23:51:05,033 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.94ms. Allocated memory is still 169.9MB. Free memory was 131.2MB in the beginning and 127.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 23:51:05,034 INFO L158 Benchmark]: Boogie Preprocessor took 39.62ms. Allocated memory is still 169.9MB. Free memory was 126.9MB in the beginning and 124.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 23:51:05,036 INFO L158 Benchmark]: RCFGBuilder took 1756.56ms. Allocated memory is still 169.9MB. Free memory was 124.2MB in the beginning and 99.9MB in the end (delta: 24.2MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2022-11-25 23:51:05,040 INFO L158 Benchmark]: TraceAbstraction took 145624.97ms. Allocated memory was 169.9MB in the beginning and 901.8MB in the end (delta: 731.9MB). Free memory was 99.9MB in the beginning and 754.7MB in the end (delta: -654.8MB). Peak memory consumption was 513.1MB. Max. memory is 16.1GB. [2022-11-25 23:51:05,041 INFO L158 Benchmark]: Witness Printer took 217.56ms. Allocated memory is still 901.8MB. Free memory was 754.7MB in the beginning and 735.8MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 23:51:05,041 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.26ms. Allocated memory is still 115.3MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 550.43ms. Allocated memory is still 169.9MB. Free memory was 135.9MB in the beginning and 131.2MB in the end (delta: 4.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.94ms. Allocated memory is still 169.9MB. Free memory was 131.2MB in the beginning and 127.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.62ms. Allocated memory is still 169.9MB. Free memory was 126.9MB in the beginning and 124.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1756.56ms. Allocated memory is still 169.9MB. Free memory was 124.2MB in the beginning and 99.9MB in the end (delta: 24.2MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * TraceAbstraction took 145624.97ms. Allocated memory was 169.9MB in the beginning and 901.8MB in the end (delta: 731.9MB). Free memory was 99.9MB in the beginning and 754.7MB in the end (delta: -654.8MB). Peak memory consumption was 513.1MB. Max. memory is 16.1GB. * Witness Printer took 217.56ms. Allocated memory is still 901.8MB. Free memory was 754.7MB in the beginning and 735.8MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. 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: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 63]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 93]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 93]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 99]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 111]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 111]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 117]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 117]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 123]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 123]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 129]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 129]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 135]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 135]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 147]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 147]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 153]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 153]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 159]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 159]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 165]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 165]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 171]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 171]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 177]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 177]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 183]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 183]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 189]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 189]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 195]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 195]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 201]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 201]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 207]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 207]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 213]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 213]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 219]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 219]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 225]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 225]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 231]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 231]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 237]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 237]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 243]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 243]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 249]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 249]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 255]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 255]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 261]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 261]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 267]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 267]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 273]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 273]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 279]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 279]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 285]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 285]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 291]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 291]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 297]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 297]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 303]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 303]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 309]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 309]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 315]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 315]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 321]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 321]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 327]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 327]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 333]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 333]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 339]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 339]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 345]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 345]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 351]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 351]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 357]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 357]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 363]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 363]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 369]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 369]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 375]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 375]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 381]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 381]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 387]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 387]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 393]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 393]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 399]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 399]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 405]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 405]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 411]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 411]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 417]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 417]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 424]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 424]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 430]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 430]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 431]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 431]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 457]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 457]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 458]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 458]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 469]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 469]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 470]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 470]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 481]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 481]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 482]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 482]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 493]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 493]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 494]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 494]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 505]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 505]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 506]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 506]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 517]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 517]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 518]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 518]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 529]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 529]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 530]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 530]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 541]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 541]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 542]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 542]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 554]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 554]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 565]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 565]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 577]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 577]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 578]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 578]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 589]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 589]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 590]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 601]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 601]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 613]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 613]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 614]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 614]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 626]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 626]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 637]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 637]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 638]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 638]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 649]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 649]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 650]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 650]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 661]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 661]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 662]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 662]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 673]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 673]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 674]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 674]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 685]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 685]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 686]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 686]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 697]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 697]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 698]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 698]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 709]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 709]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 710]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 710]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 721]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 721]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 722]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 722]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 733]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 733]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 734]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 734]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 745]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 745]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 746]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 746]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 757]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 757]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 758]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 758]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 769]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 769]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 770]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 770]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 781]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 781]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 782]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 782]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 793]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 793]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 794]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 794]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 805]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 805]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 806]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 806]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 817]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 817]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 818]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 818]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 829]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 829]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 830]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 830]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 841]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 841]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 842]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 842]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 853]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 853]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 854]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 854]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 865]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 865]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 866]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 866]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 877]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 877]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 878]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 878]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 889]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 889]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 890]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 890]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 901]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 901]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 902]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 902]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 913]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 913]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 914]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 914]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 925]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 925]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 926]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 926]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 937]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 937]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 938]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 938]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 949]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 949]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 950]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 950]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 961]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 961]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 962]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 962]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 973]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 973]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 974]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 974]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 985]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 985]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 986]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 986]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 997]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 997]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 998]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 998]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1009]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1009]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1010]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1010]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1021]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1021]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1022]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1022]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1033]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1033]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1034]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1034]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1045]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1045]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1046]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1046]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1057]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1057]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1058]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1058]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1069]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1069]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1070]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1070]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1081]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1081]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1082]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1082]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1093]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1093]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1094]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1094]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1105]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1106]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1117]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1117]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1129]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1129]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1130]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1130]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1142]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1142]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1153]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1153]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1154]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1154]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1165]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1165]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1166]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1166]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1177]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1177]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1178]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1178]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1189]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1189]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1190]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1190]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1201]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1201]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1202]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1202]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1213]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1213]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1214]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1214]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1225]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1225]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1237]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1237]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1238]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1238]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1249]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1249]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1250]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1250]: 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 1 procedures, 955 locations, 408 error locations. Started 1 CEGAR loops. OverallTime: 145.4s, OverallIterations: 74, TraceHistogramMax: 62, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 59.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 45404 SdHoareTripleChecker+Valid, 49.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45404 mSDsluCounter, 73318 SdHoareTripleChecker+Invalid, 40.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42760 mSDsCounter, 5443 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 88548 IncrementalHoareTripleChecker+Invalid, 93991 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5443 mSolverCounterUnsat, 30558 mSDtfsCounter, 88548 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4557 GetRequests, 2685 SyntacticMatches, 0 SemanticMatches, 1872 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28060 ImplicationChecksByTransitivity, 48.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2136occurred in iteration=8, InterpolantAutomatonStates: 1765, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 74 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 68 LocationsWithAnnotation, 68 PreInvPairs, 322 NumberOfFragments, 2695 HoareAnnotationTreeSize, 68 FomulaSimplifications, 615 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 68 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 53.9s InterpolantComputationTime, 13059 NumberOfCodeBlocks, 13059 NumberOfCodeBlocksAsserted, 99 NumberOfCheckSat, 13730 ConstructedInterpolants, 0 QuantifiedInterpolants, 38314 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2363 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 79 InterpolantComputations, 72 PerfectInterpolantSequences, 11346/26868 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 408 specifications checked. All of them hold - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__x <= 8) && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 31 - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 39 - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 35 - InvariantResult [Line: 241]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__x <= 38) && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: (((((main__y <= 51 && 50 <= main__y) && 51 <= main__x) || ((main__y <= 53 && 53 <= main__x) && 50 <= main__y)) || ((main__y <= 52 && 50 <= main__y) && 52 <= main__x)) || ((1 <= main__x && main__y <= 50) && 50 <= main__y)) || ((main__y <= 54 && 50 <= main__y) && 54 <= main__x) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && main__x <= 16) && 50 <= main__y - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((85 <= main__x && main__y <= 85) && 50 <= main__y) || ((main__y <= 82 && 50 <= main__y) && 82 <= main__x)) || ((main__y <= 60 && 60 <= main__x) && 50 <= main__y)) || ((56 <= main__x && main__y <= 56) && 50 <= main__y)) || ((50 <= main__y && main__y <= 87) && 87 <= main__x)) || ((main__y <= 83 && 83 <= main__x) && 50 <= main__y)) || ((61 <= main__x && 50 <= main__y) && main__y <= 61)) || ((71 <= main__x && main__y <= 71) && 50 <= main__y)) || ((main__y < 2147483615 && 95 <= main__x) && 50 <= main__y)) || ((79 <= main__x && 50 <= main__y) && main__y <= 79)) || ((main__y <= 58 && 58 <= main__x) && 50 <= main__y)) || ((80 <= main__x && main__y <= 80) && 50 <= main__y)) || ((main__y <= 74 && 74 <= main__x) && 50 <= main__y)) || ((78 <= main__x && main__y <= 78) && 50 <= main__y)) || ((50 <= main__y && main__y <= 59) && 59 <= main__x)) || ((84 <= main__x && main__y <= 84) && 50 <= main__y)) || ((main__y <= 55 && 50 <= main__y) && 55 <= main__x)) || ((75 <= main__x && 50 <= main__y) && main__y <= 75)) || ((50 <= main__y && 65 <= main__x) && main__y <= 65)) || ((main__y <= 68 && 50 <= main__y) && 68 <= main__x)) || ((main__y <= 62 && 62 <= main__x) && 50 <= main__y)) || ((92 <= main__x && 50 <= main__y) && main__y < 2147483612)) || ((98 <= main__x && main__y < 2147483618) && 50 <= main__y)) || ((63 <= main__x && 50 <= main__y) && main__y <= 63)) || ((100 <= main__x && main__y < 2147483620) && 50 <= main__y)) || ((main__y <= 81 && 50 <= main__y) && 81 <= main__x)) || ((main__y <= 76 && 76 <= main__x) && 50 <= main__y)) || ((93 <= main__x && 50 <= main__y) && main__y < 2147483613)) || ((94 <= main__x && 50 <= main__y) && main__y < 2147483614)) || ((main__y < 2147483610 && 50 <= main__y) && 90 <= main__x)) || ((77 <= main__x && main__y <= 77) && 50 <= main__y)) || ((91 <= main__x && main__y < 2147483611) && 50 <= main__y)) || ((main__y <= 57 && 57 <= main__x) && 50 <= main__y)) || ((main__y < 2147483616 && 50 <= main__y) && 96 <= main__x)) || ((main__y <= 66 && 50 <= main__y) && 66 <= main__x)) || ((main__y < 2147483619 && 99 <= main__x) && 50 <= main__y)) || ((88 <= main__x && 50 <= main__y) && main__y <= 88)) || ((70 <= main__x && 50 <= main__y) && main__y <= 70)) || ((main__y <= 51 && 50 <= main__y) && 51 <= main__x)) || ((86 <= main__x && 50 <= main__y) && main__y <= 86)) || ((64 <= main__x && 50 <= main__y) && main__y <= 64)) || ((67 <= main__x && main__y <= 67) && 50 <= main__y)) || ((72 <= main__x && main__y <= 72) && 50 <= main__y)) || ((50 <= main__y && 69 <= main__x) && main__y <= 69)) || ((main__y <= 73 && 50 <= main__y) && 73 <= main__x)) || ((main__y <= 53 && 53 <= main__x) && 50 <= main__y)) || ((main__y < 2147483609 && 50 <= main__y) && 89 <= main__x)) || ((main__y <= 52 && 50 <= main__y) && 52 <= main__x)) || ((1 <= main__x && main__y <= 50) && 50 <= main__y)) || ((main__y < 2147483617 && 50 <= main__y) && 97 <= main__x)) || ((main__y <= 54 && 50 <= main__y) && 54 <= main__x) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && main__x <= 4) && 50 <= main__y - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: ((main__x <= 40 && 1 <= main__x) && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 355]: Loop Invariant Derived loop invariant: ((((((((56 <= main__x && main__y <= 56) && 50 <= main__y) || ((main__y <= 55 && 50 <= main__y) && 55 <= main__x)) || ((main__y <= 57 && 57 <= main__x) && 50 <= main__y)) || ((main__y <= 51 && 50 <= main__y) && 51 <= main__x)) || ((main__y <= 53 && 53 <= main__x) && 50 <= main__y)) || ((main__y <= 52 && 50 <= main__y) && 52 <= main__x)) || ((1 <= main__x && main__y <= 50) && 50 <= main__y)) || ((main__y <= 54 && 50 <= main__y) && 54 <= main__x) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 43 - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 13 - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && main__x <= 28) && 50 <= main__y - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 34 - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && main__x <= 10) && 50 <= main__y - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 21 - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: (1 <= main__x && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 385]: Loop Invariant Derived loop invariant: (((((((((((((main__y <= 60 && 60 <= main__x) && 50 <= main__y) || ((56 <= main__x && main__y <= 56) && 50 <= main__y)) || ((61 <= main__x && 50 <= main__y) && main__y <= 61)) || ((main__y <= 58 && 58 <= main__x) && 50 <= main__y)) || ((50 <= main__y && main__y <= 59) && 59 <= main__x)) || ((main__y <= 55 && 50 <= main__y) && 55 <= main__x)) || ((main__y <= 62 && 62 <= main__x) && 50 <= main__y)) || ((main__y <= 57 && 57 <= main__x) && 50 <= main__y)) || ((main__y <= 51 && 50 <= main__y) && 51 <= main__x)) || ((main__y <= 53 && 53 <= main__x) && 50 <= main__y)) || ((main__y <= 52 && 50 <= main__y) && 52 <= main__x)) || ((1 <= main__x && main__y <= 50) && 50 <= main__y)) || ((main__y <= 54 && 50 <= main__y) && 54 <= main__x) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((main__x <= 5 && 1 <= main__x) && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 32 - InvariantResult [Line: 391]: Loop Invariant Derived loop invariant: ((((((((((((((main__y <= 60 && 60 <= main__x) && 50 <= main__y) || ((56 <= main__x && main__y <= 56) && 50 <= main__y)) || ((61 <= main__x && 50 <= main__y) && main__y <= 61)) || ((main__y <= 58 && 58 <= main__x) && 50 <= main__y)) || ((50 <= main__y && main__y <= 59) && 59 <= main__x)) || ((main__y <= 55 && 50 <= main__y) && 55 <= main__x)) || ((main__y <= 62 && 62 <= main__x) && 50 <= main__y)) || ((63 <= main__x && 50 <= main__y) && main__y <= 63)) || ((main__y <= 57 && 57 <= main__x) && 50 <= main__y)) || ((main__y <= 51 && 50 <= main__y) && 51 <= main__x)) || ((main__y <= 53 && 53 <= main__x) && 50 <= main__y)) || ((main__y <= 52 && 50 <= main__y) && 52 <= main__x)) || ((1 <= main__x && main__y <= 50) && 50 <= main__y)) || ((main__y <= 54 && 50 <= main__y) && 54 <= main__x) - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: ((main__x <= 9 && 1 <= main__x) && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 397]: Loop Invariant Derived loop invariant: (((((((((((((((main__y <= 60 && 60 <= main__x) && 50 <= main__y) || ((56 <= main__x && main__y <= 56) && 50 <= main__y)) || ((61 <= main__x && 50 <= main__y) && main__y <= 61)) || ((main__y <= 58 && 58 <= main__x) && 50 <= main__y)) || ((50 <= main__y && main__y <= 59) && 59 <= main__x)) || ((main__y <= 55 && 50 <= main__y) && 55 <= main__x)) || ((main__y <= 62 && 62 <= main__x) && 50 <= main__y)) || ((63 <= main__x && 50 <= main__y) && main__y <= 63)) || ((main__y <= 57 && 57 <= main__x) && 50 <= main__y)) || ((main__y <= 51 && 50 <= main__y) && 51 <= main__x)) || ((64 <= main__x && 50 <= main__y) && main__y <= 64)) || ((main__y <= 53 && 53 <= main__x) && 50 <= main__y)) || ((main__y <= 52 && 50 <= main__y) && 52 <= main__x)) || ((1 <= main__x && main__y <= 50) && 50 <= main__y)) || ((main__y <= 54 && 50 <= main__y) && 54 <= main__x) - InvariantResult [Line: 229]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && main__x <= 36) && 50 <= main__y - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 15 - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 29 - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__x <= 12) && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 409]: Loop Invariant Derived loop invariant: (((((((((((((((((main__y <= 60 && 60 <= main__x) && 50 <= main__y) || ((56 <= main__x && main__y <= 56) && 50 <= main__y)) || ((61 <= main__x && 50 <= main__y) && main__y <= 61)) || ((main__y <= 58 && 58 <= main__x) && 50 <= main__y)) || ((50 <= main__y && main__y <= 59) && 59 <= main__x)) || ((main__y <= 55 && 50 <= main__y) && 55 <= main__x)) || ((50 <= main__y && 65 <= main__x) && main__y <= 65)) || ((main__y <= 62 && 62 <= main__x) && 50 <= main__y)) || ((63 <= main__x && 50 <= main__y) && main__y <= 63)) || ((main__y <= 57 && 57 <= main__x) && 50 <= main__y)) || ((main__y <= 66 && 50 <= main__y) && 66 <= main__x)) || ((main__y <= 51 && 50 <= main__y) && 51 <= main__x)) || ((64 <= main__x && 50 <= main__y) && main__y <= 64)) || ((main__y <= 53 && 53 <= main__x) && 50 <= main__y)) || ((main__y <= 52 && 50 <= main__y) && 52 <= main__x)) || ((1 <= main__x && main__y <= 50) && 50 <= main__y)) || ((main__y <= 54 && 50 <= main__y) && 54 <= main__x) - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 23 - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && main__x <= 20) && 50 <= main__y - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__x <= 41) && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__x <= 25) && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && main__x <= 30) && 50 <= main__y - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && main__x <= 26) && 50 <= main__y - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ((((((((((((((((main__y <= 60 && 60 <= main__x) && 50 <= main__y) || ((56 <= main__x && main__y <= 56) && 50 <= main__y)) || ((61 <= main__x && 50 <= main__y) && main__y <= 61)) || ((main__y <= 58 && 58 <= main__x) && 50 <= main__y)) || ((50 <= main__y && main__y <= 59) && 59 <= main__x)) || ((main__y <= 55 && 50 <= main__y) && 55 <= main__x)) || ((50 <= main__y && 65 <= main__x) && main__y <= 65)) || ((main__y <= 62 && 62 <= main__x) && 50 <= main__y)) || ((63 <= main__x && 50 <= main__y) && main__y <= 63)) || ((main__y <= 57 && 57 <= main__x) && 50 <= main__y)) || ((main__y <= 51 && 50 <= main__y) && 51 <= main__x)) || ((64 <= main__x && 50 <= main__y) && main__y <= 64)) || ((main__y <= 53 && 53 <= main__x) && 50 <= main__y)) || ((main__y <= 52 && 50 <= main__y) && 52 <= main__x)) || ((1 <= main__x && main__y <= 50) && 50 <= main__y)) || ((main__y <= 54 && 50 <= main__y) && 54 <= main__x) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 42 - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: (((main__y <= 51 && 50 <= main__y) && 51 <= main__x) || ((main__y <= 52 && 50 <= main__y) && 52 <= main__x)) || ((1 <= main__x && main__y <= 50) && 50 <= main__y) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((main__x <= 19 && 1 <= main__x) && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: ((((((((((((main__y <= 60 && 60 <= main__x) && 50 <= main__y) || ((56 <= main__x && main__y <= 56) && 50 <= main__y)) || ((61 <= main__x && 50 <= main__y) && main__y <= 61)) || ((main__y <= 58 && 58 <= main__x) && 50 <= main__y)) || ((50 <= main__y && main__y <= 59) && 59 <= main__x)) || ((main__y <= 55 && 50 <= main__y) && 55 <= main__x)) || ((main__y <= 57 && 57 <= main__x) && 50 <= main__y)) || ((main__y <= 51 && 50 <= main__y) && 51 <= main__x)) || ((main__y <= 53 && 53 <= main__x) && 50 <= main__y)) || ((main__y <= 52 && 50 <= main__y) && 52 <= main__x)) || ((1 <= main__x && main__y <= 50) && 50 <= main__y)) || ((main__y <= 54 && 50 <= main__y) && 54 <= main__x) - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: ((main__x <= 33 && 1 <= main__x) && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: ((main__x <= 46 && 1 <= main__x) && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__x <= 47) && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && main__x <= 24) && 50 <= main__y - InvariantResult [Line: 349]: Loop Invariant Derived loop invariant: (((((((56 <= main__x && main__y <= 56) && 50 <= main__y) || ((main__y <= 55 && 50 <= main__y) && 55 <= main__x)) || ((main__y <= 51 && 50 <= main__y) && 51 <= main__x)) || ((main__y <= 53 && 53 <= main__x) && 50 <= main__y)) || ((main__y <= 52 && 50 <= main__y) && 52 <= main__x)) || ((1 <= main__x && main__y <= 50) && 50 <= main__y)) || ((main__y <= 54 && 50 <= main__y) && 54 <= main__x) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: (((((((((56 <= main__x && main__y <= 56) && 50 <= main__y) || ((main__y <= 58 && 58 <= main__x) && 50 <= main__y)) || ((main__y <= 55 && 50 <= main__y) && 55 <= main__x)) || ((main__y <= 57 && 57 <= main__x) && 50 <= main__y)) || ((main__y <= 51 && 50 <= main__y) && 51 <= main__x)) || ((main__y <= 53 && 53 <= main__x) && 50 <= main__y)) || ((main__y <= 52 && 50 <= main__y) && 52 <= main__x)) || ((1 <= main__x && main__y <= 50) && 50 <= main__y)) || ((main__y <= 54 && 50 <= main__y) && 54 <= main__x) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 7 - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: (((((((((((main__y <= 60 && 60 <= main__x) && 50 <= main__y) || ((56 <= main__x && main__y <= 56) && 50 <= main__y)) || ((main__y <= 58 && 58 <= main__x) && 50 <= main__y)) || ((50 <= main__y && main__y <= 59) && 59 <= main__x)) || ((main__y <= 55 && 50 <= main__y) && 55 <= main__x)) || ((main__y <= 57 && 57 <= main__x) && 50 <= main__y)) || ((main__y <= 51 && 50 <= main__y) && 51 <= main__x)) || ((main__y <= 53 && 53 <= main__x) && 50 <= main__y)) || ((main__y <= 52 && 50 <= main__y) && 52 <= main__x)) || ((1 <= main__x && main__y <= 50) && 50 <= main__y)) || ((main__y <= 54 && 50 <= main__y) && 54 <= main__x) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 37 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__x <= 2) && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: ((main__y <= 51 && 50 <= main__y) && 51 <= main__x) || ((1 <= main__x && main__y <= 50) && 50 <= main__y) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 17 - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 22 - InvariantResult [Line: 343]: Loop Invariant Derived loop invariant: ((((((main__y <= 55 && 50 <= main__y) && 55 <= main__x) || ((main__y <= 51 && 50 <= main__y) && 51 <= main__x)) || ((main__y <= 53 && 53 <= main__x) && 50 <= main__y)) || ((main__y <= 52 && 50 <= main__y) && 52 <= main__x)) || ((1 <= main__x && main__y <= 50) && 50 <= main__y)) || ((main__y <= 54 && 50 <= main__y) && 54 <= main__x) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 6 - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 3 - InvariantResult [Line: 301]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 48 - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: ((((main__y <= 51 && 50 <= main__y) && 51 <= main__x) || ((main__y <= 53 && 53 <= main__x) && 50 <= main__y)) || ((main__y <= 52 && 50 <= main__y) && 52 <= main__x)) || ((1 <= main__x && main__y <= 50) && 50 <= main__y) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((main__x <= 14 && 1 <= main__x) && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__x <= 44) && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: ((((((((((56 <= main__x && main__y <= 56) && 50 <= main__y) || ((main__y <= 58 && 58 <= main__x) && 50 <= main__y)) || ((50 <= main__y && main__y <= 59) && 59 <= main__x)) || ((main__y <= 55 && 50 <= main__y) && 55 <= main__x)) || ((main__y <= 57 && 57 <= main__x) && 50 <= main__y)) || ((main__y <= 51 && 50 <= main__y) && 51 <= main__x)) || ((main__y <= 53 && 53 <= main__x) && 50 <= main__y)) || ((main__y <= 52 && 50 <= main__y) && 52 <= main__x)) || ((1 <= main__x && main__y <= 50) && 50 <= main__y)) || ((main__y <= 54 && 50 <= main__y) && 54 <= main__x) - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: ((main__x <= 11 && 1 <= main__x) && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__x <= 45) && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && main__x <= 18) && 50 <= main__y - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 1 - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 49 - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__x <= 27) && main__y <= 50) && 50 <= main__y RESULT: Ultimate proved your program to be correct! [2022-11-25 23:51:05,125 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_654de0a8-3841-4d27-b212-acb3a68a3802/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE