./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/byte_add_1-2.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_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-18 23:00:34,913 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 23:00:34,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 23:00:34,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 23:00:34,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 23:00:34,958 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 23:00:34,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 23:00:34,962 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 23:00:34,964 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 23:00:34,968 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 23:00:34,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 23:00:34,972 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 23:00:34,972 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 23:00:34,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 23:00:34,975 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 23:00:34,977 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 23:00:34,977 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 23:00:34,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 23:00:34,980 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 23:00:34,985 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 23:00:34,987 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 23:00:34,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 23:00:34,991 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 23:00:34,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 23:00:34,999 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 23:00:35,000 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 23:00:35,000 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 23:00:35,003 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 23:00:35,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 23:00:35,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 23:00:35,005 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 23:00:35,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 23:00:35,007 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 23:00:35,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 23:00:35,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 23:00:35,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 23:00:35,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 23:00:35,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 23:00:35,010 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 23:00:35,011 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 23:00:35,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 23:00:35,013 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-02-18 23:00:35,051 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 23:00:35,051 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 23:00:35,052 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 23:00:35,052 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 23:00:35,053 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 23:00:35,053 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 23:00:35,054 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 23:00:35,054 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 23:00:35,054 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 23:00:35,054 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 23:00:35,055 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 23:00:35,055 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 23:00:35,056 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 23:00:35,056 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 23:00:35,056 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 23:00:35,056 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 23:00:35,056 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 23:00:35,056 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 23:00:35,057 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-18 23:00:35,057 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 23:00:35,057 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 23:00:35,057 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 23:00:35,057 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 23:00:35,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 23:00:35,058 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 23:00:35,058 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 23:00:35,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 23:00:35,058 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 23:00:35,059 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 23:00:35,059 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 23:00:35,060 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 23:00:35,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 23:00:35,060 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 23:00:35,060 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 23:00:35,060 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 23:00:35,061 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 23:00:35,061 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 23:00:35,061 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 -> db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c [2023-02-18 23:00:35,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 23:00:35,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 23:00:35,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 23:00:35,336 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 23:00:35,336 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 23:00:35,338 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-2.i [2023-02-18 23:00:36,581 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 23:00:36,774 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 23:00:36,774 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-2.i [2023-02-18 23:00:36,783 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d868657ae/65222756cc31474b9dba890d3efeaa70/FLAG306b719e8 [2023-02-18 23:00:36,797 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d868657ae/65222756cc31474b9dba890d3efeaa70 [2023-02-18 23:00:36,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 23:00:36,801 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 23:00:36,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 23:00:36,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 23:00:36,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 23:00:36,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 11:00:36" (1/1) ... [2023-02-18 23:00:36,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4df01d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:00:36, skipping insertion in model container [2023-02-18 23:00:36,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 11:00:36" (1/1) ... [2023-02-18 23:00:36,815 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 23:00:36,847 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 23:00:37,001 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_1-2.i[1168,1181] [2023-02-18 23:00:37,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 23:00:37,073 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 23:00:37,091 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_1-2.i[1168,1181] [2023-02-18 23:00:37,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 23:00:37,140 INFO L208 MainTranslator]: Completed translation [2023-02-18 23:00:37,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:00:37 WrapperNode [2023-02-18 23:00:37,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 23:00:37,143 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 23:00:37,143 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 23:00:37,143 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 23:00:37,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:00:37" (1/1) ... [2023-02-18 23:00:37,166 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:00:37" (1/1) ... [2023-02-18 23:00:37,204 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 182 [2023-02-18 23:00:37,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 23:00:37,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 23:00:37,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 23:00:37,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 23:00:37,213 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:00:37" (1/1) ... [2023-02-18 23:00:37,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:00:37" (1/1) ... [2023-02-18 23:00:37,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:00:37" (1/1) ... [2023-02-18 23:00:37,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:00:37" (1/1) ... [2023-02-18 23:00:37,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:00:37" (1/1) ... [2023-02-18 23:00:37,249 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:00:37" (1/1) ... [2023-02-18 23:00:37,254 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:00:37" (1/1) ... [2023-02-18 23:00:37,256 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:00:37" (1/1) ... [2023-02-18 23:00:37,261 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 23:00:37,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 23:00:37,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 23:00:37,264 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 23:00:37,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:00:37" (1/1) ... [2023-02-18 23:00:37,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 23:00:37,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:00:37,298 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-18 23:00:37,328 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-18 23:00:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 23:00:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 23:00:37,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 23:00:37,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 23:00:37,424 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 23:00:37,425 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 23:00:37,898 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 23:00:37,906 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 23:00:37,906 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-18 23:00:37,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 11:00:37 BoogieIcfgContainer [2023-02-18 23:00:37,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 23:00:37,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 23:00:37,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 23:00:37,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 23:00:37,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 11:00:36" (1/3) ... [2023-02-18 23:00:37,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33da66e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 11:00:37, skipping insertion in model container [2023-02-18 23:00:37,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:00:37" (2/3) ... [2023-02-18 23:00:37,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33da66e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 11:00:37, skipping insertion in model container [2023-02-18 23:00:37,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 11:00:37" (3/3) ... [2023-02-18 23:00:37,939 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1-2.i [2023-02-18 23:00:37,956 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 23:00:37,956 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2023-02-18 23:00:38,022 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 23:00:38,027 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;@2a29b178, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 23:00:38,027 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2023-02-18 23:00:38,031 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-18 23:00:38,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-18 23:00:38,035 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:00:38,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-18 23:00:38,036 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-18 23:00:38,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:00:38,040 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2023-02-18 23:00:38,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:00:38,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681709620] [2023-02-18 23:00:38,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:00:38,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:00:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:00:38,213 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-18 23:00:38,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:00:38,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681709620] [2023-02-18 23:00:38,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681709620] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:00:38,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:00:38,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-18 23:00:38,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033702045] [2023-02-18 23:00:38,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:00:38,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 23:00:38,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:00:38,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 23:00:38,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 23:00:38,255 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-18 23:00:38,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:00:38,274 INFO L93 Difference]: Finished difference Result 153 states and 204 transitions. [2023-02-18 23:00:38,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 23:00:38,276 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-18 23:00:38,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:00:38,283 INFO L225 Difference]: With dead ends: 153 [2023-02-18 23:00:38,283 INFO L226 Difference]: Without dead ends: 76 [2023-02-18 23:00:38,286 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-18 23:00:38,289 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-18 23:00:38,290 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-18 23:00:38,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-18 23:00:38,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-02-18 23:00:38,327 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-18 23:00:38,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2023-02-18 23:00:38,333 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 4 [2023-02-18 23:00:38,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:00:38,334 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2023-02-18 23:00:38,334 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-18 23:00:38,336 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2023-02-18 23:00:38,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-18 23:00:38,337 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:00:38,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:00:38,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 23:00:38,339 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-18 23:00:38,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:00:38,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1140047638, now seen corresponding path program 1 times [2023-02-18 23:00:38,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:00:38,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588295930] [2023-02-18 23:00:38,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:00:38,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:00:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:00:38,570 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-18 23:00:38,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:00:38,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588295930] [2023-02-18 23:00:38,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588295930] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:00:38,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:00:38,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 23:00:38,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011411493] [2023-02-18 23:00:38,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:00:38,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 23:00:38,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:00:38,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 23:00:38,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 23:00:38,575 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-18 23:00:38,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:00:38,728 INFO L93 Difference]: Finished difference Result 162 states and 235 transitions. [2023-02-18 23:00:38,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 23:00:38,729 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-18 23:00:38,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:00:38,730 INFO L225 Difference]: With dead ends: 162 [2023-02-18 23:00:38,731 INFO L226 Difference]: Without dead ends: 108 [2023-02-18 23:00:38,731 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-18 23:00:38,732 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-18 23:00:38,733 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-18 23:00:38,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-18 23:00:38,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2023-02-18 23:00:38,741 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-18 23:00:38,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 138 transitions. [2023-02-18 23:00:38,742 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 138 transitions. Word has length 17 [2023-02-18 23:00:38,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:00:38,743 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 138 transitions. [2023-02-18 23:00:38,743 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-18 23:00:38,743 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 138 transitions. [2023-02-18 23:00:38,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 23:00:38,744 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:00:38,745 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-18 23:00:38,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 23:00:38,745 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-18 23:00:38,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:00:38,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1047629272, now seen corresponding path program 1 times [2023-02-18 23:00:38,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:00:38,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690862832] [2023-02-18 23:00:38,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:00:38,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:00:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:00:38,868 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-18 23:00:38,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:00:38,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690862832] [2023-02-18 23:00:38,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690862832] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:00:38,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:00:38,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 23:00:38,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587669106] [2023-02-18 23:00:38,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:00:38,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 23:00:38,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:00:38,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 23:00:38,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 23:00:38,872 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-18 23:00:39,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:00:39,059 INFO L93 Difference]: Finished difference Result 268 states and 359 transitions. [2023-02-18 23:00:39,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 23:00:39,060 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-18 23:00:39,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:00:39,062 INFO L225 Difference]: With dead ends: 268 [2023-02-18 23:00:39,062 INFO L226 Difference]: Without dead ends: 194 [2023-02-18 23:00:39,063 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-18 23:00:39,064 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-18 23:00:39,064 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-18 23:00:39,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-02-18 23:00:39,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 117. [2023-02-18 23:00:39,074 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-18 23:00:39,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 154 transitions. [2023-02-18 23:00:39,075 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 154 transitions. Word has length 24 [2023-02-18 23:00:39,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:00:39,076 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 154 transitions. [2023-02-18 23:00:39,076 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-18 23:00:39,076 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 154 transitions. [2023-02-18 23:00:39,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-18 23:00:39,077 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:00:39,078 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-18 23:00:39,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-18 23:00:39,078 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-18 23:00:39,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:00:39,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1685366660, now seen corresponding path program 1 times [2023-02-18 23:00:39,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:00:39,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650499229] [2023-02-18 23:00:39,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:00:39,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:00:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:00:39,258 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-18 23:00:39,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:00:39,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650499229] [2023-02-18 23:00:39,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650499229] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:00:39,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:00:39,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 23:00:39,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009707321] [2023-02-18 23:00:39,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:00:39,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 23:00:39,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:00:39,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 23:00:39,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 23:00:39,261 INFO L87 Difference]: Start difference. First operand 117 states and 154 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-18 23:00:39,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:00:39,269 INFO L93 Difference]: Finished difference Result 192 states and 255 transitions. [2023-02-18 23:00:39,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 23:00:39,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-18 23:00:39,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:00:39,270 INFO L225 Difference]: With dead ends: 192 [2023-02-18 23:00:39,270 INFO L226 Difference]: Without dead ends: 91 [2023-02-18 23:00:39,271 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-18 23:00:39,272 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 91 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 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-18 23:00:39,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 91 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:00:39,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-18 23:00:39,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-02-18 23:00:39,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 0 states have call successors, (0), 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-18 23:00:39,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 120 transitions. [2023-02-18 23:00:39,279 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 120 transitions. Word has length 27 [2023-02-18 23:00:39,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:00:39,279 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 120 transitions. [2023-02-18 23:00:39,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-18 23:00:39,280 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2023-02-18 23:00:39,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-18 23:00:39,281 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:00:39,281 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] [2023-02-18 23:00:39,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-18 23:00:39,282 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-18 23:00:39,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:00:39,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1440594285, now seen corresponding path program 1 times [2023-02-18 23:00:39,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:00:39,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340816223] [2023-02-18 23:00:39,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:00:39,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:00:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:00:39,383 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-18 23:00:39,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:00:39,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340816223] [2023-02-18 23:00:39,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340816223] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:00:39,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:00:39,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 23:00:39,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621477792] [2023-02-18 23:00:39,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:00:39,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 23:00:39,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:00:39,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 23:00:39,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 23:00:39,387 INFO L87 Difference]: Start difference. First operand 91 states and 120 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:00:39,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:00:39,549 INFO L93 Difference]: Finished difference Result 233 states and 313 transitions. [2023-02-18 23:00:39,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 23:00:39,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-18 23:00:39,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:00:39,552 INFO L225 Difference]: With dead ends: 233 [2023-02-18 23:00:39,552 INFO L226 Difference]: Without dead ends: 171 [2023-02-18 23:00:39,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 23:00:39,557 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 126 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:00:39,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 284 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:00:39,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-02-18 23:00:39,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 101. [2023-02-18 23:00:39,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.3) internal successors, (130), 100 states have internal predecessors, (130), 0 states have call successors, (0), 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-18 23:00:39,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 130 transitions. [2023-02-18 23:00:39,587 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 130 transitions. Word has length 33 [2023-02-18 23:00:39,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:00:39,588 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 130 transitions. [2023-02-18 23:00:39,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:00:39,588 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 130 transitions. [2023-02-18 23:00:39,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-18 23:00:39,589 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:00:39,589 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-18 23:00:39,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-18 23:00:39,590 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-18 23:00:39,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:00:39,591 INFO L85 PathProgramCache]: Analyzing trace with hash -884064914, now seen corresponding path program 1 times [2023-02-18 23:00:39,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:00:39,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543136201] [2023-02-18 23:00:39,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:00:39,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:00:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:00:39,690 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-18 23:00:39,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:00:39,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543136201] [2023-02-18 23:00:39,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543136201] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:00:39,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798365401] [2023-02-18 23:00:39,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:00:39,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:00:39,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:00:39,697 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-18 23:00:39,739 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-18 23:00:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:00:39,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 23:00:39,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:00:39,903 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-18 23:00:39,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:00:39,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798365401] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:00:39,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 23:00:39,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-02-18 23:00:39,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37174437] [2023-02-18 23:00:39,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:00:39,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 23:00:39,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:00:39,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 23:00:39,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-18 23:00:39,907 INFO L87 Difference]: Start difference. First operand 101 states and 130 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-18 23:00:40,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:00:40,108 INFO L93 Difference]: Finished difference Result 210 states and 302 transitions. [2023-02-18 23:00:40,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 23:00:40,109 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-18 23:00:40,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:00:40,110 INFO L225 Difference]: With dead ends: 210 [2023-02-18 23:00:40,110 INFO L226 Difference]: Without dead ends: 156 [2023-02-18 23:00:40,111 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-18 23:00:40,112 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 54 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 23:00:40,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 156 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 23:00:40,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-18 23:00:40,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 132. [2023-02-18 23:00:40,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 131 states have internal predecessors, (167), 0 states have call successors, (0), 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-18 23:00:40,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 167 transitions. [2023-02-18 23:00:40,119 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 167 transitions. Word has length 36 [2023-02-18 23:00:40,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:00:40,119 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 167 transitions. [2023-02-18 23:00:40,120 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-18 23:00:40,120 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 167 transitions. [2023-02-18 23:00:40,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-18 23:00:40,121 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:00:40,121 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-18 23:00:40,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-18 23:00:40,327 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-18 23:00:40,328 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-18 23:00:40,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:00:40,329 INFO L85 PathProgramCache]: Analyzing trace with hash -71033840, now seen corresponding path program 1 times [2023-02-18 23:00:40,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:00:40,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680072897] [2023-02-18 23:00:40,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:00:40,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:00:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:00:40,545 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-18 23:00:40,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:00:40,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680072897] [2023-02-18 23:00:40,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680072897] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:00:40,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830337115] [2023-02-18 23:00:40,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:00:40,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:00:40,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:00:40,549 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-18 23:00:40,569 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-18 23:00:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:00:40,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-18 23:00:40,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:00:40,667 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-18 23:00:40,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:00:40,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830337115] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:00:40,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 23:00:40,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2023-02-18 23:00:40,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759402730] [2023-02-18 23:00:40,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:00:40,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 23:00:40,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:00:40,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 23:00:40,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-18 23:00:40,675 INFO L87 Difference]: Start difference. First operand 132 states and 167 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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-18 23:00:40,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:00:40,772 INFO L93 Difference]: Finished difference Result 246 states and 325 transitions. [2023-02-18 23:00:40,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 23:00:40,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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-18 23:00:40,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:00:40,774 INFO L225 Difference]: With dead ends: 246 [2023-02-18 23:00:40,774 INFO L226 Difference]: Without dead ends: 131 [2023-02-18 23:00:40,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-18 23:00:40,777 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 148 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:00:40,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 125 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:00:40,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-18 23:00:40,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2023-02-18 23:00:40,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.2619047619047619) internal successors, (159), 126 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-18 23:00:40,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 159 transitions. [2023-02-18 23:00:40,782 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 159 transitions. Word has length 43 [2023-02-18 23:00:40,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:00:40,783 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 159 transitions. [2023-02-18 23:00:40,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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-18 23:00:40,783 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 159 transitions. [2023-02-18 23:00:40,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-18 23:00:40,784 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:00:40,784 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-18 23:00:40,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-18 23:00:40,985 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-18 23:00:40,985 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-18 23:00:40,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:00:40,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1390557187, now seen corresponding path program 1 times [2023-02-18 23:00:40,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:00:40,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184178262] [2023-02-18 23:00:40,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:00:40,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:00:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:00:41,157 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-18 23:00:41,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:00:41,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184178262] [2023-02-18 23:00:41,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184178262] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:00:41,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847901017] [2023-02-18 23:00:41,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:00:41,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:00:41,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:00:41,160 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-18 23:00:41,186 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-18 23:00:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:00:41,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 23:00:41,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:00:41,266 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 23:00:41,266 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:00:41,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847901017] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:00:41,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 23:00:41,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2023-02-18 23:00:41,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957220970] [2023-02-18 23:00:41,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:00:41,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 23:00:41,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:00:41,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 23:00:41,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-18 23:00:41,269 INFO L87 Difference]: Start difference. First operand 127 states and 159 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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-18 23:00:41,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:00:41,386 INFO L93 Difference]: Finished difference Result 283 states and 380 transitions. [2023-02-18 23:00:41,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 23:00:41,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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-18 23:00:41,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:00:41,388 INFO L225 Difference]: With dead ends: 283 [2023-02-18 23:00:41,388 INFO L226 Difference]: Without dead ends: 171 [2023-02-18 23:00:41,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-18 23:00:41,390 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 42 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:00:41,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 191 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:00:41,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-02-18 23:00:41,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 149. [2023-02-18 23:00:41,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.25) internal successors, (185), 148 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:00:41,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 185 transitions. [2023-02-18 23:00:41,396 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 185 transitions. Word has length 52 [2023-02-18 23:00:41,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:00:41,397 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 185 transitions. [2023-02-18 23:00:41,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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-18 23:00:41,397 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 185 transitions. [2023-02-18 23:00:41,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-02-18 23:00:41,398 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:00:41,399 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-18 23:00:41,407 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-18 23:00:41,605 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-18 23:00:41,605 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-18 23:00:41,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:00:41,606 INFO L85 PathProgramCache]: Analyzing trace with hash 360401152, now seen corresponding path program 1 times [2023-02-18 23:00:41,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:00:41,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721879963] [2023-02-18 23:00:41,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:00:41,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:00:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:00:41,851 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-18 23:00:41,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:00:41,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721879963] [2023-02-18 23:00:41,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721879963] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:00:41,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101438101] [2023-02-18 23:00:41,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:00:41,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:00:41,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:00:41,854 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-18 23:00:41,857 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-18 23:00:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:00:41,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 23:00:41,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:00:41,981 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-18 23:00:41,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:00:41,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101438101] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:00:41,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 23:00:41,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2023-02-18 23:00:41,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711847659] [2023-02-18 23:00:41,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:00:41,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 23:00:41,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:00:41,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 23:00:41,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-02-18 23:00:41,984 INFO L87 Difference]: Start difference. First operand 149 states and 185 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:00:42,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:00:42,110 INFO L93 Difference]: Finished difference Result 327 states and 431 transitions. [2023-02-18 23:00:42,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 23:00:42,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2023-02-18 23:00:42,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:00:42,113 INFO L225 Difference]: With dead ends: 327 [2023-02-18 23:00:42,113 INFO L226 Difference]: Without dead ends: 191 [2023-02-18 23:00:42,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-02-18 23:00:42,116 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 42 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:00:42,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 193 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:00:42,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-02-18 23:00:42,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 171. [2023-02-18 23:00:42,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.2411764705882353) internal successors, (211), 170 states have internal predecessors, (211), 0 states have call successors, (0), 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-18 23:00:42,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 211 transitions. [2023-02-18 23:00:42,123 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 211 transitions. Word has length 68 [2023-02-18 23:00:42,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:00:42,124 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 211 transitions. [2023-02-18 23:00:42,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:00:42,124 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 211 transitions. [2023-02-18 23:00:42,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-02-18 23:00:42,125 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:00:42,125 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-18 23:00:42,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-18 23:00:42,334 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-18 23:00:42,335 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-18 23:00:42,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:00:42,336 INFO L85 PathProgramCache]: Analyzing trace with hash 629870863, now seen corresponding path program 1 times [2023-02-18 23:00:42,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:00:42,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395993623] [2023-02-18 23:00:42,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:00:42,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:00:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:00:42,501 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-18 23:00:42,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:00:42,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395993623] [2023-02-18 23:00:42,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395993623] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:00:42,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:00:42,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 23:00:42,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360432312] [2023-02-18 23:00:42,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:00:42,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 23:00:42,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:00:42,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 23:00:42,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 23:00:42,505 INFO L87 Difference]: Start difference. First operand 171 states and 211 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:00:42,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:00:42,747 INFO L93 Difference]: Finished difference Result 645 states and 803 transitions. [2023-02-18 23:00:42,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 23:00:42,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2023-02-18 23:00:42,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:00:42,750 INFO L225 Difference]: With dead ends: 645 [2023-02-18 23:00:42,750 INFO L226 Difference]: Without dead ends: 501 [2023-02-18 23:00:42,750 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-18 23:00:42,751 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 229 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 23:00:42,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 462 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 23:00:42,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2023-02-18 23:00:42,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 171. [2023-02-18 23:00:42,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.2411764705882353) internal successors, (211), 170 states have internal predecessors, (211), 0 states have call successors, (0), 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-18 23:00:42,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 211 transitions. [2023-02-18 23:00:42,763 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 211 transitions. Word has length 84 [2023-02-18 23:00:42,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:00:42,764 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 211 transitions. [2023-02-18 23:00:42,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:00:42,764 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 211 transitions. [2023-02-18 23:00:42,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-02-18 23:00:42,765 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:00:42,765 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-18 23:00:42,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-18 23:00:42,766 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-18 23:00:42,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:00:42,767 INFO L85 PathProgramCache]: Analyzing trace with hash -2117430847, now seen corresponding path program 1 times [2023-02-18 23:00:42,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:00:42,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173145421] [2023-02-18 23:00:42,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:00:42,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:00:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:00:42,952 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-18 23:00:42,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:00:42,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173145421] [2023-02-18 23:00:42,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173145421] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:00:42,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:00:42,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 23:00:42,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234896783] [2023-02-18 23:00:42,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:00:42,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 23:00:42,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:00:42,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 23:00:42,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 23:00:42,955 INFO L87 Difference]: Start difference. First operand 171 states and 211 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:00:43,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:00:43,315 INFO L93 Difference]: Finished difference Result 815 states and 1013 transitions. [2023-02-18 23:00:43,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 23:00:43,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2023-02-18 23:00:43,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:00:43,318 INFO L225 Difference]: With dead ends: 815 [2023-02-18 23:00:43,318 INFO L226 Difference]: Without dead ends: 671 [2023-02-18 23:00:43,319 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-18 23:00:43,319 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 343 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 23:00:43,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 615 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 23:00:43,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2023-02-18 23:00:43,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 171. [2023-02-18 23:00:43,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.2411764705882353) internal successors, (211), 170 states have internal predecessors, (211), 0 states have call successors, (0), 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-18 23:00:43,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 211 transitions. [2023-02-18 23:00:43,327 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 211 transitions. Word has length 87 [2023-02-18 23:00:43,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:00:43,328 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 211 transitions. [2023-02-18 23:00:43,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:00:43,328 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 211 transitions. [2023-02-18 23:00:43,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-02-18 23:00:43,329 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:00:43,329 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-18 23:00:43,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-18 23:00:43,330 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-18 23:00:43,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:00:43,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1885697052, now seen corresponding path program 1 times [2023-02-18 23:00:43,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:00:43,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982063848] [2023-02-18 23:00:43,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:00:43,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:00:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:00:43,472 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-18 23:00:43,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:00:43,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982063848] [2023-02-18 23:00:43,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982063848] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:00:43,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747621840] [2023-02-18 23:00:43,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:00:43,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:00:43,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:00:43,477 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-18 23:00:43,489 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-18 23:00:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:00:43,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 23:00:43,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:00:43,594 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-02-18 23:00:43,594 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 23:00:43,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747621840] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:00:43,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 23:00:43,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-02-18 23:00:43,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659160008] [2023-02-18 23:00:43,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:00:43,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 23:00:43,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:00:43,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 23:00:43,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-18 23:00:43,597 INFO L87 Difference]: Start difference. First operand 171 states and 211 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:00:43,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:00:43,665 INFO L93 Difference]: Finished difference Result 469 states and 583 transitions. [2023-02-18 23:00:43,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 23:00:43,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2023-02-18 23:00:43,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:00:43,667 INFO L225 Difference]: With dead ends: 469 [2023-02-18 23:00:43,667 INFO L226 Difference]: Without dead ends: 325 [2023-02-18 23:00:43,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-18 23:00:43,668 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 82 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:00:43,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 180 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:00:43,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2023-02-18 23:00:43,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 308. [2023-02-18 23:00:43,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.250814332247557) internal successors, (384), 307 states have internal predecessors, (384), 0 states have call successors, (0), 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-18 23:00:43,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 384 transitions. [2023-02-18 23:00:43,678 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 384 transitions. Word has length 87 [2023-02-18 23:00:43,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:00:43,679 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 384 transitions. [2023-02-18 23:00:43,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:00:43,679 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 384 transitions. [2023-02-18 23:00:43,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-02-18 23:00:43,680 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:00:43,680 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-18 23:00:43,686 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-18 23:00:43,886 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-18 23:00:43,887 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-18 23:00:43,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:00:43,887 INFO L85 PathProgramCache]: Analyzing trace with hash -312709955, now seen corresponding path program 1 times [2023-02-18 23:00:43,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:00:43,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118612696] [2023-02-18 23:00:43,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:00:43,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:00:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:00:44,062 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-18 23:00:44,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:00:44,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118612696] [2023-02-18 23:00:44,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118612696] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:00:44,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:00:44,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 23:00:44,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626829506] [2023-02-18 23:00:44,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:00:44,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 23:00:44,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:00:44,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 23:00:44,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-18 23:00:44,067 INFO L87 Difference]: Start difference. First operand 308 states and 384 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:00:44,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:00:44,552 INFO L93 Difference]: Finished difference Result 837 states and 1036 transitions. [2023-02-18 23:00:44,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 23:00:44,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2023-02-18 23:00:44,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:00:44,555 INFO L225 Difference]: With dead ends: 837 [2023-02-18 23:00:44,555 INFO L226 Difference]: Without dead ends: 693 [2023-02-18 23:00:44,556 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-18 23:00:44,556 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 455 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 23:00:44,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 924 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 23:00:44,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2023-02-18 23:00:44,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 304. [2023-02-18 23:00:44,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 1.2541254125412542) internal successors, (380), 303 states have internal predecessors, (380), 0 states have call successors, (0), 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-18 23:00:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 380 transitions. [2023-02-18 23:00:44,570 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 380 transitions. Word has length 89 [2023-02-18 23:00:44,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:00:44,571 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 380 transitions. [2023-02-18 23:00:44,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:00:44,571 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 380 transitions. [2023-02-18 23:00:44,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-02-18 23:00:44,572 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:00:44,572 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] [2023-02-18 23:00:44,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-18 23:00:44,573 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-18 23:00:44,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:00:44,574 INFO L85 PathProgramCache]: Analyzing trace with hash 387927389, now seen corresponding path program 1 times [2023-02-18 23:00:44,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:00:44,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613093313] [2023-02-18 23:00:44,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:00:44,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:00:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:00:44,747 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-18 23:00:44,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:00:44,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613093313] [2023-02-18 23:00:44,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613093313] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:00:44,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785892679] [2023-02-18 23:00:44,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:00:44,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:00:44,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:00:44,753 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-18 23:00:44,756 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-18 23:00:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:00:44,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 23:00:44,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:00:44,971 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-02-18 23:00:44,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:00:45,079 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 55 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-18 23:00:45,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785892679] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:00:45,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 23:00:45,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 15 [2023-02-18 23:00:45,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208023063] [2023-02-18 23:00:45,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 23:00:45,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 23:00:45,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:00:45,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 23:00:45,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2023-02-18 23:00:45,082 INFO L87 Difference]: Start difference. First operand 304 states and 380 transitions. Second operand has 15 states, 15 states have (on average 9.533333333333333) internal successors, (143), 15 states have internal predecessors, (143), 0 states have call successors, (0), 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-18 23:00:45,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:00:45,885 INFO L93 Difference]: Finished difference Result 1285 states and 1657 transitions. [2023-02-18 23:00:45,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-18 23:00:45,885 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.533333333333333) internal successors, (143), 15 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2023-02-18 23:00:45,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:00:45,889 INFO L225 Difference]: With dead ends: 1285 [2023-02-18 23:00:45,889 INFO L226 Difference]: Without dead ends: 994 [2023-02-18 23:00:45,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 169 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=317, Unknown=0, NotChecked=0, Total=506 [2023-02-18 23:00:45,890 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 750 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-18 23:00:45,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 763 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-18 23:00:45,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2023-02-18 23:00:45,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 826. [2023-02-18 23:00:45,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 825 states have (on average 1.303030303030303) internal successors, (1075), 825 states have internal predecessors, (1075), 0 states have call successors, (0), 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-18 23:00:45,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1075 transitions. [2023-02-18 23:00:45,921 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1075 transitions. Word has length 90 [2023-02-18 23:00:45,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:00:45,921 INFO L495 AbstractCegarLoop]: Abstraction has 826 states and 1075 transitions. [2023-02-18 23:00:45,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.533333333333333) internal successors, (143), 15 states have internal predecessors, (143), 0 states have call successors, (0), 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-18 23:00:45,922 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1075 transitions. [2023-02-18 23:00:45,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-02-18 23:00:45,923 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:00:45,923 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-18 23:00:45,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-18 23:00:46,130 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-18 23:00:46,131 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-18 23:00:46,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:00:46,131 INFO L85 PathProgramCache]: Analyzing trace with hash -910381429, now seen corresponding path program 1 times [2023-02-18 23:00:46,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:00:46,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035893685] [2023-02-18 23:00:46,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:00:46,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:00:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:00:46,424 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 33 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-18 23:00:46,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:00:46,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035893685] [2023-02-18 23:00:46,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035893685] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:00:46,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310814464] [2023-02-18 23:00:46,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:00:46,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:00:46,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:00:46,426 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-18 23:00:46,456 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-18 23:00:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:00:46,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-18 23:00:46,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:00:46,696 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 28 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-18 23:00:46,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:00:46,772 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-18 23:00:46,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310814464] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:00:46,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 23:00:46,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2023-02-18 23:00:46,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866806433] [2023-02-18 23:00:46,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 23:00:46,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-18 23:00:46,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:00:46,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-18 23:00:46,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2023-02-18 23:00:46,775 INFO L87 Difference]: Start difference. First operand 826 states and 1075 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-18 23:00:48,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:00:48,059 INFO L93 Difference]: Finished difference Result 7282 states and 9027 transitions. [2023-02-18 23:00:48,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-18 23:00:48,060 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-18 23:00:48,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:00:48,083 INFO L225 Difference]: With dead ends: 7282 [2023-02-18 23:00:48,083 INFO L226 Difference]: Without dead ends: 6311 [2023-02-18 23:00:48,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 175 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=403, Invalid=1079, Unknown=0, NotChecked=0, Total=1482 [2023-02-18 23:00:48,087 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 1233 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1233 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-18 23:00:48,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1233 Valid, 1246 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-18 23:00:48,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6311 states. [2023-02-18 23:00:48,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6311 to 1410. [2023-02-18 23:00:48,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1409 states have (on average 1.3733144073811214) internal successors, (1935), 1409 states have internal predecessors, (1935), 0 states have call successors, (0), 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-18 23:00:48,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 1935 transitions. [2023-02-18 23:00:48,239 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 1935 transitions. Word has length 95 [2023-02-18 23:00:48,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:00:48,239 INFO L495 AbstractCegarLoop]: Abstraction has 1410 states and 1935 transitions. [2023-02-18 23:00:48,239 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-18 23:00:48,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 1935 transitions. [2023-02-18 23:00:48,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-02-18 23:00:48,244 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:00:48,244 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-18 23:00:48,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-18 23:00:48,451 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-18 23:00:48,451 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-18 23:00:48,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:00:48,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1586105425, now seen corresponding path program 1 times [2023-02-18 23:00:48,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:00:48,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724817888] [2023-02-18 23:00:48,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:00:48,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:00:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:00:48,576 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 72 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-18 23:00:48,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:00:48,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724817888] [2023-02-18 23:00:48,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724817888] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:00:48,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704382648] [2023-02-18 23:00:48,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:00:48,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:00:48,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:00:48,579 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-18 23:00:48,604 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-18 23:00:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:00:48,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 23:00:48,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:00:48,686 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-18 23:00:48,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:00:50,382 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-18 23:00:50,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704382648] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:00:50,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 23:00:50,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2023-02-18 23:00:50,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844476070] [2023-02-18 23:00:50,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 23:00:50,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 23:00:50,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:00:50,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 23:00:50,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-02-18 23:00:50,386 INFO L87 Difference]: Start difference. First operand 1410 states and 1935 transitions. Second operand has 10 states, 10 states have (on average 12.9) internal successors, (129), 10 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:00:51,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:00:51,244 INFO L93 Difference]: Finished difference Result 4533 states and 6300 transitions. [2023-02-18 23:00:51,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-18 23:00:51,245 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.9) internal successors, (129), 10 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2023-02-18 23:00:51,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:00:51,255 INFO L225 Difference]: With dead ends: 4533 [2023-02-18 23:00:51,255 INFO L226 Difference]: Without dead ends: 2823 [2023-02-18 23:00:51,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 208 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2023-02-18 23:00:51,261 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 526 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-18 23:00:51,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 423 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-18 23:00:51,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2023-02-18 23:00:51,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 2302. [2023-02-18 23:00:51,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2302 states, 2301 states have (on average 1.313342025206432) internal successors, (3022), 2301 states have internal predecessors, (3022), 0 states have call successors, (0), 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-18 23:00:51,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 3022 transitions. [2023-02-18 23:00:51,392 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 3022 transitions. Word has length 101 [2023-02-18 23:00:51,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:00:51,394 INFO L495 AbstractCegarLoop]: Abstraction has 2302 states and 3022 transitions. [2023-02-18 23:00:51,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.9) internal successors, (129), 10 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:00:51,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 3022 transitions. [2023-02-18 23:00:51,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-02-18 23:00:51,397 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:00:51,397 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-18 23:00:51,406 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-18 23:00:51,603 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-18 23:00:51,604 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-18 23:00:51,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:00:51,605 INFO L85 PathProgramCache]: Analyzing trace with hash -702020810, now seen corresponding path program 1 times [2023-02-18 23:00:51,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:00:51,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785883922] [2023-02-18 23:00:51,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:00:51,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:00:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 23:00:51,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 23:00:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 23:00:51,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 23:00:51,722 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-18 23:00:51,724 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 41 remaining) [2023-02-18 23:00:51,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 41 remaining) [2023-02-18 23:00:51,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 41 remaining) [2023-02-18 23:00:51,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 41 remaining) [2023-02-18 23:00:51,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 41 remaining) [2023-02-18 23:00:51,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 41 remaining) [2023-02-18 23:00:51,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 41 remaining) [2023-02-18 23:00:51,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 41 remaining) [2023-02-18 23:00:51,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 41 remaining) [2023-02-18 23:00:51,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 41 remaining) [2023-02-18 23:00:51,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 41 remaining) [2023-02-18 23:00:51,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 41 remaining) [2023-02-18 23:00:51,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 41 remaining) [2023-02-18 23:00:51,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 41 remaining) [2023-02-18 23:00:51,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 41 remaining) [2023-02-18 23:00:51,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 41 remaining) [2023-02-18 23:00:51,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 41 remaining) [2023-02-18 23:00:51,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 41 remaining) [2023-02-18 23:00:51,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 41 remaining) [2023-02-18 23:00:51,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 41 remaining) [2023-02-18 23:00:51,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 41 remaining) [2023-02-18 23:00:51,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 41 remaining) [2023-02-18 23:00:51,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 41 remaining) [2023-02-18 23:00:51,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 41 remaining) [2023-02-18 23:00:51,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 41 remaining) [2023-02-18 23:00:51,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 41 remaining) [2023-02-18 23:00:51,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 41 remaining) [2023-02-18 23:00:51,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 41 remaining) [2023-02-18 23:00:51,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 41 remaining) [2023-02-18 23:00:51,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 41 remaining) [2023-02-18 23:00:51,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 41 remaining) [2023-02-18 23:00:51,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 41 remaining) [2023-02-18 23:00:51,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 41 remaining) [2023-02-18 23:00:51,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 41 remaining) [2023-02-18 23:00:51,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 41 remaining) [2023-02-18 23:00:51,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 41 remaining) [2023-02-18 23:00:51,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 41 remaining) [2023-02-18 23:00:51,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 41 remaining) [2023-02-18 23:00:51,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 41 remaining) [2023-02-18 23:00:51,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 41 remaining) [2023-02-18 23:00:51,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 41 remaining) [2023-02-18 23:00:51,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-18 23:00:51,738 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:00:51,743 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 23:00:51,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 11:00:51 BoogieIcfgContainer [2023-02-18 23:00:51,837 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 23:00:51,837 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 23:00:51,838 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 23:00:51,838 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 23:00:51,838 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 11:00:37" (3/4) ... [2023-02-18 23:00:51,840 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-18 23:00:51,926 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 23:00:51,927 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 23:00:51,927 INFO L158 Benchmark]: Toolchain (without parser) took 15126.62ms. Allocated memory was 127.9MB in the beginning and 283.1MB in the end (delta: 155.2MB). Free memory was 83.0MB in the beginning and 154.1MB in the end (delta: -71.1MB). Peak memory consumption was 85.9MB. Max. memory is 16.1GB. [2023-02-18 23:00:51,928 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 127.9MB. Free memory is still 95.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 23:00:51,928 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.28ms. Allocated memory is still 127.9MB. Free memory was 83.0MB in the beginning and 70.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-18 23:00:51,929 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.72ms. Allocated memory is still 127.9MB. Free memory was 70.9MB in the beginning and 67.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-18 23:00:51,929 INFO L158 Benchmark]: Boogie Preprocessor took 57.14ms. Allocated memory is still 127.9MB. Free memory was 67.6MB in the beginning and 65.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 23:00:51,930 INFO L158 Benchmark]: RCFGBuilder took 646.04ms. Allocated memory is still 127.9MB. Free memory was 65.5MB in the beginning and 95.1MB in the end (delta: -29.6MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2023-02-18 23:00:51,930 INFO L158 Benchmark]: TraceAbstraction took 13910.26ms. Allocated memory was 161.5MB in the beginning and 283.1MB in the end (delta: 121.6MB). Free memory was 132.9MB in the beginning and 162.5MB in the end (delta: -29.6MB). Peak memory consumption was 90.8MB. Max. memory is 16.1GB. [2023-02-18 23:00:51,930 INFO L158 Benchmark]: Witness Printer took 89.18ms. Allocated memory is still 283.1MB. Free memory was 162.5MB in the beginning and 154.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-18 23:00:51,934 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 127.9MB. Free memory is still 95.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.28ms. Allocated memory is still 127.9MB. Free memory was 83.0MB in the beginning and 70.9MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.72ms. Allocated memory is still 127.9MB. Free memory was 70.9MB in the beginning and 67.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.14ms. Allocated memory is still 127.9MB. Free memory was 67.6MB in the beginning and 65.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 646.04ms. Allocated memory is still 127.9MB. Free memory was 65.5MB in the beginning and 95.1MB in the end (delta: -29.6MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13910.26ms. Allocated memory was 161.5MB in the beginning and 283.1MB in the end (delta: 121.6MB). Free memory was 132.9MB in the beginning and 162.5MB in the end (delta: -29.6MB). Peak memory consumption was 90.8MB. Max. memory is 16.1GB. * Witness Printer took 89.18ms. Allocated memory is still 283.1MB. Free memory was 162.5MB in the beginning and 154.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 116]: integer overflow possible integer overflow possible We found a FailurePath: [L124] unsigned int a, b, r; [L126] b = __VERIFIER_nondet_uint() [L128] a = 234770789 [L130] 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)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, na=4] [L68] nb = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, na=4, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, na=4, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, 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)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, 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)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L90] COND TRUE i == (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=255] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=255] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=255] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=255] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=255] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=255, r0=255] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=255, r0=255] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=255, r0=255] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=255, r0=255] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=255, r0=255] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=255] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=255] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=255] [L85] COND TRUE i == (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=255] [L85] EXPR partial_sum + a1 [L85] partial_sum = partial_sum + a1 VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=255] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=255] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=255] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=255] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=255] [L91] COND TRUE i == (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=255] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=255] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=255] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=255] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=255] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=255] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=255, r1=81] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=255, r1=81] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=255, r1=81] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=81, r0=255, 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)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=255, r1=81] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=255, r1=81] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=255, r1=81] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=255, r1=81] [L86] COND TRUE i == (unsigned char)2 VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=255, r1=81] [L86] EXPR partial_sum + a2 [L86] partial_sum = partial_sum + a2 VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=255, r1=81] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=255, r1=81] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=255, r1=81] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=255, r1=81] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=255, r1=81] [L92] COND TRUE i == (unsigned char)2 VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=255, r1=81] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=255, r1=81] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=255, r1=81] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=255, r1=81] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=255, r1=81] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=255, r1=81] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=255, r1=81, r2=254] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=255, r1=81, r2=254] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=254, r0=255, 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)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=255, r1=81, r2=254] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=255, r1=81, r2=254] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=255, r1=81, r2=254] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=255, r1=81, r2=254] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=255, r1=81, r2=254] [L87] COND TRUE i == (unsigned char)3 VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=255, r1=81, r2=254] [L87] EXPR partial_sum + a3 [L87] partial_sum = partial_sum + a3 VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=255, r1=81, r2=254] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=255, r1=81, r2=254] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=255, r1=81, r2=254] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=255, r1=81, r2=254] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=255, r1=81, r2=254] [L93] COND TRUE i == (unsigned char)3 VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=255, r1=81, r2=254] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=255, r1=81, r2=254] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=255, r1=81, r2=254] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=255, r1=81, r2=254] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=255, r1=81, r2=254] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=255, r1=81, r2=254] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=255, r1=81, r2=254, r3=128] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=255, r1=81, r2=254, r3=128] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=255, r1=81, r2=254, r3=128] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=255, r1=81, r2=254, r3=128] [L116] r1 << 8U VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=255, r1=81, r2=254, r3=128] [L116] r2 << 16U VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=255, r1=81, r2=254, r3=128] [L116] r3 << 24U VAL [\old(a)=234770789, \old(b)=1929379994, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379994, b0=-2365587302, b1=-9240576, b2=-36096, b3=-141, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=255, 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: 13.7s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4303 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4303 mSDsluCounter, 6229 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4410 mSDsCounter, 298 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3846 IncrementalHoareTripleChecker+Invalid, 4144 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 298 mSolverCounterUnsat, 1819 mSDtfsCounter, 3846 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1024 GetRequests, 845 SyntacticMatches, 40 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2302occurred in iteration=16, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 7047 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1614 NumberOfCodeBlocks, 1614 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1768 ConstructedInterpolants, 42 QuantifiedInterpolants, 16140 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1333 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 27 InterpolantComputations, 13 PerfectInterpolantSequences, 1136/1375 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-18 23:00:51,969 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)