./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/byte_add-2.i --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/byte_add-2.i -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 ac64f5b077f8251002b0bb05f1aba070a52d8bbef53fa94e35704949c96b0f7c --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 13:55:13,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 13:55:13,701 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 13:55:13,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 13:55:13,719 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 13:55:13,720 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 13:55:13,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 13:55:13,722 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 13:55:13,723 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 13:55:13,723 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 13:55:13,724 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 13:55:13,725 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 13:55:13,725 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 13:55:13,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 13:55:13,726 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 13:55:13,727 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 13:55:13,728 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 13:55:13,728 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 13:55:13,729 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 13:55:13,730 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 13:55:13,731 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 13:55:13,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 13:55:13,736 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 13:55:13,737 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 13:55:13,737 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 13:55:13,739 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 13:55:13,739 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 13:55:13,744 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 13:55:13,745 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 13:55:13,745 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 13:55:13,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 13:55:13,746 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 13:55:13,746 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 13:55:13,747 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 13:55:13,747 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 13:55:13,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 13:55:13,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 13:55:13,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 13:55:13,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 13:55:13,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 13:55:13,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 13:55:13,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 13:55:13,751 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:55:13,768 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 13:55:13,768 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 13:55:13,768 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 13:55:13,768 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 13:55:13,769 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 13:55:13,769 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 13:55:13,770 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 13:55:13,770 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 13:55:13,770 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 13:55:13,770 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 13:55:13,770 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 13:55:13,771 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 13:55:13,771 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 13:55:13,771 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 13:55:13,771 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 13:55:13,771 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 13:55:13,771 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 13:55:13,772 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 13:55:13,772 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-14 13:55:13,772 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 13:55:13,772 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 13:55:13,772 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 13:55:13,773 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 13:55:13,773 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 13:55:13,773 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 13:55:13,773 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 13:55:13,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 13:55:13,774 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 13:55:13,774 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 13:55:13,774 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 13:55:13,775 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 13:55:13,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 13:55:13,776 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 13:55:13,776 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 -> ac64f5b077f8251002b0bb05f1aba070a52d8bbef53fa94e35704949c96b0f7c [2022-07-14 13:55:13,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 13:55:14,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 13:55:14,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 13:55:14,029 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 13:55:14,030 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 13:55:14,031 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add-2.i [2022-07-14 13:55:14,086 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5077c806/6a85398774fb4e248c0a0c53a6c270ad/FLAGa39cb784a [2022-07-14 13:55:14,407 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 13:55:14,412 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-2.i [2022-07-14 13:55:14,420 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5077c806/6a85398774fb4e248c0a0c53a6c270ad/FLAGa39cb784a [2022-07-14 13:55:14,827 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5077c806/6a85398774fb4e248c0a0c53a6c270ad [2022-07-14 13:55:14,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 13:55:14,829 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 13:55:14,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 13:55:14,831 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 13:55:14,835 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 13:55:14,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 01:55:14" (1/1) ... [2022-07-14 13:55:14,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e966bda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:55:14, skipping insertion in model container [2022-07-14 13:55:14,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 01:55:14" (1/1) ... [2022-07-14 13:55:14,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 13:55:14,855 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 13:55:14,967 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/byte_add-2.i[1166,1179] [2022-07-14 13:55:15,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 13:55:15,009 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 13:55:15,021 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/byte_add-2.i[1166,1179] [2022-07-14 13:55:15,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 13:55:15,046 INFO L208 MainTranslator]: Completed translation [2022-07-14 13:55:15,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:55:15 WrapperNode [2022-07-14 13:55:15,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 13:55:15,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 13:55:15,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 13:55:15,048 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 13:55:15,053 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:55:15" (1/1) ... [2022-07-14 13:55:15,058 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:55:15" (1/1) ... [2022-07-14 13:55:15,110 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 186 [2022-07-14 13:55:15,112 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 13:55:15,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 13:55:15,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 13:55:15,113 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 13:55:15,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:55:15" (1/1) ... [2022-07-14 13:55:15,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:55:15" (1/1) ... [2022-07-14 13:55:15,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:55:15" (1/1) ... [2022-07-14 13:55:15,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:55:15" (1/1) ... [2022-07-14 13:55:15,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:55:15" (1/1) ... [2022-07-14 13:55:15,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:55:15" (1/1) ... [2022-07-14 13:55:15,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:55:15" (1/1) ... [2022-07-14 13:55:15,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 13:55:15,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 13:55:15,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 13:55:15,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 13:55:15,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:55:15" (1/1) ... [2022-07-14 13:55:15,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 13:55:15,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:55:15,208 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:55:15,216 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:55:15,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 13:55:15,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 13:55:15,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 13:55:15,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 13:55:15,308 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 13:55:15,309 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 13:55:15,838 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 13:55:15,854 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 13:55:15,854 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 13:55:15,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:55:15 BoogieIcfgContainer [2022-07-14 13:55:15,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 13:55:15,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 13:55:15,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 13:55:15,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 13:55:15,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 01:55:14" (1/3) ... [2022-07-14 13:55:15,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f8bdcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 01:55:15, skipping insertion in model container [2022-07-14 13:55:15,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:55:15" (2/3) ... [2022-07-14 13:55:15,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f8bdcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 01:55:15, skipping insertion in model container [2022-07-14 13:55:15,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:55:15" (3/3) ... [2022-07-14 13:55:15,863 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add-2.i [2022-07-14 13:55:15,873 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 13:55:15,873 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 40 error locations. [2022-07-14 13:55:15,908 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 13:55:15,913 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@ade74cb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@663e0e6e [2022-07-14 13:55:15,913 INFO L358 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2022-07-14 13:55:15,917 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 87 states have (on average 1.896551724137931) internal successors, (165), 127 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:55:15,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-14 13:55:15,923 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:15,923 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-14 13:55:15,924 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:15,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:15,928 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2022-07-14 13:55:15,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:15,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364589093] [2022-07-14 13:55:15,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:15,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:16,029 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:55:16,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:16,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364589093] [2022-07-14 13:55:16,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364589093] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:16,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:16,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-14 13:55:16,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275874201] [2022-07-14 13:55:16,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:16,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-14 13:55:16,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:16,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 13:55:16,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 13:55:16,063 INFO L87 Difference]: Start difference. First operand has 128 states, 87 states have (on average 1.896551724137931) internal successors, (165), 127 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) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:16,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:16,084 INFO L93 Difference]: Finished difference Result 196 states and 290 transitions. [2022-07-14 13:55:16,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 13:55:16,086 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-07-14 13:55:16,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:16,093 INFO L225 Difference]: With dead ends: 196 [2022-07-14 13:55:16,093 INFO L226 Difference]: Without dead ends: 77 [2022-07-14 13:55:16,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 13:55:16,100 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:16,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:55:16,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-14 13:55:16,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-07-14 13:55:16,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 76 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:55:16,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 104 transitions. [2022-07-14 13:55:16,138 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 104 transitions. Word has length 4 [2022-07-14 13:55:16,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:16,139 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 104 transitions. [2022-07-14 13:55:16,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:16,140 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 104 transitions. [2022-07-14 13:55:16,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 13:55:16,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:16,142 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:55:16,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 13:55:16,143 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:16,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:16,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1699660314, now seen corresponding path program 1 times [2022-07-14 13:55:16,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:16,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945551466] [2022-07-14 13:55:16,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:16,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:16,220 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:55:16,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:16,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945551466] [2022-07-14 13:55:16,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945551466] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:16,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:16,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:55:16,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703962037] [2022-07-14 13:55:16,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:16,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:55:16,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:16,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:55:16,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:55:16,223 INFO L87 Difference]: Start difference. First operand 77 states and 104 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 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:55:16,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:16,329 INFO L93 Difference]: Finished difference Result 166 states and 236 transitions. [2022-07-14 13:55:16,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:55:16,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-07-14 13:55:16,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:16,331 INFO L225 Difference]: With dead ends: 166 [2022-07-14 13:55:16,331 INFO L226 Difference]: Without dead ends: 111 [2022-07-14 13:55:16,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:55:16,332 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 36 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:16,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 139 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:55:16,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-14 13:55:16,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2022-07-14 13:55:16,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 105 states have (on average 1.3238095238095238) internal successors, (139), 106 states have internal predecessors, (139), 0 states have call successors, (0), 0 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:55:16,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 139 transitions. [2022-07-14 13:55:16,342 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 139 transitions. Word has length 13 [2022-07-14 13:55:16,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:16,342 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 139 transitions. [2022-07-14 13:55:16,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 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:55:16,342 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 139 transitions. [2022-07-14 13:55:16,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 13:55:16,343 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:16,343 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:55:16,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 13:55:16,343 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:16,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:16,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1912649374, now seen corresponding path program 1 times [2022-07-14 13:55:16,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:16,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461146125] [2022-07-14 13:55:16,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:16,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:16,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 13:55:16,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:16,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461146125] [2022-07-14 13:55:16,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461146125] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:16,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:16,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 13:55:16,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964132407] [2022-07-14 13:55:16,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:16,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:55:16,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:16,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:55:16,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:55:16,476 INFO L87 Difference]: Start difference. First operand 107 states and 139 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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:55:16,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:16,659 INFO L93 Difference]: Finished difference Result 277 states and 362 transitions. [2022-07-14 13:55:16,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:55:16,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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:55:16,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:16,663 INFO L225 Difference]: With dead ends: 277 [2022-07-14 13:55:16,664 INFO L226 Difference]: Without dead ends: 200 [2022-07-14 13:55:16,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:55:16,670 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 148 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:16,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 336 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 13:55:16,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-14 13:55:16,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 120. [2022-07-14 13:55:16,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 118 states have (on average 1.3135593220338984) internal successors, (155), 119 states have internal predecessors, (155), 0 states have call successors, (0), 0 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:55:16,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 155 transitions. [2022-07-14 13:55:16,689 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 155 transitions. Word has length 20 [2022-07-14 13:55:16,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:16,689 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 155 transitions. [2022-07-14 13:55:16,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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:55:16,689 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 155 transitions. [2022-07-14 13:55:16,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 13:55:16,690 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:16,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:55:16,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 13:55:16,691 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:16,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:16,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1423012674, now seen corresponding path program 1 times [2022-07-14 13:55:16,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:16,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960641342] [2022-07-14 13:55:16,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:16,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:16,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 13:55:16,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:16,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960641342] [2022-07-14 13:55:16,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960641342] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:16,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:16,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 13:55:16,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855417950] [2022-07-14 13:55:16,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:16,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:55:16,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:16,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:55:16,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:55:16,769 INFO L87 Difference]: Start difference. First operand 120 states and 155 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 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:55:16,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:16,915 INFO L93 Difference]: Finished difference Result 276 states and 360 transitions. [2022-07-14 13:55:16,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:55:16,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-07-14 13:55:16,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:16,916 INFO L225 Difference]: With dead ends: 276 [2022-07-14 13:55:16,916 INFO L226 Difference]: Without dead ends: 206 [2022-07-14 13:55:16,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:55:16,922 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 137 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:16,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 326 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:55:16,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-14 13:55:16,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 133. [2022-07-14 13:55:16,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 131 states have (on average 1.2900763358778626) internal successors, (169), 132 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:16,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 169 transitions. [2022-07-14 13:55:16,932 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 169 transitions. Word has length 23 [2022-07-14 13:55:16,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:16,933 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 169 transitions. [2022-07-14 13:55:16,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 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:55:16,933 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 169 transitions. [2022-07-14 13:55:16,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 13:55:16,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:16,934 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:55:16,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 13:55:16,935 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:16,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:16,935 INFO L85 PathProgramCache]: Analyzing trace with hash -766175783, now seen corresponding path program 1 times [2022-07-14 13:55:16,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:16,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444529283] [2022-07-14 13:55:16,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:16,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:16,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:55:16,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:16,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444529283] [2022-07-14 13:55:16,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444529283] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:55:16,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606403031] [2022-07-14 13:55:16,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:16,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:55:16,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:55:16,984 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:55:16,984 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:55:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:17,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 13:55:17,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:55:17,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:55:17,145 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:55:17,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606403031] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:17,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:55:17,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-07-14 13:55:17,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715901478] [2022-07-14 13:55:17,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:17,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:55:17,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:17,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:55:17,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-14 13:55:17,147 INFO L87 Difference]: Start difference. First operand 133 states and 169 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 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:55:17,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:17,312 INFO L93 Difference]: Finished difference Result 247 states and 343 transitions. [2022-07-14 13:55:17,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:55:17,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-07-14 13:55:17,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:17,314 INFO L225 Difference]: With dead ends: 247 [2022-07-14 13:55:17,314 INFO L226 Difference]: Without dead ends: 192 [2022-07-14 13:55:17,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-14 13:55:17,315 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 69 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:17,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 197 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 13:55:17,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-14 13:55:17,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 163. [2022-07-14 13:55:17,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 161 states have (on average 1.2670807453416149) internal successors, (204), 162 states have internal predecessors, (204), 0 states have call successors, (0), 0 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:55:17,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 204 transitions. [2022-07-14 13:55:17,326 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 204 transitions. Word has length 26 [2022-07-14 13:55:17,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:17,326 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 204 transitions. [2022-07-14 13:55:17,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 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:55:17,327 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 204 transitions. [2022-07-14 13:55:17,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-14 13:55:17,327 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:17,328 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:55:17,351 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:55:17,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:55:17,544 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:17,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:17,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1979417465, now seen corresponding path program 1 times [2022-07-14 13:55:17,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:17,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435830958] [2022-07-14 13:55:17,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:17,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:17,619 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:55:17,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:17,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435830958] [2022-07-14 13:55:17,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435830958] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:55:17,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081838193] [2022-07-14 13:55:17,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:17,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:55:17,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:55:17,621 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:55:17,651 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:55:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:17,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 13:55:17,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:55:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 13:55:17,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:55:17,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081838193] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:17,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:55:17,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-07-14 13:55:17,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779530782] [2022-07-14 13:55:17,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:17,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:55:17,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:17,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:55:17,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-14 13:55:17,776 INFO L87 Difference]: Start difference. First operand 163 states and 204 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:17,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:17,872 INFO L93 Difference]: Finished difference Result 308 states and 397 transitions. [2022-07-14 13:55:17,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:55:17,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-14 13:55:17,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:17,874 INFO L225 Difference]: With dead ends: 308 [2022-07-14 13:55:17,874 INFO L226 Difference]: Without dead ends: 198 [2022-07-14 13:55:17,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-14 13:55:17,875 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 23 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:17,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 240 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 58 Invalid, 0 Unknown, 60 Unchecked, 0.1s Time] [2022-07-14 13:55:17,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-14 13:55:17,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 162. [2022-07-14 13:55:17,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 160 states have (on average 1.26875) internal successors, (203), 161 states have internal predecessors, (203), 0 states have call successors, (0), 0 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:55:17,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 203 transitions. [2022-07-14 13:55:17,888 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 203 transitions. Word has length 33 [2022-07-14 13:55:17,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:17,888 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 203 transitions. [2022-07-14 13:55:17,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:17,888 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 203 transitions. [2022-07-14 13:55:17,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-14 13:55:17,889 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:17,889 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:55:17,906 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:55:18,090 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,SelfDestructingSolverStorable5 [2022-07-14 13:55:18,090 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:18,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:18,091 INFO L85 PathProgramCache]: Analyzing trace with hash 374538269, now seen corresponding path program 1 times [2022-07-14 13:55:18,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:18,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570749753] [2022-07-14 13:55:18,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:18,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:18,183 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 13:55:18,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:18,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570749753] [2022-07-14 13:55:18,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570749753] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:18,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:18,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 13:55:18,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576242568] [2022-07-14 13:55:18,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:18,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 13:55:18,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:18,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 13:55:18,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:55:18,186 INFO L87 Difference]: Start difference. First operand 162 states and 203 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:18,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:18,345 INFO L93 Difference]: Finished difference Result 418 states and 531 transitions. [2022-07-14 13:55:18,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 13:55:18,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-14 13:55:18,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:18,347 INFO L225 Difference]: With dead ends: 418 [2022-07-14 13:55:18,347 INFO L226 Difference]: Without dead ends: 309 [2022-07-14 13:55:18,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-14 13:55:18,348 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 191 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:18,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 213 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:55:18,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-07-14 13:55:18,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 184. [2022-07-14 13:55:18,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 182 states have (on average 1.2802197802197801) internal successors, (233), 183 states have internal predecessors, (233), 0 states have call successors, (0), 0 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:55:18,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 233 transitions. [2022-07-14 13:55:18,360 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 233 transitions. Word has length 39 [2022-07-14 13:55:18,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:18,361 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 233 transitions. [2022-07-14 13:55:18,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:18,361 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 233 transitions. [2022-07-14 13:55:18,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-14 13:55:18,365 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:18,365 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-07-14 13:55:18,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 13:55:18,365 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:18,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:18,367 INFO L85 PathProgramCache]: Analyzing trace with hash 185629531, now seen corresponding path program 1 times [2022-07-14 13:55:18,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:18,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685768639] [2022-07-14 13:55:18,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:18,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:18,417 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-14 13:55:18,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:18,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685768639] [2022-07-14 13:55:18,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685768639] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:18,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:18,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:55:18,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386791319] [2022-07-14 13:55:18,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:18,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:55:18,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:18,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:55:18,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:55:18,424 INFO L87 Difference]: Start difference. First operand 184 states and 233 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:18,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:18,492 INFO L93 Difference]: Finished difference Result 355 states and 461 transitions. [2022-07-14 13:55:18,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:55:18,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-14 13:55:18,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:18,496 INFO L225 Difference]: With dead ends: 355 [2022-07-14 13:55:18,496 INFO L226 Difference]: Without dead ends: 224 [2022-07-14 13:55:18,496 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:55:18,497 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 47 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:18,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 127 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:55:18,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-07-14 13:55:18,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 203. [2022-07-14 13:55:18,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 201 states have (on average 1.3134328358208955) internal successors, (264), 202 states have internal predecessors, (264), 0 states have call successors, (0), 0 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:55:18,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 264 transitions. [2022-07-14 13:55:18,502 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 264 transitions. Word has length 40 [2022-07-14 13:55:18,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:18,502 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 264 transitions. [2022-07-14 13:55:18,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:18,503 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 264 transitions. [2022-07-14 13:55:18,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-14 13:55:18,504 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:18,504 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-07-14 13:55:18,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 13:55:18,506 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:18,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:18,506 INFO L85 PathProgramCache]: Analyzing trace with hash 865687901, now seen corresponding path program 1 times [2022-07-14 13:55:18,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:18,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867768325] [2022-07-14 13:55:18,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:18,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:18,598 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:55:18,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:18,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867768325] [2022-07-14 13:55:18,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867768325] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:55:18,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492619074] [2022-07-14 13:55:18,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:18,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:55:18,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:55:18,600 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:55:18,601 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:55:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:18,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 13:55:18,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:55:18,717 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-14 13:55:18,718 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:55:18,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492619074] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:18,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:55:18,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-07-14 13:55:18,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500762225] [2022-07-14 13:55:18,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:18,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:55:18,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:18,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:55:18,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 13:55:18,720 INFO L87 Difference]: Start difference. First operand 203 states and 264 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:18,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:18,779 INFO L93 Difference]: Finished difference Result 362 states and 473 transitions. [2022-07-14 13:55:18,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:55:18,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-14 13:55:18,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:18,780 INFO L225 Difference]: With dead ends: 362 [2022-07-14 13:55:18,781 INFO L226 Difference]: Without dead ends: 212 [2022-07-14 13:55:18,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 13:55:18,781 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 22 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:18,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 240 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 58 Unchecked, 0.1s Time] [2022-07-14 13:55:18,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-07-14 13:55:18,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 202. [2022-07-14 13:55:18,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 200 states have (on average 1.27) internal successors, (254), 201 states have internal predecessors, (254), 0 states have call successors, (0), 0 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:55:18,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 254 transitions. [2022-07-14 13:55:18,786 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 254 transitions. Word has length 40 [2022-07-14 13:55:18,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:18,786 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 254 transitions. [2022-07-14 13:55:18,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:18,786 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 254 transitions. [2022-07-14 13:55:18,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-14 13:55:18,786 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:18,786 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-07-14 13:55:18,808 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:55:19,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:55:19,002 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:19,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:19,003 INFO L85 PathProgramCache]: Analyzing trace with hash -207397479, now seen corresponding path program 1 times [2022-07-14 13:55:19,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:19,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666075087] [2022-07-14 13:55:19,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:19,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:19,037 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-14 13:55:19,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:19,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666075087] [2022-07-14 13:55:19,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666075087] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:19,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:19,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 13:55:19,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92659473] [2022-07-14 13:55:19,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:19,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:55:19,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:19,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:55:19,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:55:19,039 INFO L87 Difference]: Start difference. First operand 202 states and 254 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:19,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:19,047 INFO L93 Difference]: Finished difference Result 231 states and 287 transitions. [2022-07-14 13:55:19,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:55:19,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-14 13:55:19,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:19,049 INFO L225 Difference]: With dead ends: 231 [2022-07-14 13:55:19,049 INFO L226 Difference]: Without dead ends: 202 [2022-07-14 13:55:19,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:55:19,049 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 10 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:19,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 212 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:55:19,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-14 13:55:19,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2022-07-14 13:55:19,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 200 states have (on average 1.265) internal successors, (253), 201 states have internal predecessors, (253), 0 states have call successors, (0), 0 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:55:19,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 253 transitions. [2022-07-14 13:55:19,054 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 253 transitions. Word has length 40 [2022-07-14 13:55:19,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:19,054 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 253 transitions. [2022-07-14 13:55:19,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:19,054 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 253 transitions. [2022-07-14 13:55:19,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-14 13:55:19,055 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:19,055 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 13:55:19,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 13:55:19,055 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:19,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:19,055 INFO L85 PathProgramCache]: Analyzing trace with hash 472660891, now seen corresponding path program 2 times [2022-07-14 13:55:19,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:19,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100231487] [2022-07-14 13:55:19,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:19,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:19,101 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-14 13:55:19,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:19,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100231487] [2022-07-14 13:55:19,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100231487] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:19,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:19,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 13:55:19,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903037264] [2022-07-14 13:55:19,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:19,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 13:55:19,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:19,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 13:55:19,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-14 13:55:19,102 INFO L87 Difference]: Start difference. First operand 202 states and 253 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 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:55:19,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:19,258 INFO L93 Difference]: Finished difference Result 398 states and 506 transitions. [2022-07-14 13:55:19,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 13:55:19,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 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 40 [2022-07-14 13:55:19,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:19,260 INFO L225 Difference]: With dead ends: 398 [2022-07-14 13:55:19,260 INFO L226 Difference]: Without dead ends: 227 [2022-07-14 13:55:19,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-14 13:55:19,260 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 119 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:19,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 285 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:55:19,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-07-14 13:55:19,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 200. [2022-07-14 13:55:19,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 198 states have (on average 1.2474747474747474) internal successors, (247), 199 states have internal predecessors, (247), 0 states have call successors, (0), 0 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:55:19,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 247 transitions. [2022-07-14 13:55:19,265 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 247 transitions. Word has length 40 [2022-07-14 13:55:19,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:19,265 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 247 transitions. [2022-07-14 13:55:19,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 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:55:19,265 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 247 transitions. [2022-07-14 13:55:19,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 13:55:19,266 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:19,266 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:55:19,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 13:55:19,266 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:19,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:19,266 INFO L85 PathProgramCache]: Analyzing trace with hash -828018649, now seen corresponding path program 1 times [2022-07-14 13:55:19,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:19,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048251857] [2022-07-14 13:55:19,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:19,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:19,290 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-14 13:55:19,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:19,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048251857] [2022-07-14 13:55:19,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048251857] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:19,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:19,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:55:19,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540204382] [2022-07-14 13:55:19,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:19,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:55:19,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:19,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:55:19,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:55:19,293 INFO L87 Difference]: Start difference. First operand 200 states and 247 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 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:55:19,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:19,311 INFO L93 Difference]: Finished difference Result 349 states and 432 transitions. [2022-07-14 13:55:19,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:55:19,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 44 [2022-07-14 13:55:19,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:19,312 INFO L225 Difference]: With dead ends: 349 [2022-07-14 13:55:19,312 INFO L226 Difference]: Without dead ends: 200 [2022-07-14 13:55:19,313 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:55:19,313 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 3 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:19,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 162 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:55:19,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-14 13:55:19,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2022-07-14 13:55:19,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 198 states have (on average 1.2222222222222223) internal successors, (242), 199 states have internal predecessors, (242), 0 states have call successors, (0), 0 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:55:19,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 242 transitions. [2022-07-14 13:55:19,318 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 242 transitions. Word has length 44 [2022-07-14 13:55:19,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:19,318 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 242 transitions. [2022-07-14 13:55:19,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 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:55:19,319 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 242 transitions. [2022-07-14 13:55:19,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-14 13:55:19,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:19,319 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:55:19,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 13:55:19,320 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:19,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:19,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1593078434, now seen corresponding path program 1 times [2022-07-14 13:55:19,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:19,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938234613] [2022-07-14 13:55:19,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:19,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:19,349 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-14 13:55:19,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:19,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938234613] [2022-07-14 13:55:19,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938234613] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:19,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:19,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:55:19,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763200395] [2022-07-14 13:55:19,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:19,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:55:19,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:19,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:55:19,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:55:19,354 INFO L87 Difference]: Start difference. First operand 200 states and 242 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 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:55:19,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:19,377 INFO L93 Difference]: Finished difference Result 379 states and 454 transitions. [2022-07-14 13:55:19,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:55:19,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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:55:19,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:19,379 INFO L225 Difference]: With dead ends: 379 [2022-07-14 13:55:19,379 INFO L226 Difference]: Without dead ends: 214 [2022-07-14 13:55:19,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:55:19,380 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 35 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:19,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 172 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:55:19,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-07-14 13:55:19,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 179. [2022-07-14 13:55:19,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 177 states have (on average 1.2372881355932204) internal successors, (219), 178 states have internal predecessors, (219), 0 states have call successors, (0), 0 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:55:19,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 219 transitions. [2022-07-14 13:55:19,385 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 219 transitions. Word has length 47 [2022-07-14 13:55:19,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:19,386 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 219 transitions. [2022-07-14 13:55:19,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 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:55:19,386 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 219 transitions. [2022-07-14 13:55:19,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 13:55:19,386 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:19,387 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:55:19,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 13:55:19,387 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:19,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:19,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1470470760, now seen corresponding path program 1 times [2022-07-14 13:55:19,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:19,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443369172] [2022-07-14 13:55:19,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:19,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:19,444 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:55:19,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:19,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443369172] [2022-07-14 13:55:19,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443369172] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:55:19,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763509310] [2022-07-14 13:55:19,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:19,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:55:19,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:55:19,456 INFO L229 MonitoredProcess]: Starting monitored process 5 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:55:19,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 13:55:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:19,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 13:55:19,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:55:19,584 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:55:19,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:55:19,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763509310] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:19,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:55:19,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-07-14 13:55:19,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453638986] [2022-07-14 13:55:19,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:19,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:55:19,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:19,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:55:19,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-14 13:55:19,586 INFO L87 Difference]: Start difference. First operand 179 states and 219 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:19,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:19,623 INFO L93 Difference]: Finished difference Result 364 states and 450 transitions. [2022-07-14 13:55:19,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:55:19,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-07-14 13:55:19,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:19,625 INFO L225 Difference]: With dead ends: 364 [2022-07-14 13:55:19,625 INFO L226 Difference]: Without dead ends: 235 [2022-07-14 13:55:19,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-14 13:55:19,625 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 40 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:19,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 213 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 90 Unchecked, 0.0s Time] [2022-07-14 13:55:19,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-07-14 13:55:19,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 197. [2022-07-14 13:55:19,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 195 states have (on average 1.2512820512820513) internal successors, (244), 196 states have internal predecessors, (244), 0 states have call successors, (0), 0 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:55:19,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 244 transitions. [2022-07-14 13:55:19,630 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 244 transitions. Word has length 48 [2022-07-14 13:55:19,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:19,631 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 244 transitions. [2022-07-14 13:55:19,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:19,631 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 244 transitions. [2022-07-14 13:55:19,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-14 13:55:19,631 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:19,631 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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:55:19,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-14 13:55:19,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:55:19,843 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:19,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:19,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1570165913, now seen corresponding path program 1 times [2022-07-14 13:55:19,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:19,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541792327] [2022-07-14 13:55:19,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:19,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:19,878 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-14 13:55:19,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:19,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541792327] [2022-07-14 13:55:19,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541792327] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:19,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:19,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:55:19,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077615748] [2022-07-14 13:55:19,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:19,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:55:19,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:19,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:55:19,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:55:19,881 INFO L87 Difference]: Start difference. First operand 197 states and 244 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:55:19,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:19,935 INFO L93 Difference]: Finished difference Result 370 states and 466 transitions. [2022-07-14 13:55:19,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:55:19,935 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 62 [2022-07-14 13:55:19,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:19,936 INFO L225 Difference]: With dead ends: 370 [2022-07-14 13:55:19,936 INFO L226 Difference]: Without dead ends: 224 [2022-07-14 13:55:19,938 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:55:19,938 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 46 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:19,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 107 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:55:19,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-07-14 13:55:19,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 216. [2022-07-14 13:55:19,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 214 states have (on average 1.2757009345794392) internal successors, (273), 215 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:19,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 273 transitions. [2022-07-14 13:55:19,946 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 273 transitions. Word has length 62 [2022-07-14 13:55:19,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:19,946 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 273 transitions. [2022-07-14 13:55:19,946 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:55:19,946 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 273 transitions. [2022-07-14 13:55:19,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-14 13:55:19,947 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:19,947 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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:55:19,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 13:55:19,947 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:19,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:19,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1630709795, now seen corresponding path program 1 times [2022-07-14 13:55:19,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:19,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576149177] [2022-07-14 13:55:19,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:19,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:19,981 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-14 13:55:19,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:19,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576149177] [2022-07-14 13:55:19,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576149177] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:19,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:19,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:55:19,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551338977] [2022-07-14 13:55:19,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:19,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:55:19,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:19,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:55:19,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:55:19,983 INFO L87 Difference]: Start difference. First operand 216 states and 273 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 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:55:20,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:20,037 INFO L93 Difference]: Finished difference Result 392 states and 498 transitions. [2022-07-14 13:55:20,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:55:20,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-07-14 13:55:20,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:20,039 INFO L225 Difference]: With dead ends: 392 [2022-07-14 13:55:20,039 INFO L226 Difference]: Without dead ends: 227 [2022-07-14 13:55:20,040 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:55:20,040 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 44 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:20,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 109 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:55:20,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-07-14 13:55:20,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 217. [2022-07-14 13:55:20,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 215 states have (on average 1.2744186046511627) internal successors, (274), 216 states have internal predecessors, (274), 0 states have call successors, (0), 0 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:55:20,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 274 transitions. [2022-07-14 13:55:20,048 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 274 transitions. Word has length 62 [2022-07-14 13:55:20,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:20,048 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 274 transitions. [2022-07-14 13:55:20,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 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:55:20,048 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 274 transitions. [2022-07-14 13:55:20,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-14 13:55:20,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:20,049 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:55:20,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 13:55:20,049 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:20,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:20,050 INFO L85 PathProgramCache]: Analyzing trace with hash -2023736805, now seen corresponding path program 2 times [2022-07-14 13:55:20,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:20,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232022621] [2022-07-14 13:55:20,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:20,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:20,143 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:55:20,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:20,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232022621] [2022-07-14 13:55:20,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232022621] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:55:20,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825796660] [2022-07-14 13:55:20,144 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 13:55:20,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:55:20,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:55:20,145 INFO L229 MonitoredProcess]: Starting monitored process 6 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:55:20,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-14 13:55:20,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 13:55:20,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:55:20,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 13:55:20,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:55:20,330 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 39 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 13:55:20,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:55:20,461 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 38 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 13:55:20,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825796660] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:55:20,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:55:20,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 7] total 13 [2022-07-14 13:55:20,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503977303] [2022-07-14 13:55:20,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:55:20,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 13:55:20,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:20,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 13:55:20,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-07-14 13:55:20,463 INFO L87 Difference]: Start difference. First operand 217 states and 274 transitions. Second operand has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 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:55:20,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:20,675 INFO L93 Difference]: Finished difference Result 509 states and 664 transitions. [2022-07-14 13:55:20,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 13:55:20,675 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-07-14 13:55:20,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:20,676 INFO L225 Difference]: With dead ends: 509 [2022-07-14 13:55:20,676 INFO L226 Difference]: Without dead ends: 341 [2022-07-14 13:55:20,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-07-14 13:55:20,677 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 282 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:20,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 383 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 267 Invalid, 0 Unknown, 63 Unchecked, 0.2s Time] [2022-07-14 13:55:20,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-07-14 13:55:20,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 286. [2022-07-14 13:55:20,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 284 states have (on average 1.3028169014084507) internal successors, (370), 285 states have internal predecessors, (370), 0 states have call successors, (0), 0 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:55:20,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 370 transitions. [2022-07-14 13:55:20,697 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 370 transitions. Word has length 62 [2022-07-14 13:55:20,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:20,697 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 370 transitions. [2022-07-14 13:55:20,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.23076923076923) internal successors, (107), 13 states have internal predecessors, (107), 0 states have call successors, (0), 0 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:55:20,697 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 370 transitions. [2022-07-14 13:55:20,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-14 13:55:20,698 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:20,698 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 13:55:20,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-14 13:55:20,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-14 13:55:20,902 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:20,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:20,903 INFO L85 PathProgramCache]: Analyzing trace with hash 635106439, now seen corresponding path program 1 times [2022-07-14 13:55:20,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:20,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456995782] [2022-07-14 13:55:20,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:20,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:20,930 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-14 13:55:20,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:20,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456995782] [2022-07-14 13:55:20,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456995782] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:55:20,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278265604] [2022-07-14 13:55:20,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:20,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:55:20,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:55:20,932 INFO L229 MonitoredProcess]: Starting monitored process 7 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:55:20,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-14 13:55:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:20,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 13:55:20,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:55:21,079 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 13:55:21,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:55:21,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278265604] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:21,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:55:21,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2022-07-14 13:55:21,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425473084] [2022-07-14 13:55:21,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:21,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:55:21,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:21,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:55:21,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:55:21,081 INFO L87 Difference]: Start difference. First operand 286 states and 370 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:21,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:21,152 INFO L93 Difference]: Finished difference Result 765 states and 981 transitions. [2022-07-14 13:55:21,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:55:21,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-07-14 13:55:21,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:21,154 INFO L225 Difference]: With dead ends: 765 [2022-07-14 13:55:21,154 INFO L226 Difference]: Without dead ends: 530 [2022-07-14 13:55:21,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:55:21,156 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 88 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:21,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 188 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:55:21,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-07-14 13:55:21,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 473. [2022-07-14 13:55:21,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 471 states have (on average 1.2845010615711252) internal successors, (605), 472 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:55:21,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 605 transitions. [2022-07-14 13:55:21,168 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 605 transitions. Word has length 62 [2022-07-14 13:55:21,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:21,169 INFO L495 AbstractCegarLoop]: Abstraction has 473 states and 605 transitions. [2022-07-14 13:55:21,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:21,169 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 605 transitions. [2022-07-14 13:55:21,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-14 13:55:21,183 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:21,183 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-07-14 13:55:21,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-14 13:55:21,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-14 13:55:21,400 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:21,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:21,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1941792176, now seen corresponding path program 1 times [2022-07-14 13:55:21,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:21,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611487294] [2022-07-14 13:55:21,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:21,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:21,445 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 13:55:21,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:21,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611487294] [2022-07-14 13:55:21,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611487294] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:55:21,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25458396] [2022-07-14 13:55:21,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:21,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:55:21,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:55:21,456 INFO L229 MonitoredProcess]: Starting monitored process 8 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:55:21,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 13:55:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:21,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 13:55:21,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:55:21,558 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 13:55:21,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:55:21,642 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 13:55:21,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25458396] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:55:21,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:55:21,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 8 [2022-07-14 13:55:21,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083417047] [2022-07-14 13:55:21,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:55:21,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 13:55:21,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:21,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 13:55:21,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 13:55:21,646 INFO L87 Difference]: Start difference. First operand 473 states and 605 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:55:22,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:22,014 INFO L93 Difference]: Finished difference Result 1619 states and 2076 transitions. [2022-07-14 13:55:22,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 13:55:22,015 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-07-14 13:55:22,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:22,018 INFO L225 Difference]: With dead ends: 1619 [2022-07-14 13:55:22,018 INFO L226 Difference]: Without dead ends: 1082 [2022-07-14 13:55:22,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-07-14 13:55:22,020 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 211 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:22,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 556 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 13:55:22,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2022-07-14 13:55:22,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 998. [2022-07-14 13:55:22,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 996 states have (on average 1.2439759036144578) internal successors, (1239), 997 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:22,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1239 transitions. [2022-07-14 13:55:22,044 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1239 transitions. Word has length 62 [2022-07-14 13:55:22,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:22,045 INFO L495 AbstractCegarLoop]: Abstraction has 998 states and 1239 transitions. [2022-07-14 13:55:22,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:55:22,045 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1239 transitions. [2022-07-14 13:55:22,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-14 13:55:22,046 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:22,046 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:55:22,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-14 13:55:22,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:55:22,264 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:22,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:22,265 INFO L85 PathProgramCache]: Analyzing trace with hash 683089604, now seen corresponding path program 1 times [2022-07-14 13:55:22,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:22,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147478020] [2022-07-14 13:55:22,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:22,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:22,326 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:55:22,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:22,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147478020] [2022-07-14 13:55:22,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147478020] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:55:22,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362467842] [2022-07-14 13:55:22,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:22,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:55:22,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:55:22,328 INFO L229 MonitoredProcess]: Starting monitored process 9 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:55:22,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-14 13:55:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:22,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 13:55:22,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:55:22,538 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 13:55:22,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:55:22,624 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 13:55:22,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362467842] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:55:22,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:55:22,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-14 13:55:22,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406815754] [2022-07-14 13:55:22,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:55:22,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 13:55:22,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:22,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 13:55:22,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-07-14 13:55:22,625 INFO L87 Difference]: Start difference. First operand 998 states and 1239 transitions. Second operand has 13 states, 13 states have (on average 9.846153846153847) internal successors, (128), 13 states have internal predecessors, (128), 0 states have call successors, (0), 0 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:55:23,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:23,309 INFO L93 Difference]: Finished difference Result 2695 states and 3250 transitions. [2022-07-14 13:55:23,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-14 13:55:23,309 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.846153846153847) internal successors, (128), 13 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-07-14 13:55:23,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:23,313 INFO L225 Difference]: With dead ends: 2695 [2022-07-14 13:55:23,314 INFO L226 Difference]: Without dead ends: 1729 [2022-07-14 13:55:23,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2022-07-14 13:55:23,315 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 613 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:23,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 689 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 13:55:23,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2022-07-14 13:55:23,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1263. [2022-07-14 13:55:23,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 1261 states have (on average 1.1919111816019032) internal successors, (1503), 1262 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:23,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1503 transitions. [2022-07-14 13:55:23,352 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1503 transitions. Word has length 62 [2022-07-14 13:55:23,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:23,352 INFO L495 AbstractCegarLoop]: Abstraction has 1263 states and 1503 transitions. [2022-07-14 13:55:23,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.846153846153847) internal successors, (128), 13 states have internal predecessors, (128), 0 states have call successors, (0), 0 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:55:23,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1503 transitions. [2022-07-14 13:55:23,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-14 13:55:23,354 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:23,354 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:55:23,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-14 13:55:23,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:55:23,570 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:23,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:23,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1264343822, now seen corresponding path program 1 times [2022-07-14 13:55:23,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:23,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779736023] [2022-07-14 13:55:23,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:23,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:23,656 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-14 13:55:23,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:23,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779736023] [2022-07-14 13:55:23,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779736023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:23,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:23,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 13:55:23,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566595221] [2022-07-14 13:55:23,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:23,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 13:55:23,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:23,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 13:55:23,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:55:23,658 INFO L87 Difference]: Start difference. First operand 1263 states and 1503 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 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:55:23,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:23,853 INFO L93 Difference]: Finished difference Result 2214 states and 2578 transitions. [2022-07-14 13:55:23,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 13:55:23,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 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 80 [2022-07-14 13:55:23,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:23,859 INFO L225 Difference]: With dead ends: 2214 [2022-07-14 13:55:23,859 INFO L226 Difference]: Without dead ends: 1988 [2022-07-14 13:55:23,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 13:55:23,860 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 243 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:23,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 470 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:55:23,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2022-07-14 13:55:23,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1263. [2022-07-14 13:55:23,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 1261 states have (on average 1.190325138778747) internal successors, (1501), 1262 states have internal predecessors, (1501), 0 states have call successors, (0), 0 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:55:23,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1501 transitions. [2022-07-14 13:55:23,909 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1501 transitions. Word has length 80 [2022-07-14 13:55:23,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:23,910 INFO L495 AbstractCegarLoop]: Abstraction has 1263 states and 1501 transitions. [2022-07-14 13:55:23,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 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:55:23,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1501 transitions. [2022-07-14 13:55:23,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-14 13:55:23,911 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:23,911 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:55:23,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-14 13:55:23,911 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:23,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:23,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1068642915, now seen corresponding path program 1 times [2022-07-14 13:55:23,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:23,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210754318] [2022-07-14 13:55:23,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:23,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:23,969 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-14 13:55:23,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:23,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210754318] [2022-07-14 13:55:23,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210754318] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:23,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:23,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 13:55:23,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90925142] [2022-07-14 13:55:23,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:23,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 13:55:23,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:23,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 13:55:23,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:55:23,971 INFO L87 Difference]: Start difference. First operand 1263 states and 1501 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:24,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:24,183 INFO L93 Difference]: Finished difference Result 4084 states and 4819 transitions. [2022-07-14 13:55:24,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 13:55:24,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-07-14 13:55:24,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:24,193 INFO L225 Difference]: With dead ends: 4084 [2022-07-14 13:55:24,194 INFO L226 Difference]: Without dead ends: 3755 [2022-07-14 13:55:24,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 13:55:24,196 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 205 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:24,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 396 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:55:24,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3755 states. [2022-07-14 13:55:24,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3755 to 1263. [2022-07-14 13:55:24,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 1261 states have (on average 1.190325138778747) internal successors, (1501), 1262 states have internal predecessors, (1501), 0 states have call successors, (0), 0 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:55:24,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 1501 transitions. [2022-07-14 13:55:24,255 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 1501 transitions. Word has length 80 [2022-07-14 13:55:24,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:24,255 INFO L495 AbstractCegarLoop]: Abstraction has 1263 states and 1501 transitions. [2022-07-14 13:55:24,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:24,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1501 transitions. [2022-07-14 13:55:24,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-14 13:55:24,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:24,257 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:55:24,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-14 13:55:24,257 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:24,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:24,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1632613179, now seen corresponding path program 1 times [2022-07-14 13:55:24,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:24,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246461523] [2022-07-14 13:55:24,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:24,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:24,322 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-14 13:55:24,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:24,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246461523] [2022-07-14 13:55:24,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246461523] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:24,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:24,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 13:55:24,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578363117] [2022-07-14 13:55:24,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:24,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 13:55:24,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:24,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 13:55:24,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 13:55:24,323 INFO L87 Difference]: Start difference. First operand 1263 states and 1501 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 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:55:24,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:24,629 INFO L93 Difference]: Finished difference Result 3314 states and 3881 transitions. [2022-07-14 13:55:24,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 13:55:24,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 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 83 [2022-07-14 13:55:24,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:24,637 INFO L225 Difference]: With dead ends: 3314 [2022-07-14 13:55:24,637 INFO L226 Difference]: Without dead ends: 3088 [2022-07-14 13:55:24,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-14 13:55:24,639 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 365 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:24,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 818 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 13:55:24,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2022-07-14 13:55:24,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 1279. [2022-07-14 13:55:24,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1279 states, 1277 states have (on average 1.1902897415818323) internal successors, (1520), 1278 states have internal predecessors, (1520), 0 states have call successors, (0), 0 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:55:24,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1520 transitions. [2022-07-14 13:55:24,709 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1520 transitions. Word has length 83 [2022-07-14 13:55:24,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:24,709 INFO L495 AbstractCegarLoop]: Abstraction has 1279 states and 1520 transitions. [2022-07-14 13:55:24,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 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:55:24,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1520 transitions. [2022-07-14 13:55:24,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-14 13:55:24,710 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:24,711 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:55:24,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-14 13:55:24,711 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:24,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:24,711 INFO L85 PathProgramCache]: Analyzing trace with hash 337763349, now seen corresponding path program 1 times [2022-07-14 13:55:24,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:24,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233840750] [2022-07-14 13:55:24,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:24,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:24,773 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-14 13:55:24,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:24,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233840750] [2022-07-14 13:55:24,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233840750] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:24,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:24,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 13:55:24,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46315537] [2022-07-14 13:55:24,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:24,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 13:55:24,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:24,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 13:55:24,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 13:55:24,775 INFO L87 Difference]: Start difference. First operand 1279 states and 1520 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 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:55:25,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:25,170 INFO L93 Difference]: Finished difference Result 5367 states and 6330 transitions. [2022-07-14 13:55:25,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 13:55:25,171 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 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 83 [2022-07-14 13:55:25,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:25,182 INFO L225 Difference]: With dead ends: 5367 [2022-07-14 13:55:25,182 INFO L226 Difference]: Without dead ends: 5038 [2022-07-14 13:55:25,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-14 13:55:25,184 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 307 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:25,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 650 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 13:55:25,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5038 states. [2022-07-14 13:55:25,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5038 to 1279. [2022-07-14 13:55:25,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1279 states, 1277 states have (on average 1.1902897415818323) internal successors, (1520), 1278 states have internal predecessors, (1520), 0 states have call successors, (0), 0 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:55:25,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1520 transitions. [2022-07-14 13:55:25,239 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1520 transitions. Word has length 83 [2022-07-14 13:55:25,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:25,239 INFO L495 AbstractCegarLoop]: Abstraction has 1279 states and 1520 transitions. [2022-07-14 13:55:25,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 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:55:25,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1520 transitions. [2022-07-14 13:55:25,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-14 13:55:25,241 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:25,241 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:55:25,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-14 13:55:25,241 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:25,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:25,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1378493424, now seen corresponding path program 1 times [2022-07-14 13:55:25,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:25,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748955146] [2022-07-14 13:55:25,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:25,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:25,316 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-14 13:55:25,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:25,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748955146] [2022-07-14 13:55:25,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748955146] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:55:25,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513791601] [2022-07-14 13:55:25,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:25,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:55:25,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:55:25,319 INFO L229 MonitoredProcess]: Starting monitored process 10 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:55:25,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-14 13:55:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:25,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 13:55:25,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:55:25,450 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-14 13:55:25,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:55:25,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513791601] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:25,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:55:25,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-07-14 13:55:25,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288886112] [2022-07-14 13:55:25,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:25,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:55:25,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:25,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:55:25,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 13:55:25,452 INFO L87 Difference]: Start difference. First operand 1279 states and 1520 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:25,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:25,552 INFO L93 Difference]: Finished difference Result 2740 states and 3233 transitions. [2022-07-14 13:55:25,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:55:25,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 83 [2022-07-14 13:55:25,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:25,558 INFO L225 Difference]: With dead ends: 2740 [2022-07-14 13:55:25,558 INFO L226 Difference]: Without dead ends: 2094 [2022-07-14 13:55:25,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 13:55:25,560 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 57 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:25,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 205 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:55:25,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2022-07-14 13:55:25,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 1847. [2022-07-14 13:55:25,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1847 states, 1845 states have (on average 1.1967479674796748) internal successors, (2208), 1846 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:25,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2208 transitions. [2022-07-14 13:55:25,618 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2208 transitions. Word has length 83 [2022-07-14 13:55:25,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:25,618 INFO L495 AbstractCegarLoop]: Abstraction has 1847 states and 2208 transitions. [2022-07-14 13:55:25,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 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:55:25,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2208 transitions. [2022-07-14 13:55:25,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-14 13:55:25,620 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:25,621 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:55:25,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-14 13:55:25,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-14 13:55:25,831 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:25,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:25,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1580511711, now seen corresponding path program 1 times [2022-07-14 13:55:25,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:25,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485960200] [2022-07-14 13:55:25,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:25,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:25,896 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-14 13:55:25,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:25,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485960200] [2022-07-14 13:55:25,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485960200] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:25,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:25,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 13:55:25,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216486301] [2022-07-14 13:55:25,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:25,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 13:55:25,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:25,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 13:55:25,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 13:55:25,901 INFO L87 Difference]: Start difference. First operand 1847 states and 2208 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:26,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:26,360 INFO L93 Difference]: Finished difference Result 4570 states and 5389 transitions. [2022-07-14 13:55:26,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 13:55:26,361 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2022-07-14 13:55:26,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:26,370 INFO L225 Difference]: With dead ends: 4570 [2022-07-14 13:55:26,371 INFO L226 Difference]: Without dead ends: 4344 [2022-07-14 13:55:26,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-14 13:55:26,373 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 485 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:26,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 1176 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 13:55:26,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4344 states. [2022-07-14 13:55:26,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4344 to 1826. [2022-07-14 13:55:26,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1826 states, 1824 states have (on average 1.1957236842105263) internal successors, (2181), 1825 states have internal predecessors, (2181), 0 states have call successors, (0), 0 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:55:26,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 2181 transitions. [2022-07-14 13:55:26,467 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 2181 transitions. Word has length 85 [2022-07-14 13:55:26,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:26,467 INFO L495 AbstractCegarLoop]: Abstraction has 1826 states and 2181 transitions. [2022-07-14 13:55:26,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:26,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 2181 transitions. [2022-07-14 13:55:26,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-14 13:55:26,469 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:26,469 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:55:26,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-14 13:55:26,469 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:26,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:26,470 INFO L85 PathProgramCache]: Analyzing trace with hash -403663599, now seen corresponding path program 1 times [2022-07-14 13:55:26,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:26,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751454705] [2022-07-14 13:55:26,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:26,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:26,555 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-14 13:55:26,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:26,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751454705] [2022-07-14 13:55:26,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751454705] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:26,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:26,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 13:55:26,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908878836] [2022-07-14 13:55:26,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:26,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 13:55:26,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:26,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 13:55:26,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 13:55:26,557 INFO L87 Difference]: Start difference. First operand 1826 states and 2181 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:26,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:26,996 INFO L93 Difference]: Finished difference Result 4957 states and 5841 transitions. [2022-07-14 13:55:26,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 13:55:26,996 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2022-07-14 13:55:26,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:27,016 INFO L225 Difference]: With dead ends: 4957 [2022-07-14 13:55:27,016 INFO L226 Difference]: Without dead ends: 4628 [2022-07-14 13:55:27,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-14 13:55:27,018 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 399 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:27,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1005 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 13:55:27,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4628 states. [2022-07-14 13:55:27,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4628 to 1814. [2022-07-14 13:55:27,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1814 states, 1812 states have (on average 1.1970198675496688) internal successors, (2169), 1813 states have internal predecessors, (2169), 0 states have call successors, (0), 0 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:55:27,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 2169 transitions. [2022-07-14 13:55:27,087 INFO L78 Accepts]: Start accepts. Automaton has 1814 states and 2169 transitions. Word has length 85 [2022-07-14 13:55:27,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:27,087 INFO L495 AbstractCegarLoop]: Abstraction has 1814 states and 2169 transitions. [2022-07-14 13:55:27,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:27,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 2169 transitions. [2022-07-14 13:55:27,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-14 13:55:27,088 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:27,088 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:55:27,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-14 13:55:27,089 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:27,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:27,089 INFO L85 PathProgramCache]: Analyzing trace with hash 477212928, now seen corresponding path program 1 times [2022-07-14 13:55:27,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:27,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113888699] [2022-07-14 13:55:27,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:27,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:27,179 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-14 13:55:27,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:27,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113888699] [2022-07-14 13:55:27,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113888699] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:55:27,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151060917] [2022-07-14 13:55:27,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:27,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:55:27,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:55:27,181 INFO L229 MonitoredProcess]: Starting monitored process 11 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:55:27,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-14 13:55:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:27,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 13:55:27,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:55:27,519 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-14 13:55:27,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:55:27,644 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-14 13:55:27,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151060917] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:55:27,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:55:27,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 14 [2022-07-14 13:55:27,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581789555] [2022-07-14 13:55:27,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:55:27,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 13:55:27,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:27,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 13:55:27,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-07-14 13:55:27,645 INFO L87 Difference]: Start difference. First operand 1814 states and 2169 transitions. Second operand has 14 states, 14 states have (on average 9.357142857142858) internal successors, (131), 14 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:55:28,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:28,354 INFO L93 Difference]: Finished difference Result 5288 states and 6283 transitions. [2022-07-14 13:55:28,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 13:55:28,355 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.357142857142858) internal successors, (131), 14 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 86 [2022-07-14 13:55:28,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:28,360 INFO L225 Difference]: With dead ends: 5288 [2022-07-14 13:55:28,360 INFO L226 Difference]: Without dead ends: 3411 [2022-07-14 13:55:28,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 163 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2022-07-14 13:55:28,364 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 764 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:28,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 907 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 13:55:28,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3411 states. [2022-07-14 13:55:28,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3411 to 2735. [2022-07-14 13:55:28,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2735 states, 2733 states have (on average 1.181119648737651) internal successors, (3228), 2734 states have internal predecessors, (3228), 0 states have call successors, (0), 0 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:55:28,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2735 states to 2735 states and 3228 transitions. [2022-07-14 13:55:28,461 INFO L78 Accepts]: Start accepts. Automaton has 2735 states and 3228 transitions. Word has length 86 [2022-07-14 13:55:28,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:28,461 INFO L495 AbstractCegarLoop]: Abstraction has 2735 states and 3228 transitions. [2022-07-14 13:55:28,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.357142857142858) internal successors, (131), 14 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:55:28,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2735 states and 3228 transitions. [2022-07-14 13:55:28,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-14 13:55:28,463 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:28,463 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:55:28,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-14 13:55:28,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-14 13:55:28,679 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:28,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:28,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1971534415, now seen corresponding path program 1 times [2022-07-14 13:55:28,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:28,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498499735] [2022-07-14 13:55:28,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:28,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:28,749 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-14 13:55:28,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:28,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498499735] [2022-07-14 13:55:28,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498499735] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:55:28,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136519097] [2022-07-14 13:55:28,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:28,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:55:28,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:55:28,764 INFO L229 MonitoredProcess]: Starting monitored process 12 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:55:28,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-14 13:55:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:28,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 13:55:28,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:55:29,155 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 13:55:29,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:55:29,285 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 55 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-14 13:55:29,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136519097] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:55:29,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:55:29,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 15 [2022-07-14 13:55:29,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423040877] [2022-07-14 13:55:29,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:55:29,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-14 13:55:29,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:29,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-14 13:55:29,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2022-07-14 13:55:29,287 INFO L87 Difference]: Start difference. First operand 2735 states and 3228 transitions. Second operand has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 0 states have call successors, (0), 0 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:55:30,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:30,026 INFO L93 Difference]: Finished difference Result 8169 states and 9624 transitions. [2022-07-14 13:55:30,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 13:55:30,026 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2022-07-14 13:55:30,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:30,033 INFO L225 Difference]: With dead ends: 8169 [2022-07-14 13:55:30,033 INFO L226 Difference]: Without dead ends: 5264 [2022-07-14 13:55:30,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 163 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=317, Unknown=0, NotChecked=0, Total=506 [2022-07-14 13:55:30,036 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 825 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:30,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 740 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 13:55:30,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5264 states. [2022-07-14 13:55:30,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5264 to 4271. [2022-07-14 13:55:30,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4271 states, 4269 states have (on average 1.1663152963223238) internal successors, (4979), 4270 states have internal predecessors, (4979), 0 states have call successors, (0), 0 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:55:30,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4271 states to 4271 states and 4979 transitions. [2022-07-14 13:55:30,202 INFO L78 Accepts]: Start accepts. Automaton has 4271 states and 4979 transitions. Word has length 86 [2022-07-14 13:55:30,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:30,202 INFO L495 AbstractCegarLoop]: Abstraction has 4271 states and 4979 transitions. [2022-07-14 13:55:30,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 0 states have call successors, (0), 0 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:55:30,203 INFO L276 IsEmpty]: Start isEmpty. Operand 4271 states and 4979 transitions. [2022-07-14 13:55:30,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-14 13:55:30,205 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:30,205 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:55:30,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-14 13:55:30,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-14 13:55:30,411 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:30,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:30,411 INFO L85 PathProgramCache]: Analyzing trace with hash -541799981, now seen corresponding path program 1 times [2022-07-14 13:55:30,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:30,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319870124] [2022-07-14 13:55:30,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:30,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 13:55:30,434 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 13:55:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 13:55:30,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 13:55:30,511 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-14 13:55:30,511 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 40 remaining) [2022-07-14 13:55:30,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 40 remaining) [2022-07-14 13:55:30,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 40 remaining) [2022-07-14 13:55:30,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 40 remaining) [2022-07-14 13:55:30,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 40 remaining) [2022-07-14 13:55:30,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 40 remaining) [2022-07-14 13:55:30,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 40 remaining) [2022-07-14 13:55:30,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 40 remaining) [2022-07-14 13:55:30,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 40 remaining) [2022-07-14 13:55:30,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 40 remaining) [2022-07-14 13:55:30,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 40 remaining) [2022-07-14 13:55:30,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 40 remaining) [2022-07-14 13:55:30,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 40 remaining) [2022-07-14 13:55:30,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 40 remaining) [2022-07-14 13:55:30,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 40 remaining) [2022-07-14 13:55:30,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 40 remaining) [2022-07-14 13:55:30,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 40 remaining) [2022-07-14 13:55:30,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 40 remaining) [2022-07-14 13:55:30,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 40 remaining) [2022-07-14 13:55:30,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 40 remaining) [2022-07-14 13:55:30,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 40 remaining) [2022-07-14 13:55:30,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 40 remaining) [2022-07-14 13:55:30,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 40 remaining) [2022-07-14 13:55:30,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 40 remaining) [2022-07-14 13:55:30,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 40 remaining) [2022-07-14 13:55:30,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 40 remaining) [2022-07-14 13:55:30,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 40 remaining) [2022-07-14 13:55:30,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 40 remaining) [2022-07-14 13:55:30,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 40 remaining) [2022-07-14 13:55:30,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 40 remaining) [2022-07-14 13:55:30,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 40 remaining) [2022-07-14 13:55:30,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 40 remaining) [2022-07-14 13:55:30,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 40 remaining) [2022-07-14 13:55:30,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 40 remaining) [2022-07-14 13:55:30,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 40 remaining) [2022-07-14 13:55:30,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 40 remaining) [2022-07-14 13:55:30,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 40 remaining) [2022-07-14 13:55:30,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 40 remaining) [2022-07-14 13:55:30,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 40 remaining) [2022-07-14 13:55:30,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 40 remaining) [2022-07-14 13:55:30,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-14 13:55:30,520 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:55:30,523 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 13:55:30,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 01:55:30 BoogieIcfgContainer [2022-07-14 13:55:30,595 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 13:55:30,595 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 13:55:30,595 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 13:55:30,595 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 13:55:30,596 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:55:15" (3/4) ... [2022-07-14 13:55:30,597 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-14 13:55:30,664 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-14 13:55:30,664 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 13:55:30,665 INFO L158 Benchmark]: Toolchain (without parser) took 15835.05ms. Allocated memory was 96.5MB in the beginning and 299.9MB in the end (delta: 203.4MB). Free memory was 57.9MB in the beginning and 244.0MB in the end (delta: -186.1MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2022-07-14 13:55:30,665 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory was 74.2MB in the beginning and 74.1MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 13:55:30,666 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.58ms. Allocated memory is still 96.5MB. Free memory was 57.7MB in the beginning and 69.8MB in the end (delta: -12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 13:55:30,666 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.43ms. Allocated memory is still 96.5MB. Free memory was 69.8MB in the beginning and 61.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 13:55:30,671 INFO L158 Benchmark]: Boogie Preprocessor took 69.30ms. Allocated memory is still 96.5MB. Free memory was 61.4MB in the beginning and 56.7MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-14 13:55:30,671 INFO L158 Benchmark]: RCFGBuilder took 672.78ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 56.7MB in the beginning and 81.8MB in the end (delta: -25.1MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2022-07-14 13:55:30,671 INFO L158 Benchmark]: TraceAbstraction took 14737.80ms. Allocated memory was 117.4MB in the beginning and 299.9MB in the end (delta: 182.5MB). Free memory was 81.8MB in the beginning and 251.3MB in the end (delta: -169.5MB). Peak memory consumption was 171.4MB. Max. memory is 16.1GB. [2022-07-14 13:55:30,671 INFO L158 Benchmark]: Witness Printer took 68.98ms. Allocated memory is still 299.9MB. Free memory was 251.3MB in the beginning and 244.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-14 13:55:30,672 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.19ms. Allocated memory is still 96.5MB. Free memory was 74.2MB in the beginning and 74.1MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.58ms. Allocated memory is still 96.5MB. Free memory was 57.7MB in the beginning and 69.8MB in the end (delta: -12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.43ms. Allocated memory is still 96.5MB. Free memory was 69.8MB in the beginning and 61.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.30ms. Allocated memory is still 96.5MB. Free memory was 61.4MB in the beginning and 56.7MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 672.78ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 56.7MB in the beginning and 81.8MB in the end (delta: -25.1MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14737.80ms. Allocated memory was 117.4MB in the beginning and 299.9MB in the end (delta: 182.5MB). Free memory was 81.8MB in the beginning and 251.3MB in the end (delta: -169.5MB). Peak memory consumption was 171.4MB. Max. memory is 16.1GB. * Witness Printer took 68.98ms. Allocated memory is still 299.9MB. Free memory was 251.3MB in the beginning and 244.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 116]: integer overflow possible integer overflow possible We found a FailurePath: [L124] unsigned int a, b, r; [L126] a = __VERIFIER_nondet_uint() [L127] b = __VERIFIER_nondet_uint() [L129] CALL mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=4] [L59] COND TRUE a3 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=4] [L60] EXPR na - 1 [L60] na = na - 1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=3] [L61] COND TRUE a2 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=3] [L62] EXPR na - 1 [L62] na = na - 1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=2] [L63] COND TRUE a1 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=2] [L64] EXPR na - 1 [L64] na = na - 1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=1] [L68] nb = (unsigned char)4 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=1, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=1, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L90] COND TRUE i == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0, r0=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L83] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L91] COND TRUE i == (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L83] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L92] COND TRUE i == (unsigned char)2 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L83] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L93] COND TRUE i == (unsigned char)3 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] r1 << 8U VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] r2 << 16U VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] r3 << 24U VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 128 locations, 40 error locations. Started 1 CEGAR loops. OverallTime: 14.6s, OverallIterations: 30, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5814 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5814 mSDsluCounter, 11382 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 271 IncrementalHoareTripleChecker+Unchecked, 7934 mSDsCounter, 479 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5828 IncrementalHoareTripleChecker+Invalid, 6578 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 479 mSolverCounterUnsat, 3448 mSDtfsCounter, 5828 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1236 GetRequests, 1031 SyntacticMatches, 23 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4271occurred in iteration=29, InterpolantAutomatonStates: 206, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 29 MinimizatonAttempts, 17191 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 2321 NumberOfCodeBlocks, 2321 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2543 ConstructedInterpolants, 10 QuantifiedInterpolants, 11549 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1518 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 45 InterpolantComputations, 24 PerfectInterpolantSequences, 1831/1987 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 RESULT: Ultimate proved your program to be incorrect! [2022-07-14 13:55:30,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)