./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 a3777e2ab1819fd82e3658352e2b99c7da6626d046ae65288a9623558224827f --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 13:56:17,703 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 13:56:17,704 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 13:56:17,747 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 13:56:17,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 13:56:17,749 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 13:56:17,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 13:56:17,752 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 13:56:17,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 13:56:17,756 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 13:56:17,756 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 13:56:17,758 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 13:56:17,758 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 13:56:17,759 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 13:56:17,760 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 13:56:17,763 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 13:56:17,763 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 13:56:17,764 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 13:56:17,765 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 13:56:17,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 13:56:17,771 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 13:56:17,771 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 13:56:17,772 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 13:56:17,772 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 13:56:17,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 13:56:17,778 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 13:56:17,778 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 13:56:17,779 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 13:56:17,779 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 13:56:17,780 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 13:56:17,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 13:56:17,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 13:56:17,782 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 13:56:17,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 13:56:17,783 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 13:56:17,783 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 13:56:17,784 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 13:56:17,784 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 13:56:17,784 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 13:56:17,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 13:56:17,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 13:56:17,787 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 13:56:17,788 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-07-14 13:56:17,810 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 13:56:17,811 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 13:56:17,811 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 13:56:17,811 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 13:56:17,812 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 13:56:17,812 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 13:56:17,812 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 13:56:17,813 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 13:56:17,813 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 13:56:17,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 13:56:17,814 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 13:56:17,814 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 13:56:17,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 13:56:17,814 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 13:56:17,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 13:56:17,814 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 13:56:17,815 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 13:56:17,815 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 13:56:17,816 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-14 13:56:17,816 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 13:56:17,816 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 13:56:17,816 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 13:56:17,816 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 13:56:17,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 13:56:17,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 13:56:17,817 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 13:56:17,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 13:56:17,817 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 13:56:17,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 13:56:17,817 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 13:56:17,818 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 13:56:17,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 13:56:17,818 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 13:56:17,818 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> a3777e2ab1819fd82e3658352e2b99c7da6626d046ae65288a9623558224827f [2022-07-14 13:56:18,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 13:56:18,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 13:56:18,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 13:56:18,032 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 13:56:18,032 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 13:56:18,033 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2022-07-14 13:56:18,073 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93c90daff/33cfe8262e634e58be78806e3ac1179f/FLAGbaa80d246 [2022-07-14 13:56:18,449 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 13:56:18,450 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2022-07-14 13:56:18,459 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93c90daff/33cfe8262e634e58be78806e3ac1179f/FLAGbaa80d246 [2022-07-14 13:56:18,860 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93c90daff/33cfe8262e634e58be78806e3ac1179f [2022-07-14 13:56:18,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 13:56:18,862 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 13:56:18,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 13:56:18,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 13:56:18,867 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 13:56:18,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 01:56:18" (1/1) ... [2022-07-14 13:56:18,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d29fadb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:18, skipping insertion in model container [2022-07-14 13:56:18,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 01:56:18" (1/1) ... [2022-07-14 13:56:18,874 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 13:56:18,917 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 13:56:19,104 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c[44949,44962] [2022-07-14 13:56:19,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 13:56:19,121 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 13:56:19,174 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c[44949,44962] [2022-07-14 13:56:19,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 13:56:19,191 INFO L208 MainTranslator]: Completed translation [2022-07-14 13:56:19,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:19 WrapperNode [2022-07-14 13:56:19,192 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 13:56:19,193 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 13:56:19,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 13:56:19,193 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 13:56:19,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:19" (1/1) ... [2022-07-14 13:56:19,218 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:19" (1/1) ... [2022-07-14 13:56:19,245 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 525 [2022-07-14 13:56:19,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 13:56:19,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 13:56:19,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 13:56:19,251 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 13:56:19,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:19" (1/1) ... [2022-07-14 13:56:19,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:19" (1/1) ... [2022-07-14 13:56:19,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:19" (1/1) ... [2022-07-14 13:56:19,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:19" (1/1) ... [2022-07-14 13:56:19,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:19" (1/1) ... [2022-07-14 13:56:19,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:19" (1/1) ... [2022-07-14 13:56:19,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:19" (1/1) ... [2022-07-14 13:56:19,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 13:56:19,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 13:56:19,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 13:56:19,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 13:56:19,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:19" (1/1) ... [2022-07-14 13:56:19,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 13:56:19,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:56:19,321 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 13:56:19,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 13:56:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 13:56:19,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 13:56:19,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 13:56:19,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 13:56:19,406 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 13:56:19,407 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 13:56:19,418 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-14 13:56:19,743 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-14 13:56:19,743 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-14 13:56:19,744 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 13:56:19,762 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 13:56:19,763 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-14 13:56:19,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:56:19 BoogieIcfgContainer [2022-07-14 13:56:19,764 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 13:56:19,765 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 13:56:19,765 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 13:56:19,768 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 13:56:19,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 01:56:18" (1/3) ... [2022-07-14 13:56:19,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d67c32d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 01:56:19, skipping insertion in model container [2022-07-14 13:56:19,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:56:19" (2/3) ... [2022-07-14 13:56:19,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d67c32d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 01:56:19, skipping insertion in model container [2022-07-14 13:56:19,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:56:19" (3/3) ... [2022-07-14 13:56:19,770 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2022-07-14 13:56:19,791 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 13:56:19,791 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-07-14 13:56:19,827 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 13:56:19,831 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1a0b6c2f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1273c5db [2022-07-14 13:56:19,831 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-14 13:56:19,834 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 142 states have (on average 1.732394366197183) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:19,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 13:56:19,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:19,839 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:19,839 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:19,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:19,842 INFO L85 PathProgramCache]: Analyzing trace with hash -580333898, now seen corresponding path program 1 times [2022-07-14 13:56:19,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:19,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302991386] [2022-07-14 13:56:19,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:19,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:19,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:56:19,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:19,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302991386] [2022-07-14 13:56:19,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302991386] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:19,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:19,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:19,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864335050] [2022-07-14 13:56:19,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:19,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:19,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:19,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:19,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:56:19,990 INFO L87 Difference]: Start difference. First operand has 147 states, 142 states have (on average 1.732394366197183) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:20,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:20,118 INFO L93 Difference]: Finished difference Result 312 states and 520 transitions. [2022-07-14 13:56:20,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:20,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 13:56:20,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:20,126 INFO L225 Difference]: With dead ends: 312 [2022-07-14 13:56:20,127 INFO L226 Difference]: Without dead ends: 150 [2022-07-14 13:56:20,129 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-07-14 13:56:20,134 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 205 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:20,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 207 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:20,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-14 13:56:20,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-07-14 13:56:20,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 146 states have (on average 1.5410958904109588) internal successors, (225), 149 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:20,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 225 transitions. [2022-07-14 13:56:20,163 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 225 transitions. Word has length 18 [2022-07-14 13:56:20,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:20,164 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 225 transitions. [2022-07-14 13:56:20,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:20,164 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 225 transitions. [2022-07-14 13:56:20,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 13:56:20,165 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:20,165 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:20,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 13:56:20,165 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:20,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:20,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1061870123, now seen corresponding path program 1 times [2022-07-14 13:56:20,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:20,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083123737] [2022-07-14 13:56:20,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:20,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:20,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:56:20,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:20,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083123737] [2022-07-14 13:56:20,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083123737] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:20,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:20,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:20,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845980484] [2022-07-14 13:56:20,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:20,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:20,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:20,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:20,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:56:20,201 INFO L87 Difference]: Start difference. First operand 150 states and 225 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:20,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:20,277 INFO L93 Difference]: Finished difference Result 302 states and 451 transitions. [2022-07-14 13:56:20,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:20,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-14 13:56:20,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:20,279 INFO L225 Difference]: With dead ends: 302 [2022-07-14 13:56:20,279 INFO L226 Difference]: Without dead ends: 160 [2022-07-14 13:56:20,280 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-07-14 13:56:20,281 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 165 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:20,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 151 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:20,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-14 13:56:20,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 151. [2022-07-14 13:56:20,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 147 states have (on average 1.5374149659863945) internal successors, (226), 150 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 226 transitions. [2022-07-14 13:56:20,288 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 226 transitions. Word has length 19 [2022-07-14 13:56:20,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:20,289 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 226 transitions. [2022-07-14 13:56:20,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:20,289 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 226 transitions. [2022-07-14 13:56:20,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 13:56:20,290 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:20,290 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] [2022-07-14 13:56:20,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 13:56:20,290 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:20,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:20,291 INFO L85 PathProgramCache]: Analyzing trace with hash 323589326, now seen corresponding path program 1 times [2022-07-14 13:56:20,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:20,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165842627] [2022-07-14 13:56:20,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:20,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:20,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:56:20,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:20,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165842627] [2022-07-14 13:56:20,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165842627] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:20,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:20,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:20,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325305813] [2022-07-14 13:56:20,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:20,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:20,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:20,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:20,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:56:20,321 INFO L87 Difference]: Start difference. First operand 151 states and 226 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:20,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:20,410 INFO L93 Difference]: Finished difference Result 304 states and 453 transitions. [2022-07-14 13:56:20,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:20,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-14 13:56:20,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:20,412 INFO L225 Difference]: With dead ends: 304 [2022-07-14 13:56:20,412 INFO L226 Difference]: Without dead ends: 161 [2022-07-14 13:56:20,412 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-07-14 13:56:20,413 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 163 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:20,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 152 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:20,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-14 13:56:20,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 152. [2022-07-14 13:56:20,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 148 states have (on average 1.5337837837837838) internal successors, (227), 151 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:20,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 227 transitions. [2022-07-14 13:56:20,420 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 227 transitions. Word has length 20 [2022-07-14 13:56:20,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:20,420 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 227 transitions. [2022-07-14 13:56:20,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:20,420 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 227 transitions. [2022-07-14 13:56:20,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 13:56:20,421 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:20,421 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:20,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 13:56:20,421 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:20,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:20,422 INFO L85 PathProgramCache]: Analyzing trace with hash -659408240, now seen corresponding path program 1 times [2022-07-14 13:56:20,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:20,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741063032] [2022-07-14 13:56:20,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:20,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:20,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:56:20,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:20,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741063032] [2022-07-14 13:56:20,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741063032] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:20,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:20,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:20,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580580016] [2022-07-14 13:56:20,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:20,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:20,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:20,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:20,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:56:20,450 INFO L87 Difference]: Start difference. First operand 152 states and 227 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:20,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:20,528 INFO L93 Difference]: Finished difference Result 306 states and 455 transitions. [2022-07-14 13:56:20,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:20,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-14 13:56:20,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:20,529 INFO L225 Difference]: With dead ends: 306 [2022-07-14 13:56:20,530 INFO L226 Difference]: Without dead ends: 162 [2022-07-14 13:56:20,530 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-07-14 13:56:20,531 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 161 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:20,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 153 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:20,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-14 13:56:20,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 153. [2022-07-14 13:56:20,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 149 states have (on average 1.5302013422818792) internal successors, (228), 152 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:20,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 228 transitions. [2022-07-14 13:56:20,537 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 228 transitions. Word has length 21 [2022-07-14 13:56:20,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:20,537 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 228 transitions. [2022-07-14 13:56:20,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:20,537 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 228 transitions. [2022-07-14 13:56:20,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 13:56:20,538 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:20,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:20,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 13:56:20,538 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:20,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:20,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2050129239, now seen corresponding path program 1 times [2022-07-14 13:56:20,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:20,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376082949] [2022-07-14 13:56:20,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:20,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:20,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:56:20,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:20,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376082949] [2022-07-14 13:56:20,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376082949] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:20,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:20,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:20,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279305416] [2022-07-14 13:56:20,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:20,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:20,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:20,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:20,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:56:20,564 INFO L87 Difference]: Start difference. First operand 153 states and 228 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:20,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:20,636 INFO L93 Difference]: Finished difference Result 308 states and 457 transitions. [2022-07-14 13:56:20,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:20,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-14 13:56:20,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:20,637 INFO L225 Difference]: With dead ends: 308 [2022-07-14 13:56:20,638 INFO L226 Difference]: Without dead ends: 163 [2022-07-14 13:56:20,638 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-07-14 13:56:20,639 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 159 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:20,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 154 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:20,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-14 13:56:20,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 154. [2022-07-14 13:56:20,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 150 states have (on average 1.5266666666666666) internal successors, (229), 153 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 229 transitions. [2022-07-14 13:56:20,644 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 229 transitions. Word has length 22 [2022-07-14 13:56:20,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:20,644 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 229 transitions. [2022-07-14 13:56:20,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 229 transitions. [2022-07-14 13:56:20,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-14 13:56:20,646 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:20,646 INFO L195 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:20,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 13:56:20,646 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:20,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:20,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1990190120, now seen corresponding path program 1 times [2022-07-14 13:56:20,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:20,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036434805] [2022-07-14 13:56:20,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:20,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:20,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:56:20,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:20,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036434805] [2022-07-14 13:56:20,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036434805] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:20,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:20,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:20,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562403530] [2022-07-14 13:56:20,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:20,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:20,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:20,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:20,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:56:20,678 INFO L87 Difference]: Start difference. First operand 154 states and 229 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:20,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:20,792 INFO L93 Difference]: Finished difference Result 331 states and 499 transitions. [2022-07-14 13:56:20,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:20,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2022-07-14 13:56:20,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:20,793 INFO L225 Difference]: With dead ends: 331 [2022-07-14 13:56:20,793 INFO L226 Difference]: Without dead ends: 185 [2022-07-14 13:56:20,794 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-07-14 13:56:20,794 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 134 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:20,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 165 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:20,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-14 13:56:20,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-07-14 13:56:20,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 181 states have (on average 1.5524861878453038) internal successors, (281), 184 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:20,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 281 transitions. [2022-07-14 13:56:20,800 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 281 transitions. Word has length 47 [2022-07-14 13:56:20,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:20,801 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 281 transitions. [2022-07-14 13:56:20,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:20,801 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 281 transitions. [2022-07-14 13:56:20,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-14 13:56:20,802 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:20,803 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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-07-14 13:56:20,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 13:56:20,803 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:20,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:20,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1367947310, now seen corresponding path program 1 times [2022-07-14 13:56:20,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:20,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931269453] [2022-07-14 13:56:20,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:20,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:20,830 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 13:56:20,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:20,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931269453] [2022-07-14 13:56:20,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931269453] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:20,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:20,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:20,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344368568] [2022-07-14 13:56:20,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:20,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:20,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:20,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:20,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:56:20,832 INFO L87 Difference]: Start difference. First operand 185 states and 281 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:20,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:20,904 INFO L93 Difference]: Finished difference Result 380 states and 575 transitions. [2022-07-14 13:56:20,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:20,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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-07-14 13:56:20,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:20,905 INFO L225 Difference]: With dead ends: 380 [2022-07-14 13:56:20,906 INFO L226 Difference]: Without dead ends: 203 [2022-07-14 13:56:20,906 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-07-14 13:56:20,907 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 157 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:20,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 147 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:20,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-14 13:56:20,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2022-07-14 13:56:20,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 197 states have (on average 1.532994923857868) internal successors, (302), 200 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:20,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 302 transitions. [2022-07-14 13:56:20,913 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 302 transitions. Word has length 59 [2022-07-14 13:56:20,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:20,913 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 302 transitions. [2022-07-14 13:56:20,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:20,913 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 302 transitions. [2022-07-14 13:56:20,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-14 13:56:20,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:20,915 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-07-14 13:56:20,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 13:56:20,915 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:20,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:20,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2136164213, now seen corresponding path program 1 times [2022-07-14 13:56:20,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:20,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945474546] [2022-07-14 13:56:20,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:20,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:20,970 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 13:56:20,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:20,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945474546] [2022-07-14 13:56:20,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945474546] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:20,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:20,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:20,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162134116] [2022-07-14 13:56:20,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:20,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:20,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:20,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:20,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:56:20,973 INFO L87 Difference]: Start difference. First operand 201 states and 302 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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-07-14 13:56:21,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:21,073 INFO L93 Difference]: Finished difference Result 397 states and 596 transitions. [2022-07-14 13:56:21,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:21,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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 60 [2022-07-14 13:56:21,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:21,075 INFO L225 Difference]: With dead ends: 397 [2022-07-14 13:56:21,075 INFO L226 Difference]: Without dead ends: 204 [2022-07-14 13:56:21,075 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-07-14 13:56:21,076 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 155 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:21,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 148 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:21,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-14 13:56:21,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202. [2022-07-14 13:56:21,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 198 states have (on average 1.5252525252525253) internal successors, (302), 201 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:21,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 302 transitions. [2022-07-14 13:56:21,082 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 302 transitions. Word has length 60 [2022-07-14 13:56:21,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:21,082 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 302 transitions. [2022-07-14 13:56:21,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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-07-14 13:56:21,083 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 302 transitions. [2022-07-14 13:56:21,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-14 13:56:21,083 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:21,084 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:21,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 13:56:21,084 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:21,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:21,084 INFO L85 PathProgramCache]: Analyzing trace with hash -956503025, now seen corresponding path program 1 times [2022-07-14 13:56:21,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:21,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235468695] [2022-07-14 13:56:21,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:21,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:21,138 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 13:56:21,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:21,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235468695] [2022-07-14 13:56:21,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235468695] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:21,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:21,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:21,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612417811] [2022-07-14 13:56:21,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:21,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:21,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:21,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:21,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:56:21,140 INFO L87 Difference]: Start difference. First operand 202 states and 302 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-07-14 13:56:21,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:21,274 INFO L93 Difference]: Finished difference Result 440 states and 667 transitions. [2022-07-14 13:56:21,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:21,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 73 [2022-07-14 13:56:21,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:21,275 INFO L225 Difference]: With dead ends: 440 [2022-07-14 13:56:21,276 INFO L226 Difference]: Without dead ends: 246 [2022-07-14 13:56:21,276 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-07-14 13:56:21,276 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 141 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:21,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 149 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:21,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-07-14 13:56:21,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2022-07-14 13:56:21,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 240 states have (on average 1.5541666666666667) internal successors, (373), 243 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:21,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 373 transitions. [2022-07-14 13:56:21,282 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 373 transitions. Word has length 73 [2022-07-14 13:56:21,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:21,283 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 373 transitions. [2022-07-14 13:56:21,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-07-14 13:56:21,283 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 373 transitions. [2022-07-14 13:56:21,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-14 13:56:21,291 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:21,291 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:21,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 13:56:21,292 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:21,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:21,293 INFO L85 PathProgramCache]: Analyzing trace with hash 603125704, now seen corresponding path program 1 times [2022-07-14 13:56:21,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:21,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056341321] [2022-07-14 13:56:21,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:21,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:21,334 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 13:56:21,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:21,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056341321] [2022-07-14 13:56:21,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056341321] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:21,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:21,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:21,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211120015] [2022-07-14 13:56:21,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:21,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:21,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:21,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:21,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:56:21,337 INFO L87 Difference]: Start difference. First operand 244 states and 373 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:21,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:21,439 INFO L93 Difference]: Finished difference Result 514 states and 789 transitions. [2022-07-14 13:56:21,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:21,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 74 [2022-07-14 13:56:21,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:21,441 INFO L225 Difference]: With dead ends: 514 [2022-07-14 13:56:21,441 INFO L226 Difference]: Without dead ends: 278 [2022-07-14 13:56:21,441 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-07-14 13:56:21,442 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 143 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:21,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 156 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:21,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-07-14 13:56:21,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 271. [2022-07-14 13:56:21,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 267 states have (on average 1.546816479400749) internal successors, (413), 270 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:21,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 413 transitions. [2022-07-14 13:56:21,449 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 413 transitions. Word has length 74 [2022-07-14 13:56:21,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:21,449 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 413 transitions. [2022-07-14 13:56:21,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:21,450 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 413 transitions. [2022-07-14 13:56:21,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-14 13:56:21,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:21,451 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:21,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 13:56:21,451 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:21,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:21,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1649015640, now seen corresponding path program 1 times [2022-07-14 13:56:21,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:21,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328505530] [2022-07-14 13:56:21,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:21,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:21,479 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 13:56:21,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:21,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328505530] [2022-07-14 13:56:21,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328505530] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:21,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:21,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:21,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545963803] [2022-07-14 13:56:21,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:21,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:21,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:21,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:21,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:56:21,481 INFO L87 Difference]: Start difference. First operand 271 states and 413 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:21,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:21,594 INFO L93 Difference]: Finished difference Result 537 states and 818 transitions. [2022-07-14 13:56:21,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:21,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 74 [2022-07-14 13:56:21,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:21,596 INFO L225 Difference]: With dead ends: 537 [2022-07-14 13:56:21,596 INFO L226 Difference]: Without dead ends: 274 [2022-07-14 13:56:21,597 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-07-14 13:56:21,597 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 140 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:21,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 149 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:21,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-07-14 13:56:21,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 272. [2022-07-14 13:56:21,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 268 states have (on average 1.541044776119403) internal successors, (413), 271 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:21,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 413 transitions. [2022-07-14 13:56:21,604 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 413 transitions. Word has length 74 [2022-07-14 13:56:21,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:21,605 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 413 transitions. [2022-07-14 13:56:21,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:21,605 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 413 transitions. [2022-07-14 13:56:21,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-14 13:56:21,606 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:21,606 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:21,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 13:56:21,606 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:21,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:21,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1207629393, now seen corresponding path program 1 times [2022-07-14 13:56:21,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:21,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484183120] [2022-07-14 13:56:21,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:21,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:21,628 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 13:56:21,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:21,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484183120] [2022-07-14 13:56:21,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484183120] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:21,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:21,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:21,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409422478] [2022-07-14 13:56:21,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:21,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:21,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:21,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:21,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:56:21,630 INFO L87 Difference]: Start difference. First operand 272 states and 413 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:21,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:21,744 INFO L93 Difference]: Finished difference Result 543 states and 826 transitions. [2022-07-14 13:56:21,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:21,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 75 [2022-07-14 13:56:21,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:21,746 INFO L225 Difference]: With dead ends: 543 [2022-07-14 13:56:21,746 INFO L226 Difference]: Without dead ends: 279 [2022-07-14 13:56:21,747 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-07-14 13:56:21,747 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 142 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:21,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 156 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:21,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-07-14 13:56:21,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 272. [2022-07-14 13:56:21,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 268 states have (on average 1.5298507462686568) internal successors, (410), 271 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 410 transitions. [2022-07-14 13:56:21,754 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 410 transitions. Word has length 75 [2022-07-14 13:56:21,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:21,755 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 410 transitions. [2022-07-14 13:56:21,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:21,755 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 410 transitions. [2022-07-14 13:56:21,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-14 13:56:21,756 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:21,756 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:21,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 13:56:21,756 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:21,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:21,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1576887455, now seen corresponding path program 1 times [2022-07-14 13:56:21,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:21,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077369406] [2022-07-14 13:56:21,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:21,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:21,778 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 13:56:21,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:21,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077369406] [2022-07-14 13:56:21,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077369406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:21,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:21,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:21,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600095036] [2022-07-14 13:56:21,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:21,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:21,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:21,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:21,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:56:21,780 INFO L87 Difference]: Start difference. First operand 272 states and 410 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 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-07-14 13:56:21,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:21,906 INFO L93 Difference]: Finished difference Result 583 states and 882 transitions. [2022-07-14 13:56:21,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:21,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 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 90 [2022-07-14 13:56:21,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:21,908 INFO L225 Difference]: With dead ends: 583 [2022-07-14 13:56:21,908 INFO L226 Difference]: Without dead ends: 319 [2022-07-14 13:56:21,909 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-07-14 13:56:21,909 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 125 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:21,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 154 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:21,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-14 13:56:21,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 315. [2022-07-14 13:56:21,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 311 states have (on average 1.540192926045016) internal successors, (479), 314 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:21,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 479 transitions. [2022-07-14 13:56:21,917 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 479 transitions. Word has length 90 [2022-07-14 13:56:21,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:21,918 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 479 transitions. [2022-07-14 13:56:21,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 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-07-14 13:56:21,918 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 479 transitions. [2022-07-14 13:56:21,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-14 13:56:21,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:21,919 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:21,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 13:56:21,919 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:21,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:21,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1659002301, now seen corresponding path program 1 times [2022-07-14 13:56:21,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:21,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498416320] [2022-07-14 13:56:21,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:21,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:21,941 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 13:56:21,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:21,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498416320] [2022-07-14 13:56:21,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498416320] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:21,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:21,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:21,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003690709] [2022-07-14 13:56:21,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:21,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:21,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:21,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:21,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:56:21,943 INFO L87 Difference]: Start difference. First operand 315 states and 479 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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-07-14 13:56:22,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:22,072 INFO L93 Difference]: Finished difference Result 638 states and 973 transitions. [2022-07-14 13:56:22,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:22,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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 91 [2022-07-14 13:56:22,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:22,074 INFO L225 Difference]: With dead ends: 638 [2022-07-14 13:56:22,074 INFO L226 Difference]: Without dead ends: 329 [2022-07-14 13:56:22,075 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-07-14 13:56:22,075 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 125 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:22,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 153 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:22,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-07-14 13:56:22,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 325. [2022-07-14 13:56:22,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 321 states have (on average 1.5514018691588785) internal successors, (498), 324 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:22,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 498 transitions. [2022-07-14 13:56:22,083 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 498 transitions. Word has length 91 [2022-07-14 13:56:22,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:22,083 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 498 transitions. [2022-07-14 13:56:22,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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-07-14 13:56:22,084 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 498 transitions. [2022-07-14 13:56:22,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-14 13:56:22,084 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:22,085 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:22,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 13:56:22,085 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:22,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:22,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1994556924, now seen corresponding path program 1 times [2022-07-14 13:56:22,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:22,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482416171] [2022-07-14 13:56:22,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:22,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:22,104 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-14 13:56:22,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:22,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482416171] [2022-07-14 13:56:22,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482416171] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:22,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:22,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:22,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842518428] [2022-07-14 13:56:22,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:22,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:22,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:22,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:22,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:56:22,106 INFO L87 Difference]: Start difference. First operand 325 states and 498 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:22,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:22,209 INFO L93 Difference]: Finished difference Result 679 states and 1043 transitions. [2022-07-14 13:56:22,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:22,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 100 [2022-07-14 13:56:22,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:22,211 INFO L225 Difference]: With dead ends: 679 [2022-07-14 13:56:22,211 INFO L226 Difference]: Without dead ends: 362 [2022-07-14 13:56:22,212 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-07-14 13:56:22,214 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 145 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:22,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 167 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:22,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-07-14 13:56:22,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 350. [2022-07-14 13:56:22,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 346 states have (on average 1.5375722543352601) internal successors, (532), 349 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:22,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 532 transitions. [2022-07-14 13:56:22,223 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 532 transitions. Word has length 100 [2022-07-14 13:56:22,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:22,223 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 532 transitions. [2022-07-14 13:56:22,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:22,223 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 532 transitions. [2022-07-14 13:56:22,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-14 13:56:22,226 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:22,226 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:22,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 13:56:22,227 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:22,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:22,227 INFO L85 PathProgramCache]: Analyzing trace with hash 98352259, now seen corresponding path program 1 times [2022-07-14 13:56:22,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:22,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661082479] [2022-07-14 13:56:22,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:22,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:22,266 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-14 13:56:22,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:22,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661082479] [2022-07-14 13:56:22,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661082479] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:22,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:22,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:22,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010887204] [2022-07-14 13:56:22,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:22,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:22,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:22,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:22,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:56:22,270 INFO L87 Difference]: Start difference. First operand 350 states and 532 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:22,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:22,376 INFO L93 Difference]: Finished difference Result 704 states and 1072 transitions. [2022-07-14 13:56:22,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:22,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2022-07-14 13:56:22,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:22,378 INFO L225 Difference]: With dead ends: 704 [2022-07-14 13:56:22,378 INFO L226 Difference]: Without dead ends: 362 [2022-07-14 13:56:22,379 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-07-14 13:56:22,379 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 144 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:22,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 167 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:22,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-07-14 13:56:22,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 350. [2022-07-14 13:56:22,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 346 states have (on average 1.523121387283237) internal successors, (527), 349 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:22,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 527 transitions. [2022-07-14 13:56:22,390 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 527 transitions. Word has length 101 [2022-07-14 13:56:22,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:22,390 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 527 transitions. [2022-07-14 13:56:22,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:22,391 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 527 transitions. [2022-07-14 13:56:22,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-14 13:56:22,392 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:22,392 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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-07-14 13:56:22,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 13:56:22,392 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:22,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:22,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1920296106, now seen corresponding path program 1 times [2022-07-14 13:56:22,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:22,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739857631] [2022-07-14 13:56:22,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:22,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:22,422 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-14 13:56:22,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:22,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739857631] [2022-07-14 13:56:22,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739857631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:22,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:22,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:22,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515054086] [2022-07-14 13:56:22,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:22,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:22,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:22,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:22,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:56:22,424 INFO L87 Difference]: Start difference. First operand 350 states and 527 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:22,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:22,518 INFO L93 Difference]: Finished difference Result 719 states and 1082 transitions. [2022-07-14 13:56:22,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:22,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 120 [2022-07-14 13:56:22,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:22,520 INFO L225 Difference]: With dead ends: 719 [2022-07-14 13:56:22,520 INFO L226 Difference]: Without dead ends: 377 [2022-07-14 13:56:22,520 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-07-14 13:56:22,521 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 147 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:22,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 152 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:22,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-07-14 13:56:22,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 374. [2022-07-14 13:56:22,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 370 states have (on average 1.5054054054054054) internal successors, (557), 373 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:22,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 557 transitions. [2022-07-14 13:56:22,529 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 557 transitions. Word has length 120 [2022-07-14 13:56:22,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:22,529 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 557 transitions. [2022-07-14 13:56:22,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:22,530 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 557 transitions. [2022-07-14 13:56:22,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-14 13:56:22,531 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:22,531 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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-07-14 13:56:22,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 13:56:22,531 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:22,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:22,531 INFO L85 PathProgramCache]: Analyzing trace with hash -698248943, now seen corresponding path program 1 times [2022-07-14 13:56:22,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:22,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376707458] [2022-07-14 13:56:22,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:22,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:22,554 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-14 13:56:22,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:22,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376707458] [2022-07-14 13:56:22,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376707458] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:22,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:22,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:22,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338323631] [2022-07-14 13:56:22,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:22,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:22,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:22,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:22,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:56:22,556 INFO L87 Difference]: Start difference. First operand 374 states and 557 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:22,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:22,652 INFO L93 Difference]: Finished difference Result 743 states and 1106 transitions. [2022-07-14 13:56:22,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:22,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-07-14 13:56:22,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:22,653 INFO L225 Difference]: With dead ends: 743 [2022-07-14 13:56:22,653 INFO L226 Difference]: Without dead ends: 377 [2022-07-14 13:56:22,654 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-07-14 13:56:22,654 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 146 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:22,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 151 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:22,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-07-14 13:56:22,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 374. [2022-07-14 13:56:22,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 370 states have (on average 1.4891891891891893) internal successors, (551), 373 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:22,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 551 transitions. [2022-07-14 13:56:22,662 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 551 transitions. Word has length 121 [2022-07-14 13:56:22,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:22,662 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 551 transitions. [2022-07-14 13:56:22,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:22,663 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 551 transitions. [2022-07-14 13:56:22,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-14 13:56:22,663 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:22,664 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-14 13:56:22,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 13:56:22,664 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:22,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:22,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1095545664, now seen corresponding path program 1 times [2022-07-14 13:56:22,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:22,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937488530] [2022-07-14 13:56:22,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:22,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:22,692 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-14 13:56:22,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:22,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937488530] [2022-07-14 13:56:22,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937488530] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:22,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:22,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:22,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048562922] [2022-07-14 13:56:22,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:22,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:22,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:22,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:22,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:56:22,694 INFO L87 Difference]: Start difference. First operand 374 states and 551 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:22,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:22,820 INFO L93 Difference]: Finished difference Result 785 states and 1156 transitions. [2022-07-14 13:56:22,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:22,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2022-07-14 13:56:22,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:22,823 INFO L225 Difference]: With dead ends: 785 [2022-07-14 13:56:22,823 INFO L226 Difference]: Without dead ends: 419 [2022-07-14 13:56:22,824 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-07-14 13:56:22,824 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 126 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:22,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 159 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:22,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-07-14 13:56:22,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 415. [2022-07-14 13:56:22,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 411 states have (on average 1.4841849148418491) internal successors, (610), 414 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:22,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 610 transitions. [2022-07-14 13:56:22,832 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 610 transitions. Word has length 130 [2022-07-14 13:56:22,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:22,832 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 610 transitions. [2022-07-14 13:56:22,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:22,833 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 610 transitions. [2022-07-14 13:56:22,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-14 13:56:22,833 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:22,834 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-14 13:56:22,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-14 13:56:22,834 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:22,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:22,834 INFO L85 PathProgramCache]: Analyzing trace with hash 850220610, now seen corresponding path program 1 times [2022-07-14 13:56:22,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:22,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039438990] [2022-07-14 13:56:22,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:22,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:22,852 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-14 13:56:22,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:22,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039438990] [2022-07-14 13:56:22,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039438990] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:22,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:22,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:22,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824646233] [2022-07-14 13:56:22,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:22,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:22,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:22,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:22,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:56:22,854 INFO L87 Difference]: Start difference. First operand 415 states and 610 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:22,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:22,946 INFO L93 Difference]: Finished difference Result 826 states and 1213 transitions. [2022-07-14 13:56:22,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:22,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 131 [2022-07-14 13:56:22,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:22,948 INFO L225 Difference]: With dead ends: 826 [2022-07-14 13:56:22,948 INFO L226 Difference]: Without dead ends: 417 [2022-07-14 13:56:22,948 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-07-14 13:56:22,949 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 125 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:22,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 156 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:22,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-07-14 13:56:22,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 413. [2022-07-14 13:56:22,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 409 states have (on average 1.4792176039119804) internal successors, (605), 412 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:22,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 605 transitions. [2022-07-14 13:56:22,960 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 605 transitions. Word has length 131 [2022-07-14 13:56:22,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:22,960 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 605 transitions. [2022-07-14 13:56:22,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:22,961 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 605 transitions. [2022-07-14 13:56:22,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-14 13:56:22,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:22,962 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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-07-14 13:56:22,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 13:56:22,962 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:22,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:22,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1977670215, now seen corresponding path program 1 times [2022-07-14 13:56:22,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:22,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092337822] [2022-07-14 13:56:22,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:22,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:22,986 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-14 13:56:22,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:22,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092337822] [2022-07-14 13:56:22,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092337822] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:22,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:22,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:22,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133276740] [2022-07-14 13:56:22,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:22,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:22,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:22,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:22,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:56:22,988 INFO L87 Difference]: Start difference. First operand 413 states and 605 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-07-14 13:56:23,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:23,056 INFO L93 Difference]: Finished difference Result 843 states and 1235 transitions. [2022-07-14 13:56:23,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:23,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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 141 [2022-07-14 13:56:23,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:23,058 INFO L225 Difference]: With dead ends: 843 [2022-07-14 13:56:23,058 INFO L226 Difference]: Without dead ends: 438 [2022-07-14 13:56:23,060 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-07-14 13:56:23,061 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 149 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:23,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 152 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:23,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-07-14 13:56:23,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 434. [2022-07-14 13:56:23,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 430 states have (on average 1.4604651162790698) internal successors, (628), 433 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:23,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 628 transitions. [2022-07-14 13:56:23,071 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 628 transitions. Word has length 141 [2022-07-14 13:56:23,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:23,071 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 628 transitions. [2022-07-14 13:56:23,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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-07-14 13:56:23,071 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 628 transitions. [2022-07-14 13:56:23,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-14 13:56:23,072 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:23,072 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 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-07-14 13:56:23,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-14 13:56:23,073 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:23,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:23,073 INFO L85 PathProgramCache]: Analyzing trace with hash -2018786222, now seen corresponding path program 1 times [2022-07-14 13:56:23,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:23,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259150166] [2022-07-14 13:56:23,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:23,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:23,095 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-14 13:56:23,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:23,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259150166] [2022-07-14 13:56:23,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259150166] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:23,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:23,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:23,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880664882] [2022-07-14 13:56:23,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:23,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:23,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:23,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:23,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:56:23,098 INFO L87 Difference]: Start difference. First operand 434 states and 628 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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-07-14 13:56:23,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:23,167 INFO L93 Difference]: Finished difference Result 864 states and 1250 transitions. [2022-07-14 13:56:23,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:23,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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 142 [2022-07-14 13:56:23,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:23,169 INFO L225 Difference]: With dead ends: 864 [2022-07-14 13:56:23,169 INFO L226 Difference]: Without dead ends: 438 [2022-07-14 13:56:23,170 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-07-14 13:56:23,171 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 148 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:23,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 152 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:23,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-07-14 13:56:23,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 434. [2022-07-14 13:56:23,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 430 states have (on average 1.441860465116279) internal successors, (620), 433 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:23,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 620 transitions. [2022-07-14 13:56:23,180 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 620 transitions. Word has length 142 [2022-07-14 13:56:23,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:23,180 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 620 transitions. [2022-07-14 13:56:23,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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-07-14 13:56:23,180 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 620 transitions. [2022-07-14 13:56:23,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-14 13:56:23,181 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:23,181 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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-07-14 13:56:23,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-14 13:56:23,182 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:23,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:23,182 INFO L85 PathProgramCache]: Analyzing trace with hash -136164042, now seen corresponding path program 1 times [2022-07-14 13:56:23,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:23,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404179311] [2022-07-14 13:56:23,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:23,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:23,210 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-14 13:56:23,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:23,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404179311] [2022-07-14 13:56:23,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404179311] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:23,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:23,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:23,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205205114] [2022-07-14 13:56:23,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:23,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:23,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:23,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:23,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:56:23,213 INFO L87 Difference]: Start difference. First operand 434 states and 620 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:23,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:23,240 INFO L93 Difference]: Finished difference Result 1280 states and 1824 transitions. [2022-07-14 13:56:23,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:23,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2022-07-14 13:56:23,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:23,242 INFO L225 Difference]: With dead ends: 1280 [2022-07-14 13:56:23,242 INFO L226 Difference]: Without dead ends: 854 [2022-07-14 13:56:23,243 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-07-14 13:56:23,243 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 173 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:23,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 505 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:56:23,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2022-07-14 13:56:23,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 435. [2022-07-14 13:56:23,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 431 states have (on average 1.4408352668213458) internal successors, (621), 434 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:23,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 621 transitions. [2022-07-14 13:56:23,254 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 621 transitions. Word has length 157 [2022-07-14 13:56:23,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:23,254 INFO L495 AbstractCegarLoop]: Abstraction has 435 states and 621 transitions. [2022-07-14 13:56:23,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:23,255 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 621 transitions. [2022-07-14 13:56:23,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-14 13:56:23,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:23,256 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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-07-14 13:56:23,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-14 13:56:23,256 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:23,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:23,257 INFO L85 PathProgramCache]: Analyzing trace with hash -877621738, now seen corresponding path program 1 times [2022-07-14 13:56:23,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:23,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80172259] [2022-07-14 13:56:23,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:23,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:23,289 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-14 13:56:23,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:23,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80172259] [2022-07-14 13:56:23,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80172259] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:56:23,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799484697] [2022-07-14 13:56:23,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:23,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:23,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:56:23,292 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 13:56:23,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 13:56:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:23,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 13:56:23,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:56:23,476 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-14 13:56:23,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:56:23,520 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-14 13:56:23,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799484697] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:56:23,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:56:23,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-14 13:56:23,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406138493] [2022-07-14 13:56:23,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:56:23,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 13:56:23,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:23,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 13:56:23,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 13:56:23,522 INFO L87 Difference]: Start difference. First operand 435 states and 621 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:23,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:23,852 INFO L93 Difference]: Finished difference Result 1667 states and 2372 transitions. [2022-07-14 13:56:23,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 13:56:23,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2022-07-14 13:56:23,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:23,856 INFO L225 Difference]: With dead ends: 1667 [2022-07-14 13:56:23,856 INFO L226 Difference]: Without dead ends: 1208 [2022-07-14 13:56:23,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-14 13:56:23,857 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 575 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:23,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 585 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 13:56:23,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2022-07-14 13:56:23,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 505. [2022-07-14 13:56:23,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 503 states have (on average 1.4353876739562623) internal successors, (722), 504 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:23,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 722 transitions. [2022-07-14 13:56:23,876 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 722 transitions. Word has length 157 [2022-07-14 13:56:23,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:23,876 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 722 transitions. [2022-07-14 13:56:23,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:23,877 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 722 transitions. [2022-07-14 13:56:23,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-14 13:56:23,878 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:23,878 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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-07-14 13:56:23,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-14 13:56:24,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-14 13:56:24,095 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:24,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:24,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1902183378, now seen corresponding path program 1 times [2022-07-14 13:56:24,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:24,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576124721] [2022-07-14 13:56:24,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:24,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:24,145 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-14 13:56:24,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:24,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576124721] [2022-07-14 13:56:24,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576124721] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:56:24,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975443662] [2022-07-14 13:56:24,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:24,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:24,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:56:24,147 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 13:56:24,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 13:56:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:24,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 13:56:24,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:56:24,280 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-14 13:56:24,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:56:24,336 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-14 13:56:24,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975443662] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:56:24,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:56:24,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-14 13:56:24,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884427621] [2022-07-14 13:56:24,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:56:24,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 13:56:24,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:24,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 13:56:24,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 13:56:24,338 INFO L87 Difference]: Start difference. First operand 505 states and 722 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:24,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:24,887 INFO L93 Difference]: Finished difference Result 1929 states and 2722 transitions. [2022-07-14 13:56:24,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 13:56:24,887 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 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 159 [2022-07-14 13:56:24,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:24,891 INFO L225 Difference]: With dead ends: 1929 [2022-07-14 13:56:24,891 INFO L226 Difference]: Without dead ends: 1432 [2022-07-14 13:56:24,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-14 13:56:24,892 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 478 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:24,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 945 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 13:56:24,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2022-07-14 13:56:24,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 625. [2022-07-14 13:56:24,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 623 states have (on average 1.3804173354735152) internal successors, (860), 624 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 860 transitions. [2022-07-14 13:56:24,916 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 860 transitions. Word has length 159 [2022-07-14 13:56:24,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:24,916 INFO L495 AbstractCegarLoop]: Abstraction has 625 states and 860 transitions. [2022-07-14 13:56:24,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:24,916 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 860 transitions. [2022-07-14 13:56:24,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-14 13:56:24,918 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:24,918 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 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] [2022-07-14 13:56:24,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 13:56:25,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-14 13:56:25,135 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:25,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:25,135 INFO L85 PathProgramCache]: Analyzing trace with hash 2140887848, now seen corresponding path program 1 times [2022-07-14 13:56:25,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:25,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921058559] [2022-07-14 13:56:25,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:25,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:25,180 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-14 13:56:25,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:25,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921058559] [2022-07-14 13:56:25,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921058559] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:25,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:25,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:25,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781996835] [2022-07-14 13:56:25,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:25,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:25,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:25,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:25,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:56:25,182 INFO L87 Difference]: Start difference. First operand 625 states and 860 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:25,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:25,208 INFO L93 Difference]: Finished difference Result 1446 states and 1977 transitions. [2022-07-14 13:56:25,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:25,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2022-07-14 13:56:25,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:25,210 INFO L225 Difference]: With dead ends: 1446 [2022-07-14 13:56:25,210 INFO L226 Difference]: Without dead ends: 544 [2022-07-14 13:56:25,211 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-07-14 13:56:25,212 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 58 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:25,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 455 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:56:25,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2022-07-14 13:56:25,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2022-07-14 13:56:25,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 542 states have (on average 1.381918819188192) internal successors, (749), 543 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:25,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 749 transitions. [2022-07-14 13:56:25,227 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 749 transitions. Word has length 169 [2022-07-14 13:56:25,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:25,227 INFO L495 AbstractCegarLoop]: Abstraction has 544 states and 749 transitions. [2022-07-14 13:56:25,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:25,227 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 749 transitions. [2022-07-14 13:56:25,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-07-14 13:56:25,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:25,229 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 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-07-14 13:56:25,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-14 13:56:25,230 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:25,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:25,230 INFO L85 PathProgramCache]: Analyzing trace with hash -873338986, now seen corresponding path program 1 times [2022-07-14 13:56:25,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:25,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960860547] [2022-07-14 13:56:25,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:25,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:25,249 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-07-14 13:56:25,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:25,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960860547] [2022-07-14 13:56:25,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960860547] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:25,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:25,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:25,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679142665] [2022-07-14 13:56:25,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:25,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:25,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:25,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:25,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:56:25,251 INFO L87 Difference]: Start difference. First operand 544 states and 749 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:25,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:25,336 INFO L93 Difference]: Finished difference Result 1098 states and 1507 transitions. [2022-07-14 13:56:25,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:25,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 201 [2022-07-14 13:56:25,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:25,338 INFO L225 Difference]: With dead ends: 1098 [2022-07-14 13:56:25,338 INFO L226 Difference]: Without dead ends: 550 [2022-07-14 13:56:25,339 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-07-14 13:56:25,339 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 124 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:25,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 150 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:25,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-07-14 13:56:25,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 546. [2022-07-14 13:56:25,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 544 states have (on average 1.3621323529411764) internal successors, (741), 545 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:25,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 741 transitions. [2022-07-14 13:56:25,354 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 741 transitions. Word has length 201 [2022-07-14 13:56:25,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:25,354 INFO L495 AbstractCegarLoop]: Abstraction has 546 states and 741 transitions. [2022-07-14 13:56:25,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:25,355 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 741 transitions. [2022-07-14 13:56:25,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2022-07-14 13:56:25,357 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:25,357 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:25,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-14 13:56:25,357 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:25,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:25,358 INFO L85 PathProgramCache]: Analyzing trace with hash 840195126, now seen corresponding path program 1 times [2022-07-14 13:56:25,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:25,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884563619] [2022-07-14 13:56:25,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:25,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:25,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 700 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2022-07-14 13:56:25,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:25,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884563619] [2022-07-14 13:56:25,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884563619] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:25,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:25,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:25,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821889095] [2022-07-14 13:56:25,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:25,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:25,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:25,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:25,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:56:25,406 INFO L87 Difference]: Start difference. First operand 546 states and 741 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 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-07-14 13:56:25,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:25,502 INFO L93 Difference]: Finished difference Result 1120 states and 1513 transitions. [2022-07-14 13:56:25,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:25,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 340 [2022-07-14 13:56:25,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:25,505 INFO L225 Difference]: With dead ends: 1120 [2022-07-14 13:56:25,505 INFO L226 Difference]: Without dead ends: 582 [2022-07-14 13:56:25,505 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-07-14 13:56:25,506 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:25,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 292 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:25,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-07-14 13:56:25,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 580. [2022-07-14 13:56:25,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 578 states have (on average 1.3494809688581315) internal successors, (780), 579 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:25,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 780 transitions. [2022-07-14 13:56:25,528 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 780 transitions. Word has length 340 [2022-07-14 13:56:25,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:25,528 INFO L495 AbstractCegarLoop]: Abstraction has 580 states and 780 transitions. [2022-07-14 13:56:25,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 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-07-14 13:56:25,528 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 780 transitions. [2022-07-14 13:56:25,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2022-07-14 13:56:25,532 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:25,532 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 4, 4, 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, 1, 1, 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-07-14 13:56:25,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-14 13:56:25,532 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:25,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:25,534 INFO L85 PathProgramCache]: Analyzing trace with hash 299615116, now seen corresponding path program 1 times [2022-07-14 13:56:25,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:25,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651882641] [2022-07-14 13:56:25,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:25,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:25,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 824 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2022-07-14 13:56:25,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:25,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651882641] [2022-07-14 13:56:25,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651882641] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:25,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:25,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:25,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613739222] [2022-07-14 13:56:25,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:25,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:25,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:25,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:25,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:56:25,585 INFO L87 Difference]: Start difference. First operand 580 states and 780 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:25,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:25,676 INFO L93 Difference]: Finished difference Result 1190 states and 1595 transitions. [2022-07-14 13:56:25,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:25,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 371 [2022-07-14 13:56:25,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:25,679 INFO L225 Difference]: With dead ends: 1190 [2022-07-14 13:56:25,679 INFO L226 Difference]: Without dead ends: 618 [2022-07-14 13:56:25,680 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-07-14 13:56:25,680 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:25,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 292 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:56:25,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2022-07-14 13:56:25,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 616. [2022-07-14 13:56:25,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 614 states have (on average 1.3371335504885993) internal successors, (821), 615 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:25,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 821 transitions. [2022-07-14 13:56:25,697 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 821 transitions. Word has length 371 [2022-07-14 13:56:25,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:25,697 INFO L495 AbstractCegarLoop]: Abstraction has 616 states and 821 transitions. [2022-07-14 13:56:25,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:25,697 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 821 transitions. [2022-07-14 13:56:25,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2022-07-14 13:56:25,700 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:25,701 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 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-07-14 13:56:25,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-14 13:56:25,701 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:25,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:25,702 INFO L85 PathProgramCache]: Analyzing trace with hash 521510171, now seen corresponding path program 1 times [2022-07-14 13:56:25,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:25,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995931146] [2022-07-14 13:56:25,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:25,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:25,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 970 proven. 0 refuted. 0 times theorem prover too weak. 749 trivial. 0 not checked. [2022-07-14 13:56:25,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:25,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995931146] [2022-07-14 13:56:25,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995931146] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:56:25,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:56:25,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:56:25,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976994999] [2022-07-14 13:56:25,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:56:25,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:56:25,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:25,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:56:25,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:56:25,754 INFO L87 Difference]: Start difference. First operand 616 states and 821 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:25,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:25,789 INFO L93 Difference]: Finished difference Result 1635 states and 2161 transitions. [2022-07-14 13:56:25,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:56:25,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 404 [2022-07-14 13:56:25,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:25,792 INFO L225 Difference]: With dead ends: 1635 [2022-07-14 13:56:25,792 INFO L226 Difference]: Without dead ends: 1027 [2022-07-14 13:56:25,793 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-07-14 13:56:25,793 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 63 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:25,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 391 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:56:25,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2022-07-14 13:56:25,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 1027. [2022-07-14 13:56:25,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1025 states have (on average 1.3151219512195123) internal successors, (1348), 1026 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:25,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1348 transitions. [2022-07-14 13:56:25,838 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1348 transitions. Word has length 404 [2022-07-14 13:56:25,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:25,838 INFO L495 AbstractCegarLoop]: Abstraction has 1027 states and 1348 transitions. [2022-07-14 13:56:25,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:25,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1348 transitions. [2022-07-14 13:56:25,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2022-07-14 13:56:25,842 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:56:25,842 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 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-07-14 13:56:25,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-14 13:56:25,842 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-14 13:56:25,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:56:25,843 INFO L85 PathProgramCache]: Analyzing trace with hash 810329561, now seen corresponding path program 1 times [2022-07-14 13:56:25,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:56:25,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65029643] [2022-07-14 13:56:25,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:25,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:56:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:25,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 354 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2022-07-14 13:56:25,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:56:25,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65029643] [2022-07-14 13:56:25,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65029643] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:56:25,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748556267] [2022-07-14 13:56:25,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:56:25,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:25,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:56:25,902 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 13:56:25,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 13:56:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:56:26,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 13:56:26,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:56:26,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 354 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2022-07-14 13:56:26,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:56:26,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 354 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2022-07-14 13:56:26,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748556267] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:56:26,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:56:26,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-14 13:56:26,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550086936] [2022-07-14 13:56:26,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:56:26,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 13:56:26,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:56:26,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 13:56:26,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-14 13:56:26,168 INFO L87 Difference]: Start difference. First operand 1027 states and 1348 transitions. Second operand has 8 states, 8 states have (on average 27.875) internal successors, (223), 8 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:26,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:56:26,421 INFO L93 Difference]: Finished difference Result 2364 states and 3119 transitions. [2022-07-14 13:56:26,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 13:56:26,422 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 27.875) internal successors, (223), 8 states have internal predecessors, (223), 0 states have call successors, (0), 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 404 [2022-07-14 13:56:26,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:56:26,423 INFO L225 Difference]: With dead ends: 2364 [2022-07-14 13:56:26,423 INFO L226 Difference]: Without dead ends: 0 [2022-07-14 13:56:26,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 812 GetRequests, 805 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-14 13:56:26,425 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 99 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 13:56:26,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 988 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 13:56:26,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-14 13:56:26,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-14 13:56:26,426 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-07-14 13:56:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-14 13:56:26,426 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 404 [2022-07-14 13:56:26,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:56:26,426 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 13:56:26,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.875) internal successors, (223), 8 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:56:26,436 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-14 13:56:26,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-14 13:56:26,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-07-14 13:56:26,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-07-14 13:56:26,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-07-14 13:56:26,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-07-14 13:56:26,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 13:56:26,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:56:26,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-14 13:56:34,156 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 270) no Hoare annotation was computed. [2022-07-14 13:56:34,157 INFO L899 garLoopResultBuilder]: For program point L465(lines 465 469) no Hoare annotation was computed. [2022-07-14 13:56:34,157 INFO L899 garLoopResultBuilder]: For program point L268(line 268) no Hoare annotation was computed. [2022-07-14 13:56:34,157 INFO L899 garLoopResultBuilder]: For program point L268-1(line 268) no Hoare annotation was computed. [2022-07-14 13:56:34,157 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 608) no Hoare annotation was computed. [2022-07-14 13:56:34,157 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 619) no Hoare annotation was computed. [2022-07-14 13:56:34,157 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 630) no Hoare annotation was computed. [2022-07-14 13:56:34,157 INFO L902 garLoopResultBuilder]: At program point L698(lines 689 700) the Hoare annotation is: true [2022-07-14 13:56:34,157 INFO L899 garLoopResultBuilder]: For program point L335(lines 335 339) no Hoare annotation was computed. [2022-07-14 13:56:34,157 INFO L899 garLoopResultBuilder]: For program point L270(line 270) no Hoare annotation was computed. [2022-07-14 13:56:34,157 INFO L899 garLoopResultBuilder]: For program point L270-1(line 270) no Hoare annotation was computed. [2022-07-14 13:56:34,157 INFO L895 garLoopResultBuilder]: At program point L601(lines 109 669) the Hoare annotation is: (let ((.cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (= 8192 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse19 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse20 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse16 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse17 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 12292)) (.cse21 (not (<= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse18 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse22 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse13 .cse14 .cse15) (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse12 .cse15) (and .cse19 .cse0 .cse20 .cse21 .cse22) (and .cse19 .cse20 .cse21 .cse18 .cse22) (and .cse16 .cse17 .cse21 .cse18 .cse22))) [2022-07-14 13:56:34,157 INFO L899 garLoopResultBuilder]: For program point L568(lines 568 572) no Hoare annotation was computed. [2022-07-14 13:56:34,157 INFO L899 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2022-07-14 13:56:34,158 INFO L895 garLoopResultBuilder]: At program point L370(lines 352 388) the Hoare annotation is: (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) [2022-07-14 13:56:34,158 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 607) no Hoare annotation was computed. [2022-07-14 13:56:34,158 INFO L899 garLoopResultBuilder]: For program point L172(lines 172 618) no Hoare annotation was computed. [2022-07-14 13:56:34,158 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 629) no Hoare annotation was computed. [2022-07-14 13:56:34,158 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 540) no Hoare annotation was computed. [2022-07-14 13:56:34,158 INFO L899 garLoopResultBuilder]: For program point L470(lines 470 481) no Hoare annotation was computed. [2022-07-14 13:56:34,158 INFO L899 garLoopResultBuilder]: For program point L536-2(lines 219 600) no Hoare annotation was computed. [2022-07-14 13:56:34,158 INFO L895 garLoopResultBuilder]: At program point L404(lines 395 426) the Hoare annotation is: (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) [2022-07-14 13:56:34,158 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 250) no Hoare annotation was computed. [2022-07-14 13:56:34,158 INFO L895 garLoopResultBuilder]: At program point L206(lines 202 608) the Hoare annotation is: (let ((.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse2 (not (<= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse3))) [2022-07-14 13:56:34,158 INFO L895 garLoopResultBuilder]: At program point L173(lines 169 619) the Hoare annotation is: (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) [2022-07-14 13:56:34,158 INFO L899 garLoopResultBuilder]: For program point L239-2(lines 239 250) no Hoare annotation was computed. [2022-07-14 13:56:34,158 INFO L899 garLoopResultBuilder]: For program point L372(lines 372 376) no Hoare annotation was computed. [2022-07-14 13:56:34,158 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 270) no Hoare annotation was computed. [2022-07-14 13:56:34,159 INFO L902 garLoopResultBuilder]: At program point L670(lines 108 671) the Hoare annotation is: true [2022-07-14 13:56:34,159 INFO L899 garLoopResultBuilder]: For program point L406(lines 406 412) no Hoare annotation was computed. [2022-07-14 13:56:34,159 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 246) no Hoare annotation was computed. [2022-07-14 13:56:34,159 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 606) no Hoare annotation was computed. [2022-07-14 13:56:34,159 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 617) no Hoare annotation was computed. [2022-07-14 13:56:34,159 INFO L899 garLoopResultBuilder]: For program point L142(lines 142 628) no Hoare annotation was computed. [2022-07-14 13:56:34,159 INFO L895 garLoopResultBuilder]: At program point L109-2(lines 109 669) the Hoare annotation is: (let ((.cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (= 8192 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse19 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse20 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse16 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse17 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 12292)) (.cse21 (not (<= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse18 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse22 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse13 .cse14 .cse15) (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse12 .cse15) (and .cse19 .cse0 .cse20 .cse21 .cse22) (and .cse19 .cse20 .cse21 .cse18 .cse22) (and .cse16 .cse17 .cse21 .cse18 .cse22))) [2022-07-14 13:56:34,159 INFO L895 garLoopResultBuilder]: At program point L176(lines 175 617) the Hoare annotation is: (let ((.cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192))) (.cse5 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 8192 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse10 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse15 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse16 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse17 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (< 8192 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 12292) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse16 .cse17))) [2022-07-14 13:56:34,159 INFO L895 garLoopResultBuilder]: At program point L143(lines 136 630) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192))) (.cse5 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse14 .cse15) (and .cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-07-14 13:56:34,159 INFO L899 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2022-07-14 13:56:34,159 INFO L899 garLoopResultBuilder]: For program point L639(lines 639 667) no Hoare annotation was computed. [2022-07-14 13:56:34,159 INFO L899 garLoopResultBuilder]: For program point L474(lines 474 478) no Hoare annotation was computed. [2022-07-14 13:56:34,159 INFO L899 garLoopResultBuilder]: For program point L640(lines 640 664) no Hoare annotation was computed. [2022-07-14 13:56:34,159 INFO L899 garLoopResultBuilder]: For program point L574(lines 574 578) no Hoare annotation was computed. [2022-07-14 13:56:34,159 INFO L899 garLoopResultBuilder]: For program point L508(lines 508 512) no Hoare annotation was computed. [2022-07-14 13:56:34,160 INFO L899 garLoopResultBuilder]: For program point L574-2(lines 574 578) no Hoare annotation was computed. [2022-07-14 13:56:34,160 INFO L899 garLoopResultBuilder]: For program point L508-2(lines 219 600) no Hoare annotation was computed. [2022-07-14 13:56:34,160 INFO L899 garLoopResultBuilder]: For program point L211(lines 211 605) no Hoare annotation was computed. [2022-07-14 13:56:34,160 INFO L899 garLoopResultBuilder]: For program point L178(lines 178 616) no Hoare annotation was computed. [2022-07-14 13:56:34,160 INFO L899 garLoopResultBuilder]: For program point L145(lines 145 627) no Hoare annotation was computed. [2022-07-14 13:56:34,160 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 638) no Hoare annotation was computed. [2022-07-14 13:56:34,160 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 678) no Hoare annotation was computed. [2022-07-14 13:56:34,160 INFO L899 garLoopResultBuilder]: For program point L641(lines 641 650) no Hoare annotation was computed. [2022-07-14 13:56:34,160 INFO L899 garLoopResultBuilder]: For program point L674-2(lines 674 678) no Hoare annotation was computed. [2022-07-14 13:56:34,160 INFO L899 garLoopResultBuilder]: For program point L641-2(lines 640 662) no Hoare annotation was computed. [2022-07-14 13:56:34,160 INFO L899 garLoopResultBuilder]: For program point L278(lines 278 282) no Hoare annotation was computed. [2022-07-14 13:56:34,160 INFO L895 garLoopResultBuilder]: At program point L212(lines 208 606) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse1 (not (<= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse3 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse3) (and (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse0 .cse1 .cse2 .cse3))) [2022-07-14 13:56:34,160 INFO L895 garLoopResultBuilder]: At program point L113(lines 112 638) the Hoare annotation is: false [2022-07-14 13:56:34,160 INFO L899 garLoopResultBuilder]: For program point L312(lines 312 316) no Hoare annotation was computed. [2022-07-14 13:56:34,160 INFO L899 garLoopResultBuilder]: For program point L312-2(lines 219 600) no Hoare annotation was computed. [2022-07-14 13:56:34,160 INFO L899 garLoopResultBuilder]: For program point L643(lines 643 647) no Hoare annotation was computed. [2022-07-14 13:56:34,160 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 604) no Hoare annotation was computed. [2022-07-14 13:56:34,160 INFO L899 garLoopResultBuilder]: For program point L181(lines 181 615) no Hoare annotation was computed. [2022-07-14 13:56:34,160 INFO L899 garLoopResultBuilder]: For program point L148(lines 148 626) no Hoare annotation was computed. [2022-07-14 13:56:34,161 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 637) no Hoare annotation was computed. [2022-07-14 13:56:34,161 INFO L899 garLoopResultBuilder]: For program point L347(lines 347 351) no Hoare annotation was computed. [2022-07-14 13:56:34,161 INFO L899 garLoopResultBuilder]: For program point L347-2(lines 219 600) no Hoare annotation was computed. [2022-07-14 13:56:34,161 INFO L895 garLoopResultBuilder]: At program point L215(lines 214 604) the Hoare annotation is: (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) [2022-07-14 13:56:34,161 INFO L895 garLoopResultBuilder]: At program point L182(lines 178 616) the Hoare annotation is: (and (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (not (<= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) [2022-07-14 13:56:34,161 INFO L895 garLoopResultBuilder]: At program point L149(lines 145 627) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192))) (.cse5 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse12 .cse13) (and .cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-07-14 13:56:34,161 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 91) no Hoare annotation was computed. [2022-07-14 13:56:34,161 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 459) no Hoare annotation was computed. [2022-07-14 13:56:34,161 INFO L895 garLoopResultBuilder]: At program point L414(lines 405 425) the Hoare annotation is: (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) [2022-07-14 13:56:34,161 INFO L899 garLoopResultBuilder]: For program point L447-2(lines 447 459) no Hoare annotation was computed. [2022-07-14 13:56:34,161 INFO L899 garLoopResultBuilder]: For program point L184(lines 184 614) no Hoare annotation was computed. [2022-07-14 13:56:34,161 INFO L899 garLoopResultBuilder]: For program point L151(lines 151 625) no Hoare annotation was computed. [2022-07-14 13:56:34,161 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 636) no Hoare annotation was computed. [2022-07-14 13:56:34,161 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-14 13:56:34,161 INFO L895 garLoopResultBuilder]: At program point L218(lines 217 603) the Hoare annotation is: (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) [2022-07-14 13:56:34,161 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 90) no Hoare annotation was computed. [2022-07-14 13:56:34,162 INFO L899 garLoopResultBuilder]: For program point L86-2(lines 83 91) no Hoare annotation was computed. [2022-07-14 13:56:34,162 INFO L899 garLoopResultBuilder]: For program point L549(lines 549 554) no Hoare annotation was computed. [2022-07-14 13:56:34,162 INFO L899 garLoopResultBuilder]: For program point L450(lines 450 455) no Hoare annotation was computed. [2022-07-14 13:56:34,162 INFO L899 garLoopResultBuilder]: For program point L417(lines 417 421) no Hoare annotation was computed. [2022-07-14 13:56:34,162 INFO L899 garLoopResultBuilder]: For program point L252(lines 252 257) no Hoare annotation was computed. [2022-07-14 13:56:34,162 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 613) no Hoare annotation was computed. [2022-07-14 13:56:34,162 INFO L899 garLoopResultBuilder]: For program point L154(lines 154 624) no Hoare annotation was computed. [2022-07-14 13:56:34,162 INFO L899 garLoopResultBuilder]: For program point L121(lines 121 635) no Hoare annotation was computed. [2022-07-14 13:56:34,162 INFO L899 garLoopResultBuilder]: For program point L584(lines 584 594) no Hoare annotation was computed. [2022-07-14 13:56:34,162 INFO L899 garLoopResultBuilder]: For program point L584-1(lines 584 594) no Hoare annotation was computed. [2022-07-14 13:56:34,162 INFO L899 garLoopResultBuilder]: For program point L518(lines 518 522) no Hoare annotation was computed. [2022-07-14 13:56:34,162 INFO L899 garLoopResultBuilder]: For program point L518-2(lines 518 522) no Hoare annotation was computed. [2022-07-14 13:56:34,162 INFO L895 garLoopResultBuilder]: At program point L188(lines 184 614) the Hoare annotation is: (let ((.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse3 (not (<= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse5 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse5))) [2022-07-14 13:56:34,162 INFO L895 garLoopResultBuilder]: At program point L155(lines 151 625) the Hoare annotation is: (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529)) (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) [2022-07-14 13:56:34,162 INFO L899 garLoopResultBuilder]: For program point L486(lines 486 490) no Hoare annotation was computed. [2022-07-14 13:56:34,162 INFO L895 garLoopResultBuilder]: At program point L222(lines 115 637) the Hoare annotation is: false [2022-07-14 13:56:34,162 INFO L902 garLoopResultBuilder]: At program point L685(lines 75 687) the Hoare annotation is: true [2022-07-14 13:56:34,162 INFO L899 garLoopResultBuilder]: For program point L652(lines 652 658) no Hoare annotation was computed. [2022-07-14 13:56:34,163 INFO L899 garLoopResultBuilder]: For program point L355(lines 355 387) no Hoare annotation was computed. [2022-07-14 13:56:34,163 INFO L899 garLoopResultBuilder]: For program point L322(lines 322 326) no Hoare annotation was computed. [2022-07-14 13:56:34,163 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-14 13:56:34,163 INFO L899 garLoopResultBuilder]: For program point L322-2(lines 322 326) no Hoare annotation was computed. [2022-07-14 13:56:34,163 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 612) no Hoare annotation was computed. [2022-07-14 13:56:34,163 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 623) no Hoare annotation was computed. [2022-07-14 13:56:34,163 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 634) no Hoare annotation was computed. [2022-07-14 13:56:34,172 INFO L902 garLoopResultBuilder]: At program point L686(lines 20 688) the Hoare annotation is: true [2022-07-14 13:56:34,172 INFO L899 garLoopResultBuilder]: For program point L587(lines 587 591) no Hoare annotation was computed. [2022-07-14 13:56:34,172 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 101) no Hoare annotation was computed. [2022-07-14 13:56:34,172 INFO L899 garLoopResultBuilder]: For program point L93-1(lines 75 687) no Hoare annotation was computed. [2022-07-14 13:56:34,172 INFO L899 garLoopResultBuilder]: For program point L358(lines 358 386) no Hoare annotation was computed. [2022-07-14 13:56:34,172 INFO L899 garLoopResultBuilder]: For program point L358-1(lines 358 386) no Hoare annotation was computed. [2022-07-14 13:56:34,172 INFO L899 garLoopResultBuilder]: For program point L259(lines 259 272) no Hoare annotation was computed. [2022-07-14 13:56:34,172 INFO L899 garLoopResultBuilder]: For program point L193(lines 193 611) no Hoare annotation was computed. [2022-07-14 13:56:34,173 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 622) no Hoare annotation was computed. [2022-07-14 13:56:34,173 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 633) no Hoare annotation was computed. [2022-07-14 13:56:34,173 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 268) no Hoare annotation was computed. [2022-07-14 13:56:34,174 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 98) no Hoare annotation was computed. [2022-07-14 13:56:34,175 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-14 13:56:34,175 INFO L899 garLoopResultBuilder]: For program point L359(lines 359 383) no Hoare annotation was computed. [2022-07-14 13:56:34,175 INFO L899 garLoopResultBuilder]: For program point L227(lines 227 231) no Hoare annotation was computed. [2022-07-14 13:56:34,175 INFO L895 garLoopResultBuilder]: At program point L194(lines 190 612) the Hoare annotation is: (let ((.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse3 (not (<= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse5 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse5))) [2022-07-14 13:56:34,175 INFO L895 garLoopResultBuilder]: At program point L161(lines 157 623) the Hoare annotation is: (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) [2022-07-14 13:56:34,175 INFO L899 garLoopResultBuilder]: For program point L227-2(lines 219 600) no Hoare annotation was computed. [2022-07-14 13:56:34,175 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 268) no Hoare annotation was computed. [2022-07-14 13:56:34,176 INFO L899 garLoopResultBuilder]: For program point L261(lines 261 266) no Hoare annotation was computed. [2022-07-14 13:56:34,176 INFO L899 garLoopResultBuilder]: For program point L559(lines 559 567) no Hoare annotation was computed. [2022-07-14 13:56:34,176 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 299) no Hoare annotation was computed. [2022-07-14 13:56:34,176 INFO L899 garLoopResultBuilder]: For program point L295-2(lines 219 600) no Hoare annotation was computed. [2022-07-14 13:56:34,176 INFO L899 garLoopResultBuilder]: For program point L196(lines 196 610) no Hoare annotation was computed. [2022-07-14 13:56:34,177 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 621) no Hoare annotation was computed. [2022-07-14 13:56:34,177 INFO L899 garLoopResultBuilder]: For program point L130(lines 130 632) no Hoare annotation was computed. [2022-07-14 13:56:34,177 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 426) no Hoare annotation was computed. [2022-07-14 13:56:34,177 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 382) no Hoare annotation was computed. [2022-07-14 13:56:34,177 INFO L895 garLoopResultBuilder]: At program point L131(lines 127 633) the Hoare annotation is: false [2022-07-14 13:56:34,177 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-14 13:56:34,177 INFO L899 garLoopResultBuilder]: For program point L396(lines 396 402) no Hoare annotation was computed. [2022-07-14 13:56:34,178 INFO L899 garLoopResultBuilder]: For program point L562(lines 562 566) no Hoare annotation was computed. [2022-07-14 13:56:34,178 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 534) no Hoare annotation was computed. [2022-07-14 13:56:34,178 INFO L899 garLoopResultBuilder]: For program point L364(lines 364 368) no Hoare annotation was computed. [2022-07-14 13:56:34,178 INFO L899 garLoopResultBuilder]: For program point L331-1(lines 331 340) no Hoare annotation was computed. [2022-07-14 13:56:34,178 INFO L899 garLoopResultBuilder]: For program point L364-2(lines 362 380) no Hoare annotation was computed. [2022-07-14 13:56:34,178 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 609) no Hoare annotation was computed. [2022-07-14 13:56:34,178 INFO L899 garLoopResultBuilder]: For program point L166(lines 166 620) no Hoare annotation was computed. [2022-07-14 13:56:34,178 INFO L899 garLoopResultBuilder]: For program point L133(lines 133 631) no Hoare annotation was computed. [2022-07-14 13:56:34,179 INFO L895 garLoopResultBuilder]: At program point L563(lines 75 687) the Hoare annotation is: (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) [2022-07-14 13:56:34,179 INFO L899 garLoopResultBuilder]: For program point L497(lines 497 501) no Hoare annotation was computed. [2022-07-14 13:56:34,179 INFO L895 garLoopResultBuilder]: At program point L200(lines 196 610) the Hoare annotation is: (let ((.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse3 (not (<= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse5 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse5))) [2022-07-14 13:56:34,179 INFO L895 garLoopResultBuilder]: At program point L167(lines 163 621) the Hoare annotation is: (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) [2022-07-14 13:56:34,179 INFO L895 garLoopResultBuilder]: At program point L134(lines 133 631) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192))) (.cse5 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse14 .cse15) (and .cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-07-14 13:56:34,181 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:56:34,183 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 13:56:34,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 01:56:34 BoogieIcfgContainer [2022-07-14 13:56:34,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 13:56:34,205 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 13:56:34,205 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 13:56:34,205 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 13:56:34,206 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:56:19" (3/4) ... [2022-07-14 13:56:34,208 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-14 13:56:34,218 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-14 13:56:34,218 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-14 13:56:34,219 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-14 13:56:34,219 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-14 13:56:34,262 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-14 13:56:34,263 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 13:56:34,263 INFO L158 Benchmark]: Toolchain (without parser) took 15400.54ms. Allocated memory was 134.2MB in the beginning and 373.3MB in the end (delta: 239.1MB). Free memory was 104.6MB in the beginning and 237.6MB in the end (delta: -133.0MB). Peak memory consumption was 105.4MB. Max. memory is 16.1GB. [2022-07-14 13:56:34,263 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 92.3MB. Free memory is still 49.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 13:56:34,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.40ms. Allocated memory is still 134.2MB. Free memory was 104.2MB in the beginning and 105.7MB in the end (delta: -1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 13:56:34,263 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.58ms. Allocated memory is still 134.2MB. Free memory was 105.7MB in the beginning and 102.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-14 13:56:34,264 INFO L158 Benchmark]: Boogie Preprocessor took 37.63ms. Allocated memory is still 134.2MB. Free memory was 102.7MB in the beginning and 100.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 13:56:34,264 INFO L158 Benchmark]: RCFGBuilder took 475.51ms. Allocated memory is still 134.2MB. Free memory was 100.6MB in the beginning and 71.3MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-07-14 13:56:34,264 INFO L158 Benchmark]: TraceAbstraction took 14439.36ms. Allocated memory was 134.2MB in the beginning and 373.3MB in the end (delta: 239.1MB). Free memory was 70.8MB in the beginning and 245.0MB in the end (delta: -174.1MB). Peak memory consumption was 190.2MB. Max. memory is 16.1GB. [2022-07-14 13:56:34,264 INFO L158 Benchmark]: Witness Printer took 57.62ms. Allocated memory is still 373.3MB. Free memory was 245.0MB in the beginning and 237.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 13:56:34,265 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.14ms. Allocated memory is still 92.3MB. Free memory is still 49.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.40ms. Allocated memory is still 134.2MB. Free memory was 104.2MB in the beginning and 105.7MB in the end (delta: -1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.58ms. Allocated memory is still 134.2MB. Free memory was 105.7MB in the beginning and 102.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.63ms. Allocated memory is still 134.2MB. Free memory was 102.7MB in the beginning and 100.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 475.51ms. Allocated memory is still 134.2MB. Free memory was 100.6MB in the beginning and 71.3MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14439.36ms. Allocated memory was 134.2MB in the beginning and 373.3MB in the end (delta: 239.1MB). Free memory was 70.8MB in the beginning and 245.0MB in the end (delta: -174.1MB). Peak memory consumption was 190.2MB. Max. memory is 16.1GB. * Witness Printer took 57.62ms. Allocated memory is still 373.3MB. Free memory was 245.0MB in the beginning and 237.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. 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: 268]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 268]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 270]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 270]: 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, 147 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 14.4s, OverallIterations: 31, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4837 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4837 mSDsluCounter, 8053 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2919 mSDsCounter, 1081 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3704 IncrementalHoareTripleChecker+Invalid, 4785 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1081 mSolverCounterUnsat, 5134 mSDtfsCounter, 3704 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1548 GetRequests, 1497 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1027occurred in iteration=30, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 2049 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 200 NumberOfFragments, 1950 HoareAnnotationTreeSize, 29 FomulaSimplifications, 128 FormulaSimplificationTreeSizeReduction, 2.7s HoareSimplificationTime, 29 FomulaSimplificationsInter, 396884 FormulaSimplificationTreeSizeReductionInter, 4.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 4811 NumberOfCodeBlocks, 4811 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 5494 ConstructedInterpolants, 0 QuantifiedInterpolants, 8634 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1321 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 37 InterpolantComputations, 28 PerfectInterpolantSequences, 13015/13072 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 4 specifications checked. All of them hold - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: ((((((!(8673 == s__state) && !(8576 == s__state)) && !(s__state == 8657)) && !(s__state == 8672)) && !(12292 <= s__state)) && !(s__state == 8656)) && 8576 <= s__state) || ((((((!(8673 == s__state) && !(s__state == 8657)) && !(s__state == 8672)) && !(12292 <= s__state)) && !(s__state == 8656)) && !(0 == s__hit)) && 8576 <= s__state) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: ((((!(s__state == 8657) && !(12292 <= s__state)) && !(s__state == 8656)) && !(0 == s__hit)) && 8576 <= s__state) || ((((!(8576 == s__state) && !(s__state == 8657)) && !(12292 <= s__state)) && !(s__state == 8656)) && 8576 <= s__state) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576 - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: !(12292 == s__state) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(8576 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && 8576 <= s__s3__tmp__next_state___0) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) || (((((((((((((((((!(8576 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && 8192 < s__state) && 3 == s__s3__tmp__next_state___0) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576)) || ((((((((((((((((((!(s__state == 8561) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && 8576 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 < 12292) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576 - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8560 == s__state)) && s__state <= 8576 - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: ((((((!(8673 == s__state) && !(8576 == s__state)) && !(s__state == 8657)) && !(s__state == 8672)) && !(12292 <= s__state)) && !(s__state == 8656)) && 8576 <= s__state) || ((((((!(8673 == s__state) && !(s__state == 8657)) && !(s__state == 8672)) && !(12292 <= s__state)) && !(s__state == 8656)) && !(0 == s__hit)) && 8576 <= s__state) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: ((((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8576) || ((((((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576 - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576 - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && s__state <= 8576 - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(8576 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && 3 == s__s3__tmp__next_state___0) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) || (((((((((((((((((!(s__state == 8561) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && 8576 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 < 12292) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8576)) || ((((((((((((((((!(s__state == 8561) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && 8576 <= s__s3__tmp__next_state___0) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576)) || (((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8529)) && s__state <= 8576)) || ((((!(8673 == s__state) && !(8576 == s__state)) && !(s__state == 8657)) && !(12292 <= s__state)) && 8576 <= s__state)) || ((((!(8673 == s__state) && !(s__state == 8657)) && !(12292 <= s__state)) && !(0 == s__hit)) && 8576 <= s__state)) || ((((8576 <= s__s3__tmp__next_state___0 && s__s3__tmp__next_state___0 < 12292) && !(12292 <= s__state)) && !(0 == s__hit)) && 8576 <= s__state) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8576) || ((((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(8576 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && 3 == s__s3__tmp__next_state___0) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) || (((((((((((((((((!(s__state == 8561) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && 8576 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 < 12292) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8576)) || ((((((((((((((((!(s__state == 8561) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && 8576 <= s__s3__tmp__next_state___0) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576)) || (((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8529)) && s__state <= 8576)) || ((((!(8673 == s__state) && !(8576 == s__state)) && !(s__state == 8657)) && !(12292 <= s__state)) && 8576 <= s__state)) || ((((!(8673 == s__state) && !(s__state == 8657)) && !(12292 <= s__state)) && !(0 == s__hit)) && 8576 <= s__state)) || ((((8576 <= s__s3__tmp__next_state___0 && s__s3__tmp__next_state___0 < 12292) && !(12292 <= s__state)) && !(0 == s__hit)) && 8576 <= s__state) - InvariantResult [Line: 689]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: ((((((!(8673 == s__state) && !(8576 == s__state)) && !(s__state == 8657)) && !(s__state == 8672)) && !(12292 <= s__state)) && !(s__state == 8656)) && 8576 <= s__state) || ((((((!(8673 == s__state) && !(s__state == 8657)) && !(s__state == 8672)) && !(12292 <= s__state)) && !(s__state == 8656)) && !(0 == s__hit)) && 8576 <= s__state) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: !(12292 == s__state) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: ((((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8576) || ((((((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: !(12292 == s__state) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: ((((!(8673 == s__state) && !(s__state == 8657)) && !(s__state == 8672)) && !(12292 <= s__state)) && !(s__state == 8656)) && 8576 <= s__state - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: ((((!(8673 == s__state) && !(8576 == s__state)) && !(s__state == 8672)) && !(12292 <= s__state)) && 8576 <= s__state) || ((((!(8673 == s__state) && !(s__state == 8672)) && !(12292 <= s__state)) && !(0 == s__hit)) && 8576 <= s__state) RESULT: Ultimate proved your program to be correct! [2022-07-14 13:56:34,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE