./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/byte_add_2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 574ddb4e 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-1.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 8b7afe619831a9e012e7620d6e0b03d3495f1fd3efb2bdea6bfa4bb1568774e6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 09:10:48,117 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 09:10:48,118 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 09:10:48,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 09:10:48,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 09:10:48,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 09:10:48,154 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 09:10:48,156 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 09:10:48,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 09:10:48,162 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 09:10:48,163 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 09:10:48,165 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 09:10:48,165 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 09:10:48,167 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 09:10:48,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 09:10:48,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 09:10:48,169 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 09:10:48,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 09:10:48,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 09:10:48,176 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 09:10:48,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 09:10:48,178 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 09:10:48,179 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 09:10:48,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 09:10:48,182 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 09:10:48,182 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 09:10:48,183 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 09:10:48,184 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 09:10:48,184 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 09:10:48,184 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 09:10:48,185 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 09:10:48,185 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 09:10:48,186 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 09:10:48,187 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 09:10:48,188 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 09:10:48,188 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 09:10:48,188 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 09:10:48,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 09:10:48,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 09:10:48,189 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 09:10:48,190 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 09:10:48,191 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-02-17 09:10:48,219 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 09:10:48,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 09:10:48,220 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 09:10:48,220 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 09:10:48,221 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 09:10:48,221 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 09:10:48,221 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 09:10:48,221 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 09:10:48,221 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 09:10:48,222 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 09:10:48,222 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 09:10:48,222 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 09:10:48,223 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 09:10:48,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 09:10:48,223 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 09:10:48,223 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 09:10:48,223 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 09:10:48,223 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 09:10:48,223 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-17 09:10:48,223 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 09:10:48,224 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 09:10:48,224 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 09:10:48,224 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 09:10:48,224 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 09:10:48,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 09:10:48,224 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 09:10:48,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 09:10:48,225 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 09:10:48,225 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 09:10:48,225 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 09:10:48,225 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 09:10:48,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 09:10:48,225 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 09:10:48,226 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 09:10:48,226 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 09:10:48,226 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 09:10:48,226 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 09:10:48,226 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 8b7afe619831a9e012e7620d6e0b03d3495f1fd3efb2bdea6bfa4bb1568774e6 [2023-02-17 09:10:48,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 09:10:48,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 09:10:48,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 09:10:48,416 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 09:10:48,416 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 09:10:48,417 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-1.i [2023-02-17 09:10:49,307 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 09:10:49,486 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 09:10:49,487 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-1.i [2023-02-17 09:10:49,493 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28d4f1cc8/dcecb20ec7fa469a828c60e0fc0fad95/FLAGe57f1e145 [2023-02-17 09:10:49,501 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28d4f1cc8/dcecb20ec7fa469a828c60e0fc0fad95 [2023-02-17 09:10:49,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 09:10:49,504 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 09:10:49,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 09:10:49,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 09:10:49,507 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 09:10:49,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 09:10:49" (1/1) ... [2023-02-17 09:10:49,508 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@428acf4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:10:49, skipping insertion in model container [2023-02-17 09:10:49,508 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 09:10:49" (1/1) ... [2023-02-17 09:10:49,513 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 09:10:49,527 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 09:10:49,606 WARN L237 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-1.i[1168,1181] [2023-02-17 09:10:49,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 09:10:49,634 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 09:10:49,642 WARN L237 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-1.i[1168,1181] [2023-02-17 09:10:49,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 09:10:49,666 INFO L208 MainTranslator]: Completed translation [2023-02-17 09:10:49,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:10:49 WrapperNode [2023-02-17 09:10:49,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 09:10:49,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 09:10:49,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 09:10:49,668 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 09:10:49,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:10:49" (1/1) ... [2023-02-17 09:10:49,678 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:10:49" (1/1) ... [2023-02-17 09:10:49,698 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 182 [2023-02-17 09:10:49,698 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 09:10:49,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 09:10:49,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 09:10:49,699 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 09:10:49,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:10:49" (1/1) ... [2023-02-17 09:10:49,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:10:49" (1/1) ... [2023-02-17 09:10:49,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:10:49" (1/1) ... [2023-02-17 09:10:49,708 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:10:49" (1/1) ... [2023-02-17 09:10:49,715 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:10:49" (1/1) ... [2023-02-17 09:10:49,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:10:49" (1/1) ... [2023-02-17 09:10:49,719 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:10:49" (1/1) ... [2023-02-17 09:10:49,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:10:49" (1/1) ... [2023-02-17 09:10:49,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 09:10:49,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 09:10:49,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 09:10:49,724 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 09:10:49,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:10:49" (1/1) ... [2023-02-17 09:10:49,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 09:10:49,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:10:49,763 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) [2023-02-17 09:10:49,764 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 [2023-02-17 09:10:49,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 09:10:49,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 09:10:49,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 09:10:49,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 09:10:49,841 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 09:10:49,842 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 09:10:50,201 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 09:10:50,205 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 09:10:50,206 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-17 09:10:50,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:10:50 BoogieIcfgContainer [2023-02-17 09:10:50,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 09:10:50,209 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 09:10:50,209 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 09:10:50,211 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 09:10:50,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 09:10:49" (1/3) ... [2023-02-17 09:10:50,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8058be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 09:10:50, skipping insertion in model container [2023-02-17 09:10:50,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:10:49" (2/3) ... [2023-02-17 09:10:50,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8058be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 09:10:50, skipping insertion in model container [2023-02-17 09:10:50,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:10:50" (3/3) ... [2023-02-17 09:10:50,213 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_2-1.i [2023-02-17 09:10:50,224 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 09:10:50,224 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2023-02-17 09:10:50,280 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 09:10:50,286 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6c3a63f8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 09:10:50,287 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2023-02-17 09:10:50,305 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 84 states have (on average 1.8928571428571428) internal successors, (159), 125 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:10:50,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-17 09:10:50,310 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:50,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-17 09:10:50,312 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:50,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:50,317 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2023-02-17 09:10:50,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:50,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194460595] [2023-02-17 09:10:50,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:50,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:50,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:10:50,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:50,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194460595] [2023-02-17 09:10:50,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194460595] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:10:50,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:10:50,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-17 09:10:50,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932816453] [2023-02-17 09:10:50,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:10:50,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 09:10:50,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:50,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 09:10:50,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 09:10:50,453 INFO L87 Difference]: Start difference. First operand has 126 states, 84 states have (on average 1.8928571428571428) internal successors, (159), 125 states have internal predecessors, (159), 0 states have call successors, (0), 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) [2023-02-17 09:10:50,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:10:50,479 INFO L93 Difference]: Finished difference Result 153 states and 204 transitions. [2023-02-17 09:10:50,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 09:10:50,481 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 [2023-02-17 09:10:50,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:10:50,487 INFO L225 Difference]: With dead ends: 153 [2023-02-17 09:10:50,488 INFO L226 Difference]: Without dead ends: 76 [2023-02-17 09:10:50,490 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 [2023-02-17 09:10:50,494 INFO L413 NwaCegarLoop]: 116 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, 116 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 [2023-02-17 09:10:50,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:10:50,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-17 09:10:50,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-02-17 09:10:50,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 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) [2023-02-17 09:10:50,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2023-02-17 09:10:50,522 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 4 [2023-02-17 09:10:50,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:10:50,523 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2023-02-17 09:10:50,523 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) [2023-02-17 09:10:50,524 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2023-02-17 09:10:50,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 09:10:50,525 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:50,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:10:50,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 09:10:50,526 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:50,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:50,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1140047638, now seen corresponding path program 1 times [2023-02-17 09:10:50,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:50,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928556810] [2023-02-17 09:10:50,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:50,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:50,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:10:50,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:50,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928556810] [2023-02-17 09:10:50,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928556810] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:10:50,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:10:50,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 09:10:50,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518080976] [2023-02-17 09:10:50,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:10:50,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 09:10:50,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:50,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 09:10:50,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:10:50,700 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:10:50,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:10:50,816 INFO L93 Difference]: Finished difference Result 162 states and 235 transitions. [2023-02-17 09:10:50,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 09:10:50,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2023-02-17 09:10:50,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:10:50,818 INFO L225 Difference]: With dead ends: 162 [2023-02-17 09:10:50,818 INFO L226 Difference]: Without dead ends: 108 [2023-02-17 09:10:50,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:10:50,819 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 35 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 09:10:50,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 135 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 09:10:50,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-17 09:10:50,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2023-02-17 09:10:50,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:10:50,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 138 transitions. [2023-02-17 09:10:50,829 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 138 transitions. Word has length 17 [2023-02-17 09:10:50,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:10:50,830 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 138 transitions. [2023-02-17 09:10:50,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:10:50,831 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 138 transitions. [2023-02-17 09:10:50,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 09:10:50,834 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:50,834 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] [2023-02-17 09:10:50,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 09:10:50,835 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:50,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:50,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1047629272, now seen corresponding path program 1 times [2023-02-17 09:10:50,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:50,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176850997] [2023-02-17 09:10:50,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:50,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 09:10:50,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:50,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176850997] [2023-02-17 09:10:50,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176850997] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:10:50,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:10:50,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 09:10:50,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521947247] [2023-02-17 09:10:50,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:10:50,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 09:10:50,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:50,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 09:10:50,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 09:10:50,918 INFO L87 Difference]: Start difference. First operand 104 states and 138 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:10:51,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:10:51,048 INFO L93 Difference]: Finished difference Result 268 states and 359 transitions. [2023-02-17 09:10:51,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 09:10:51,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2023-02-17 09:10:51,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:10:51,049 INFO L225 Difference]: With dead ends: 268 [2023-02-17 09:10:51,050 INFO L226 Difference]: Without dead ends: 194 [2023-02-17 09:10:51,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 09:10:51,051 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 147 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 09:10:51,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 325 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 09:10:51,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-02-17 09:10:51,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 117. [2023-02-17 09:10:51,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.3275862068965518) internal successors, (154), 116 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:10:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 154 transitions. [2023-02-17 09:10:51,059 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 154 transitions. Word has length 24 [2023-02-17 09:10:51,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:10:51,059 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 154 transitions. [2023-02-17 09:10:51,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:10:51,060 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 154 transitions. [2023-02-17 09:10:51,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 09:10:51,070 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:51,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:10:51,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 09:10:51,071 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:51,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:51,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1685366660, now seen corresponding path program 1 times [2023-02-17 09:10:51,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:51,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104796556] [2023-02-17 09:10:51,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:51,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:51,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 09:10:51,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:51,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104796556] [2023-02-17 09:10:51,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104796556] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:10:51,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:10:51,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 09:10:51,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884200716] [2023-02-17 09:10:51,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:10:51,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 09:10:51,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:51,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 09:10:51,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 09:10:51,179 INFO L87 Difference]: Start difference. First operand 117 states and 154 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:10:51,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:10:51,311 INFO L93 Difference]: Finished difference Result 267 states and 357 transitions. [2023-02-17 09:10:51,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 09:10:51,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-17 09:10:51,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:10:51,316 INFO L225 Difference]: With dead ends: 267 [2023-02-17 09:10:51,316 INFO L226 Difference]: Without dead ends: 200 [2023-02-17 09:10:51,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 09:10:51,325 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 136 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 09:10:51,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 315 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 09:10:51,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-02-17 09:10:51,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 130. [2023-02-17 09:10:51,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.302325581395349) internal successors, (168), 129 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:10:51,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 168 transitions. [2023-02-17 09:10:51,340 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 168 transitions. Word has length 27 [2023-02-17 09:10:51,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:10:51,341 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 168 transitions. [2023-02-17 09:10:51,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:10:51,341 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 168 transitions. [2023-02-17 09:10:51,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-17 09:10:51,345 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:51,345 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:10:51,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-17 09:10:51,345 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:51,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:51,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1833052269, now seen corresponding path program 1 times [2023-02-17 09:10:51,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:51,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446419246] [2023-02-17 09:10:51,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:51,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:51,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 09:10:51,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:51,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446419246] [2023-02-17 09:10:51,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446419246] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:10:51,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:10:51,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 09:10:51,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814054007] [2023-02-17 09:10:51,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:10:51,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 09:10:51,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:51,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 09:10:51,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:10:51,420 INFO L87 Difference]: Start difference. First operand 130 states and 168 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:10:51,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:10:51,425 INFO L93 Difference]: Finished difference Result 198 states and 261 transitions. [2023-02-17 09:10:51,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 09:10:51,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-02-17 09:10:51,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:10:51,426 INFO L225 Difference]: With dead ends: 198 [2023-02-17 09:10:51,426 INFO L226 Difference]: Without dead ends: 96 [2023-02-17 09:10:51,426 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 [2023-02-17 09:10:51,427 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 86 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:10:51,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 91 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:10:51,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-17 09:10:51,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-02-17 09:10:51,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.3157894736842106) internal successors, (125), 95 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:10:51,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 125 transitions. [2023-02-17 09:10:51,431 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 125 transitions. Word has length 30 [2023-02-17 09:10:51,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:10:51,432 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 125 transitions. [2023-02-17 09:10:51,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:10:51,432 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 125 transitions. [2023-02-17 09:10:51,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-17 09:10:51,432 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:51,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:10:51,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-17 09:10:51,433 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:51,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:51,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1993043557, now seen corresponding path program 1 times [2023-02-17 09:10:51,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:51,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978345708] [2023-02-17 09:10:51,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:51,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:51,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:10:51,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:51,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978345708] [2023-02-17 09:10:51,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978345708] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:10:51,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407420111] [2023-02-17 09:10:51,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:51,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:10:51,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:10:51,499 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) [2023-02-17 09:10:51,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 09:10:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:51,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 09:10:51,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:10:51,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:10:51,632 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 09:10:51,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407420111] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:10:51,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 09:10:51,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-02-17 09:10:51,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704189186] [2023-02-17 09:10:51,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:10:51,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 09:10:51,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:51,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 09:10:51,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-17 09:10:51,634 INFO L87 Difference]: Start difference. First operand 96 states and 125 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:10:51,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:10:51,754 INFO L93 Difference]: Finished difference Result 205 states and 297 transitions. [2023-02-17 09:10:51,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 09:10:51,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-17 09:10:51,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:10:51,755 INFO L225 Difference]: With dead ends: 205 [2023-02-17 09:10:51,756 INFO L226 Difference]: Without dead ends: 151 [2023-02-17 09:10:51,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-17 09:10:51,756 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 56 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 09:10:51,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 156 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 09:10:51,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-17 09:10:51,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2023-02-17 09:10:51,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.2803030303030303) 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) [2023-02-17 09:10:51,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 169 transitions. [2023-02-17 09:10:51,772 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 169 transitions. Word has length 36 [2023-02-17 09:10:51,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:10:51,772 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 169 transitions. [2023-02-17 09:10:51,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:10:51,773 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 169 transitions. [2023-02-17 09:10:51,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-17 09:10:51,773 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:51,773 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:10:51,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-17 09:10:51,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-02-17 09:10:51,981 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:51,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:51,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1280522041, now seen corresponding path program 1 times [2023-02-17 09:10:51,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:51,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428631134] [2023-02-17 09:10:51,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:51,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:52,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:10:52,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:52,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428631134] [2023-02-17 09:10:52,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428631134] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:10:52,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265098082] [2023-02-17 09:10:52,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:52,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:10:52,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:10:52,075 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) [2023-02-17 09:10:52,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 09:10:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:52,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 09:10:52,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:10:52,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 09:10:52,146 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 09:10:52,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265098082] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:10:52,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 09:10:52,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-02-17 09:10:52,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664834210] [2023-02-17 09:10:52,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:10:52,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 09:10:52,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:52,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 09:10:52,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 09:10:52,148 INFO L87 Difference]: Start difference. First operand 133 states and 169 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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) [2023-02-17 09:10:52,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:10:52,192 INFO L93 Difference]: Finished difference Result 244 states and 321 transitions. [2023-02-17 09:10:52,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 09:10:52,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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 43 [2023-02-17 09:10:52,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:10:52,194 INFO L225 Difference]: With dead ends: 244 [2023-02-17 09:10:52,194 INFO L226 Difference]: Without dead ends: 127 [2023-02-17 09:10:52,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-02-17 09:10:52,195 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 72 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:10:52,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 134 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:10:52,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-17 09:10:52,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 117. [2023-02-17 09:10:52,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.2758620689655173) internal successors, (148), 116 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:10:52,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 148 transitions. [2023-02-17 09:10:52,199 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 148 transitions. Word has length 43 [2023-02-17 09:10:52,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:10:52,199 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 148 transitions. [2023-02-17 09:10:52,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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) [2023-02-17 09:10:52,199 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 148 transitions. [2023-02-17 09:10:52,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-17 09:10:52,200 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:52,200 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, 1, 1, 1, 1] [2023-02-17 09:10:52,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-17 09:10:52,413 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,SelfDestructingSolverStorable6 [2023-02-17 09:10:52,413 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:52,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:52,413 INFO L85 PathProgramCache]: Analyzing trace with hash -493197952, now seen corresponding path program 1 times [2023-02-17 09:10:52,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:52,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681293160] [2023-02-17 09:10:52,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:52,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:10:52,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:52,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681293160] [2023-02-17 09:10:52,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681293160] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:10:52,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705276809] [2023-02-17 09:10:52,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:52,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:10:52,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:10:52,506 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) [2023-02-17 09:10:52,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 09:10:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:52,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 09:10:52,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:10:52,591 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-17 09:10:52,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 09:10:52,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705276809] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:10:52,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 09:10:52,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-02-17 09:10:52,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037649515] [2023-02-17 09:10:52,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:10:52,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 09:10:52,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:52,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 09:10:52,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-17 09:10:52,594 INFO L87 Difference]: Start difference. First operand 117 states and 148 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:10:54,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-02-17 09:10:56,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-02-17 09:10:58,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-02-17 09:11:00,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-02-17 09:11:03,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-02-17 09:11:05,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-02-17 09:11:07,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-02-17 09:11:09,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-02-17 09:11:11,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-02-17 09:11:13,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-02-17 09:11:14,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:11:14,306 INFO L93 Difference]: Finished difference Result 273 states and 369 transitions. [2023-02-17 09:11:14,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 09:11:14,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2023-02-17 09:11:14,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:11:14,307 INFO L225 Difference]: With dead ends: 273 [2023-02-17 09:11:14,308 INFO L226 Difference]: Without dead ends: 164 [2023-02-17 09:11:14,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-17 09:11:14,308 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 42 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 24 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.7s IncrementalHoareTripleChecker+Time [2023-02-17 09:11:14,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 193 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 116 Invalid, 10 Unknown, 0 Unchecked, 21.7s Time] [2023-02-17 09:11:14,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-02-17 09:11:14,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 139. [2023-02-17 09:11:14,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.2608695652173914) internal successors, (174), 138 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:11:14,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 174 transitions. [2023-02-17 09:11:14,312 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 174 transitions. Word has length 52 [2023-02-17 09:11:14,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:11:14,312 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 174 transitions. [2023-02-17 09:11:14,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:11:14,312 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 174 transitions. [2023-02-17 09:11:14,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-02-17 09:11:14,313 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:11:14,313 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:11:14,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-17 09:11:14,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:11:14,514 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:11:14,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:11:14,514 INFO L85 PathProgramCache]: Analyzing trace with hash -271705697, now seen corresponding path program 1 times [2023-02-17 09:11:14,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:11:14,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753628765] [2023-02-17 09:11:14,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:11:14,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:11:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:11:14,677 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:11:14,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:11:14,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753628765] [2023-02-17 09:11:14,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753628765] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:11:14,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057972311] [2023-02-17 09:11:14,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:11:14,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:11:14,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:11:14,679 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) [2023-02-17 09:11:14,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-17 09:11:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:11:14,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 09:11:14,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:11:14,790 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-02-17 09:11:14,790 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 09:11:14,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057972311] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:11:14,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 09:11:14,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-02-17 09:11:14,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721713867] [2023-02-17 09:11:14,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:11:14,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 09:11:14,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:11:14,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 09:11:14,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 09:11:14,796 INFO L87 Difference]: Start difference. First operand 139 states and 174 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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) [2023-02-17 09:11:14,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:11:14,990 INFO L93 Difference]: Finished difference Result 318 states and 421 transitions. [2023-02-17 09:11:14,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 09:11:14,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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 68 [2023-02-17 09:11:14,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:11:14,992 INFO L225 Difference]: With dead ends: 318 [2023-02-17 09:11:14,992 INFO L226 Difference]: Without dead ends: 185 [2023-02-17 09:11:14,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 09:11:14,992 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 42 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 09:11:14,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 194 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 09:11:14,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-02-17 09:11:14,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 161. [2023-02-17 09:11:14,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.25) internal successors, (200), 160 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:11:14,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 200 transitions. [2023-02-17 09:11:14,996 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 200 transitions. Word has length 68 [2023-02-17 09:11:14,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:11:14,996 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 200 transitions. [2023-02-17 09:11:14,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 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) [2023-02-17 09:11:14,996 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 200 transitions. [2023-02-17 09:11:14,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-02-17 09:11:14,997 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:11:14,997 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] [2023-02-17 09:11:15,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-17 09:11:15,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:11:15,202 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:11:15,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:11:15,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1991578566, now seen corresponding path program 1 times [2023-02-17 09:11:15,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:11:15,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589562607] [2023-02-17 09:11:15,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:11:15,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:11:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:11:15,365 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-02-17 09:11:15,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:11:15,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589562607] [2023-02-17 09:11:15,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589562607] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:11:15,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:11:15,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 09:11:15,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041908031] [2023-02-17 09:11:15,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:11:15,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 09:11:15,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:11:15,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 09:11:15,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 09:11:15,370 INFO L87 Difference]: Start difference. First operand 161 states and 200 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) [2023-02-17 09:11:15,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:11:15,660 INFO L93 Difference]: Finished difference Result 629 states and 780 transitions. [2023-02-17 09:11:15,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 09:11:15,661 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 84 [2023-02-17 09:11:15,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:11:15,662 INFO L225 Difference]: With dead ends: 629 [2023-02-17 09:11:15,662 INFO L226 Difference]: Without dead ends: 490 [2023-02-17 09:11:15,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 09:11:15,663 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 245 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 09:11:15,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 490 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 09:11:15,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2023-02-17 09:11:15,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 161. [2023-02-17 09:11:15,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.25) internal successors, (200), 160 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:11:15,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 200 transitions. [2023-02-17 09:11:15,667 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 200 transitions. Word has length 84 [2023-02-17 09:11:15,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:11:15,668 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 200 transitions. [2023-02-17 09:11:15,668 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) [2023-02-17 09:11:15,668 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 200 transitions. [2023-02-17 09:11:15,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-02-17 09:11:15,668 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:11:15,668 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, 1, 1] [2023-02-17 09:11:15,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-17 09:11:15,670 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:11:15,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:11:15,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1230056049, now seen corresponding path program 1 times [2023-02-17 09:11:15,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:11:15,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226583452] [2023-02-17 09:11:15,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:11:15,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:11:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:11:15,839 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-02-17 09:11:15,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:11:15,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226583452] [2023-02-17 09:11:15,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226583452] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:11:15,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:11:15,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 09:11:15,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942968158] [2023-02-17 09:11:15,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:11:15,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 09:11:15,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:11:15,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 09:11:15,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 09:11:15,841 INFO L87 Difference]: Start difference. First operand 161 states and 200 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) [2023-02-17 09:11:16,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:11:16,297 INFO L93 Difference]: Finished difference Result 796 states and 985 transitions. [2023-02-17 09:11:16,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 09:11:16,298 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 87 [2023-02-17 09:11:16,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:11:16,300 INFO L225 Difference]: With dead ends: 796 [2023-02-17 09:11:16,300 INFO L226 Difference]: Without dead ends: 657 [2023-02-17 09:11:16,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-17 09:11:16,301 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 368 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 09:11:16,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 640 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 09:11:16,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2023-02-17 09:11:16,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 161. [2023-02-17 09:11:16,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.25) internal successors, (200), 160 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:11:16,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 200 transitions. [2023-02-17 09:11:16,307 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 200 transitions. Word has length 87 [2023-02-17 09:11:16,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:11:16,307 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 200 transitions. [2023-02-17 09:11:16,307 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) [2023-02-17 09:11:16,308 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 200 transitions. [2023-02-17 09:11:16,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-02-17 09:11:16,312 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:11:16,312 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] [2023-02-17 09:11:16,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-17 09:11:16,312 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:11:16,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:11:16,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1677424560, now seen corresponding path program 1 times [2023-02-17 09:11:16,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:11:16,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126896083] [2023-02-17 09:11:16,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:11:16,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:11:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:11:16,488 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-02-17 09:11:16,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:11:16,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126896083] [2023-02-17 09:11:16,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126896083] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:11:16,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382186624] [2023-02-17 09:11:16,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:11:16,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:11:16,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:11:16,490 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) [2023-02-17 09:11:16,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-17 09:11:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:11:16,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 09:11:16,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:11:16,563 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-17 09:11:16,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:11:16,611 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 40 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-02-17 09:11:16,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382186624] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:11:16,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:11:16,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 6] total 10 [2023-02-17 09:11:16,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163714579] [2023-02-17 09:11:16,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:11:16,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 09:11:16,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:11:16,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 09:11:16,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-02-17 09:11:16,613 INFO L87 Difference]: Start difference. First operand 161 states and 200 transitions. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:11:17,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:11:17,394 INFO L93 Difference]: Finished difference Result 840 states and 1136 transitions. [2023-02-17 09:11:17,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-17 09:11:17,395 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 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 87 [2023-02-17 09:11:17,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:11:17,397 INFO L225 Difference]: With dead ends: 840 [2023-02-17 09:11:17,397 INFO L226 Difference]: Without dead ends: 682 [2023-02-17 09:11:17,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 166 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2023-02-17 09:11:17,398 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 508 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-17 09:11:17,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 495 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-17 09:11:17,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2023-02-17 09:11:17,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 560. [2023-02-17 09:11:17,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.302325581395349) internal successors, (728), 559 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:11:17,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 728 transitions. [2023-02-17 09:11:17,412 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 728 transitions. Word has length 87 [2023-02-17 09:11:17,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:11:17,412 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 728 transitions. [2023-02-17 09:11:17,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:11:17,412 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 728 transitions. [2023-02-17 09:11:17,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-02-17 09:11:17,413 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:11:17,413 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, 1, 1, 1, 1] [2023-02-17 09:11:17,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-17 09:11:17,620 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,SelfDestructingSolverStorable11 [2023-02-17 09:11:17,620 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:11:17,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:11:17,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1511267789, now seen corresponding path program 1 times [2023-02-17 09:11:17,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:11:17,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314233290] [2023-02-17 09:11:17,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:11:17,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:11:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:11:17,780 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-02-17 09:11:17,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:11:17,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314233290] [2023-02-17 09:11:17,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314233290] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:11:17,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:11:17,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 09:11:17,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960513114] [2023-02-17 09:11:17,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:11:17,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 09:11:17,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:11:17,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 09:11:17,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-17 09:11:17,782 INFO L87 Difference]: Start difference. First operand 560 states and 728 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) [2023-02-17 09:11:18,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:11:18,377 INFO L93 Difference]: Finished difference Result 1545 states and 2010 transitions. [2023-02-17 09:11:18,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 09:11:18,378 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 89 [2023-02-17 09:11:18,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:11:18,381 INFO L225 Difference]: With dead ends: 1545 [2023-02-17 09:11:18,381 INFO L226 Difference]: Without dead ends: 1196 [2023-02-17 09:11:18,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-17 09:11:18,381 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 489 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 09:11:18,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 957 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 09:11:18,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2023-02-17 09:11:18,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 555. [2023-02-17 09:11:18,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 554 states have (on average 1.3032490974729243) internal successors, (722), 554 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:11:18,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 722 transitions. [2023-02-17 09:11:18,397 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 722 transitions. Word has length 89 [2023-02-17 09:11:18,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:11:18,398 INFO L495 AbstractCegarLoop]: Abstraction has 555 states and 722 transitions. [2023-02-17 09:11:18,398 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) [2023-02-17 09:11:18,398 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 722 transitions. [2023-02-17 09:11:18,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-02-17 09:11:18,399 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:11:18,399 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, 1, 1] [2023-02-17 09:11:18,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-17 09:11:18,399 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:11:18,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:11:18,400 INFO L85 PathProgramCache]: Analyzing trace with hash -967413213, now seen corresponding path program 1 times [2023-02-17 09:11:18,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:11:18,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808419395] [2023-02-17 09:11:18,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:11:18,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:11:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:11:18,585 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-02-17 09:11:18,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:11:18,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808419395] [2023-02-17 09:11:18,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808419395] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:11:18,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154970763] [2023-02-17 09:11:18,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:11:18,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:11:18,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:11:18,587 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) [2023-02-17 09:11:18,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-17 09:11:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:11:18,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 09:11:18,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:11:18,861 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-17 09:11:18,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:11:18,936 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-17 09:11:18,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154970763] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:11:18,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:11:18,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2023-02-17 09:11:18,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570467620] [2023-02-17 09:11:18,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:11:18,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 09:11:18,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:11:18,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 09:11:18,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-02-17 09:11:18,937 INFO L87 Difference]: Start difference. First operand 555 states and 722 transitions. Second operand has 12 states, 12 states have (on average 11.5) internal successors, (138), 12 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:11:19,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:11:19,984 INFO L93 Difference]: Finished difference Result 1664 states and 2180 transitions. [2023-02-17 09:11:19,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 09:11:19,984 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.5) internal successors, (138), 12 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2023-02-17 09:11:19,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:11:19,987 INFO L225 Difference]: With dead ends: 1664 [2023-02-17 09:11:19,988 INFO L226 Difference]: Without dead ends: 1312 [2023-02-17 09:11:19,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 176 SyntacticMatches, 8 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2023-02-17 09:11:19,988 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 722 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-17 09:11:19,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1147 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-17 09:11:19,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2023-02-17 09:11:20,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 555. [2023-02-17 09:11:20,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 554 states have (on average 1.3032490974729243) internal successors, (722), 554 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:11:20,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 722 transitions. [2023-02-17 09:11:20,003 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 722 transitions. Word has length 93 [2023-02-17 09:11:20,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:11:20,003 INFO L495 AbstractCegarLoop]: Abstraction has 555 states and 722 transitions. [2023-02-17 09:11:20,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.5) internal successors, (138), 12 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:11:20,004 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 722 transitions. [2023-02-17 09:11:20,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-02-17 09:11:20,004 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:11:20,004 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, 1, 1, 1, 1] [2023-02-17 09:11:20,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-17 09:11:20,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:11:20,210 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:11:20,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:11:20,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1251242111, now seen corresponding path program 1 times [2023-02-17 09:11:20,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:11:20,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667839990] [2023-02-17 09:11:20,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:11:20,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:11:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:11:20,423 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 41 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-17 09:11:20,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:11:20,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667839990] [2023-02-17 09:11:20,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667839990] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:11:20,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786504761] [2023-02-17 09:11:20,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:11:20,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:11:20,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:11:20,425 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) [2023-02-17 09:11:20,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-17 09:11:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:11:20,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-17 09:11:20,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:11:20,585 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 47 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-17 09:11:20,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:11:20,679 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-17 09:11:20,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786504761] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:11:20,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:11:20,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2023-02-17 09:11:20,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051112732] [2023-02-17 09:11:20,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:11:20,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-17 09:11:20,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:11:20,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-17 09:11:20,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2023-02-17 09:11:20,681 INFO L87 Difference]: Start difference. First operand 555 states and 722 transitions. Second operand has 17 states, 16 states have (on average 12.375) internal successors, (198), 17 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:11:21,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:11:21,760 INFO L93 Difference]: Finished difference Result 4006 states and 4979 transitions. [2023-02-17 09:11:21,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-17 09:11:21,760 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 12.375) internal successors, (198), 17 states have internal predecessors, (198), 0 states have call successors, (0), 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 95 [2023-02-17 09:11:21,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:11:21,768 INFO L225 Difference]: With dead ends: 4006 [2023-02-17 09:11:21,768 INFO L226 Difference]: Without dead ends: 3420 [2023-02-17 09:11:21,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 175 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=403, Invalid=1079, Unknown=0, NotChecked=0, Total=1482 [2023-02-17 09:11:21,770 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 1143 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-17 09:11:21,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 1097 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-17 09:11:21,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3420 states. [2023-02-17 09:11:21,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3420 to 889. [2023-02-17 09:11:21,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 888 states have (on average 1.3344594594594594) internal successors, (1185), 888 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:11:21,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1185 transitions. [2023-02-17 09:11:21,802 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1185 transitions. Word has length 95 [2023-02-17 09:11:21,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:11:21,803 INFO L495 AbstractCegarLoop]: Abstraction has 889 states and 1185 transitions. [2023-02-17 09:11:21,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 12.375) internal successors, (198), 17 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:11:21,803 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1185 transitions. [2023-02-17 09:11:21,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-02-17 09:11:21,804 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:11:21,804 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:11:21,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-17 09:11:22,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:11:22,013 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:11:22,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:11:22,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1116141497, now seen corresponding path program 1 times [2023-02-17 09:11:22,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:11:22,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166062677] [2023-02-17 09:11:22,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:11:22,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:11:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:11:22,105 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 76 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-17 09:11:22,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:11:22,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166062677] [2023-02-17 09:11:22,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166062677] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:11:22,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911381151] [2023-02-17 09:11:22,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:11:22,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:11:22,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:11:22,107 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) [2023-02-17 09:11:22,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-17 09:11:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:11:22,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 09:11:22,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:11:22,201 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-17 09:11:22,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:11:22,364 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-17 09:11:22,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911381151] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-17 09:11:22,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-17 09:11:22,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 9 [2023-02-17 09:11:22,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796060701] [2023-02-17 09:11:22,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:11:22,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 09:11:22,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:11:22,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 09:11:22,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-17 09:11:22,367 INFO L87 Difference]: Start difference. First operand 889 states and 1185 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:11:22,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:11:22,687 INFO L93 Difference]: Finished difference Result 2432 states and 3298 transitions. [2023-02-17 09:11:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 09:11:22,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2023-02-17 09:11:22,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:11:22,691 INFO L225 Difference]: With dead ends: 2432 [2023-02-17 09:11:22,691 INFO L226 Difference]: Without dead ends: 1793 [2023-02-17 09:11:22,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 198 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-02-17 09:11:22,693 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 146 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 09:11:22,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 212 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 09:11:22,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2023-02-17 09:11:22,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1547. [2023-02-17 09:11:22,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1546 states have (on average 1.3551099611901682) internal successors, (2095), 1546 states have internal predecessors, (2095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:11:22,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2095 transitions. [2023-02-17 09:11:22,754 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2095 transitions. Word has length 101 [2023-02-17 09:11:22,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:11:22,754 INFO L495 AbstractCegarLoop]: Abstraction has 1547 states and 2095 transitions. [2023-02-17 09:11:22,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:11:22,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2095 transitions. [2023-02-17 09:11:22,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-02-17 09:11:22,756 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:11:22,756 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:11:22,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-17 09:11:22,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-17 09:11:22,961 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:11:22,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:11:22,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1501915936, now seen corresponding path program 1 times [2023-02-17 09:11:22,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:11:22,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047879037] [2023-02-17 09:11:22,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:11:22,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:11:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:11:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-17 09:11:23,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:11:23,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047879037] [2023-02-17 09:11:23,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047879037] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:11:23,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:11:23,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 09:11:23,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828141952] [2023-02-17 09:11:23,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:11:23,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 09:11:23,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:11:23,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 09:11:23,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 09:11:23,066 INFO L87 Difference]: Start difference. First operand 1547 states and 2095 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:11:23,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:11:23,419 INFO L93 Difference]: Finished difference Result 3250 states and 4371 transitions. [2023-02-17 09:11:23,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 09:11:23,419 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2023-02-17 09:11:23,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:11:23,423 INFO L225 Difference]: With dead ends: 3250 [2023-02-17 09:11:23,423 INFO L226 Difference]: Without dead ends: 1939 [2023-02-17 09:11:23,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2023-02-17 09:11:23,425 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 262 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 09:11:23,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 284 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 09:11:23,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2023-02-17 09:11:23,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1493. [2023-02-17 09:11:23,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 1492 states have (on average 1.329088471849866) internal successors, (1983), 1492 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:11:23,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1983 transitions. [2023-02-17 09:11:23,483 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1983 transitions. Word has length 102 [2023-02-17 09:11:23,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:11:23,483 INFO L495 AbstractCegarLoop]: Abstraction has 1493 states and 1983 transitions. [2023-02-17 09:11:23,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 09:11:23,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1983 transitions. [2023-02-17 09:11:23,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-02-17 09:11:23,485 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:11:23,485 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1] [2023-02-17 09:11:23,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-17 09:11:23,485 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:11:23,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:11:23,485 INFO L85 PathProgramCache]: Analyzing trace with hash -702020810, now seen corresponding path program 1 times [2023-02-17 09:11:23,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:11:23,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442072790] [2023-02-17 09:11:23,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:11:23,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:11:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:11:23,521 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:11:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:11:23,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:11:23,570 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-17 09:11:23,571 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 41 remaining) [2023-02-17 09:11:23,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 41 remaining) [2023-02-17 09:11:23,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 41 remaining) [2023-02-17 09:11:23,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 41 remaining) [2023-02-17 09:11:23,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 41 remaining) [2023-02-17 09:11:23,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 41 remaining) [2023-02-17 09:11:23,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 41 remaining) [2023-02-17 09:11:23,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 41 remaining) [2023-02-17 09:11:23,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 41 remaining) [2023-02-17 09:11:23,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 41 remaining) [2023-02-17 09:11:23,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 41 remaining) [2023-02-17 09:11:23,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 41 remaining) [2023-02-17 09:11:23,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 41 remaining) [2023-02-17 09:11:23,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 41 remaining) [2023-02-17 09:11:23,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 41 remaining) [2023-02-17 09:11:23,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 41 remaining) [2023-02-17 09:11:23,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 41 remaining) [2023-02-17 09:11:23,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 41 remaining) [2023-02-17 09:11:23,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 41 remaining) [2023-02-17 09:11:23,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 41 remaining) [2023-02-17 09:11:23,575 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 41 remaining) [2023-02-17 09:11:23,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 41 remaining) [2023-02-17 09:11:23,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 41 remaining) [2023-02-17 09:11:23,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 41 remaining) [2023-02-17 09:11:23,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 41 remaining) [2023-02-17 09:11:23,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 41 remaining) [2023-02-17 09:11:23,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 41 remaining) [2023-02-17 09:11:23,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 41 remaining) [2023-02-17 09:11:23,576 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 41 remaining) [2023-02-17 09:11:23,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 41 remaining) [2023-02-17 09:11:23,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 41 remaining) [2023-02-17 09:11:23,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 41 remaining) [2023-02-17 09:11:23,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 41 remaining) [2023-02-17 09:11:23,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 41 remaining) [2023-02-17 09:11:23,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 41 remaining) [2023-02-17 09:11:23,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 41 remaining) [2023-02-17 09:11:23,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 41 remaining) [2023-02-17 09:11:23,577 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 41 remaining) [2023-02-17 09:11:23,578 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 41 remaining) [2023-02-17 09:11:23,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 41 remaining) [2023-02-17 09:11:23,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 41 remaining) [2023-02-17 09:11:23,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-17 09:11:23,583 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:11:23,586 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 09:11:23,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 09:11:23 BoogieIcfgContainer [2023-02-17 09:11:23,664 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 09:11:23,665 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 09:11:23,665 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 09:11:23,665 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 09:11:23,665 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:10:50" (3/4) ... [2023-02-17 09:11:23,667 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-17 09:11:23,737 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 09:11:23,737 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 09:11:23,737 INFO L158 Benchmark]: Toolchain (without parser) took 34233.49ms. Allocated memory was 146.8MB in the beginning and 176.2MB in the end (delta: 29.4MB). Free memory was 115.6MB in the beginning and 134.9MB in the end (delta: -19.3MB). Peak memory consumption was 106.4MB. Max. memory is 16.1GB. [2023-02-17 09:11:23,738 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 121.6MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 09:11:23,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.41ms. Allocated memory is still 146.8MB. Free memory was 115.6MB in the beginning and 102.9MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-17 09:11:23,738 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.64ms. Allocated memory is still 146.8MB. Free memory was 102.9MB in the beginning and 100.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-17 09:11:23,738 INFO L158 Benchmark]: Boogie Preprocessor took 24.23ms. Allocated memory is still 146.8MB. Free memory was 100.0MB in the beginning and 97.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 09:11:23,739 INFO L158 Benchmark]: RCFGBuilder took 483.63ms. Allocated memory is still 146.8MB. Free memory was 97.9MB in the beginning and 74.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-02-17 09:11:23,739 INFO L158 Benchmark]: TraceAbstraction took 33455.63ms. Allocated memory was 146.8MB in the beginning and 176.2MB in the end (delta: 29.4MB). Free memory was 74.2MB in the beginning and 43.5MB in the end (delta: 30.7MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. [2023-02-17 09:11:23,739 INFO L158 Benchmark]: Witness Printer took 72.36ms. Allocated memory is still 176.2MB. Free memory was 43.5MB in the beginning and 134.9MB in the end (delta: -91.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-17 09:11:23,744 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.13ms. Allocated memory is still 121.6MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 162.41ms. Allocated memory is still 146.8MB. Free memory was 115.6MB in the beginning and 102.9MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.64ms. Allocated memory is still 146.8MB. Free memory was 102.9MB in the beginning and 100.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.23ms. Allocated memory is still 146.8MB. Free memory was 100.0MB in the beginning and 97.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 483.63ms. Allocated memory is still 146.8MB. Free memory was 97.9MB in the beginning and 74.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 33455.63ms. Allocated memory was 146.8MB in the beginning and 176.2MB in the end (delta: 29.4MB). Free memory was 74.2MB in the beginning and 43.5MB in the end (delta: 30.7MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. * Witness Printer took 72.36ms. Allocated memory is still 176.2MB. Free memory was 43.5MB in the beginning and 134.9MB in the end (delta: -91.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 116]: integer overflow possible integer overflow possible We found a FailurePath: [L124] unsigned int a, b, r; [L125] a = __VERIFIER_nondet_uint() [L127] b = 234770789 [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)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L68] nb = (unsigned char)4 VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, 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)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L89] COND TRUE i < nb VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L90] COND TRUE i == (unsigned char)0 VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=101] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=101] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=101] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=101] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=101] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=101, r0=101] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=101, r0=101] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=101, r0=101] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=101, r0=101] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=101, r0=101] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L83] COND TRUE i < na VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L85] COND TRUE i == (unsigned char)1 VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L85] EXPR partial_sum + a1 [L85] partial_sum = partial_sum + a1 VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L89] COND TRUE i < nb VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L91] COND TRUE i == (unsigned char)1 VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101, r1=81] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101, r1=81] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101, r1=81] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=81, r0=101, r1=81] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L83] COND TRUE i < na VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L86] COND TRUE i == (unsigned char)2 VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L86] EXPR partial_sum + a2 [L86] partial_sum = partial_sum + a2 VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L89] COND TRUE i < nb VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L92] COND TRUE i == (unsigned char)2 VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81, r2=254] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81, r2=254] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=254, r0=101, r1=81, r2=254] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L83] COND TRUE i < na VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L87] COND TRUE i == (unsigned char)3 VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L87] EXPR partial_sum + a3 [L87] partial_sum = partial_sum + a3 VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=101, r1=81, r2=254] [L89] COND TRUE i < nb VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=101, r1=81, r2=254] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=101, r1=81, r2=254] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=101, r1=81, r2=254] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=101, r1=81, r2=254] [L93] COND TRUE i == (unsigned char)3 VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=115, r0=101, r1=81, r2=254] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254, r3=128] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254, r3=128] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254, r3=128] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254, r3=128] [L116] r1 << 8U VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254, r3=128] [L116] r2 << 16U VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254, r3=128] [L116] r3 << 24U VAL [\old(a)=1929379840, \old(b)=234770789, a=1929379840, a0=-2365587456, a1=-9240576, a2=-36096, a3=-141, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254, 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. - 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, 126 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 33.3s, OverallIterations: 18, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 27.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 10 mSolverCounterUnknown, 4499 SdHoareTripleChecker+Valid, 26.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4499 mSDsluCounter, 6981 SdHoareTripleChecker+Invalid, 24.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4961 mSDsCounter, 321 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4521 IncrementalHoareTripleChecker+Invalid, 4852 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 321 mSolverCounterUnsat, 2020 mSDtfsCounter, 4521 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1125 GetRequests, 932 SyntacticMatches, 49 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1547occurred in iteration=16, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 5796 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1719 NumberOfCodeBlocks, 1719 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1961 ConstructedInterpolants, 64 QuantifiedInterpolants, 14791 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1339 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 29 InterpolantComputations, 14 PerfectInterpolantSequences, 1317/1563 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! [2023-02-17 09:11:23,796 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)