./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/byte_add_2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add_2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b7afe619831a9e012e7620d6e0b03d3495f1fd3efb2bdea6bfa4bb1568774e6 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 20:49:28,234 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 20:49:28,237 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 20:49:28,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 20:49:28,287 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 20:49:28,291 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 20:49:28,292 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 20:49:28,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 20:49:28,299 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 20:49:28,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 20:49:28,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 20:49:28,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 20:49:28,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 20:49:28,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 20:49:28,309 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 20:49:28,312 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 20:49:28,313 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 20:49:28,314 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 20:49:28,315 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 20:49:28,318 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 20:49:28,320 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 20:49:28,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 20:49:28,323 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 20:49:28,324 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 20:49:28,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 20:49:28,328 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 20:49:28,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 20:49:28,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 20:49:28,329 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 20:49:28,330 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 20:49:28,330 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 20:49:28,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 20:49:28,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 20:49:28,333 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 20:49:28,334 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 20:49:28,334 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 20:49:28,335 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 20:49:28,335 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 20:49:28,335 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 20:49:28,336 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 20:49:28,337 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 20:49:28,337 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2021-12-21 20:49:28,364 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 20:49:28,365 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 20:49:28,367 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 20:49:28,367 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 20:49:28,368 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 20:49:28,368 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 20:49:28,368 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 20:49:28,368 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 20:49:28,369 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 20:49:28,369 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 20:49:28,370 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 20:49:28,370 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 20:49:28,370 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 20:49:28,370 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 20:49:28,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 20:49:28,370 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 20:49:28,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 20:49:28,371 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 20:49:28,371 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-12-21 20:49:28,371 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 20:49:28,371 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 20:49:28,371 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 20:49:28,371 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 20:49:28,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 20:49:28,372 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 20:49:28,372 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 20:49:28,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 20:49:28,374 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 20:49:28,374 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 20:49:28,374 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 20:49:28,374 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 20:49:28,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 20:49:28,375 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 20:49:28,375 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 20:49:28,375 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8b7afe619831a9e012e7620d6e0b03d3495f1fd3efb2bdea6bfa4bb1568774e6 [2021-12-21 20:49:28,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 20:49:28,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 20:49:28,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 20:49:28,609 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 20:49:28,609 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 20:49:28,610 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-1.i [2021-12-21 20:49:28,649 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b084f8c8/27c52fc114a24fab84c092c767271008/FLAG5d9d67cd0 [2021-12-21 20:49:28,971 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 20:49:28,972 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-1.i [2021-12-21 20:49:28,981 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b084f8c8/27c52fc114a24fab84c092c767271008/FLAG5d9d67cd0 [2021-12-21 20:49:29,385 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b084f8c8/27c52fc114a24fab84c092c767271008 [2021-12-21 20:49:29,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 20:49:29,388 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 20:49:29,389 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 20:49:29,389 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 20:49:29,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 20:49:29,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:49:29" (1/1) ... [2021-12-21 20:49:29,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35d92bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:49:29, skipping insertion in model container [2021-12-21 20:49:29,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:49:29" (1/1) ... [2021-12-21 20:49:29,397 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 20:49:29,413 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 20:49:29,557 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-1.i[1168,1181] [2021-12-21 20:49:29,629 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 20:49:29,650 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 20:49:29,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-1.i[1168,1181] [2021-12-21 20:49:29,712 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 20:49:29,721 INFO L208 MainTranslator]: Completed translation [2021-12-21 20:49:29,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:49:29 WrapperNode [2021-12-21 20:49:29,722 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 20:49:29,723 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 20:49:29,723 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 20:49:29,723 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 20:49:29,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:49:29" (1/1) ... [2021-12-21 20:49:29,755 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:49:29" (1/1) ... [2021-12-21 20:49:29,792 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 161 [2021-12-21 20:49:29,792 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 20:49:29,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 20:49:29,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 20:49:29,793 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 20:49:29,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:49:29" (1/1) ... [2021-12-21 20:49:29,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:49:29" (1/1) ... [2021-12-21 20:49:29,813 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:49:29" (1/1) ... [2021-12-21 20:49:29,814 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:49:29" (1/1) ... [2021-12-21 20:49:29,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:49:29" (1/1) ... [2021-12-21 20:49:29,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:49:29" (1/1) ... [2021-12-21 20:49:29,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:49:29" (1/1) ... [2021-12-21 20:49:29,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 20:49:29,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 20:49:29,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 20:49:29,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 20:49:29,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:49:29" (1/1) ... [2021-12-21 20:49:29,861 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 20:49:29,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:49:29,878 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) [2021-12-21 20:49:29,896 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 [2021-12-21 20:49:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 20:49:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 20:49:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 20:49:29,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 20:49:29,958 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 20:49:29,959 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 20:49:30,181 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 20:49:30,186 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 20:49:30,186 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-21 20:49:30,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:49:30 BoogieIcfgContainer [2021-12-21 20:49:30,188 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 20:49:30,189 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 20:49:30,189 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 20:49:30,192 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 20:49:30,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 08:49:29" (1/3) ... [2021-12-21 20:49:30,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eaf813b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:49:30, skipping insertion in model container [2021-12-21 20:49:30,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:49:29" (2/3) ... [2021-12-21 20:49:30,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eaf813b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:49:30, skipping insertion in model container [2021-12-21 20:49:30,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:49:30" (3/3) ... [2021-12-21 20:49:30,194 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add_2-1.i [2021-12-21 20:49:30,198 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 20:49:30,198 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2021-12-21 20:49:30,229 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 20:49:30,234 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 20:49:30,235 INFO L340 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2021-12-21 20:49:30,249 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 75 states have (on average 1.9066666666666667) internal successors, (143), 113 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) [2021-12-21 20:49:30,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-21 20:49:30,257 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:30,258 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-21 20:49:30,258 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-21 20:49:30,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:30,265 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2021-12-21 20:49:30,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:30,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355603543] [2021-12-21 20:49:30,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:30,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:30,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:49:30,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:30,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355603543] [2021-12-21 20:49:30,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355603543] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:30,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:30,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-12-21 20:49:30,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231233192] [2021-12-21 20:49:30,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:30,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-21 20:49:30,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:30,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-21 20:49:30,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 20:49:30,420 INFO L87 Difference]: Start difference. First operand has 114 states, 75 states have (on average 1.9066666666666667) internal successors, (143), 113 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) 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) [2021-12-21 20:49:30,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:30,444 INFO L93 Difference]: Finished difference Result 135 states and 177 transitions. [2021-12-21 20:49:30,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 20:49:30,446 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 [2021-12-21 20:49:30,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:30,453 INFO L225 Difference]: With dead ends: 135 [2021-12-21 20:49:30,453 INFO L226 Difference]: Without dead ends: 69 [2021-12-21 20:49:30,456 INFO L932 BasicCegarLoop]: 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 [2021-12-21 20:49:30,461 INFO L933 BasicCegarLoop]: 103 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, 103 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 [2021-12-21 20:49:30,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:49:30,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-12-21 20:49:30,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-12-21 20:49:30,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 68 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:30,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2021-12-21 20:49:30,495 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 4 [2021-12-21 20:49:30,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:30,495 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2021-12-21 20:49:30,496 INFO L471 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) [2021-12-21 20:49:30,496 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2021-12-21 20:49:30,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-21 20:49:30,497 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:30,497 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:49:30,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 20:49:30,498 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-21 20:49:30,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:30,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1944470950, now seen corresponding path program 1 times [2021-12-21 20:49:30,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:30,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752083420] [2021-12-21 20:49:30,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:30,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:49:30,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:30,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752083420] [2021-12-21 20:49:30,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752083420] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:30,628 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:30,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 20:49:30,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38631442] [2021-12-21 20:49:30,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:30,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 20:49:30,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:30,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 20:49:30,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:49:30,631 INFO L87 Difference]: Start difference. First operand 69 states and 95 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:30,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:30,727 INFO L93 Difference]: Finished difference Result 145 states and 212 transitions. [2021-12-21 20:49:30,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 20:49:30,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-21 20:49:30,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:30,728 INFO L225 Difference]: With dead ends: 145 [2021-12-21 20:49:30,728 INFO L226 Difference]: Without dead ends: 98 [2021-12-21 20:49:30,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:49:30,730 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 30 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:30,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 121 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:49:30,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-21 20:49:30,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2021-12-21 20:49:30,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:30,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 124 transitions. [2021-12-21 20:49:30,736 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 124 transitions. Word has length 13 [2021-12-21 20:49:30,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:30,737 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 124 transitions. [2021-12-21 20:49:30,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:30,737 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 124 transitions. [2021-12-21 20:49:30,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-21 20:49:30,738 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:30,738 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:49:30,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 20:49:30,738 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-21 20:49:30,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:30,739 INFO L85 PathProgramCache]: Analyzing trace with hash 565405448, now seen corresponding path program 1 times [2021-12-21 20:49:30,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:30,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090412873] [2021-12-21 20:49:30,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:30,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:30,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 20:49:30,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:30,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090412873] [2021-12-21 20:49:30,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090412873] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:30,805 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:30,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 20:49:30,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28452978] [2021-12-21 20:49:30,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:30,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:49:30,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:30,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:49:30,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 20:49:30,806 INFO L87 Difference]: Start difference. First operand 94 states and 124 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:30,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:30,934 INFO L93 Difference]: Finished difference Result 221 states and 296 transitions. [2021-12-21 20:49:30,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 20:49:30,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-21 20:49:30,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:30,936 INFO L225 Difference]: With dead ends: 221 [2021-12-21 20:49:30,936 INFO L226 Difference]: Without dead ends: 164 [2021-12-21 20:49:30,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:49:30,937 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 116 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:30,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 281 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:49:30,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-12-21 20:49:30,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 104. [2021-12-21 20:49:30,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2021-12-21 20:49:30,961 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 135 transitions. Word has length 20 [2021-12-21 20:49:30,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:30,962 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 135 transitions. [2021-12-21 20:49:30,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 135 transitions. [2021-12-21 20:49:30,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-21 20:49:30,967 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:30,967 INFO L514 BasicCegarLoop]: 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] [2021-12-21 20:49:30,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 20:49:30,967 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-21 20:49:30,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:30,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1055427225, now seen corresponding path program 1 times [2021-12-21 20:49:30,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:30,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346336572] [2021-12-21 20:49:30,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:30,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:31,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 20:49:31,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:31,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346336572] [2021-12-21 20:49:31,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346336572] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:31,004 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:31,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 20:49:31,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263734029] [2021-12-21 20:49:31,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:31,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 20:49:31,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:31,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 20:49:31,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:49:31,006 INFO L87 Difference]: Start difference. First operand 104 states and 135 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:31,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:31,010 INFO L93 Difference]: Finished difference Result 162 states and 214 transitions. [2021-12-21 20:49:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 20:49:31,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-21 20:49:31,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:31,011 INFO L225 Difference]: With dead ends: 162 [2021-12-21 20:49:31,011 INFO L226 Difference]: Without dead ends: 81 [2021-12-21 20:49:31,012 INFO L932 BasicCegarLoop]: 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 [2021-12-21 20:49:31,013 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 80 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:31,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 83 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:49:31,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-21 20:49:31,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-12-21 20:49:31,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:31,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2021-12-21 20:49:31,017 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 23 [2021-12-21 20:49:31,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:31,017 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2021-12-21 20:49:31,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:31,018 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2021-12-21 20:49:31,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-21 20:49:31,018 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:31,019 INFO L514 BasicCegarLoop]: 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] [2021-12-21 20:49:31,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 20:49:31,019 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-21 20:49:31,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:31,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1486873965, now seen corresponding path program 1 times [2021-12-21 20:49:31,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:31,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449853416] [2021-12-21 20:49:31,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:31,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:31,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:49:31,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:31,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449853416] [2021-12-21 20:49:31,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449853416] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:31,052 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:31,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 20:49:31,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190093101] [2021-12-21 20:49:31,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:31,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 20:49:31,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:31,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 20:49:31,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:49:31,053 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:31,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:31,060 INFO L93 Difference]: Finished difference Result 105 states and 139 transitions. [2021-12-21 20:49:31,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 20:49:31,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-12-21 20:49:31,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:31,061 INFO L225 Difference]: With dead ends: 105 [2021-12-21 20:49:31,061 INFO L226 Difference]: Without dead ends: 92 [2021-12-21 20:49:31,061 INFO L932 BasicCegarLoop]: 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 [2021-12-21 20:49:31,062 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 4 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:31,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:49:31,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-21 20:49:31,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-12-21 20:49:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.3296703296703296) internal successors, (121), 91 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 121 transitions. [2021-12-21 20:49:31,067 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 121 transitions. Word has length 29 [2021-12-21 20:49:31,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:31,067 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 121 transitions. [2021-12-21 20:49:31,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:31,067 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2021-12-21 20:49:31,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-21 20:49:31,068 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:31,068 INFO L514 BasicCegarLoop]: 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] [2021-12-21 20:49:31,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 20:49:31,069 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-21 20:49:31,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:31,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1796976081, now seen corresponding path program 1 times [2021-12-21 20:49:31,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:31,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44068246] [2021-12-21 20:49:31,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:31,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:31,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:49:31,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:31,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44068246] [2021-12-21 20:49:31,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44068246] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:31,151 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:31,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 20:49:31,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950660053] [2021-12-21 20:49:31,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:31,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:49:31,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:31,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:49:31,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 20:49:31,152 INFO L87 Difference]: Start difference. First operand 92 states and 121 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:31,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:31,268 INFO L93 Difference]: Finished difference Result 247 states and 327 transitions. [2021-12-21 20:49:31,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 20:49:31,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-12-21 20:49:31,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:31,269 INFO L225 Difference]: With dead ends: 247 [2021-12-21 20:49:31,269 INFO L226 Difference]: Without dead ends: 177 [2021-12-21 20:49:31,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:49:31,270 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 113 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:31,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 259 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:49:31,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-12-21 20:49:31,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 97. [2021-12-21 20:49:31,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.3125) internal successors, (126), 96 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:31,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 126 transitions. [2021-12-21 20:49:31,276 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 126 transitions. Word has length 29 [2021-12-21 20:49:31,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:31,276 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 126 transitions. [2021-12-21 20:49:31,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:31,276 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2021-12-21 20:49:31,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-21 20:49:31,277 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:31,277 INFO L514 BasicCegarLoop]: 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] [2021-12-21 20:49:31,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-21 20:49:31,278 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-21 20:49:31,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:31,278 INFO L85 PathProgramCache]: Analyzing trace with hash 543877549, now seen corresponding path program 1 times [2021-12-21 20:49:31,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:31,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168555953] [2021-12-21 20:49:31,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:31,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:49:31,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:31,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168555953] [2021-12-21 20:49:31,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168555953] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:49:31,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796263685] [2021-12-21 20:49:31,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:31,317 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:49:31,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:49:31,318 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) [2021-12-21 20:49:31,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-21 20:49:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:31,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 20:49:31,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:49:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:49:31,505 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:49:31,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796263685] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:31,506 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 20:49:31,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-12-21 20:49:31,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654202916] [2021-12-21 20:49:31,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:31,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:49:31,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:31,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:49:31,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-21 20:49:31,508 INFO L87 Difference]: Start difference. First operand 97 states and 126 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:31,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:31,640 INFO L93 Difference]: Finished difference Result 213 states and 311 transitions. [2021-12-21 20:49:31,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 20:49:31,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-21 20:49:31,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:31,641 INFO L225 Difference]: With dead ends: 213 [2021-12-21 20:49:31,641 INFO L226 Difference]: Without dead ends: 159 [2021-12-21 20:49:31,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-21 20:49:31,642 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 46 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:31,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 132 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:49:31,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-21 20:49:31,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 138. [2021-12-21 20:49:31,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.2554744525547445) internal successors, (172), 137 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:31,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 172 transitions. [2021-12-21 20:49:31,648 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 172 transitions. Word has length 32 [2021-12-21 20:49:31,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:31,648 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 172 transitions. [2021-12-21 20:49:31,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:31,649 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 172 transitions. [2021-12-21 20:49:31,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-21 20:49:31,649 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:31,650 INFO L514 BasicCegarLoop]: 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] [2021-12-21 20:49:31,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-21 20:49:31,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:49:31,867 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-21 20:49:31,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:31,867 INFO L85 PathProgramCache]: Analyzing trace with hash 372269661, now seen corresponding path program 1 times [2021-12-21 20:49:31,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:31,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922728763] [2021-12-21 20:49:31,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:31,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:49:31,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:31,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922728763] [2021-12-21 20:49:31,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922728763] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:49:31,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541824754] [2021-12-21 20:49:31,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:31,994 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:49:31,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:49:31,998 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) [2021-12-21 20:49:31,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-21 20:49:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:32,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 20:49:32,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:49:32,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 20:49:32,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:49:32,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541824754] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:32,165 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 20:49:32,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2021-12-21 20:49:32,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229739326] [2021-12-21 20:49:32,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:32,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 20:49:32,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:32,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 20:49:32,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:49:32,167 INFO L87 Difference]: Start difference. First operand 138 states and 172 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:32,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:32,250 INFO L93 Difference]: Finished difference Result 255 states and 329 transitions. [2021-12-21 20:49:32,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 20:49:32,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-21 20:49:32,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:32,252 INFO L225 Difference]: With dead ends: 255 [2021-12-21 20:49:32,252 INFO L226 Difference]: Without dead ends: 139 [2021-12-21 20:49:32,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-21 20:49:32,253 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 72 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:32,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 117 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:49:32,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-12-21 20:49:32,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 117. [2021-12-21 20:49:32,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.2586206896551724) internal successors, (146), 116 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:32,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 146 transitions. [2021-12-21 20:49:32,257 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 146 transitions. Word has length 39 [2021-12-21 20:49:32,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:32,258 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 146 transitions. [2021-12-21 20:49:32,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:32,258 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 146 transitions. [2021-12-21 20:49:32,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-21 20:49:32,259 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:32,259 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:49:32,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-21 20:49:32,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-12-21 20:49:32,480 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-21 20:49:32,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:32,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1054853098, now seen corresponding path program 1 times [2021-12-21 20:49:32,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:32,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033845239] [2021-12-21 20:49:32,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:32,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:32,555 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 20:49:32,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:32,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033845239] [2021-12-21 20:49:32,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033845239] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:32,556 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:32,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 20:49:32,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686332241] [2021-12-21 20:49:32,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:32,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:49:32,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:32,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:49:32,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 20:49:32,558 INFO L87 Difference]: Start difference. First operand 117 states and 146 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:32,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:32,669 INFO L93 Difference]: Finished difference Result 326 states and 434 transitions. [2021-12-21 20:49:32,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 20:49:32,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-12-21 20:49:32,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:32,670 INFO L225 Difference]: With dead ends: 326 [2021-12-21 20:49:32,671 INFO L226 Difference]: Without dead ends: 230 [2021-12-21 20:49:32,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:49:32,671 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 97 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:32,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 118 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:49:32,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-12-21 20:49:32,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 156. [2021-12-21 20:49:32,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.3290322580645162) internal successors, (206), 155 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:32,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 206 transitions. [2021-12-21 20:49:32,688 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 206 transitions. Word has length 48 [2021-12-21 20:49:32,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:32,688 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 206 transitions. [2021-12-21 20:49:32,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:32,688 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 206 transitions. [2021-12-21 20:49:32,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-21 20:49:32,690 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:32,690 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:49:32,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-21 20:49:32,690 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-21 20:49:32,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:32,691 INFO L85 PathProgramCache]: Analyzing trace with hash -847771261, now seen corresponding path program 1 times [2021-12-21 20:49:32,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:32,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780222521] [2021-12-21 20:49:32,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:32,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:32,755 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-21 20:49:32,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:32,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780222521] [2021-12-21 20:49:32,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780222521] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:32,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:32,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 20:49:32,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873641421] [2021-12-21 20:49:32,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:32,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:49:32,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:32,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:49:32,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 20:49:32,757 INFO L87 Difference]: Start difference. First operand 156 states and 206 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:32,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:32,868 INFO L93 Difference]: Finished difference Result 430 states and 586 transitions. [2021-12-21 20:49:32,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 20:49:32,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-12-21 20:49:32,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:32,869 INFO L225 Difference]: With dead ends: 430 [2021-12-21 20:49:32,869 INFO L226 Difference]: Without dead ends: 295 [2021-12-21 20:49:32,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:49:32,870 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 116 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:32,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 111 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:49:32,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-12-21 20:49:32,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 195. [2021-12-21 20:49:32,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 1.3865979381443299) internal successors, (269), 194 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:32,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 269 transitions. [2021-12-21 20:49:32,876 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 269 transitions. Word has length 64 [2021-12-21 20:49:32,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:32,877 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 269 transitions. [2021-12-21 20:49:32,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:32,877 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 269 transitions. [2021-12-21 20:49:32,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-21 20:49:32,878 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:32,879 INFO L514 BasicCegarLoop]: 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] [2021-12-21 20:49:32,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-21 20:49:32,879 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-21 20:49:32,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:32,880 INFO L85 PathProgramCache]: Analyzing trace with hash 220871532, now seen corresponding path program 1 times [2021-12-21 20:49:32,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:32,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739490575] [2021-12-21 20:49:32,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:32,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:32,956 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-21 20:49:32,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:32,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739490575] [2021-12-21 20:49:32,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739490575] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:32,958 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:32,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 20:49:32,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182808513] [2021-12-21 20:49:32,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:32,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 20:49:32,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:32,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 20:49:32,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:49:32,964 INFO L87 Difference]: Start difference. First operand 195 states and 269 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:33,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:33,215 INFO L93 Difference]: Finished difference Result 759 states and 1046 transitions. [2021-12-21 20:49:33,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:49:33,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-12-21 20:49:33,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:33,219 INFO L225 Difference]: With dead ends: 759 [2021-12-21 20:49:33,219 INFO L226 Difference]: Without dead ends: 586 [2021-12-21 20:49:33,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:49:33,221 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 205 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:33,221 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 416 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 20:49:33,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2021-12-21 20:49:33,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 195. [2021-12-21 20:49:33,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 1.3865979381443299) internal successors, (269), 194 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:33,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 269 transitions. [2021-12-21 20:49:33,229 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 269 transitions. Word has length 80 [2021-12-21 20:49:33,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:33,229 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 269 transitions. [2021-12-21 20:49:33,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:33,229 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 269 transitions. [2021-12-21 20:49:33,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-21 20:49:33,230 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:33,231 INFO L514 BasicCegarLoop]: 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] [2021-12-21 20:49:33,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-21 20:49:33,231 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-21 20:49:33,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:33,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1618881827, now seen corresponding path program 1 times [2021-12-21 20:49:33,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:33,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650627830] [2021-12-21 20:49:33,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:33,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:33,305 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-12-21 20:49:33,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:33,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650627830] [2021-12-21 20:49:33,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650627830] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:33,305 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:33,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 20:49:33,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775284992] [2021-12-21 20:49:33,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:33,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 20:49:33,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:33,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 20:49:33,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:49:33,307 INFO L87 Difference]: Start difference. First operand 195 states and 269 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:33,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:33,385 INFO L93 Difference]: Finished difference Result 632 states and 874 transitions. [2021-12-21 20:49:33,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 20:49:33,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-12-21 20:49:33,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:33,388 INFO L225 Difference]: With dead ends: 632 [2021-12-21 20:49:33,388 INFO L226 Difference]: Without dead ends: 459 [2021-12-21 20:49:33,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:49:33,389 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 180 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:33,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 226 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:49:33,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-12-21 20:49:33,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 336. [2021-12-21 20:49:33,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 1.4029850746268657) internal successors, (470), 335 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:33,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2021-12-21 20:49:33,408 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 83 [2021-12-21 20:49:33,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:33,408 INFO L470 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2021-12-21 20:49:33,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:33,409 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2021-12-21 20:49:33,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-21 20:49:33,410 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:33,410 INFO L514 BasicCegarLoop]: 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] [2021-12-21 20:49:33,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-21 20:49:33,411 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-21 20:49:33,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:33,411 INFO L85 PathProgramCache]: Analyzing trace with hash -45908259, now seen corresponding path program 1 times [2021-12-21 20:49:33,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:33,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966640827] [2021-12-21 20:49:33,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:33,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:33,494 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-21 20:49:33,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:33,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966640827] [2021-12-21 20:49:33,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966640827] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:33,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:33,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 20:49:33,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466063790] [2021-12-21 20:49:33,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:33,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 20:49:33,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:33,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 20:49:33,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 20:49:33,496 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:33,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:33,852 INFO L93 Difference]: Finished difference Result 1674 states and 2332 transitions. [2021-12-21 20:49:33,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 20:49:33,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-12-21 20:49:33,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:33,856 INFO L225 Difference]: With dead ends: 1674 [2021-12-21 20:49:33,856 INFO L226 Difference]: Without dead ends: 1360 [2021-12-21 20:49:33,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-21 20:49:33,858 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 308 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:33,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 542 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 20:49:33,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2021-12-21 20:49:33,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 336. [2021-12-21 20:49:33,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 1.4029850746268657) internal successors, (470), 335 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:33,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2021-12-21 20:49:33,875 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 83 [2021-12-21 20:49:33,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:33,875 INFO L470 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2021-12-21 20:49:33,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:33,875 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2021-12-21 20:49:33,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-21 20:49:33,876 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:33,876 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2021-12-21 20:49:33,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-21 20:49:33,876 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-21 20:49:33,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:33,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1508814206, now seen corresponding path program 1 times [2021-12-21 20:49:33,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:33,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427551228] [2021-12-21 20:49:33,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:33,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-21 20:49:33,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:33,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427551228] [2021-12-21 20:49:33,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427551228] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:49:33,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106479913] [2021-12-21 20:49:33,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:33,979 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:49:33,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:49:33,981 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) [2021-12-21 20:49:33,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-21 20:49:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:34,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 20:49:34,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:49:34,308 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-12-21 20:49:34,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:49:34,491 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-12-21 20:49:34,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106479913] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:49:34,491 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:49:34,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2021-12-21 20:49:34,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686214813] [2021-12-21 20:49:34,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:49:34,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 20:49:34,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:34,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 20:49:34,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-21 20:49:34,493 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:34,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:34,740 INFO L93 Difference]: Finished difference Result 1554 states and 2219 transitions. [2021-12-21 20:49:34,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 20:49:34,740 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-12-21 20:49:34,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:34,743 INFO L225 Difference]: With dead ends: 1554 [2021-12-21 20:49:34,743 INFO L226 Difference]: Without dead ends: 1230 [2021-12-21 20:49:34,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-12-21 20:49:34,744 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 166 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:34,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 518 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 20:49:34,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2021-12-21 20:49:34,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1018. [2021-12-21 20:49:34,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1017 states have (on average 1.3441494591937069) internal successors, (1367), 1017 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:34,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1367 transitions. [2021-12-21 20:49:34,769 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1367 transitions. Word has length 83 [2021-12-21 20:49:34,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:34,770 INFO L470 AbstractCegarLoop]: Abstraction has 1018 states and 1367 transitions. [2021-12-21 20:49:34,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:34,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1367 transitions. [2021-12-21 20:49:34,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-21 20:49:34,771 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:34,771 INFO L514 BasicCegarLoop]: 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] [2021-12-21 20:49:34,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-21 20:49:34,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:49:34,976 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-21 20:49:34,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:34,977 INFO L85 PathProgramCache]: Analyzing trace with hash 6193209, now seen corresponding path program 1 times [2021-12-21 20:49:34,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:34,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371666104] [2021-12-21 20:49:34,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:34,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-21 20:49:35,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:35,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371666104] [2021-12-21 20:49:35,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371666104] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:35,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:35,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 20:49:35,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009046109] [2021-12-21 20:49:35,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:35,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 20:49:35,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:35,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 20:49:35,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:49:35,049 INFO L87 Difference]: Start difference. First operand 1018 states and 1367 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:35,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:35,493 INFO L93 Difference]: Finished difference Result 1805 states and 2400 transitions. [2021-12-21 20:49:35,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 20:49:35,493 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-12-21 20:49:35,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:35,497 INFO L225 Difference]: With dead ends: 1805 [2021-12-21 20:49:35,497 INFO L226 Difference]: Without dead ends: 1461 [2021-12-21 20:49:35,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-21 20:49:35,501 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 409 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:35,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 812 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 20:49:35,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2021-12-21 20:49:35,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1011. [2021-12-21 20:49:35,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1010 states have (on average 1.3455445544554456) internal successors, (1359), 1010 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:35,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1359 transitions. [2021-12-21 20:49:35,531 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1359 transitions. Word has length 85 [2021-12-21 20:49:35,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:35,531 INFO L470 AbstractCegarLoop]: Abstraction has 1011 states and 1359 transitions. [2021-12-21 20:49:35,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:35,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1359 transitions. [2021-12-21 20:49:35,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-12-21 20:49:35,533 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:35,533 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2021-12-21 20:49:35,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-21 20:49:35,534 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-21 20:49:35,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:35,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1246814763, now seen corresponding path program 1 times [2021-12-21 20:49:35,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:35,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399968151] [2021-12-21 20:49:35,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:35,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:35,615 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-21 20:49:35,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:35,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399968151] [2021-12-21 20:49:35,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399968151] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:49:35,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459515713] [2021-12-21 20:49:35,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:35,616 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:49:35,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:49:35,632 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) [2021-12-21 20:49:35,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-21 20:49:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:35,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-21 20:49:35,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:49:36,167 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 63 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-21 20:49:36,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:49:36,861 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 58 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-21 20:49:36,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459515713] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:49:36,862 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:49:36,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 10] total 20 [2021-12-21 20:49:36,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196005933] [2021-12-21 20:49:36,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:49:36,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-21 20:49:36,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:36,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-21 20:49:36,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2021-12-21 20:49:36,863 INFO L87 Difference]: Start difference. First operand 1011 states and 1359 transitions. Second operand has 20 states, 20 states have (on average 9.7) internal successors, (194), 20 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:39,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:39,990 INFO L93 Difference]: Finished difference Result 3128 states and 4074 transitions. [2021-12-21 20:49:39,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2021-12-21 20:49:39,990 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 9.7) internal successors, (194), 20 states have internal predecessors, (194), 0 states have call successors, (0), 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 [2021-12-21 20:49:39,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:39,996 INFO L225 Difference]: With dead ends: 3128 [2021-12-21 20:49:39,996 INFO L226 Difference]: Without dead ends: 2140 [2021-12-21 20:49:39,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 164 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2257 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1160, Invalid=6850, Unknown=0, NotChecked=0, Total=8010 [2021-12-21 20:49:40,000 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 1771 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 2980 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1771 SdHoareTripleChecker+Valid, 1830 SdHoareTripleChecker+Invalid, 3228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 2980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:40,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1771 Valid, 1830 Invalid, 3228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 2980 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-21 20:49:40,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2021-12-21 20:49:40,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 934. [2021-12-21 20:49:40,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 933 states have (on average 1.3290460878885315) internal successors, (1240), 933 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:40,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1240 transitions. [2021-12-21 20:49:40,050 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1240 transitions. Word has length 89 [2021-12-21 20:49:40,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:40,050 INFO L470 AbstractCegarLoop]: Abstraction has 934 states and 1240 transitions. [2021-12-21 20:49:40,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.7) internal successors, (194), 20 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:40,051 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1240 transitions. [2021-12-21 20:49:40,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-21 20:49:40,052 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:40,052 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:49:40,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-21 20:49:40,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-21 20:49:40,272 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-21 20:49:40,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:40,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1562640017, now seen corresponding path program 1 times [2021-12-21 20:49:40,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:40,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278730652] [2021-12-21 20:49:40,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:40,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:40,404 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 57 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-21 20:49:40,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:40,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278730652] [2021-12-21 20:49:40,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278730652] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:49:40,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479643962] [2021-12-21 20:49:40,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:40,404 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:49:40,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:49:40,405 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) [2021-12-21 20:49:40,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-21 20:49:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:40,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-21 20:49:40,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:49:40,760 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 57 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-21 20:49:40,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:49:40,907 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 52 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-21 20:49:40,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479643962] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:49:40,908 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:49:40,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2021-12-21 20:49:40,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866924160] [2021-12-21 20:49:40,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:49:40,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 20:49:40,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:40,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 20:49:40,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-21 20:49:40,911 INFO L87 Difference]: Start difference. First operand 934 states and 1240 transitions. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:41,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:41,195 INFO L93 Difference]: Finished difference Result 2270 states and 2964 transitions. [2021-12-21 20:49:41,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 20:49:41,196 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-12-21 20:49:41,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:41,199 INFO L225 Difference]: With dead ends: 2270 [2021-12-21 20:49:41,199 INFO L226 Difference]: Without dead ends: 1365 [2021-12-21 20:49:41,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 175 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-12-21 20:49:41,202 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 392 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:41,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 428 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:49:41,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2021-12-21 20:49:41,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 921. [2021-12-21 20:49:41,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.3271739130434783) internal successors, (1221), 920 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:41,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1221 transitions. [2021-12-21 20:49:41,236 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1221 transitions. Word has length 91 [2021-12-21 20:49:41,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:41,236 INFO L470 AbstractCegarLoop]: Abstraction has 921 states and 1221 transitions. [2021-12-21 20:49:41,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:41,237 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1221 transitions. [2021-12-21 20:49:41,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-21 20:49:41,238 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:41,238 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2021-12-21 20:49:41,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-21 20:49:41,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-21 20:49:41,455 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-21 20:49:41,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:41,456 INFO L85 PathProgramCache]: Analyzing trace with hash 365632685, now seen corresponding path program 2 times [2021-12-21 20:49:41,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:41,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570573095] [2021-12-21 20:49:41,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:41,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 41 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-21 20:49:41,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:41,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570573095] [2021-12-21 20:49:41,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570573095] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:49:41,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643061156] [2021-12-21 20:49:41,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 20:49:41,582 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:49:41,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:49:41,584 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) [2021-12-21 20:49:41,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-21 20:49:41,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 20:49:41,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 20:49:41,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-21 20:49:41,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:49:42,163 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 47 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-21 20:49:42,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:49:42,410 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-21 20:49:42,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643061156] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:49:42,410 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:49:42,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2021-12-21 20:49:42,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567939322] [2021-12-21 20:49:42,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:49:42,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-21 20:49:42,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:42,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-21 20:49:42,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2021-12-21 20:49:42,412 INFO L87 Difference]: Start difference. First operand 921 states and 1221 transitions. Second operand has 17 states, 16 states have (on average 11.75) internal successors, (188), 17 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:43,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:43,368 INFO L93 Difference]: Finished difference Result 5527 states and 7152 transitions. [2021-12-21 20:49:43,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-21 20:49:43,369 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 11.75) internal successors, (188), 17 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-12-21 20:49:43,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:43,381 INFO L225 Difference]: With dead ends: 5527 [2021-12-21 20:49:43,381 INFO L226 Difference]: Without dead ends: 5436 [2021-12-21 20:49:43,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=403, Invalid=1079, Unknown=0, NotChecked=0, Total=1482 [2021-12-21 20:49:43,384 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 682 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:43,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [682 Valid, 1228 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 20:49:43,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5436 states. [2021-12-21 20:49:43,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5436 to 1192. [2021-12-21 20:49:43,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 1191 states have (on average 1.3702770780856424) internal successors, (1632), 1191 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:43,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1632 transitions. [2021-12-21 20:49:43,451 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1632 transitions. Word has length 91 [2021-12-21 20:49:43,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:43,452 INFO L470 AbstractCegarLoop]: Abstraction has 1192 states and 1632 transitions. [2021-12-21 20:49:43,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 11.75) internal successors, (188), 17 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:43,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1632 transitions. [2021-12-21 20:49:43,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-21 20:49:43,458 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:43,458 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:49:43,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-21 20:49:43,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-21 20:49:43,676 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-21 20:49:43,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:43,677 INFO L85 PathProgramCache]: Analyzing trace with hash -502969241, now seen corresponding path program 1 times [2021-12-21 20:49:43,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:43,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682738335] [2021-12-21 20:49:43,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:43,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:43,744 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 76 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-21 20:49:43,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:43,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682738335] [2021-12-21 20:49:43,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682738335] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:49:43,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984723314] [2021-12-21 20:49:43,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:43,745 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:49:43,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:49:43,746 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) [2021-12-21 20:49:43,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-21 20:49:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:43,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 20:49:43,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:49:43,958 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-21 20:49:43,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:49:44,155 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-21 20:49:44,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984723314] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-21 20:49:44,156 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-21 20:49:44,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 9 [2021-12-21 20:49:44,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873689354] [2021-12-21 20:49:44,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:44,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 20:49:44,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:44,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 20:49:44,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-21 20:49:44,160 INFO L87 Difference]: Start difference. First operand 1192 states and 1632 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:44,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:44,363 INFO L93 Difference]: Finished difference Result 3393 states and 4625 transitions. [2021-12-21 20:49:44,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 20:49:44,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-12-21 20:49:44,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:44,367 INFO L225 Difference]: With dead ends: 3393 [2021-12-21 20:49:44,367 INFO L226 Difference]: Without dead ends: 1453 [2021-12-21 20:49:44,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 192 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-21 20:49:44,370 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 119 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:44,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 167 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:49:44,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2021-12-21 20:49:44,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 787. [2021-12-21 20:49:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.3740458015267176) internal successors, (1080), 786 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:44,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1080 transitions. [2021-12-21 20:49:44,408 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1080 transitions. Word has length 97 [2021-12-21 20:49:44,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:44,409 INFO L470 AbstractCegarLoop]: Abstraction has 787 states and 1080 transitions. [2021-12-21 20:49:44,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:44,409 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1080 transitions. [2021-12-21 20:49:44,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-12-21 20:49:44,410 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:44,410 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:49:44,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-21 20:49:44,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:49:44,628 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-21 20:49:44,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:44,629 INFO L85 PathProgramCache]: Analyzing trace with hash -828431344, now seen corresponding path program 1 times [2021-12-21 20:49:44,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:44,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524823751] [2021-12-21 20:49:44,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:44,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:44,688 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-21 20:49:44,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:44,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524823751] [2021-12-21 20:49:44,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524823751] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:44,688 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:44,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 20:49:44,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334526481] [2021-12-21 20:49:44,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:44,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 20:49:44,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:44,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 20:49:44,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:49:44,690 INFO L87 Difference]: Start difference. First operand 787 states and 1080 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:44,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:44,902 INFO L93 Difference]: Finished difference Result 1800 states and 2430 transitions. [2021-12-21 20:49:44,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 20:49:44,902 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-12-21 20:49:44,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:44,905 INFO L225 Difference]: With dead ends: 1800 [2021-12-21 20:49:44,905 INFO L226 Difference]: Without dead ends: 889 [2021-12-21 20:49:44,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-12-21 20:49:44,906 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 130 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:44,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 233 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 20:49:44,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2021-12-21 20:49:44,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 771. [2021-12-21 20:49:44,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 770 states have (on average 1.3545454545454545) internal successors, (1043), 770 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:44,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1043 transitions. [2021-12-21 20:49:44,931 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1043 transitions. Word has length 98 [2021-12-21 20:49:44,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:44,932 INFO L470 AbstractCegarLoop]: Abstraction has 771 states and 1043 transitions. [2021-12-21 20:49:44,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:44,932 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1043 transitions. [2021-12-21 20:49:44,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-12-21 20:49:44,933 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:44,933 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 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] [2021-12-21 20:49:44,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-21 20:49:44,934 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-21 20:49:44,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:44,934 INFO L85 PathProgramCache]: Analyzing trace with hash 840122728, now seen corresponding path program 1 times [2021-12-21 20:49:44,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:44,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993620156] [2021-12-21 20:49:44,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:44,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 20:49:44,959 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 20:49:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 20:49:44,998 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 20:49:44,999 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-21 20:49:44,999 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 38 remaining) [2021-12-21 20:49:45,001 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 38 remaining) [2021-12-21 20:49:45,001 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 38 remaining) [2021-12-21 20:49:45,001 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 38 remaining) [2021-12-21 20:49:45,001 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 38 remaining) [2021-12-21 20:49:45,001 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 38 remaining) [2021-12-21 20:49:45,001 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 38 remaining) [2021-12-21 20:49:45,002 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 38 remaining) [2021-12-21 20:49:45,002 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 38 remaining) [2021-12-21 20:49:45,002 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 38 remaining) [2021-12-21 20:49:45,002 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 38 remaining) [2021-12-21 20:49:45,002 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 38 remaining) [2021-12-21 20:49:45,002 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 38 remaining) [2021-12-21 20:49:45,002 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 38 remaining) [2021-12-21 20:49:45,003 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 38 remaining) [2021-12-21 20:49:45,003 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 38 remaining) [2021-12-21 20:49:45,003 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 38 remaining) [2021-12-21 20:49:45,003 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 38 remaining) [2021-12-21 20:49:45,003 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 38 remaining) [2021-12-21 20:49:45,003 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 38 remaining) [2021-12-21 20:49:45,003 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 38 remaining) [2021-12-21 20:49:45,004 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 38 remaining) [2021-12-21 20:49:45,004 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 38 remaining) [2021-12-21 20:49:45,004 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 38 remaining) [2021-12-21 20:49:45,004 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 38 remaining) [2021-12-21 20:49:45,004 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 38 remaining) [2021-12-21 20:49:45,004 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 38 remaining) [2021-12-21 20:49:45,004 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 38 remaining) [2021-12-21 20:49:45,005 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 38 remaining) [2021-12-21 20:49:45,005 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 38 remaining) [2021-12-21 20:49:45,005 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 38 remaining) [2021-12-21 20:49:45,005 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 38 remaining) [2021-12-21 20:49:45,005 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 38 remaining) [2021-12-21 20:49:45,005 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 38 remaining) [2021-12-21 20:49:45,005 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 38 remaining) [2021-12-21 20:49:45,005 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 38 remaining) [2021-12-21 20:49:45,006 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 38 remaining) [2021-12-21 20:49:45,006 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 38 remaining) [2021-12-21 20:49:45,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-21 20:49:45,008 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:49:45,010 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 20:49:45,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 08:49:45 BoogieIcfgContainer [2021-12-21 20:49:45,071 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 20:49:45,071 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 20:49:45,071 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 20:49:45,071 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 20:49:45,072 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:49:30" (3/4) ... [2021-12-21 20:49:45,073 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-21 20:49:45,074 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 20:49:45,074 INFO L158 Benchmark]: Toolchain (without parser) took 15685.85ms. Allocated memory was 102.8MB in the beginning and 243.3MB in the end (delta: 140.5MB). Free memory was 73.8MB in the beginning and 93.8MB in the end (delta: -20.0MB). Peak memory consumption was 121.0MB. Max. memory is 16.1GB. [2021-12-21 20:49:45,074 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 102.8MB. Free memory was 60.2MB in the beginning and 60.1MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 20:49:45,074 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.47ms. Allocated memory was 102.8MB in the beginning and 138.4MB in the end (delta: 35.7MB). Free memory was 73.8MB in the beginning and 112.7MB in the end (delta: -38.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-21 20:49:45,075 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.32ms. Allocated memory is still 138.4MB. Free memory was 112.7MB in the beginning and 110.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 20:49:45,075 INFO L158 Benchmark]: Boogie Preprocessor took 61.40ms. Allocated memory is still 138.4MB. Free memory was 110.6MB in the beginning and 109.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 20:49:45,075 INFO L158 Benchmark]: RCFGBuilder took 333.09ms. Allocated memory is still 138.4MB. Free memory was 109.2MB in the beginning and 93.8MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-21 20:49:45,075 INFO L158 Benchmark]: TraceAbstraction took 14881.41ms. Allocated memory was 138.4MB in the beginning and 243.3MB in the end (delta: 104.9MB). Free memory was 93.1MB in the beginning and 93.8MB in the end (delta: -679.8kB). Peak memory consumption was 107.3MB. Max. memory is 16.1GB. [2021-12-21 20:49:45,075 INFO L158 Benchmark]: Witness Printer took 2.62ms. Allocated memory is still 243.3MB. Free memory is still 93.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 20:49:45,076 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 102.8MB. Free memory was 60.2MB in the beginning and 60.1MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.47ms. Allocated memory was 102.8MB in the beginning and 138.4MB in the end (delta: 35.7MB). Free memory was 73.8MB in the beginning and 112.7MB in the end (delta: -38.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.32ms. Allocated memory is still 138.4MB. Free memory was 112.7MB in the beginning and 110.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.40ms. Allocated memory is still 138.4MB. Free memory was 110.6MB in the beginning and 109.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 333.09ms. Allocated memory is still 138.4MB. Free memory was 109.2MB in the beginning and 93.8MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14881.41ms. Allocated memory was 138.4MB in the beginning and 243.3MB in the end (delta: 104.9MB). Free memory was 93.1MB in the beginning and 93.8MB in the end (delta: -679.8kB). Peak memory consumption was 107.3MB. Max. memory is 16.1GB. * Witness Printer took 2.62ms. Allocated memory is still 243.3MB. Free memory is still 93.8MB. There was no memory consumed. 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 - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 96. Possible FailurePath: [L124] unsigned int a, b, r; [L125] a = __VERIFIER_nondet_uint() [L127] b = 234770789 [L129] CALL mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L68] nb = (unsigned char)4 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, na=4, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L89] COND TRUE i < nb VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L90] COND TRUE i == (unsigned char)0 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=255] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=356] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=356] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=356] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=4, nb=4, partial_sum=356] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=1, r0=4060086273] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=1, r0=4060086273] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=1, r0=4060086273] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=4, nb=4, partial_sum=1, r0=4060086273] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=1, r0=4060086273] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=4060086273] [L83] COND TRUE i < na VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=4060086273] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=4060086273] [L85] COND TRUE i == (unsigned char)1 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=4060086273] [L85] EXPR partial_sum + a1 [L85] partial_sum = partial_sum + a1 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=4060086273] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=4060086273] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=4060086273] [L89] COND TRUE i < nb VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=4060086273] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=4060086273] [L91] COND TRUE i == (unsigned char)1 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=4060086273] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=337, r0=4060086273] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=337, r0=4060086273] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=4, nb=4, partial_sum=337, r0=4060086273] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, r0=4060086273] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, r0=4060086273] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=4060086273, r1=4060086272] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=4060086273, r1=4060086272] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=4060086273, r1=4060086272] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=4060086273, r1=4060086272] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=4060086273, r1=4060086272] [L83] COND TRUE i < na VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=4060086273, r1=4060086272] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=4060086273, r1=4060086272] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=4060086273, r1=4060086272] [L86] COND TRUE i == (unsigned char)2 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=4060086273, r1=4060086272] [L86] EXPR partial_sum + a2 [L86] partial_sum = partial_sum + a2 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=4060086273, r1=4060086272] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=4060086273, r1=4060086272] [L89] COND TRUE i < nb VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=4060086273, r1=4060086272] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=4060086273, r1=4060086272] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=4060086273, r1=4060086272] [L92] COND TRUE i == (unsigned char)2 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=4060086273, r1=4060086272] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=510, r0=4060086273, r1=4060086272] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=4, nb=4, partial_sum=510, r0=4060086273, r1=4060086272] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, r0=4060086273, r1=4060086272] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, r0=4060086273, r1=4060086272] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, r0=4060086273, r1=4060086272] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, partial_sum=2, r0=4060086273, r1=4060086272, r2=4060086274] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=2, na=4, nb=4, partial_sum=2, r0=4060086273, r1=4060086272, r2=4060086274] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=3, na=4, nb=4, partial_sum=2, r0=4060086273, r1=4060086272, r2=4060086274] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=4060086273, r1=4060086272, r2=4060086274] [L83] COND TRUE i < na VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=4060086273, r1=4060086272, r2=4060086274] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=4060086273, r1=4060086272, r2=4060086274] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=4060086273, r1=4060086272, r2=4060086274] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=4060086273, r1=4060086272, r2=4060086274] [L87] COND TRUE i == (unsigned char)3 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=4060086273, r1=4060086272, r2=4060086274] [L87] EXPR partial_sum + a3 [L87] partial_sum = partial_sum + a3 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=4060086273, r1=4060086272, r2=4060086274] [L89] COND TRUE i < nb VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=4060086273, r1=4060086272, r2=4060086274] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=4060086273, r1=4060086272, r2=4060086274] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=4060086273, r1=4060086272, r2=4060086274] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=4060086273, r1=4060086272, r2=4060086274] [L93] COND TRUE i == (unsigned char)3 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=4060086273, r1=4060086272, r2=4060086274] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=4060086273, r1=4060086272, r2=4060086274] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=4060086273, r1=4060086272, r2=4060086274] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=4060086273, r1=4060086272, r2=4060086274] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=4060086273, r1=4060086272, r2=4060086274] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=4060086273, r1=4060086272, r2=4060086274] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=4060086273, r1=4060086272, r2=4060086274, r3=255] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=4060086273, r1=4060086272, r2=4060086274, r3=255] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=4060086273, r1=4060086272, r2=4060086274, r3=255] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=4060086273, r1=4060086272, r2=4060086274, r3=255] [L116] r1 << 8U VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=4060086273, r1=4060086272, r2=4060086274, r3=255] [L116] r2 << 16U VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=4060086273, r1=4060086272, r2=4060086274, r3=255] [L116] r3 << 24U VAL [\old(a)=4060086271, \old(b)=234770789, a=4060086271, a0=4060086271, a1=15859711, a2=61951, a3=241, b=234770789, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=4060086273, r1=4060086272, r2=4060086274, r3=255] - 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 114 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 14.8s, OverallIterations: 21, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5036 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5036 mSDsluCounter, 7888 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5855 mSDsCounter, 598 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6138 IncrementalHoareTripleChecker+Invalid, 6736 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 598 mSolverCounterUnsat, 2033 mSDtfsCounter, 6138 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1218 GetRequests, 982 SyntacticMatches, 17 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2673 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1192occurred in iteration=18, InterpolantAutomatonStates: 204, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 9239 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1804 NumberOfCodeBlocks, 1804 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2122 ConstructedInterpolants, 0 QuantifiedInterpolants, 10809 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1182 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 32 InterpolantComputations, 16 PerfectInterpolantSequences, 1627/1855 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 could not prove your program: unable to determine feasibility of some traces [2021-12-21 20:49:45,108 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 Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample