./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5237d83 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_2b624044-81a2-4aa3-a56b-42ff3bb45b25/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b624044-81a2-4aa3-a56b-42ff3bb45b25/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b624044-81a2-4aa3-a56b-42ff3bb45b25/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b624044-81a2-4aa3-a56b-42ff3bb45b25/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b624044-81a2-4aa3-a56b-42ff3bb45b25/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b624044-81a2-4aa3-a56b-42ff3bb45b25/bin/uautomizer-vX5HgA9Q3a --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 --- 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-b5237d8 [2022-11-21 13:45:00,144 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 13:45:00,148 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 13:45:00,182 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 13:45:00,183 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 13:45:00,187 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 13:45:00,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 13:45:00,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 13:45:00,199 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 13:45:00,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 13:45:00,208 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 13:45:00,210 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 13:45:00,211 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 13:45:00,215 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 13:45:00,216 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 13:45:00,221 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 13:45:00,224 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 13:45:00,225 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 13:45:00,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 13:45:00,235 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 13:45:00,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 13:45:00,240 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 13:45:00,242 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 13:45:00,243 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 13:45:00,255 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 13:45:00,256 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 13:45:00,256 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 13:45:00,259 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 13:45:00,260 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 13:45:00,261 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 13:45:00,263 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 13:45:00,264 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 13:45:00,267 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 13:45:00,269 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 13:45:00,271 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 13:45:00,271 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 13:45:00,272 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 13:45:00,273 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 13:45:00,273 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 13:45:00,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 13:45:00,276 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 13:45:00,277 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b624044-81a2-4aa3-a56b-42ff3bb45b25/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-21 13:45:00,325 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 13:45:00,326 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 13:45:00,327 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 13:45:00,327 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 13:45:00,328 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 13:45:00,329 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 13:45:00,330 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 13:45:00,330 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 13:45:00,331 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 13:45:00,331 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 13:45:00,333 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 13:45:00,333 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 13:45:00,333 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 13:45:00,334 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 13:45:00,334 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 13:45:00,335 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 13:45:00,335 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 13:45:00,335 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 13:45:00,336 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-21 13:45:00,336 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 13:45:00,336 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 13:45:00,337 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 13:45:00,337 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 13:45:00,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 13:45:00,338 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 13:45:00,338 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 13:45:00,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:45:00,339 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 13:45:00,340 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 13:45:00,341 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 13:45:00,341 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 13:45:00,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 13:45:00,342 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 13:45:00,342 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 13:45:00,343 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 13:45:00,343 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_2b624044-81a2-4aa3-a56b-42ff3bb45b25/bin/uautomizer-vX5HgA9Q3a/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_2b624044-81a2-4aa3-a56b-42ff3bb45b25/bin/uautomizer-vX5HgA9Q3a 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 -> Automizer 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 -> 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 [2022-11-21 13:45:00,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 13:45:00,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 13:45:00,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 13:45:00,777 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 13:45:00,778 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 13:45:00,779 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b624044-81a2-4aa3-a56b-42ff3bb45b25/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2022-11-21 13:45:04,150 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 13:45:04,450 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 13:45:04,451 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b624044-81a2-4aa3-a56b-42ff3bb45b25/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2022-11-21 13:45:04,466 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b624044-81a2-4aa3-a56b-42ff3bb45b25/bin/uautomizer-vX5HgA9Q3a/data/6f376fb58/5ddbadb6436c4a9b915ef6a2a2cf3332/FLAGaee798150 [2022-11-21 13:45:04,493 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b624044-81a2-4aa3-a56b-42ff3bb45b25/bin/uautomizer-vX5HgA9Q3a/data/6f376fb58/5ddbadb6436c4a9b915ef6a2a2cf3332 [2022-11-21 13:45:04,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 13:45:04,500 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 13:45:04,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 13:45:04,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 13:45:04,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 13:45:04,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:45:04" (1/1) ... [2022-11-21 13:45:04,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ba0bf98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:04, skipping insertion in model container [2022-11-21 13:45:04,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:45:04" (1/1) ... [2022-11-21 13:45:04,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 13:45:04,587 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:45:04,992 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_2b624044-81a2-4aa3-a56b-42ff3bb45b25/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c[6080,6093] [2022-11-21 13:45:04,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:45:05,018 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 13:45:05,091 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_2b624044-81a2-4aa3-a56b-42ff3bb45b25/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c[6080,6093] [2022-11-21 13:45:05,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:45:05,123 INFO L208 MainTranslator]: Completed translation [2022-11-21 13:45:05,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:05 WrapperNode [2022-11-21 13:45:05,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 13:45:05,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 13:45:05,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 13:45:05,126 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 13:45:05,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:05" (1/1) ... [2022-11-21 13:45:05,162 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:05" (1/1) ... [2022-11-21 13:45:05,209 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 222 [2022-11-21 13:45:05,213 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 13:45:05,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 13:45:05,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 13:45:05,214 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 13:45:05,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:05" (1/1) ... [2022-11-21 13:45:05,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:05" (1/1) ... [2022-11-21 13:45:05,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:05" (1/1) ... [2022-11-21 13:45:05,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:05" (1/1) ... [2022-11-21 13:45:05,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:05" (1/1) ... [2022-11-21 13:45:05,260 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:05" (1/1) ... [2022-11-21 13:45:05,262 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:05" (1/1) ... [2022-11-21 13:45:05,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:05" (1/1) ... [2022-11-21 13:45:05,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 13:45:05,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 13:45:05,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 13:45:05,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 13:45:05,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:05" (1/1) ... [2022-11-21 13:45:05,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:45:05,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b624044-81a2-4aa3-a56b-42ff3bb45b25/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:45:05,330 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b624044-81a2-4aa3-a56b-42ff3bb45b25/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 13:45:05,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b624044-81a2-4aa3-a56b-42ff3bb45b25/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 13:45:05,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 13:45:05,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 13:45:05,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 13:45:05,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 13:45:05,548 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 13:45:05,551 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 13:45:06,017 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 13:45:06,026 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 13:45:06,026 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-21 13:45:06,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:45:06 BoogieIcfgContainer [2022-11-21 13:45:06,029 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 13:45:06,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 13:45:06,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 13:45:06,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 13:45:06,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:45:04" (1/3) ... [2022-11-21 13:45:06,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66487092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:45:06, skipping insertion in model container [2022-11-21 13:45:06,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:05" (2/3) ... [2022-11-21 13:45:06,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66487092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:45:06, skipping insertion in model container [2022-11-21 13:45:06,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:45:06" (3/3) ... [2022-11-21 13:45:06,040 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2022-11-21 13:45:06,064 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 13:45:06,064 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-21 13:45:06,128 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 13:45:06,136 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=PETRI_NET, 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;@6c95572d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 13:45:06,136 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-21 13:45:06,142 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 69 states have (on average 1.7536231884057971) internal successors, (121), 83 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-21 13:45:06,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-21 13:45:06,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:06,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:06,151 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:06,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:06,163 INFO L85 PathProgramCache]: Analyzing trace with hash -524468693, now seen corresponding path program 1 times [2022-11-21 13:45:06,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:06,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559559947] [2022-11-21 13:45:06,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:06,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:06,469 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-21 13:45:06,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:06,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559559947] [2022-11-21 13:45:06,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559559947] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:06,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:06,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:45:06,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858354809] [2022-11-21 13:45:06,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:06,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 13:45:06,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:06,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 13:45:06,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 13:45:06,526 INFO L87 Difference]: Start difference. First operand has 84 states, 69 states have (on average 1.7536231884057971) internal successors, (121), 83 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) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:06,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:06,576 INFO L93 Difference]: Finished difference Result 141 states and 201 transitions. [2022-11-21 13:45:06,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 13:45:06,580 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-21 13:45:06,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:06,596 INFO L225 Difference]: With dead ends: 141 [2022-11-21 13:45:06,596 INFO L226 Difference]: Without dead ends: 77 [2022-11-21 13:45:06,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 13:45:06,606 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:06,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:45:06,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-21 13:45:06,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-11-21 13:45:06,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 76 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:06,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2022-11-21 13:45:06,675 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 11 [2022-11-21 13:45:06,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:06,676 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2022-11-21 13:45:06,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:06,677 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2022-11-21 13:45:06,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-21 13:45:06,679 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:06,679 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:06,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 13:45:06,680 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:06,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:06,682 INFO L85 PathProgramCache]: Analyzing trace with hash -133016270, now seen corresponding path program 1 times [2022-11-21 13:45:06,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:06,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822094190] [2022-11-21 13:45:06,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:06,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:06,996 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-21 13:45:06,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:06,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822094190] [2022-11-21 13:45:06,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822094190] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:06,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:06,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:45:06,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527231364] [2022-11-21 13:45:06,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:07,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:45:07,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:07,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:45:07,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:07,001 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-21 13:45:07,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:07,158 INFO L93 Difference]: Finished difference Result 136 states and 188 transitions. [2022-11-21 13:45:07,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:45:07,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-21 13:45:07,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:07,161 INFO L225 Difference]: With dead ends: 136 [2022-11-21 13:45:07,162 INFO L226 Difference]: Without dead ends: 77 [2022-11-21 13:45:07,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:45:07,166 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 3 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:07,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 417 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:45:07,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-21 13:45:07,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-11-21 13:45:07,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 76 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:07,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 95 transitions. [2022-11-21 13:45:07,186 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 95 transitions. Word has length 15 [2022-11-21 13:45:07,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:07,186 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 95 transitions. [2022-11-21 13:45:07,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-21 13:45:07,188 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 95 transitions. [2022-11-21 13:45:07,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-21 13:45:07,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:07,192 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] [2022-11-21 13:45:07,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 13:45:07,193 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:07,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:07,197 INFO L85 PathProgramCache]: Analyzing trace with hash 2029260687, now seen corresponding path program 1 times [2022-11-21 13:45:07,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:07,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243614830] [2022-11-21 13:45:07,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:07,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:07,346 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-21 13:45:07,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:07,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243614830] [2022-11-21 13:45:07,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243614830] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:07,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:07,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:45:07,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459139497] [2022-11-21 13:45:07,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:07,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:45:07,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:07,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:45:07,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:45:07,350 INFO L87 Difference]: Start difference. First operand 77 states and 95 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:07,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:07,555 INFO L93 Difference]: Finished difference Result 184 states and 241 transitions. [2022-11-21 13:45:07,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:45:07,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-11-21 13:45:07,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:07,558 INFO L225 Difference]: With dead ends: 184 [2022-11-21 13:45:07,559 INFO L226 Difference]: Without dead ends: 181 [2022-11-21 13:45:07,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:07,561 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 216 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:07,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 164 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:45:07,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-21 13:45:07,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 120. [2022-11-21 13:45:07,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 108 states have (on average 1.5277777777777777) internal successors, (165), 119 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-21 13:45:07,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 165 transitions. [2022-11-21 13:45:07,577 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 165 transitions. Word has length 30 [2022-11-21 13:45:07,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:07,578 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 165 transitions. [2022-11-21 13:45:07,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:07,578 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 165 transitions. [2022-11-21 13:45:07,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-21 13:45:07,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:07,580 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] [2022-11-21 13:45:07,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 13:45:07,580 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:07,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:07,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1517427904, now seen corresponding path program 1 times [2022-11-21 13:45:07,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:07,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879638918] [2022-11-21 13:45:07,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:07,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:07,689 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-21 13:45:07,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:07,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879638918] [2022-11-21 13:45:07,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879638918] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:07,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:07,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:45:07,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420500872] [2022-11-21 13:45:07,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:07,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:45:07,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:07,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:45:07,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:45:07,693 INFO L87 Difference]: Start difference. First operand 120 states and 165 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:07,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:07,847 INFO L93 Difference]: Finished difference Result 172 states and 238 transitions. [2022-11-21 13:45:07,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:45:07,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-21 13:45:07,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:07,856 INFO L225 Difference]: With dead ends: 172 [2022-11-21 13:45:07,856 INFO L226 Difference]: Without dead ends: 169 [2022-11-21 13:45:07,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:07,866 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 215 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:07,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 113 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:45:07,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-11-21 13:45:07,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 163. [2022-11-21 13:45:07,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 151 states have (on average 1.5364238410596027) internal successors, (232), 162 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:07,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 232 transitions. [2022-11-21 13:45:07,889 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 232 transitions. Word has length 31 [2022-11-21 13:45:07,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:07,890 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 232 transitions. [2022-11-21 13:45:07,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:07,891 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 232 transitions. [2022-11-21 13:45:07,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-21 13:45:07,892 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:07,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:07,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 13:45:07,893 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:07,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:07,893 INFO L85 PathProgramCache]: Analyzing trace with hash 204375473, now seen corresponding path program 1 times [2022-11-21 13:45:07,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:07,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481040232] [2022-11-21 13:45:07,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:07,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:08,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:45:08,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:08,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481040232] [2022-11-21 13:45:08,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481040232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:08,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:08,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:45:08,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404760073] [2022-11-21 13:45:08,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:08,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:45:08,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:08,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:45:08,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:08,008 INFO L87 Difference]: Start difference. First operand 163 states and 232 transitions. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:08,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:08,357 INFO L93 Difference]: Finished difference Result 543 states and 792 transitions. [2022-11-21 13:45:08,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 13:45:08,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-21 13:45:08,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:08,360 INFO L225 Difference]: With dead ends: 543 [2022-11-21 13:45:08,360 INFO L226 Difference]: Without dead ends: 402 [2022-11-21 13:45:08,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:45:08,363 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 486 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:08,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 316 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:45:08,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-11-21 13:45:08,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 292. [2022-11-21 13:45:08,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 280 states have (on average 1.525) internal successors, (427), 291 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:08,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 427 transitions. [2022-11-21 13:45:08,427 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 427 transitions. Word has length 32 [2022-11-21 13:45:08,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:08,427 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 427 transitions. [2022-11-21 13:45:08,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:08,428 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 427 transitions. [2022-11-21 13:45:08,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-21 13:45:08,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:08,429 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-21 13:45:08,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 13:45:08,430 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:08,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:08,431 INFO L85 PathProgramCache]: Analyzing trace with hash 2040672610, now seen corresponding path program 1 times [2022-11-21 13:45:08,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:08,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283137135] [2022-11-21 13:45:08,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:08,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:08,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:45:08,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:08,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283137135] [2022-11-21 13:45:08,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283137135] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:08,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:08,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:45:08,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604212983] [2022-11-21 13:45:08,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:08,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:45:08,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:08,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:45:08,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:08,611 INFO L87 Difference]: Start difference. First operand 292 states and 427 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 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-21 13:45:08,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:08,921 INFO L93 Difference]: Finished difference Result 393 states and 570 transitions. [2022-11-21 13:45:08,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:45:08,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 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-21 13:45:08,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:08,933 INFO L225 Difference]: With dead ends: 393 [2022-11-21 13:45:08,934 INFO L226 Difference]: Without dead ends: 390 [2022-11-21 13:45:08,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:45:08,937 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 469 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:08,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 195 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:45:08,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-11-21 13:45:08,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 378. [2022-11-21 13:45:08,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 366 states have (on average 1.5081967213114753) internal successors, (552), 377 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:08,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 552 transitions. [2022-11-21 13:45:08,998 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 552 transitions. Word has length 33 [2022-11-21 13:45:08,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:08,999 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 552 transitions. [2022-11-21 13:45:08,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 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-21 13:45:08,999 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 552 transitions. [2022-11-21 13:45:09,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-21 13:45:09,000 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:09,000 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:09,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 13:45:09,001 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:09,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:09,002 INFO L85 PathProgramCache]: Analyzing trace with hash -355463801, now seen corresponding path program 1 times [2022-11-21 13:45:09,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:09,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064698947] [2022-11-21 13:45:09,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:09,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:09,095 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-21 13:45:09,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:09,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064698947] [2022-11-21 13:45:09,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064698947] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:09,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:09,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:45:09,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255605532] [2022-11-21 13:45:09,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:09,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:45:09,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:09,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:45:09,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:45:09,099 INFO L87 Difference]: Start difference. First operand 378 states and 552 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:09,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:09,183 INFO L93 Difference]: Finished difference Result 1058 states and 1556 transitions. [2022-11-21 13:45:09,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:45:09,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-11-21 13:45:09,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:09,188 INFO L225 Difference]: With dead ends: 1058 [2022-11-21 13:45:09,188 INFO L226 Difference]: Without dead ends: 702 [2022-11-21 13:45:09,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:45:09,197 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 61 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:09,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 221 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:45:09,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2022-11-21 13:45:09,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 690. [2022-11-21 13:45:09,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 678 states have (on average 1.5014749262536873) internal successors, (1018), 689 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:09,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1018 transitions. [2022-11-21 13:45:09,255 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1018 transitions. Word has length 34 [2022-11-21 13:45:09,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:09,255 INFO L495 AbstractCegarLoop]: Abstraction has 690 states and 1018 transitions. [2022-11-21 13:45:09,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:09,256 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1018 transitions. [2022-11-21 13:45:09,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-21 13:45:09,257 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:09,258 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:09,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 13:45:09,258 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:09,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:09,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1332610729, now seen corresponding path program 1 times [2022-11-21 13:45:09,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:09,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064948798] [2022-11-21 13:45:09,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:09,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:09,303 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-21 13:45:09,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:09,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064948798] [2022-11-21 13:45:09,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064948798] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:09,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:09,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:45:09,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004674266] [2022-11-21 13:45:09,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:09,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:45:09,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:09,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:45:09,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:45:09,306 INFO L87 Difference]: Start difference. First operand 690 states and 1018 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:09,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:09,415 INFO L93 Difference]: Finished difference Result 1962 states and 2898 transitions. [2022-11-21 13:45:09,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:45:09,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-21 13:45:09,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:09,425 INFO L225 Difference]: With dead ends: 1962 [2022-11-21 13:45:09,425 INFO L226 Difference]: Without dead ends: 1294 [2022-11-21 13:45:09,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:45:09,429 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 59 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:09,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 223 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:45:09,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2022-11-21 13:45:09,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1282. [2022-11-21 13:45:09,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1270 states have (on average 1.48503937007874) internal successors, (1886), 1281 states have internal predecessors, (1886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:09,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1886 transitions. [2022-11-21 13:45:09,544 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1886 transitions. Word has length 36 [2022-11-21 13:45:09,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:09,546 INFO L495 AbstractCegarLoop]: Abstraction has 1282 states and 1886 transitions. [2022-11-21 13:45:09,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:09,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1886 transitions. [2022-11-21 13:45:09,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-21 13:45:09,551 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:09,557 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-21 13:45:09,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 13:45:09,557 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:09,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:09,558 INFO L85 PathProgramCache]: Analyzing trace with hash -958732938, now seen corresponding path program 1 times [2022-11-21 13:45:09,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:09,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002211054] [2022-11-21 13:45:09,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:09,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:09,640 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-21 13:45:09,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:09,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002211054] [2022-11-21 13:45:09,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002211054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:09,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:09,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:45:09,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094127353] [2022-11-21 13:45:09,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:09,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:45:09,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:09,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:45:09,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:45:09,643 INFO L87 Difference]: Start difference. First operand 1282 states and 1886 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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-21 13:45:09,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:09,822 INFO L93 Difference]: Finished difference Result 3578 states and 5262 transitions. [2022-11-21 13:45:09,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:45:09,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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-21 13:45:09,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:09,834 INFO L225 Difference]: With dead ends: 3578 [2022-11-21 13:45:09,834 INFO L226 Difference]: Without dead ends: 2318 [2022-11-21 13:45:09,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:45:09,837 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 59 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:09,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 224 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:45:09,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2022-11-21 13:45:10,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2306. [2022-11-21 13:45:10,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2306 states, 2294 states have (on average 1.4673060156931124) internal successors, (3366), 2305 states have internal predecessors, (3366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:10,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 3366 transitions. [2022-11-21 13:45:10,136 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 3366 transitions. Word has length 37 [2022-11-21 13:45:10,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:10,137 INFO L495 AbstractCegarLoop]: Abstraction has 2306 states and 3366 transitions. [2022-11-21 13:45:10,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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-21 13:45:10,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3366 transitions. [2022-11-21 13:45:10,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-21 13:45:10,144 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:10,144 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:10,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 13:45:10,144 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:10,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:10,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1433500942, now seen corresponding path program 1 times [2022-11-21 13:45:10,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:10,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257959411] [2022-11-21 13:45:10,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:10,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:10,264 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:45:10,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:10,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257959411] [2022-11-21 13:45:10,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257959411] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:10,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:10,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:45:10,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303335567] [2022-11-21 13:45:10,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:10,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:45:10,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:10,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:45:10,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:45:10,272 INFO L87 Difference]: Start difference. First operand 2306 states and 3366 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:10,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:10,543 INFO L93 Difference]: Finished difference Result 5186 states and 7536 transitions. [2022-11-21 13:45:10,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:45:10,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-11-21 13:45:10,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:10,557 INFO L225 Difference]: With dead ends: 5186 [2022-11-21 13:45:10,557 INFO L226 Difference]: Without dead ends: 2902 [2022-11-21 13:45:10,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:45:10,601 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 38 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:10,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 157 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:45:10,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2022-11-21 13:45:10,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 2856. [2022-11-21 13:45:10,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2856 states, 2844 states have (on average 1.4430379746835442) internal successors, (4104), 2855 states have internal predecessors, (4104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:10,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 4104 transitions. [2022-11-21 13:45:10,896 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 4104 transitions. Word has length 52 [2022-11-21 13:45:10,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:10,896 INFO L495 AbstractCegarLoop]: Abstraction has 2856 states and 4104 transitions. [2022-11-21 13:45:10,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:10,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 4104 transitions. [2022-11-21 13:45:10,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-21 13:45:10,898 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:10,899 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:10,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 13:45:10,899 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:10,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:10,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1734299650, now seen corresponding path program 1 times [2022-11-21 13:45:10,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:10,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833893582] [2022-11-21 13:45:10,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:10,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:11,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:45:11,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:11,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833893582] [2022-11-21 13:45:11,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833893582] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:11,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:11,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:45:11,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950940141] [2022-11-21 13:45:11,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:11,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:45:11,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:11,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:45:11,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:11,227 INFO L87 Difference]: Start difference. First operand 2856 states and 4104 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:11,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:11,678 INFO L93 Difference]: Finished difference Result 5694 states and 8184 transitions. [2022-11-21 13:45:11,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:45:11,679 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2022-11-21 13:45:11,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:11,691 INFO L225 Difference]: With dead ends: 5694 [2022-11-21 13:45:11,691 INFO L226 Difference]: Without dead ends: 2862 [2022-11-21 13:45:11,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:45:11,700 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 102 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:11,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 214 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:45:11,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2022-11-21 13:45:11,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2856. [2022-11-21 13:45:11,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2856 states, 2844 states have (on average 1.431786216596343) internal successors, (4072), 2855 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:11,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 4072 transitions. [2022-11-21 13:45:11,972 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 4072 transitions. Word has length 56 [2022-11-21 13:45:11,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:11,975 INFO L495 AbstractCegarLoop]: Abstraction has 2856 states and 4072 transitions. [2022-11-21 13:45:11,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:11,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 4072 transitions. [2022-11-21 13:45:11,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-21 13:45:11,976 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:11,976 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:11,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 13:45:11,977 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:11,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:11,977 INFO L85 PathProgramCache]: Analyzing trace with hash -545317284, now seen corresponding path program 1 times [2022-11-21 13:45:11,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:11,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319457056] [2022-11-21 13:45:11,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:11,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:12,154 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 13:45:12,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:12,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319457056] [2022-11-21 13:45:12,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319457056] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:12,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:12,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:45:12,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804363800] [2022-11-21 13:45:12,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:12,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:45:12,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:12,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:45:12,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:45:12,159 INFO L87 Difference]: Start difference. First operand 2856 states and 4072 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:12,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:12,520 INFO L93 Difference]: Finished difference Result 3720 states and 5320 transitions. [2022-11-21 13:45:12,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:45:12,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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-21 13:45:12,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:12,537 INFO L225 Difference]: With dead ends: 3720 [2022-11-21 13:45:12,537 INFO L226 Difference]: Without dead ends: 3717 [2022-11-21 13:45:12,539 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-21 13:45:12,540 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 101 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:12,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 219 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:45:12,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3717 states. [2022-11-21 13:45:12,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3717 to 2920. [2022-11-21 13:45:12,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 2908 states have (on average 1.4429160935350756) internal successors, (4196), 2919 states have internal predecessors, (4196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4196 transitions. [2022-11-21 13:45:12,862 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4196 transitions. Word has length 57 [2022-11-21 13:45:12,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:12,863 INFO L495 AbstractCegarLoop]: Abstraction has 2920 states and 4196 transitions. [2022-11-21 13:45:12,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:12,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4196 transitions. [2022-11-21 13:45:12,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-21 13:45:12,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:12,864 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:12,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 13:45:12,865 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:12,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:12,866 INFO L85 PathProgramCache]: Analyzing trace with hash -727960002, now seen corresponding path program 1 times [2022-11-21 13:45:12,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:12,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798061869] [2022-11-21 13:45:12,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:12,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:12,991 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-21 13:45:12,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:12,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798061869] [2022-11-21 13:45:12,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798061869] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:12,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:12,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:45:12,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504863072] [2022-11-21 13:45:12,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:12,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:45:12,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:12,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:45:12,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:12,995 INFO L87 Difference]: Start difference. First operand 2920 states and 4196 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:13,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:13,494 INFO L93 Difference]: Finished difference Result 7006 states and 9880 transitions. [2022-11-21 13:45:13,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:45:13,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 59 [2022-11-21 13:45:13,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:13,512 INFO L225 Difference]: With dead ends: 7006 [2022-11-21 13:45:13,512 INFO L226 Difference]: Without dead ends: 4110 [2022-11-21 13:45:13,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:45:13,518 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 224 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:13,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 273 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:45:13,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4110 states. [2022-11-21 13:45:13,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4110 to 3708. [2022-11-21 13:45:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3708 states, 3696 states have (on average 1.4015151515151516) internal successors, (5180), 3707 states have internal predecessors, (5180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:13,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3708 states to 3708 states and 5180 transitions. [2022-11-21 13:45:13,840 INFO L78 Accepts]: Start accepts. Automaton has 3708 states and 5180 transitions. Word has length 59 [2022-11-21 13:45:13,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:13,841 INFO L495 AbstractCegarLoop]: Abstraction has 3708 states and 5180 transitions. [2022-11-21 13:45:13,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:13,841 INFO L276 IsEmpty]: Start isEmpty. Operand 3708 states and 5180 transitions. [2022-11-21 13:45:13,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-21 13:45:13,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:13,842 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:13,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 13:45:13,843 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:13,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:13,843 INFO L85 PathProgramCache]: Analyzing trace with hash -63892162, now seen corresponding path program 1 times [2022-11-21 13:45:13,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:13,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762769609] [2022-11-21 13:45:13,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:13,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:14,011 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 13:45:14,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:14,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762769609] [2022-11-21 13:45:14,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762769609] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:14,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:14,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:45:14,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445070264] [2022-11-21 13:45:14,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:14,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:45:14,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:14,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:45:14,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:14,015 INFO L87 Difference]: Start difference. First operand 3708 states and 5180 transitions. Second operand has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:14,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:14,583 INFO L93 Difference]: Finished difference Result 8081 states and 11296 transitions. [2022-11-21 13:45:14,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:45:14,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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 59 [2022-11-21 13:45:14,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:14,603 INFO L225 Difference]: With dead ends: 8081 [2022-11-21 13:45:14,603 INFO L226 Difference]: Without dead ends: 5185 [2022-11-21 13:45:14,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:45:14,608 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 225 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:14,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 293 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:45:14,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5185 states. [2022-11-21 13:45:15,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5185 to 5176. [2022-11-21 13:45:15,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5176 states, 5164 states have (on average 1.3648334624322231) internal successors, (7048), 5175 states have internal predecessors, (7048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:15,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5176 states to 5176 states and 7048 transitions. [2022-11-21 13:45:15,052 INFO L78 Accepts]: Start accepts. Automaton has 5176 states and 7048 transitions. Word has length 59 [2022-11-21 13:45:15,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:15,052 INFO L495 AbstractCegarLoop]: Abstraction has 5176 states and 7048 transitions. [2022-11-21 13:45:15,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:15,053 INFO L276 IsEmpty]: Start isEmpty. Operand 5176 states and 7048 transitions. [2022-11-21 13:45:15,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-21 13:45:15,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:15,055 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:15,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 13:45:15,055 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:15,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:15,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1980656779, now seen corresponding path program 1 times [2022-11-21 13:45:15,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:15,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141313191] [2022-11-21 13:45:15,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:15,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:15,200 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 13:45:15,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:15,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141313191] [2022-11-21 13:45:15,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141313191] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:15,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:15,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:45:15,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919650451] [2022-11-21 13:45:15,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:15,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:45:15,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:15,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:45:15,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:15,204 INFO L87 Difference]: Start difference. First operand 5176 states and 7048 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 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-21 13:45:15,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:15,859 INFO L93 Difference]: Finished difference Result 10358 states and 14628 transitions. [2022-11-21 13:45:15,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:45:15,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 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 60 [2022-11-21 13:45:15,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:15,889 INFO L225 Difference]: With dead ends: 10358 [2022-11-21 13:45:15,896 INFO L226 Difference]: Without dead ends: 6390 [2022-11-21 13:45:15,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:45:15,904 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 240 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:15,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 219 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:45:15,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6390 states. [2022-11-21 13:45:16,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6390 to 5412. [2022-11-21 13:45:16,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5412 states, 5400 states have (on average 1.4103703703703703) internal successors, (7616), 5411 states have internal predecessors, (7616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:16,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5412 states to 5412 states and 7616 transitions. [2022-11-21 13:45:16,334 INFO L78 Accepts]: Start accepts. Automaton has 5412 states and 7616 transitions. Word has length 60 [2022-11-21 13:45:16,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:16,334 INFO L495 AbstractCegarLoop]: Abstraction has 5412 states and 7616 transitions. [2022-11-21 13:45:16,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 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-21 13:45:16,335 INFO L276 IsEmpty]: Start isEmpty. Operand 5412 states and 7616 transitions. [2022-11-21 13:45:16,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-21 13:45:16,336 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:16,336 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:16,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 13:45:16,337 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:16,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:16,337 INFO L85 PathProgramCache]: Analyzing trace with hash -998722173, now seen corresponding path program 1 times [2022-11-21 13:45:16,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:16,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553042078] [2022-11-21 13:45:16,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:16,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:16,467 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 13:45:16,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:16,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553042078] [2022-11-21 13:45:16,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553042078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:16,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:16,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:45:16,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803283207] [2022-11-21 13:45:16,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:16,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:45:16,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:16,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:45:16,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:45:16,473 INFO L87 Difference]: Start difference. First operand 5412 states and 7616 transitions. Second operand has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:16,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:16,985 INFO L93 Difference]: Finished difference Result 7128 states and 10256 transitions. [2022-11-21 13:45:16,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:45:16,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 60 [2022-11-21 13:45:16,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:17,035 INFO L225 Difference]: With dead ends: 7128 [2022-11-21 13:45:17,035 INFO L226 Difference]: Without dead ends: 7125 [2022-11-21 13:45:17,037 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-21 13:45:17,038 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 104 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:17,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 212 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:45:17,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7125 states. [2022-11-21 13:45:17,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7125 to 7116. [2022-11-21 13:45:17,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7116 states, 7104 states have (on average 1.4234234234234233) internal successors, (10112), 7115 states have internal predecessors, (10112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:17,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7116 states to 7116 states and 10112 transitions. [2022-11-21 13:45:17,587 INFO L78 Accepts]: Start accepts. Automaton has 7116 states and 10112 transitions. Word has length 60 [2022-11-21 13:45:17,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:17,587 INFO L495 AbstractCegarLoop]: Abstraction has 7116 states and 10112 transitions. [2022-11-21 13:45:17,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:17,588 INFO L276 IsEmpty]: Start isEmpty. Operand 7116 states and 10112 transitions. [2022-11-21 13:45:17,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-21 13:45:17,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:17,596 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:17,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-21 13:45:17,597 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:17,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:17,598 INFO L85 PathProgramCache]: Analyzing trace with hash -895616052, now seen corresponding path program 1 times [2022-11-21 13:45:17,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:17,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889522151] [2022-11-21 13:45:17,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:17,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:17,738 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 13:45:17,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:17,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889522151] [2022-11-21 13:45:17,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889522151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:17,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:17,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:45:17,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64139054] [2022-11-21 13:45:17,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:17,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:45:17,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:17,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:45:17,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:45:17,742 INFO L87 Difference]: Start difference. First operand 7116 states and 10112 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:18,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:18,431 INFO L93 Difference]: Finished difference Result 7119 states and 10112 transitions. [2022-11-21 13:45:18,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:45:18,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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-21 13:45:18,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:18,450 INFO L225 Difference]: With dead ends: 7119 [2022-11-21 13:45:18,450 INFO L226 Difference]: Without dead ends: 7116 [2022-11-21 13:45:18,454 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-21 13:45:18,455 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 95 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:18,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 172 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:45:18,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7116 states. [2022-11-21 13:45:18,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7116 to 7113. [2022-11-21 13:45:18,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7113 states, 7104 states have (on average 1.382882882882883) internal successors, (9824), 7112 states have internal predecessors, (9824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:19,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7113 states to 7113 states and 9824 transitions. [2022-11-21 13:45:19,015 INFO L78 Accepts]: Start accepts. Automaton has 7113 states and 9824 transitions. Word has length 61 [2022-11-21 13:45:19,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:19,015 INFO L495 AbstractCegarLoop]: Abstraction has 7113 states and 9824 transitions. [2022-11-21 13:45:19,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:19,016 INFO L276 IsEmpty]: Start isEmpty. Operand 7113 states and 9824 transitions. [2022-11-21 13:45:19,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-21 13:45:19,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:19,017 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:19,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-21 13:45:19,018 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:19,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:19,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1994293595, now seen corresponding path program 1 times [2022-11-21 13:45:19,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:19,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618064250] [2022-11-21 13:45:19,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:19,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:19,157 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 13:45:19,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:19,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618064250] [2022-11-21 13:45:19,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618064250] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:19,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:19,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:45:19,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108288687] [2022-11-21 13:45:19,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:19,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:45:19,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:19,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:45:19,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:19,160 INFO L87 Difference]: Start difference. First operand 7113 states and 9824 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 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-21 13:45:19,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:19,804 INFO L93 Difference]: Finished difference Result 13095 states and 18312 transitions. [2022-11-21 13:45:19,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:45:19,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 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 62 [2022-11-21 13:45:19,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:19,825 INFO L225 Difference]: With dead ends: 13095 [2022-11-21 13:45:19,826 INFO L226 Difference]: Without dead ends: 7974 [2022-11-21 13:45:19,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:45:19,835 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 221 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:19,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 289 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:45:19,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7974 states. [2022-11-21 13:45:20,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7974 to 7965. [2022-11-21 13:45:20,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7965 states, 7956 states have (on average 1.3745600804424334) internal successors, (10936), 7964 states have internal predecessors, (10936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:20,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7965 states to 7965 states and 10936 transitions. [2022-11-21 13:45:20,380 INFO L78 Accepts]: Start accepts. Automaton has 7965 states and 10936 transitions. Word has length 62 [2022-11-21 13:45:20,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:20,381 INFO L495 AbstractCegarLoop]: Abstraction has 7965 states and 10936 transitions. [2022-11-21 13:45:20,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 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-21 13:45:20,382 INFO L276 IsEmpty]: Start isEmpty. Operand 7965 states and 10936 transitions. [2022-11-21 13:45:20,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-21 13:45:20,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:20,386 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:20,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-21 13:45:20,386 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:20,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:20,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1431570358, now seen corresponding path program 1 times [2022-11-21 13:45:20,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:20,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016730875] [2022-11-21 13:45:20,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:20,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:20,520 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 13:45:20,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:20,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016730875] [2022-11-21 13:45:20,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016730875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:20,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:20,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:45:20,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248653391] [2022-11-21 13:45:20,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:20,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:45:20,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:20,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:45:20,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:20,523 INFO L87 Difference]: Start difference. First operand 7965 states and 10936 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:21,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:21,253 INFO L93 Difference]: Finished difference Result 8363 states and 11468 transitions. [2022-11-21 13:45:21,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:45:21,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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 63 [2022-11-21 13:45:21,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:21,276 INFO L225 Difference]: With dead ends: 8363 [2022-11-21 13:45:21,276 INFO L226 Difference]: Without dead ends: 8360 [2022-11-21 13:45:21,279 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-21 13:45:21,280 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 147 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:21,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 331 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:45:21,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8360 states. [2022-11-21 13:45:21,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8360 to 8357. [2022-11-21 13:45:21,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8357 states, 8348 states have (on average 1.3699089602299952) internal successors, (11436), 8356 states have internal predecessors, (11436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:21,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8357 states to 8357 states and 11436 transitions. [2022-11-21 13:45:21,957 INFO L78 Accepts]: Start accepts. Automaton has 8357 states and 11436 transitions. Word has length 63 [2022-11-21 13:45:21,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:21,957 INFO L495 AbstractCegarLoop]: Abstraction has 8357 states and 11436 transitions. [2022-11-21 13:45:21,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:21,958 INFO L276 IsEmpty]: Start isEmpty. Operand 8357 states and 11436 transitions. [2022-11-21 13:45:21,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-21 13:45:21,959 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:21,959 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:21,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-21 13:45:21,960 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:21,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:21,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1693559058, now seen corresponding path program 1 times [2022-11-21 13:45:21,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:21,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316019880] [2022-11-21 13:45:21,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:21,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:22,078 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 13:45:22,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:22,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316019880] [2022-11-21 13:45:22,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316019880] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:22,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:22,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:45:22,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475753178] [2022-11-21 13:45:22,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:22,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:45:22,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:22,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:45:22,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:22,081 INFO L87 Difference]: Start difference. First operand 8357 states and 11436 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:22,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:22,706 INFO L93 Difference]: Finished difference Result 15305 states and 21464 transitions. [2022-11-21 13:45:22,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:45:22,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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 63 [2022-11-21 13:45:22,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:22,729 INFO L225 Difference]: With dead ends: 15305 [2022-11-21 13:45:22,730 INFO L226 Difference]: Without dead ends: 9332 [2022-11-21 13:45:22,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:45:22,738 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 240 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:22,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 213 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:45:22,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9332 states. [2022-11-21 13:45:23,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9332 to 7613. [2022-11-21 13:45:23,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7613 states, 7604 states have (on average 1.374013677012099) internal successors, (10448), 7612 states have internal predecessors, (10448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:23,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7613 states to 7613 states and 10448 transitions. [2022-11-21 13:45:23,249 INFO L78 Accepts]: Start accepts. Automaton has 7613 states and 10448 transitions. Word has length 63 [2022-11-21 13:45:23,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:23,249 INFO L495 AbstractCegarLoop]: Abstraction has 7613 states and 10448 transitions. [2022-11-21 13:45:23,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:23,250 INFO L276 IsEmpty]: Start isEmpty. Operand 7613 states and 10448 transitions. [2022-11-21 13:45:23,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-21 13:45:23,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:23,251 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] [2022-11-21 13:45:23,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-21 13:45:23,252 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:23,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:23,253 INFO L85 PathProgramCache]: Analyzing trace with hash -152528517, now seen corresponding path program 1 times [2022-11-21 13:45:23,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:23,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628779401] [2022-11-21 13:45:23,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:23,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:23,383 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 13:45:23,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:23,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628779401] [2022-11-21 13:45:23,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628779401] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:23,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:23,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:45:23,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501643306] [2022-11-21 13:45:23,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:23,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:45:23,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:23,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:45:23,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:45:23,388 INFO L87 Difference]: Start difference. First operand 7613 states and 10448 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:24,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:24,081 INFO L93 Difference]: Finished difference Result 9897 states and 13776 transitions. [2022-11-21 13:45:24,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:45:24,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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 64 [2022-11-21 13:45:24,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:24,107 INFO L225 Difference]: With dead ends: 9897 [2022-11-21 13:45:24,108 INFO L226 Difference]: Without dead ends: 9894 [2022-11-21 13:45:24,112 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-21 13:45:24,114 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 125 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:24,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 329 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:45:24,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9894 states. [2022-11-21 13:45:24,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9894 to 9317. [2022-11-21 13:45:24,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9317 states, 9308 states have (on average 1.3596905887408681) internal successors, (12656), 9316 states have internal predecessors, (12656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:24,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9317 states to 9317 states and 12656 transitions. [2022-11-21 13:45:24,761 INFO L78 Accepts]: Start accepts. Automaton has 9317 states and 12656 transitions. Word has length 64 [2022-11-21 13:45:24,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:24,761 INFO L495 AbstractCegarLoop]: Abstraction has 9317 states and 12656 transitions. [2022-11-21 13:45:24,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:24,762 INFO L276 IsEmpty]: Start isEmpty. Operand 9317 states and 12656 transitions. [2022-11-21 13:45:24,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-21 13:45:24,764 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:24,764 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:24,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-21 13:45:24,765 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:24,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:24,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1215076963, now seen corresponding path program 1 times [2022-11-21 13:45:24,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:24,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375832357] [2022-11-21 13:45:24,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:24,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:24,918 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 13:45:24,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:24,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375832357] [2022-11-21 13:45:24,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375832357] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:24,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:24,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:45:24,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502479562] [2022-11-21 13:45:24,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:24,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:45:24,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:24,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:45:24,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:24,922 INFO L87 Difference]: Start difference. First operand 9317 states and 12656 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 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-21 13:45:25,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:25,621 INFO L93 Difference]: Finished difference Result 10175 states and 13832 transitions. [2022-11-21 13:45:25,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:45:25,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 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 66 [2022-11-21 13:45:25,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:25,646 INFO L225 Difference]: With dead ends: 10175 [2022-11-21 13:45:25,646 INFO L226 Difference]: Without dead ends: 10172 [2022-11-21 13:45:25,652 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-21 13:45:25,653 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 154 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:25,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 292 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:45:25,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10172 states. [2022-11-21 13:45:26,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10172 to 10169. [2022-11-21 13:45:26,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10169 states, 10160 states have (on average 1.3566929133858268) internal successors, (13784), 10168 states have internal predecessors, (13784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:26,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10169 states to 10169 states and 13784 transitions. [2022-11-21 13:45:26,448 INFO L78 Accepts]: Start accepts. Automaton has 10169 states and 13784 transitions. Word has length 66 [2022-11-21 13:45:26,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:26,449 INFO L495 AbstractCegarLoop]: Abstraction has 10169 states and 13784 transitions. [2022-11-21 13:45:26,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 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-21 13:45:26,449 INFO L276 IsEmpty]: Start isEmpty. Operand 10169 states and 13784 transitions. [2022-11-21 13:45:26,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-21 13:45:26,451 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:26,451 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:26,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-21 13:45:26,452 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:26,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:26,453 INFO L85 PathProgramCache]: Analyzing trace with hash -551009123, now seen corresponding path program 1 times [2022-11-21 13:45:26,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:26,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408894833] [2022-11-21 13:45:26,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:26,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:26,619 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 13:45:26,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:26,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408894833] [2022-11-21 13:45:26,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408894833] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:26,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:26,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:45:26,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983595807] [2022-11-21 13:45:26,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:26,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:45:26,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:26,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:45:26,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:26,623 INFO L87 Difference]: Start difference. First operand 10169 states and 13784 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 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-21 13:45:27,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:27,467 INFO L93 Difference]: Finished difference Result 12740 states and 17384 transitions. [2022-11-21 13:45:27,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:45:27,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 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 66 [2022-11-21 13:45:27,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:27,492 INFO L225 Difference]: With dead ends: 12740 [2022-11-21 13:45:27,493 INFO L226 Difference]: Without dead ends: 12737 [2022-11-21 13:45:27,496 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-21 13:45:27,497 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 159 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:27,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 373 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:45:27,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12737 states. [2022-11-21 13:45:28,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12737 to 12725. [2022-11-21 13:45:28,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12725 states, 12716 states have (on average 1.3595470273670966) internal successors, (17288), 12724 states have internal predecessors, (17288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:28,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12725 states to 12725 states and 17288 transitions. [2022-11-21 13:45:28,248 INFO L78 Accepts]: Start accepts. Automaton has 12725 states and 17288 transitions. Word has length 66 [2022-11-21 13:45:28,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:28,249 INFO L495 AbstractCegarLoop]: Abstraction has 12725 states and 17288 transitions. [2022-11-21 13:45:28,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 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-21 13:45:28,250 INFO L276 IsEmpty]: Start isEmpty. Operand 12725 states and 17288 transitions. [2022-11-21 13:45:28,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-21 13:45:28,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:28,252 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:28,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-21 13:45:28,252 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:28,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:28,253 INFO L85 PathProgramCache]: Analyzing trace with hash 98586614, now seen corresponding path program 1 times [2022-11-21 13:45:28,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:28,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408095374] [2022-11-21 13:45:28,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:28,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:28,383 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 13:45:28,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:28,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408095374] [2022-11-21 13:45:28,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408095374] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:28,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:28,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:45:28,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454005091] [2022-11-21 13:45:28,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:28,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:45:28,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:28,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:45:28,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:28,386 INFO L87 Difference]: Start difference. First operand 12725 states and 17288 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:29,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:29,061 INFO L93 Difference]: Finished difference Result 14663 states and 19912 transitions. [2022-11-21 13:45:29,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:45:29,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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 67 [2022-11-21 13:45:29,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:29,081 INFO L225 Difference]: With dead ends: 14663 [2022-11-21 13:45:29,082 INFO L226 Difference]: Without dead ends: 8977 [2022-11-21 13:45:29,089 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-21 13:45:29,090 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 141 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:29,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 302 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:45:29,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8977 states. [2022-11-21 13:45:29,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8977 to 6853. [2022-11-21 13:45:29,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6853 states, 6844 states have (on average 1.3559322033898304) internal successors, (9280), 6852 states have internal predecessors, (9280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:29,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6853 states to 6853 states and 9280 transitions. [2022-11-21 13:45:29,605 INFO L78 Accepts]: Start accepts. Automaton has 6853 states and 9280 transitions. Word has length 67 [2022-11-21 13:45:29,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:29,606 INFO L495 AbstractCegarLoop]: Abstraction has 6853 states and 9280 transitions. [2022-11-21 13:45:29,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:29,606 INFO L276 IsEmpty]: Start isEmpty. Operand 6853 states and 9280 transitions. [2022-11-21 13:45:29,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-21 13:45:29,608 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:29,609 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:29,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-21 13:45:29,609 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:29,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:29,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2141818987, now seen corresponding path program 1 times [2022-11-21 13:45:29,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:29,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539528929] [2022-11-21 13:45:29,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:29,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:29,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 13:45:29,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:29,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539528929] [2022-11-21 13:45:29,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539528929] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:29,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:29,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:45:29,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409761816] [2022-11-21 13:45:29,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:29,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:45:29,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:29,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:45:29,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:29,744 INFO L87 Difference]: Start difference. First operand 6853 states and 9280 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 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-21 13:45:30,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:30,338 INFO L93 Difference]: Finished difference Result 7046 states and 9528 transitions. [2022-11-21 13:45:30,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:45:30,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 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 70 [2022-11-21 13:45:30,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:30,349 INFO L225 Difference]: With dead ends: 7046 [2022-11-21 13:45:30,349 INFO L226 Difference]: Without dead ends: 6669 [2022-11-21 13:45:30,352 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-21 13:45:30,353 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 139 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:30,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 440 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:45:30,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6669 states. [2022-11-21 13:45:30,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6669 to 6665. [2022-11-21 13:45:30,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6665 states, 6656 states have (on average 1.3551682692307692) internal successors, (9020), 6664 states have internal predecessors, (9020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:30,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 9020 transitions. [2022-11-21 13:45:30,884 INFO L78 Accepts]: Start accepts. Automaton has 6665 states and 9020 transitions. Word has length 70 [2022-11-21 13:45:30,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:30,885 INFO L495 AbstractCegarLoop]: Abstraction has 6665 states and 9020 transitions. [2022-11-21 13:45:30,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 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-21 13:45:30,886 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 9020 transitions. [2022-11-21 13:45:30,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-21 13:45:30,890 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:30,890 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:30,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-21 13:45:30,891 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:30,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:30,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1104636752, now seen corresponding path program 1 times [2022-11-21 13:45:30,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:30,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189465656] [2022-11-21 13:45:30,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:30,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:31,008 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 13:45:31,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:31,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189465656] [2022-11-21 13:45:31,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189465656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:31,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:31,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 13:45:31,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647779811] [2022-11-21 13:45:31,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:31,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:45:31,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:31,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:45:31,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:45:31,011 INFO L87 Difference]: Start difference. First operand 6665 states and 9020 transitions. Second operand has 4 states, 3 states have (on average 27.0) internal successors, (81), 4 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-21 13:45:31,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:31,562 INFO L93 Difference]: Finished difference Result 6859 states and 9264 transitions. [2022-11-21 13:45:31,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:45:31,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 27.0) internal successors, (81), 4 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 84 [2022-11-21 13:45:31,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:31,572 INFO L225 Difference]: With dead ends: 6859 [2022-11-21 13:45:31,573 INFO L226 Difference]: Without dead ends: 6856 [2022-11-21 13:45:31,575 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-21 13:45:31,576 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 97 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:31,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 329 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:45:31,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6856 states. [2022-11-21 13:45:32,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6856 to 6662. [2022-11-21 13:45:32,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6662 states, 6656 states have (on average 1.3191105769230769) internal successors, (8780), 6661 states have internal predecessors, (8780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:32,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6662 states to 6662 states and 8780 transitions. [2022-11-21 13:45:32,049 INFO L78 Accepts]: Start accepts. Automaton has 6662 states and 8780 transitions. Word has length 84 [2022-11-21 13:45:32,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:32,049 INFO L495 AbstractCegarLoop]: Abstraction has 6662 states and 8780 transitions. [2022-11-21 13:45:32,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 27.0) internal successors, (81), 4 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-21 13:45:32,050 INFO L276 IsEmpty]: Start isEmpty. Operand 6662 states and 8780 transitions. [2022-11-21 13:45:32,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-21 13:45:32,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:32,055 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:32,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-21 13:45:32,055 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:32,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:32,056 INFO L85 PathProgramCache]: Analyzing trace with hash 713863341, now seen corresponding path program 1 times [2022-11-21 13:45:32,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:32,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3217372] [2022-11-21 13:45:32,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:32,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:32,251 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-21 13:45:32,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:32,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3217372] [2022-11-21 13:45:32,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3217372] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:32,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:32,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:45:32,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860945378] [2022-11-21 13:45:32,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:32,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:45:32,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:32,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:45:32,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:32,255 INFO L87 Difference]: Start difference. First operand 6662 states and 8780 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:33,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:33,084 INFO L93 Difference]: Finished difference Result 7057 states and 9280 transitions. [2022-11-21 13:45:33,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:45:33,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 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-21 13:45:33,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:33,097 INFO L225 Difference]: With dead ends: 7057 [2022-11-21 13:45:33,098 INFO L226 Difference]: Without dead ends: 7054 [2022-11-21 13:45:33,101 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-21 13:45:33,102 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 123 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:33,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 356 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:45:33,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7054 states. [2022-11-21 13:45:33,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7054 to 6270. [2022-11-21 13:45:33,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6270 states, 6264 states have (on average 1.3167305236270754) internal successors, (8248), 6269 states have internal predecessors, (8248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:33,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6270 states to 6270 states and 8248 transitions. [2022-11-21 13:45:33,646 INFO L78 Accepts]: Start accepts. Automaton has 6270 states and 8248 transitions. Word has length 85 [2022-11-21 13:45:33,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:33,647 INFO L495 AbstractCegarLoop]: Abstraction has 6270 states and 8248 transitions. [2022-11-21 13:45:33,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:33,647 INFO L276 IsEmpty]: Start isEmpty. Operand 6270 states and 8248 transitions. [2022-11-21 13:45:33,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-21 13:45:33,651 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:33,651 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:33,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-21 13:45:33,652 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:33,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:33,653 INFO L85 PathProgramCache]: Analyzing trace with hash 699004210, now seen corresponding path program 1 times [2022-11-21 13:45:33,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:33,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471632453] [2022-11-21 13:45:33,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:33,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:33,801 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 13:45:33,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:33,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471632453] [2022-11-21 13:45:33,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471632453] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:33,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:33,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:45:33,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493502264] [2022-11-21 13:45:33,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:33,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:45:33,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:33,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:45:33,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:33,805 INFO L87 Difference]: Start difference. First operand 6270 states and 8248 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:34,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:34,374 INFO L93 Difference]: Finished difference Result 9597 states and 12728 transitions. [2022-11-21 13:45:34,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:45:34,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 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 86 [2022-11-21 13:45:34,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:34,381 INFO L225 Difference]: With dead ends: 9597 [2022-11-21 13:45:34,381 INFO L226 Difference]: Without dead ends: 5791 [2022-11-21 13:45:34,387 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-21 13:45:34,388 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 167 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:34,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 341 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:45:34,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5791 states. [2022-11-21 13:45:34,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5791 to 5782. [2022-11-21 13:45:34,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5782 states, 5776 states have (on average 1.3109418282548477) internal successors, (7572), 5781 states have internal predecessors, (7572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:34,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5782 states to 5782 states and 7572 transitions. [2022-11-21 13:45:34,718 INFO L78 Accepts]: Start accepts. Automaton has 5782 states and 7572 transitions. Word has length 86 [2022-11-21 13:45:34,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:34,718 INFO L495 AbstractCegarLoop]: Abstraction has 5782 states and 7572 transitions. [2022-11-21 13:45:34,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:34,718 INFO L276 IsEmpty]: Start isEmpty. Operand 5782 states and 7572 transitions. [2022-11-21 13:45:34,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-21 13:45:34,722 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:34,722 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:34,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-21 13:45:34,723 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:34,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:34,723 INFO L85 PathProgramCache]: Analyzing trace with hash -2107484616, now seen corresponding path program 2 times [2022-11-21 13:45:34,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:34,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560612445] [2022-11-21 13:45:34,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:34,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:34,877 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 13:45:34,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:34,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560612445] [2022-11-21 13:45:34,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560612445] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:34,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:34,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:45:34,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885441608] [2022-11-21 13:45:34,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:34,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:45:34,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:34,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:45:34,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:34,880 INFO L87 Difference]: Start difference. First operand 5782 states and 7572 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 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-21 13:45:35,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:35,431 INFO L93 Difference]: Finished difference Result 5977 states and 7816 transitions. [2022-11-21 13:45:35,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:45:35,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 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 86 [2022-11-21 13:45:35,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:35,438 INFO L225 Difference]: With dead ends: 5977 [2022-11-21 13:45:35,438 INFO L226 Difference]: Without dead ends: 5032 [2022-11-21 13:45:35,441 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-21 13:45:35,442 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 154 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:35,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 365 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:45:35,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5032 states. [2022-11-21 13:45:35,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5032 to 5026. [2022-11-21 13:45:35,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5026 states, 5020 states have (on average 1.3123505976095617) internal successors, (6588), 5025 states have internal predecessors, (6588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:35,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5026 states to 5026 states and 6588 transitions. [2022-11-21 13:45:35,734 INFO L78 Accepts]: Start accepts. Automaton has 5026 states and 6588 transitions. Word has length 86 [2022-11-21 13:45:35,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:35,734 INFO L495 AbstractCegarLoop]: Abstraction has 5026 states and 6588 transitions. [2022-11-21 13:45:35,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 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-21 13:45:35,735 INFO L276 IsEmpty]: Start isEmpty. Operand 5026 states and 6588 transitions. [2022-11-21 13:45:35,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-21 13:45:35,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:35,738 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:35,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-21 13:45:35,738 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:35,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:35,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1066301654, now seen corresponding path program 1 times [2022-11-21 13:45:35,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:35,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190334229] [2022-11-21 13:45:35,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:35,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:35,888 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-21 13:45:35,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:35,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190334229] [2022-11-21 13:45:35,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190334229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:35,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:35,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:45:35,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838530063] [2022-11-21 13:45:35,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:35,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:45:35,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:35,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:45:35,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:35,891 INFO L87 Difference]: Start difference. First operand 5026 states and 6588 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:36,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:36,332 INFO L93 Difference]: Finished difference Result 5029 states and 6588 transitions. [2022-11-21 13:45:36,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:45:36,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 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 88 [2022-11-21 13:45:36,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:36,340 INFO L225 Difference]: With dead ends: 5029 [2022-11-21 13:45:36,340 INFO L226 Difference]: Without dead ends: 5026 [2022-11-21 13:45:36,343 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-21 13:45:36,343 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 115 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:36,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 303 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:45:36,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5026 states. [2022-11-21 13:45:36,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5026 to 5026. [2022-11-21 13:45:36,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5026 states, 5020 states have (on average 1.307569721115538) internal successors, (6564), 5025 states have internal predecessors, (6564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:36,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5026 states to 5026 states and 6564 transitions. [2022-11-21 13:45:36,762 INFO L78 Accepts]: Start accepts. Automaton has 5026 states and 6564 transitions. Word has length 88 [2022-11-21 13:45:36,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:36,763 INFO L495 AbstractCegarLoop]: Abstraction has 5026 states and 6564 transitions. [2022-11-21 13:45:36,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:36,763 INFO L276 IsEmpty]: Start isEmpty. Operand 5026 states and 6564 transitions. [2022-11-21 13:45:36,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-21 13:45:36,766 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:36,766 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:36,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-21 13:45:36,766 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:36,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:36,767 INFO L85 PathProgramCache]: Analyzing trace with hash 435812822, now seen corresponding path program 1 times [2022-11-21 13:45:36,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:36,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456300491] [2022-11-21 13:45:36,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:36,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:36,930 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 13:45:36,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:36,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456300491] [2022-11-21 13:45:36,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456300491] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:36,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:36,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:45:36,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496654707] [2022-11-21 13:45:36,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:36,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:45:36,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:36,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:45:36,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:36,933 INFO L87 Difference]: Start difference. First operand 5026 states and 6564 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 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-21 13:45:37,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:37,317 INFO L93 Difference]: Finished difference Result 5032 states and 6564 transitions. [2022-11-21 13:45:37,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:45:37,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 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 88 [2022-11-21 13:45:37,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:37,323 INFO L225 Difference]: With dead ends: 5032 [2022-11-21 13:45:37,323 INFO L226 Difference]: Without dead ends: 5029 [2022-11-21 13:45:37,324 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-21 13:45:37,325 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 120 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:37,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 318 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:45:37,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2022-11-21 13:45:37,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 5026. [2022-11-21 13:45:37,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5026 states, 5020 states have (on average 1.29800796812749) internal successors, (6516), 5025 states have internal predecessors, (6516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:37,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5026 states to 5026 states and 6516 transitions. [2022-11-21 13:45:37,563 INFO L78 Accepts]: Start accepts. Automaton has 5026 states and 6516 transitions. Word has length 88 [2022-11-21 13:45:37,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:37,563 INFO L495 AbstractCegarLoop]: Abstraction has 5026 states and 6516 transitions. [2022-11-21 13:45:37,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 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-21 13:45:37,563 INFO L276 IsEmpty]: Start isEmpty. Operand 5026 states and 6516 transitions. [2022-11-21 13:45:37,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-21 13:45:37,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:37,566 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:37,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-21 13:45:37,567 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:37,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:37,567 INFO L85 PathProgramCache]: Analyzing trace with hash 625295837, now seen corresponding path program 1 times [2022-11-21 13:45:37,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:37,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552567911] [2022-11-21 13:45:37,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:37,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:37,709 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 13:45:37,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:37,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552567911] [2022-11-21 13:45:37,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552567911] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:37,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:37,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:45:37,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465732776] [2022-11-21 13:45:37,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:37,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:45:37,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:37,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:45:37,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:37,712 INFO L87 Difference]: Start difference. First operand 5026 states and 6516 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:37,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:37,995 INFO L93 Difference]: Finished difference Result 6116 states and 7962 transitions. [2022-11-21 13:45:37,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:45:37,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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-21 13:45:37,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:37,999 INFO L225 Difference]: With dead ends: 6116 [2022-11-21 13:45:37,999 INFO L226 Difference]: Without dead ends: 3366 [2022-11-21 13:45:38,004 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-21 13:45:38,005 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 100 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:38,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 261 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:45:38,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3366 states. [2022-11-21 13:45:38,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3366 to 3029. [2022-11-21 13:45:38,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3029 states, 3028 states have (on average 1.2536327608982827) internal successors, (3796), 3028 states have internal predecessors, (3796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:38,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3029 states to 3029 states and 3796 transitions. [2022-11-21 13:45:38,204 INFO L78 Accepts]: Start accepts. Automaton has 3029 states and 3796 transitions. Word has length 89 [2022-11-21 13:45:38,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:38,204 INFO L495 AbstractCegarLoop]: Abstraction has 3029 states and 3796 transitions. [2022-11-21 13:45:38,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:38,204 INFO L276 IsEmpty]: Start isEmpty. Operand 3029 states and 3796 transitions. [2022-11-21 13:45:38,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-21 13:45:38,207 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:38,207 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:38,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-21 13:45:38,208 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:38,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:38,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1161477710, now seen corresponding path program 1 times [2022-11-21 13:45:38,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:38,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287888357] [2022-11-21 13:45:38,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:38,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:38,357 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-21 13:45:38,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:38,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287888357] [2022-11-21 13:45:38,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287888357] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:38,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:38,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:45:38,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608197568] [2022-11-21 13:45:38,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:38,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:45:38,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:38,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:45:38,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:38,361 INFO L87 Difference]: Start difference. First operand 3029 states and 3796 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:38,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:38,684 INFO L93 Difference]: Finished difference Result 3219 states and 4036 transitions. [2022-11-21 13:45:38,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:45:38,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 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 92 [2022-11-21 13:45:38,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:38,688 INFO L225 Difference]: With dead ends: 3219 [2022-11-21 13:45:38,688 INFO L226 Difference]: Without dead ends: 2746 [2022-11-21 13:45:38,689 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-21 13:45:38,690 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 126 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:38,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 357 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:45:38,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2022-11-21 13:45:38,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2557. [2022-11-21 13:45:38,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2556 states have (on average 1.242566510172144) internal successors, (3176), 2556 states have internal predecessors, (3176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:38,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 3176 transitions. [2022-11-21 13:45:38,837 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 3176 transitions. Word has length 92 [2022-11-21 13:45:38,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:38,837 INFO L495 AbstractCegarLoop]: Abstraction has 2557 states and 3176 transitions. [2022-11-21 13:45:38,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:38,837 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 3176 transitions. [2022-11-21 13:45:38,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-21 13:45:38,839 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:38,840 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:38,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-21 13:45:38,840 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:38,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:38,841 INFO L85 PathProgramCache]: Analyzing trace with hash -462888882, now seen corresponding path program 2 times [2022-11-21 13:45:38,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:38,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426345871] [2022-11-21 13:45:38,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:38,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:38,978 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 13:45:38,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:38,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426345871] [2022-11-21 13:45:38,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426345871] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:38,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:38,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:45:38,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367360616] [2022-11-21 13:45:38,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:38,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:45:38,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:38,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:45:38,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:38,981 INFO L87 Difference]: Start difference. First operand 2557 states and 3176 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 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-21 13:45:39,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:39,277 INFO L93 Difference]: Finished difference Result 2558 states and 3176 transitions. [2022-11-21 13:45:39,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:45:39,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 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 92 [2022-11-21 13:45:39,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:39,280 INFO L225 Difference]: With dead ends: 2558 [2022-11-21 13:45:39,280 INFO L226 Difference]: Without dead ends: 1789 [2022-11-21 13:45:39,282 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-21 13:45:39,283 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 105 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:39,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 490 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:45:39,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2022-11-21 13:45:39,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1789. [2022-11-21 13:45:39,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1788 states have (on average 1.2348993288590604) internal successors, (2208), 1788 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:39,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2208 transitions. [2022-11-21 13:45:39,433 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 2208 transitions. Word has length 92 [2022-11-21 13:45:39,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:39,434 INFO L495 AbstractCegarLoop]: Abstraction has 1789 states and 2208 transitions. [2022-11-21 13:45:39,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 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-21 13:45:39,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2208 transitions. [2022-11-21 13:45:39,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-21 13:45:39,437 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:39,437 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:45:39,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-21 13:45:39,441 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-21 13:45:39,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:39,441 INFO L85 PathProgramCache]: Analyzing trace with hash 548742747, now seen corresponding path program 1 times [2022-11-21 13:45:39,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:39,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050952788] [2022-11-21 13:45:39,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:39,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:39,610 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-21 13:45:39,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:39,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050952788] [2022-11-21 13:45:39,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050952788] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:39,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:39,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:45:39,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20493095] [2022-11-21 13:45:39,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:39,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 13:45:39,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:39,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 13:45:39,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-21 13:45:39,615 INFO L87 Difference]: Start difference. First operand 1789 states and 2208 transitions. Second operand has 5 states, 4 states have (on average 25.75) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:39,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:39,882 INFO L93 Difference]: Finished difference Result 1789 states and 2208 transitions. [2022-11-21 13:45:39,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 13:45:39,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 25.75) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 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 108 [2022-11-21 13:45:39,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:39,883 INFO L225 Difference]: With dead ends: 1789 [2022-11-21 13:45:39,883 INFO L226 Difference]: Without dead ends: 0 [2022-11-21 13:45:39,885 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-21 13:45:39,886 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 108 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:39,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 447 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:45:39,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-21 13:45:39,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-21 13:45:39,887 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-21 13:45:39,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-21 13:45:39,889 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2022-11-21 13:45:39,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:39,889 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-21 13:45:39,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 25.75) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:45:39,889 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-21 13:45:39,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-21 13:45:39,891 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-11-21 13:45:39,892 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-11-21 13:45:39,892 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-11-21 13:45:39,893 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-11-21 13:45:39,893 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-11-21 13:45:39,893 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-11-21 13:45:39,894 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-11-21 13:45:39,894 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-11-21 13:45:39,894 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-11-21 13:45:39,895 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-11-21 13:45:39,895 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-11-21 13:45:39,895 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-11-21 13:45:39,895 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-11-21 13:45:39,896 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-11-21 13:45:39,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-21 13:45:39,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-21 13:45:46,094 WARN L233 SmtUtils]: Spent 6.18s on a formula simplification. DAG size of input: 693 DAG size of output: 683 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 13:45:51,419 WARN L233 SmtUtils]: Spent 5.32s on a formula simplification. DAG size of input: 728 DAG size of output: 718 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 13:45:57,191 WARN L233 SmtUtils]: Spent 5.77s on a formula simplification. DAG size of input: 756 DAG size of output: 746 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-21 13:46:13,324 WARN L233 SmtUtils]: Spent 5.50s on a formula simplification. DAG size of input: 683 DAG size of output: 36 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-21 13:46:19,096 WARN L233 SmtUtils]: Spent 5.76s on a formula simplification. DAG size of input: 718 DAG size of output: 36 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-21 13:46:25,102 WARN L233 SmtUtils]: Spent 6.00s on a formula simplification. DAG size of input: 746 DAG size of output: 36 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-21 13:46:30,384 WARN L233 SmtUtils]: Spent 5.27s on a formula simplification. DAG size of input: 710 DAG size of output: 36 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-21 13:46:36,333 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 210) no Hoare annotation was computed. [2022-11-21 13:46:36,333 INFO L899 garLoopResultBuilder]: For program point L151(lines 151 159) no Hoare annotation was computed. [2022-11-21 13:46:36,333 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-21 13:46:36,333 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 156) no Hoare annotation was computed. [2022-11-21 13:46:36,334 INFO L895 garLoopResultBuilder]: At program point L202(lines 132 204) the Hoare annotation is: (or (and (= |ULTIMATE.start_init_~tmp~0#1| 0) (= |ULTIMATE.start_init_#res#1| 0)) (and (= (* 256 (div ~mode2~0 256)) ~mode2~0) (= (* 256 (div ~mode1~0 256)) ~mode1~0) (= (* 256 (div ~mode3~0 256)) ~mode3~0) (<= ~st2~0 0) (<= (+ ~st3~0 ~st1~0) 0) (<= ~r1~0 (* (div ~r1~0 256) 256)) (<= 0 (+ ~st2~0 ~st1~0)) (<= 0 ~st3~0))) [2022-11-21 13:46:36,334 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 214) no Hoare annotation was computed. [2022-11-21 13:46:36,334 INFO L899 garLoopResultBuilder]: For program point L285(lines 285 289) no Hoare annotation was computed. [2022-11-21 13:46:36,334 INFO L899 garLoopResultBuilder]: For program point L219(line 219) no Hoare annotation was computed. [2022-11-21 13:46:36,335 INFO L899 garLoopResultBuilder]: For program point L219-1(line 219) no Hoare annotation was computed. [2022-11-21 13:46:36,335 INFO L899 garLoopResultBuilder]: For program point L219-2(line 219) no Hoare annotation was computed. [2022-11-21 13:46:36,335 INFO L899 garLoopResultBuilder]: For program point L120(lines 120 122) no Hoare annotation was computed. [2022-11-21 13:46:36,335 INFO L899 garLoopResultBuilder]: For program point L219-3(line 219) no Hoare annotation was computed. [2022-11-21 13:46:36,335 INFO L899 garLoopResultBuilder]: For program point L219-4(lines 219 223) no Hoare annotation was computed. [2022-11-21 13:46:36,335 INFO L899 garLoopResultBuilder]: For program point L21(lines 21 23) no Hoare annotation was computed. [2022-11-21 13:46:36,336 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 214) no Hoare annotation was computed. [2022-11-21 13:46:36,336 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 201) no Hoare annotation was computed. [2022-11-21 13:46:36,336 INFO L899 garLoopResultBuilder]: For program point L137-1(lines 137 201) no Hoare annotation was computed. [2022-11-21 13:46:36,336 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 103) no Hoare annotation was computed. [2022-11-21 13:46:36,336 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-11-21 13:46:36,337 INFO L895 garLoopResultBuilder]: At program point L88-2(lines 82 106) the Hoare annotation is: (let ((.cse10 (+ ~st2~0 ~st1~0))) (let ((.cse7 (<= ~st2~0 0)) (.cse2 (<= (+ ~st3~0 ~st1~0) 0)) (.cse5 (= ~st1~0 1)) (.cse8 (<= ~st3~0 0)) (.cse3 (<= 0 ~st3~0)) (.cse0 (= ~st2~0 1)) (.cse1 (<= 0 ~st1~0)) (.cse6 (<= 0 ~st2~0)) (.cse4 (= ~st3~0 1)) (.cse9 (<= .cse10 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (or (and .cse5 .cse6 .cse7) (and .cse5 .cse0))) (and .cse5 .cse8 .cse6 .cse7 .cse3) (and (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) .cse7 .cse2 .cse9 (<= 0 .cse10)) (and .cse5 .cse0 .cse8 .cse3) (and .cse0 (<= ~st1~0 0) .cse1 .cse4) (and .cse1 .cse6 .cse4 .cse9)))) [2022-11-21 13:46:36,337 INFO L899 garLoopResultBuilder]: For program point L138(lines 138 198) no Hoare annotation was computed. [2022-11-21 13:46:36,337 INFO L899 garLoopResultBuilder]: For program point L287(line 287) no Hoare annotation was computed. [2022-11-21 13:46:36,337 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 195) no Hoare annotation was computed. [2022-11-21 13:46:36,337 INFO L899 garLoopResultBuilder]: For program point L57(lines 57 78) no Hoare annotation was computed. [2022-11-21 13:46:36,338 INFO L895 garLoopResultBuilder]: At program point L57-2(lines 51 81) the Hoare annotation is: (let ((.cse10 (+ ~st2~0 ~st1~0))) (let ((.cse7 (<= ~st2~0 0)) (.cse2 (<= (+ ~st3~0 ~st1~0) 0)) (.cse5 (= ~st1~0 1)) (.cse8 (<= ~st3~0 0)) (.cse3 (<= 0 ~st3~0)) (.cse0 (= ~st2~0 1)) (.cse1 (<= 0 ~st1~0)) (.cse6 (<= 0 ~st2~0)) (.cse4 (= ~st3~0 1)) (.cse9 (<= .cse10 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (or (and .cse5 .cse6 .cse7) (and .cse5 .cse0))) (and .cse5 .cse8 .cse6 .cse7 .cse3) (and (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) .cse7 .cse2 .cse9 (<= 0 .cse10)) (and .cse5 .cse0 .cse8 .cse3) (and .cse0 (<= ~st1~0 0) .cse1 .cse4) (and .cse1 .cse6 .cse4 .cse9)))) [2022-11-21 13:46:36,338 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 219) no Hoare annotation was computed. [2022-11-21 13:46:36,338 INFO L899 garLoopResultBuilder]: For program point L140(lines 140 192) no Hoare annotation was computed. [2022-11-21 13:46:36,338 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-21 13:46:36,338 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 98) no Hoare annotation was computed. [2022-11-21 13:46:36,339 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2022-11-21 13:46:36,339 INFO L899 garLoopResultBuilder]: For program point L91-1(lines 91 98) no Hoare annotation was computed. [2022-11-21 13:46:36,339 INFO L899 garLoopResultBuilder]: For program point L58-2(lines 58 60) no Hoare annotation was computed. [2022-11-21 13:46:36,339 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 219) no Hoare annotation was computed. [2022-11-21 13:46:36,339 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 189) no Hoare annotation was computed. [2022-11-21 13:46:36,339 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 210) no Hoare annotation was computed. [2022-11-21 13:46:36,339 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 97) no Hoare annotation was computed. [2022-11-21 13:46:36,340 INFO L899 garLoopResultBuilder]: For program point L142(lines 142 186) no Hoare annotation was computed. [2022-11-21 13:46:36,340 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 214) no Hoare annotation was computed. [2022-11-21 13:46:36,340 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 183) no Hoare annotation was computed. [2022-11-21 13:46:36,340 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 214) no Hoare annotation was computed. [2022-11-21 13:46:36,340 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 61) no Hoare annotation was computed. [2022-11-21 13:46:36,340 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2022-11-21 13:46:36,341 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-21 13:46:36,341 INFO L899 garLoopResultBuilder]: For program point L210(line 210) no Hoare annotation was computed. [2022-11-21 13:46:36,341 INFO L899 garLoopResultBuilder]: For program point L210-1(line 210) no Hoare annotation was computed. [2022-11-21 13:46:36,341 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 180) no Hoare annotation was computed. [2022-11-21 13:46:36,341 INFO L899 garLoopResultBuilder]: For program point L210-2(line 210) no Hoare annotation was computed. [2022-11-21 13:46:36,341 INFO L899 garLoopResultBuilder]: For program point L210-3(line 210) no Hoare annotation was computed. [2022-11-21 13:46:36,342 INFO L899 garLoopResultBuilder]: For program point L210-4(lines 210 229) no Hoare annotation was computed. [2022-11-21 13:46:36,342 INFO L899 garLoopResultBuilder]: For program point L210-5(lines 210 229) no Hoare annotation was computed. [2022-11-21 13:46:36,342 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 61) no Hoare annotation was computed. [2022-11-21 13:46:36,342 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 97) no Hoare annotation was computed. [2022-11-21 13:46:36,342 INFO L899 garLoopResultBuilder]: For program point L211(lines 211 226) no Hoare annotation was computed. [2022-11-21 13:46:36,342 INFO L899 garLoopResultBuilder]: For program point L145(lines 145 177) no Hoare annotation was computed. [2022-11-21 13:46:36,343 INFO L895 garLoopResultBuilder]: At program point L278(lines 233 279) the Hoare annotation is: false [2022-11-21 13:46:36,343 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 174) no Hoare annotation was computed. [2022-11-21 13:46:36,343 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 128) no Hoare annotation was computed. [2022-11-21 13:46:36,343 INFO L895 garLoopResultBuilder]: At program point L113-2(lines 107 131) the Hoare annotation is: (let ((.cse10 (+ ~st2~0 ~st1~0))) (let ((.cse7 (<= ~st2~0 0)) (.cse2 (<= (+ ~st3~0 ~st1~0) 0)) (.cse5 (= ~st1~0 1)) (.cse8 (<= ~st3~0 0)) (.cse3 (<= 0 ~st3~0)) (.cse0 (= ~st2~0 1)) (.cse1 (<= 0 ~st1~0)) (.cse6 (<= 0 ~st2~0)) (.cse4 (= ~st3~0 1)) (.cse9 (<= .cse10 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (or (and .cse5 .cse6 .cse7) (and .cse5 .cse0))) (and .cse5 .cse8 .cse6 .cse7 .cse3) (and (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) .cse7 .cse2 .cse9 (<= 0 .cse10)) (and .cse5 .cse0 .cse8 .cse3) (and .cse0 (<= ~st1~0 0) .cse1 .cse4) (and .cse1 .cse6 .cse4 .cse9)))) [2022-11-21 13:46:36,343 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 219) no Hoare annotation was computed. [2022-11-21 13:46:36,344 INFO L895 garLoopResultBuilder]: At program point L262-2(lines 262 276) the Hoare annotation is: (let ((.cse10 (+ ~st2~0 ~st1~0))) (let ((.cse7 (<= ~st2~0 0)) (.cse2 (<= (+ ~st3~0 ~st1~0) 0)) (.cse5 (= ~st1~0 1)) (.cse8 (<= ~st3~0 0)) (.cse3 (<= 0 ~st3~0)) (.cse0 (= ~st2~0 1)) (.cse1 (<= 0 ~st1~0)) (.cse6 (<= 0 ~st2~0)) (.cse4 (= ~st3~0 1)) (.cse9 (<= .cse10 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (or (and .cse5 .cse6 .cse7) (and .cse5 .cse0))) (and .cse5 .cse8 .cse6 .cse7 .cse3) (and (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) .cse7 .cse2 .cse9 (<= 0 .cse10)) (and .cse5 .cse0 .cse8 .cse3) (and .cse0 (<= ~st1~0 0) .cse1 .cse4) (and .cse1 .cse6 .cse4 .cse9)))) [2022-11-21 13:46:36,344 INFO L899 garLoopResultBuilder]: For program point L262-3(lines 262 276) no Hoare annotation was computed. [2022-11-21 13:46:36,344 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 73) no Hoare annotation was computed. [2022-11-21 13:46:36,344 INFO L899 garLoopResultBuilder]: For program point L64-1(lines 64 73) no Hoare annotation was computed. [2022-11-21 13:46:36,344 INFO L899 garLoopResultBuilder]: For program point L147(lines 147 171) no Hoare annotation was computed. [2022-11-21 13:46:36,345 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 219) no Hoare annotation was computed. [2022-11-21 13:46:36,345 INFO L895 garLoopResultBuilder]: At program point L230(lines 205 232) the Hoare annotation is: (let ((.cse10 (+ ~st2~0 ~st1~0))) (let ((.cse7 (<= ~st2~0 0)) (.cse2 (<= (+ ~st3~0 ~st1~0) 0)) (.cse5 (= ~st1~0 1)) (.cse8 (<= ~st3~0 0)) (.cse3 (<= 0 ~st3~0)) (.cse0 (= ~st2~0 1)) (.cse1 (<= 0 ~st1~0)) (.cse6 (<= 0 ~st2~0)) (.cse4 (= ~st3~0 1)) (.cse9 (<= .cse10 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (or (and .cse5 .cse6 .cse7) (and .cse5 .cse0))) (and .cse5 .cse8 .cse6 .cse7 .cse3) (and (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) .cse7 .cse2 .cse9 (<= 0 .cse10)) (and .cse5 .cse0 .cse8 .cse3) (and .cse0 (<= ~st1~0 0) .cse1 .cse4) (and .cse1 .cse6 .cse4 .cse9)))) [2022-11-21 13:46:36,345 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 72) no Hoare annotation was computed. [2022-11-21 13:46:36,345 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-21 13:46:36,345 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 210) no Hoare annotation was computed. [2022-11-21 13:46:36,345 INFO L899 garLoopResultBuilder]: For program point L280(lines 280 291) no Hoare annotation was computed. [2022-11-21 13:46:36,346 INFO L899 garLoopResultBuilder]: For program point L214(line 214) no Hoare annotation was computed. [2022-11-21 13:46:36,346 INFO L899 garLoopResultBuilder]: For program point L214-1(line 214) no Hoare annotation was computed. [2022-11-21 13:46:36,346 INFO L899 garLoopResultBuilder]: For program point L148(lines 148 168) no Hoare annotation was computed. [2022-11-21 13:46:36,346 INFO L899 garLoopResultBuilder]: For program point L214-2(line 214) no Hoare annotation was computed. [2022-11-21 13:46:36,346 INFO L899 garLoopResultBuilder]: For program point L214-3(line 214) no Hoare annotation was computed. [2022-11-21 13:46:36,346 INFO L899 garLoopResultBuilder]: For program point L214-4(lines 214 226) no Hoare annotation was computed. [2022-11-21 13:46:36,347 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 210) no Hoare annotation was computed. [2022-11-21 13:46:36,347 INFO L895 garLoopResultBuilder]: At program point L215(lines 211 226) the Hoare annotation is: (let ((.cse9 (+ ~st2~0 ~st1~0))) (let ((.cse0 (= ~st1~0 1)) (.cse7 (<= 0 ~st3~0)) (.cse3 (<= ~st2~0 0)) (.cse6 (<= (+ ~st3~0 ~st1~0) 0)) (.cse4 (= ~st2~0 1)) (.cse5 (<= 0 ~st1~0)) (.cse1 (<= 0 ~st2~0)) (.cse2 (= ~st3~0 1)) (.cse8 (<= .cse9 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse0 (<= ~st3~0 0) .cse1 .cse3 .cse7) (and (<= 0 (+ ~st3~0 ~st2~0 ~st1~0)) .cse3 .cse6 .cse8 (<= 0 .cse9)) (and .cse4 (<= ~st1~0 0) .cse5 .cse2) (and .cse5 .cse1 .cse2 .cse8)))) [2022-11-21 13:46:36,347 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 165) no Hoare annotation was computed. [2022-11-21 13:46:36,347 INFO L899 garLoopResultBuilder]: For program point L116(lines 116 123) no Hoare annotation was computed. [2022-11-21 13:46:36,347 INFO L899 garLoopResultBuilder]: For program point L116-1(lines 116 123) no Hoare annotation was computed. [2022-11-21 13:46:36,348 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 162) no Hoare annotation was computed. [2022-11-21 13:46:36,348 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 122) no Hoare annotation was computed. [2022-11-21 13:46:36,348 INFO L899 garLoopResultBuilder]: For program point L68(lines 68 72) no Hoare annotation was computed. [2022-11-21 13:46:36,351 INFO L444 BasicCegarLoop]: Path program histogram: [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] [2022-11-21 13:46:36,353 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 13:46:36,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 01:46:36 BoogieIcfgContainer [2022-11-21 13:46:36,394 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 13:46:36,394 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 13:46:36,394 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 13:46:36,395 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 13:46:36,395 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:45:06" (3/4) ... [2022-11-21 13:46:36,398 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-21 13:46:36,410 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-11-21 13:46:36,414 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-21 13:46:36,414 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-21 13:46:36,415 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-21 13:46:36,446 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (tmp == 0 && \result == 0) || (((((((256 * (mode2 / 256) == mode2 && 256 * (mode1 / 256) == mode1) && 256 * (mode3 / 256) == mode3) && st2 <= 0) && st3 + st1 <= 0) && r1 <= r1 / 256 * 256) && 0 <= st2 + st1) && 0 <= st3) [2022-11-21 13:46:36,490 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b624044-81a2-4aa3-a56b-42ff3bb45b25/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 13:46:36,491 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 13:46:36,494 INFO L158 Benchmark]: Toolchain (without parser) took 91992.13ms. Allocated memory was 138.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 75.0MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 577.1MB. Max. memory is 16.1GB. [2022-11-21 13:46:36,495 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 138.4MB. Free memory is still 107.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 13:46:36,497 INFO L158 Benchmark]: CACSL2BoogieTranslator took 618.17ms. Allocated memory was 138.4MB in the beginning and 199.2MB in the end (delta: 60.8MB). Free memory was 74.8MB in the beginning and 160.9MB in the end (delta: -86.1MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2022-11-21 13:46:36,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.61ms. Allocated memory is still 199.2MB. Free memory was 160.9MB in the beginning and 158.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 13:46:36,498 INFO L158 Benchmark]: Boogie Preprocessor took 65.64ms. Allocated memory is still 199.2MB. Free memory was 158.8MB in the beginning and 157.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 13:46:36,499 INFO L158 Benchmark]: RCFGBuilder took 749.00ms. Allocated memory is still 199.2MB. Free memory was 157.0MB in the beginning and 137.2MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-21 13:46:36,501 INFO L158 Benchmark]: TraceAbstraction took 90361.45ms. Allocated memory was 199.2MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 136.6MB in the beginning and 1.1GB in the end (delta: -969.8MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-11-21 13:46:36,501 INFO L158 Benchmark]: Witness Printer took 96.83ms. Allocated memory is still 1.7GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-21 13:46:36,502 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.32ms. Allocated memory is still 138.4MB. Free memory is still 107.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 618.17ms. Allocated memory was 138.4MB in the beginning and 199.2MB in the end (delta: 60.8MB). Free memory was 74.8MB in the beginning and 160.9MB in the end (delta: -86.1MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.61ms. Allocated memory is still 199.2MB. Free memory was 160.9MB in the beginning and 158.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.64ms. Allocated memory is still 199.2MB. Free memory was 158.8MB in the beginning and 157.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 749.00ms. Allocated memory is still 199.2MB. Free memory was 157.0MB in the beginning and 137.2MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 90361.45ms. Allocated memory was 199.2MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 136.6MB in the beginning and 1.1GB in the end (delta: -969.8MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 96.83ms. Allocated memory is still 1.7GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 210]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 210]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 210]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 210]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 214]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 214]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 214]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 214]: 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: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 90.2s, OverallIterations: 35, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 16.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 56.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5238 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5238 mSDsluCounter, 9880 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5128 mSDsCounter, 208 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3609 IncrementalHoareTripleChecker+Invalid, 3817 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 208 mSolverCounterUnsat, 4752 mSDtfsCounter, 3609 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12725occurred in iteration=23, InterpolantAutomatonStates: 164, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.6s AutomataMinimizationTime, 35 MinimizatonAttempts, 8448 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 882 NumberOfFragments, 752 HoareAnnotationTreeSize, 8 FomulaSimplifications, 44158 FormulaSimplificationTreeSizeReduction, 27.8s HoareSimplificationTime, 8 FomulaSimplificationsInter, 161713 FormulaSimplificationTreeSizeReductionInter, 28.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2142 NumberOfCodeBlocks, 2142 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2107 ConstructedInterpolants, 0 QuantifiedInterpolants, 8283 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 594/594 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 14 specifications checked. All of them hold - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (tmp == 0 && \result == 0) || (((((((256 * (mode2 / 256) == mode2 && 256 * (mode1 / 256) == mode1) && 256 * (mode3 / 256) == mode3) && st2 <= 0) && st3 + st1 <= 0) && r1 <= r1 / 256 * 256) && 0 <= st2 + st1) && 0 <= st3) - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: ((((((((st2 == 1 && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3) || (st3 == 1 && (((st1 == 1 && 0 <= st2) && st2 <= 0) || (st1 == 1 && st2 == 1)))) || ((((st1 == 1 && st3 <= 0) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || ((((0 <= st3 + st2 + st1 && st2 <= 0) && st3 + st1 <= 0) && st2 + st1 <= 0) && 0 <= st2 + st1)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3)) || (((st2 == 1 && st1 <= 0) && 0 <= st1) && st3 == 1)) || (((0 <= st1 && 0 <= st2) && st3 == 1) && st2 + st1 <= 0) - InvariantResult [Line: 82]: Loop Invariant Derived loop invariant: ((((((((st2 == 1 && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3) || (st3 == 1 && (((st1 == 1 && 0 <= st2) && st2 <= 0) || (st1 == 1 && st2 == 1)))) || ((((st1 == 1 && st3 <= 0) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || ((((0 <= st3 + st2 + st1 && st2 <= 0) && st3 + st1 <= 0) && st2 + st1 <= 0) && 0 <= st2 + st1)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3)) || (((st2 == 1 && st1 <= 0) && 0 <= st1) && st3 == 1)) || (((0 <= st1 && 0 <= st2) && st3 == 1) && st2 + st1 <= 0) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: ((((((((st2 == 1 && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3) || (st3 == 1 && (((st1 == 1 && 0 <= st2) && st2 <= 0) || (st1 == 1 && st2 == 1)))) || ((((st1 == 1 && st3 <= 0) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || ((((0 <= st3 + st2 + st1 && st2 <= 0) && st3 + st1 <= 0) && st2 + st1 <= 0) && 0 <= st2 + st1)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3)) || (((st2 == 1 && st1 <= 0) && 0 <= st1) && st3 == 1)) || (((0 <= st1 && 0 <= st2) && st3 == 1) && st2 + st1 <= 0) - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: ((((((((st2 == 1 && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3) || (st3 == 1 && (((st1 == 1 && 0 <= st2) && st2 <= 0) || (st1 == 1 && st2 == 1)))) || ((((st1 == 1 && st3 <= 0) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || ((((0 <= st3 + st2 + st1 && st2 <= 0) && st3 + st1 <= 0) && st2 + st1 <= 0) && 0 <= st2 + st1)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3)) || (((st2 == 1 && st1 <= 0) && 0 <= st1) && st3 == 1)) || (((0 <= st1 && 0 <= st2) && st3 == 1) && st2 + st1 <= 0) - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: (((((((st1 == 1 && 0 <= st2) && st3 == 1) && st2 <= 0) || (((st2 == 1 && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3)) || ((((st1 == 1 && st3 <= 0) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || ((((0 <= st3 + st2 + st1 && st2 <= 0) && st3 + st1 <= 0) && st2 + st1 <= 0) && 0 <= st2 + st1)) || (((st2 == 1 && st1 <= 0) && 0 <= st1) && st3 == 1)) || (((0 <= st1 && 0 <= st2) && st3 == 1) && st2 + st1 <= 0) - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: ((((((((st2 == 1 && 0 <= st1) && st3 + st1 <= 0) && 0 <= st3) || (st3 == 1 && (((st1 == 1 && 0 <= st2) && st2 <= 0) || (st1 == 1 && st2 == 1)))) || ((((st1 == 1 && st3 <= 0) && 0 <= st2) && st2 <= 0) && 0 <= st3)) || ((((0 <= st3 + st2 + st1 && st2 <= 0) && st3 + st1 <= 0) && st2 + st1 <= 0) && 0 <= st2 + st1)) || (((st1 == 1 && st2 == 1) && st3 <= 0) && 0 <= st3)) || (((st2 == 1 && st1 <= 0) && 0 <= st1) && st3 == 1)) || (((0 <= st1 && 0 <= st2) && st3 == 1) && st2 + st1 <= 0) - InvariantResult [Line: 233]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-11-21 13:46:36,542 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b624044-81a2-4aa3-a56b-42ff3bb45b25/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE