./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/byte_add-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 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.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ac64f5b077f8251002b0bb05f1aba070a52d8bbef53fa94e35704949c96b0f7c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 20:49:25,407 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 20:49:25,409 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 20:49:25,450 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 20:49:25,451 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 20:49:25,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 20:49:25,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 20:49:25,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 20:49:25,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 20:49:25,461 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 20:49:25,461 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 20:49:25,462 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 20:49:25,463 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 20:49:25,464 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 20:49:25,466 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 20:49:25,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 20:49:25,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 20:49:25,470 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 20:49:25,471 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 20:49:25,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 20:49:25,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 20:49:25,479 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 20:49:25,480 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 20:49:25,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 20:49:25,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 20:49:25,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 20:49:25,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 20:49:25,487 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 20:49:25,488 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 20:49:25,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 20:49:25,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 20:49:25,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 20:49:25,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 20:49:25,491 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 20:49:25,492 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 20:49:25,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 20:49:25,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 20:49:25,494 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 20:49:25,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 20:49:25,494 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 20:49:25,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 20:49:25,495 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:25,522 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 20:49:25,522 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 20:49:25,523 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 20:49:25,523 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 20:49:25,523 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 20:49:25,523 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 20:49:25,524 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 20:49:25,524 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 20:49:25,524 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 20:49:25,524 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 20:49:25,525 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 20:49:25,525 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 20:49:25,525 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 20:49:25,525 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 20:49:25,526 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 20:49:25,526 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 20:49:25,526 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 20:49:25,526 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 20:49:25,526 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-12-21 20:49:25,526 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 20:49:25,527 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 20:49:25,527 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 20:49:25,527 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 20:49:25,527 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 20:49:25,527 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 20:49:25,527 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 20:49:25,527 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 20:49:25,528 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 20:49:25,528 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 20:49:25,528 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 20:49:25,528 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 20:49:25,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 20:49:25,529 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 20:49:25,529 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 20:49:25,529 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac64f5b077f8251002b0bb05f1aba070a52d8bbef53fa94e35704949c96b0f7c [2021-12-21 20:49:25,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 20:49:25,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 20:49:25,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 20:49:25,723 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 20:49:25,724 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 20:49:25,724 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add-2.i [2021-12-21 20:49:25,766 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3960928e0/be16251c6baa434c95477d7faa7c9dcc/FLAG0321ec002 [2021-12-21 20:49:26,144 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 20:49:26,144 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-2.i [2021-12-21 20:49:26,150 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3960928e0/be16251c6baa434c95477d7faa7c9dcc/FLAG0321ec002 [2021-12-21 20:49:26,164 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3960928e0/be16251c6baa434c95477d7faa7c9dcc [2021-12-21 20:49:26,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 20:49:26,167 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 20:49:26,169 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 20:49:26,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 20:49:26,171 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 20:49:26,171 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:49:26" (1/1) ... [2021-12-21 20:49:26,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@248da0ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:49:26, skipping insertion in model container [2021-12-21 20:49:26,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:49:26" (1/1) ... [2021-12-21 20:49:26,177 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 20:49:26,199 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 20:49:26,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-2.i[1166,1179] [2021-12-21 20:49:26,396 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 20:49:26,404 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 20:49:26,418 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-2.i[1166,1179] [2021-12-21 20:49:26,437 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 20:49:26,454 INFO L208 MainTranslator]: Completed translation [2021-12-21 20:49:26,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:49:26 WrapperNode [2021-12-21 20:49:26,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 20:49:26,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 20:49:26,456 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 20:49:26,457 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 20:49:26,461 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:26" (1/1) ... [2021-12-21 20:49:26,476 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:26" (1/1) ... [2021-12-21 20:49:26,502 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 162 [2021-12-21 20:49:26,503 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 20:49:26,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 20:49:26,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 20:49:26,504 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 20:49:26,510 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:26" (1/1) ... [2021-12-21 20:49:26,510 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:26" (1/1) ... [2021-12-21 20:49:26,519 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:26" (1/1) ... [2021-12-21 20:49:26,519 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:26" (1/1) ... [2021-12-21 20:49:26,528 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:26" (1/1) ... [2021-12-21 20:49:26,535 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:26" (1/1) ... [2021-12-21 20:49:26,537 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:26" (1/1) ... [2021-12-21 20:49:26,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 20:49:26,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 20:49:26,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 20:49:26,546 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 20:49:26,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:49:26" (1/1) ... [2021-12-21 20:49:26,553 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 20:49:26,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:49:26,605 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:26,628 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:26,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 20:49:26,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 20:49:26,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 20:49:26,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 20:49:26,689 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 20:49:26,691 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 20:49:26,892 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 20:49:26,898 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 20:49:26,898 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-21 20:49:26,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:49:26 BoogieIcfgContainer [2021-12-21 20:49:26,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 20:49:26,901 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 20:49:26,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 20:49:26,904 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 20:49:26,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 08:49:26" (1/3) ... [2021-12-21 20:49:26,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b639ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:49:26, skipping insertion in model container [2021-12-21 20:49:26,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:49:26" (2/3) ... [2021-12-21 20:49:26,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b639ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:49:26, skipping insertion in model container [2021-12-21 20:49:26,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:49:26" (3/3) ... [2021-12-21 20:49:26,906 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add-2.i [2021-12-21 20:49:26,910 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 20:49:26,910 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2021-12-21 20:49:26,944 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 20:49:26,950 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:26,950 INFO L340 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2021-12-21 20:49:26,969 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:26,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-21 20:49:26,972 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:26,972 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-21 20:49:26,973 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:26,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:26,979 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2021-12-21 20:49:26,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:26,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173003856] [2021-12-21 20:49:26,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:26,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:27,117 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:27,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:27,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173003856] [2021-12-21 20:49:27,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173003856] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:27,120 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:27,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-12-21 20:49:27,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147386] [2021-12-21 20:49:27,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:27,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-21 20:49:27,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:27,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-21 20:49:27,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 20:49:27,147 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:27,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:27,170 INFO L93 Difference]: Finished difference Result 135 states and 177 transitions. [2021-12-21 20:49:27,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 20:49:27,172 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:27,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:27,178 INFO L225 Difference]: With dead ends: 135 [2021-12-21 20:49:27,178 INFO L226 Difference]: Without dead ends: 69 [2021-12-21 20:49:27,180 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:27,185 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:27,185 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:27,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-12-21 20:49:27,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-12-21 20:49:27,209 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:27,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2021-12-21 20:49:27,214 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 4 [2021-12-21 20:49:27,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:27,214 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2021-12-21 20:49:27,214 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:27,214 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2021-12-21 20:49:27,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-21 20:49:27,215 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:27,216 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:49:27,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 20:49:27,216 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:27,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:27,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1944470950, now seen corresponding path program 1 times [2021-12-21 20:49:27,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:27,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015284583] [2021-12-21 20:49:27,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:27,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:27,294 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:27,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:27,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015284583] [2021-12-21 20:49:27,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015284583] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:27,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:27,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 20:49:27,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771009451] [2021-12-21 20:49:27,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:27,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 20:49:27,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:27,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 20:49:27,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:49:27,297 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:27,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:27,387 INFO L93 Difference]: Finished difference Result 145 states and 212 transitions. [2021-12-21 20:49:27,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 20:49:27,387 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:27,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:27,388 INFO L225 Difference]: With dead ends: 145 [2021-12-21 20:49:27,388 INFO L226 Difference]: Without dead ends: 98 [2021-12-21 20:49:27,389 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:27,390 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:27,390 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:27,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-21 20:49:27,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2021-12-21 20:49:27,395 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:27,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 124 transitions. [2021-12-21 20:49:27,396 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 124 transitions. Word has length 13 [2021-12-21 20:49:27,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:27,396 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 124 transitions. [2021-12-21 20:49:27,397 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:27,397 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 124 transitions. [2021-12-21 20:49:27,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-21 20:49:27,398 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:27,398 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:27,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 20:49:27,398 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:27,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:27,399 INFO L85 PathProgramCache]: Analyzing trace with hash 565405448, now seen corresponding path program 1 times [2021-12-21 20:49:27,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:27,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898652166] [2021-12-21 20:49:27,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:27,399 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:27,464 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:27,464 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:27,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898652166] [2021-12-21 20:49:27,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898652166] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:27,465 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:27,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 20:49:27,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803271759] [2021-12-21 20:49:27,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:27,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:49:27,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:27,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:49:27,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 20:49:27,467 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:27,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:27,600 INFO L93 Difference]: Finished difference Result 221 states and 296 transitions. [2021-12-21 20:49:27,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 20:49:27,600 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:27,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:27,601 INFO L225 Difference]: With dead ends: 221 [2021-12-21 20:49:27,601 INFO L226 Difference]: Without dead ends: 164 [2021-12-21 20:49:27,602 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:27,603 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:27,603 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:27,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-12-21 20:49:27,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 104. [2021-12-21 20:49:27,609 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:27,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2021-12-21 20:49:27,609 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 135 transitions. Word has length 20 [2021-12-21 20:49:27,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:27,610 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 135 transitions. [2021-12-21 20:49:27,610 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:27,610 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 135 transitions. [2021-12-21 20:49:27,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-21 20:49:27,611 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:27,611 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:27,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 20:49:27,611 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:27,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:27,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1055427225, now seen corresponding path program 1 times [2021-12-21 20:49:27,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:27,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026405943] [2021-12-21 20:49:27,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:27,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:27,690 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:27,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:27,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026405943] [2021-12-21 20:49:27,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026405943] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:27,691 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:27,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 20:49:27,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007587393] [2021-12-21 20:49:27,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:27,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:49:27,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:27,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:49:27,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 20:49:27,693 INFO L87 Difference]: Start difference. First operand 104 states and 135 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:27,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:27,838 INFO L93 Difference]: Finished difference Result 259 states and 340 transitions. [2021-12-21 20:49:27,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 20:49:27,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-21 20:49:27,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:27,841 INFO L225 Difference]: With dead ends: 259 [2021-12-21 20:49:27,841 INFO L226 Difference]: Without dead ends: 194 [2021-12-21 20:49:27,843 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:27,845 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 124 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:27,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 291 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:49:27,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-12-21 20:49:27,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 120. [2021-12-21 20:49:27,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.2941176470588236) internal successors, (154), 119 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:27,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 154 transitions. [2021-12-21 20:49:27,852 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 154 transitions. Word has length 23 [2021-12-21 20:49:27,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:27,852 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 154 transitions. [2021-12-21 20:49:27,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:27,853 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 154 transitions. [2021-12-21 20:49:27,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-21 20:49:27,854 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:27,854 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] [2021-12-21 20:49:27,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 20:49:27,854 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:27,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:27,855 INFO L85 PathProgramCache]: Analyzing trace with hash -2113419709, now seen corresponding path program 1 times [2021-12-21 20:49:27,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:27,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493206812] [2021-12-21 20:49:27,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:27,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:27,908 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:27,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:27,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493206812] [2021-12-21 20:49:27,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493206812] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:49:27,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402268206] [2021-12-21 20:49:27,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:27,909 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:49:27,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:49:27,916 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:27,927 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:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:27,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 20:49:27,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:49:28,135 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:28,135 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:49:28,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402268206] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:28,135 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 20:49:28,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-12-21 20:49:28,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937752975] [2021-12-21 20:49:28,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:28,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:49:28,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:28,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:49:28,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-21 20:49:28,137 INFO L87 Difference]: Start difference. First operand 120 states and 154 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:28,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:28,264 INFO L93 Difference]: Finished difference Result 216 states and 307 transitions. [2021-12-21 20:49:28,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 20:49:28,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-21 20:49:28,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:28,265 INFO L225 Difference]: With dead ends: 216 [2021-12-21 20:49:28,265 INFO L226 Difference]: Without dead ends: 169 [2021-12-21 20:49:28,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-21 20:49:28,266 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 57 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:28,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 164 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:49:28,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-12-21 20:49:28,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 145. [2021-12-21 20:49:28,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.2708333333333333) internal successors, (183), 144 states have internal predecessors, (183), 0 states have call successors, (0), 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:28,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 183 transitions. [2021-12-21 20:49:28,272 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 183 transitions. Word has length 26 [2021-12-21 20:49:28,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:28,272 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 183 transitions. [2021-12-21 20:49:28,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:28,272 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 183 transitions. [2021-12-21 20:49:28,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-21 20:49:28,273 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:28,273 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:49:28,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-21 20:49:28,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:49:28,488 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:28,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:28,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1301565703, now seen corresponding path program 1 times [2021-12-21 20:49:28,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:28,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378731866] [2021-12-21 20:49:28,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:28,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:28,534 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:49:28,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:28,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378731866] [2021-12-21 20:49:28,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378731866] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:49:28,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056746957] [2021-12-21 20:49:28,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:28,535 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:49:28,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:49:28,536 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:28,537 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:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:28,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 20:49:28,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:49:28,685 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 20:49:28,686 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:49:28,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056746957] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:28,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 20:49:28,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-12-21 20:49:28,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965495795] [2021-12-21 20:49:28,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:28,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:49:28,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:28,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:49:28,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-21 20:49:28,688 INFO L87 Difference]: Start difference. First operand 145 states and 183 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:28,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:28,755 INFO L93 Difference]: Finished difference Result 262 states and 343 transitions. [2021-12-21 20:49:28,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 20:49:28,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-21 20:49:28,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:28,757 INFO L225 Difference]: With dead ends: 262 [2021-12-21 20:49:28,757 INFO L226 Difference]: Without dead ends: 170 [2021-12-21 20:49:28,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-21 20:49:28,758 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 17 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:28,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 201 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 58 Invalid, 0 Unknown, 60 Unchecked, 0.1s Time] [2021-12-21 20:49:28,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-12-21 20:49:28,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 144. [2021-12-21 20:49:28,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.2727272727272727) internal successors, (182), 143 states have internal predecessors, (182), 0 states have call successors, (0), 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:28,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 182 transitions. [2021-12-21 20:49:28,764 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 182 transitions. Word has length 33 [2021-12-21 20:49:28,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:28,764 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 182 transitions. [2021-12-21 20:49:28,764 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:28,764 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 182 transitions. [2021-12-21 20:49:28,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-21 20:49:28,765 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:28,766 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:49:28,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-21 20:49:28,979 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,SelfDestructingSolverStorable5 [2021-12-21 20:49:28,979 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:28,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:28,980 INFO L85 PathProgramCache]: Analyzing trace with hash 115469453, now seen corresponding path program 1 times [2021-12-21 20:49:28,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:28,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696741025] [2021-12-21 20:49:28,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:28,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:29,049 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-21 20:49:29,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:29,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696741025] [2021-12-21 20:49:29,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696741025] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:29,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:29,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 20:49:29,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869908625] [2021-12-21 20:49:29,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:29,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 20:49:29,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:29,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 20:49:29,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:49:29,052 INFO L87 Difference]: Start difference. First operand 144 states and 182 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:29,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:29,171 INFO L93 Difference]: Finished difference Result 354 states and 456 transitions. [2021-12-21 20:49:29,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 20:49:29,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-21 20:49:29,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:29,172 INFO L225 Difference]: With dead ends: 354 [2021-12-21 20:49:29,172 INFO L226 Difference]: Without dead ends: 263 [2021-12-21 20:49:29,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:49:29,173 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 169 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:29,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 162 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:49:29,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-12-21 20:49:29,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 166. [2021-12-21 20:49:29,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.284848484848485) internal successors, (212), 165 states have internal predecessors, (212), 0 states have call successors, (0), 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:29,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 212 transitions. [2021-12-21 20:49:29,178 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 212 transitions. Word has length 39 [2021-12-21 20:49:29,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:29,178 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 212 transitions. [2021-12-21 20:49:29,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:29,178 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 212 transitions. [2021-12-21 20:49:29,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-21 20:49:29,180 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:29,180 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:49:29,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-21 20:49:29,180 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:29,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:29,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1345550587, now seen corresponding path program 1 times [2021-12-21 20:49:29,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:29,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983701733] [2021-12-21 20:49:29,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:29,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:29,203 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-21 20:49:29,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:29,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983701733] [2021-12-21 20:49:29,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983701733] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:29,204 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:29,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 20:49:29,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196766632] [2021-12-21 20:49:29,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:29,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 20:49:29,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:29,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 20:49:29,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:49:29,206 INFO L87 Difference]: Start difference. First operand 166 states and 212 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:29,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:29,273 INFO L93 Difference]: Finished difference Result 309 states and 407 transitions. [2021-12-21 20:49:29,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 20:49:29,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-21 20:49:29,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:29,274 INFO L225 Difference]: With dead ends: 309 [2021-12-21 20:49:29,274 INFO L226 Difference]: Without dead ends: 196 [2021-12-21 20:49:29,275 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:29,276 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 41 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:29,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 109 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:49:29,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-12-21 20:49:29,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 180. [2021-12-21 20:49:29,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 1.324022346368715) internal successors, (237), 179 states have internal predecessors, (237), 0 states have call successors, (0), 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:29,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 237 transitions. [2021-12-21 20:49:29,296 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 237 transitions. Word has length 40 [2021-12-21 20:49:29,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:29,297 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 237 transitions. [2021-12-21 20:49:29,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:29,297 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 237 transitions. [2021-12-21 20:49:29,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-21 20:49:29,298 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:29,303 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:49:29,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-21 20:49:29,304 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:29,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:29,304 INFO L85 PathProgramCache]: Analyzing trace with hash -665492217, now seen corresponding path program 1 times [2021-12-21 20:49:29,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:29,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811601611] [2021-12-21 20:49:29,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:29,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:29,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:29,348 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:49:29,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:29,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811601611] [2021-12-21 20:49:29,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811601611] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:49:29,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111159202] [2021-12-21 20:49:29,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:29,349 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:49:29,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:49:29,350 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:29,376 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:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:29,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 20:49:29,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:49:29,498 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-21 20:49:29,498 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:49:29,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111159202] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:29,498 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 20:49:29,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2021-12-21 20:49:29,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861762340] [2021-12-21 20:49:29,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:29,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:49:29,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:29,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:49:29,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:49:29,499 INFO L87 Difference]: Start difference. First operand 180 states and 237 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:29,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:29,567 INFO L93 Difference]: Finished difference Result 316 states and 419 transitions. [2021-12-21 20:49:29,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 20:49:29,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-21 20:49:29,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:29,568 INFO L225 Difference]: With dead ends: 316 [2021-12-21 20:49:29,568 INFO L226 Difference]: Without dead ends: 189 [2021-12-21 20:49:29,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:49:29,568 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 16 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:29,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 201 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 45 Unchecked, 0.1s Time] [2021-12-21 20:49:29,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-12-21 20:49:29,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 179. [2021-12-21 20:49:29,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.2752808988764044) internal successors, (227), 178 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:29,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 227 transitions. [2021-12-21 20:49:29,572 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 227 transitions. Word has length 40 [2021-12-21 20:49:29,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:29,573 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 227 transitions. [2021-12-21 20:49:29,573 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:29,573 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 227 transitions. [2021-12-21 20:49:29,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-21 20:49:29,573 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:29,573 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:49:29,593 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:29,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:49:29,791 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:29,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:29,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1738577597, now seen corresponding path program 1 times [2021-12-21 20:49:29,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:29,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059189956] [2021-12-21 20:49:29,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:29,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:29,812 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-21 20:49:29,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:29,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059189956] [2021-12-21 20:49:29,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059189956] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:29,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:29,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 20:49:29,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73991706] [2021-12-21 20:49:29,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:29,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 20:49:29,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:29,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 20:49:29,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:49:29,813 INFO L87 Difference]: Start difference. First operand 179 states and 227 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:29,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:29,818 INFO L93 Difference]: Finished difference Result 205 states and 257 transitions. [2021-12-21 20:49:29,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 20:49:29,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-21 20:49:29,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:29,819 INFO L225 Difference]: With dead ends: 205 [2021-12-21 20:49:29,819 INFO L226 Difference]: Without dead ends: 179 [2021-12-21 20:49:29,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 20:49:29,820 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 8 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:29,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 197 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:49:29,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-12-21 20:49:29,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2021-12-21 20:49:29,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.2696629213483146) internal successors, (226), 178 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:29,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 226 transitions. [2021-12-21 20:49:29,823 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 226 transitions. Word has length 40 [2021-12-21 20:49:29,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:29,823 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 226 transitions. [2021-12-21 20:49:29,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:29,824 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 226 transitions. [2021-12-21 20:49:29,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-21 20:49:29,824 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:29,824 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:49:29,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-21 20:49:29,824 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:29,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:29,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1058519227, now seen corresponding path program 2 times [2021-12-21 20:49:29,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:29,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707813438] [2021-12-21 20:49:29,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:29,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:29,874 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 20:49:29,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:29,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707813438] [2021-12-21 20:49:29,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707813438] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:29,874 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:29,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 20:49:29,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669604906] [2021-12-21 20:49:29,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:29,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 20:49:29,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:29,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 20:49:29,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-21 20:49:29,875 INFO L87 Difference]: Start difference. First operand 179 states and 226 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:30,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:30,062 INFO L93 Difference]: Finished difference Result 342 states and 440 transitions. [2021-12-21 20:49:30,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:49:30,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-21 20:49:30,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:30,064 INFO L225 Difference]: With dead ends: 342 [2021-12-21 20:49:30,064 INFO L226 Difference]: Without dead ends: 194 [2021-12-21 20:49:30,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-21 20:49:30,065 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 107 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:30,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 182 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 20:49:30,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-12-21 20:49:30,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 172. [2021-12-21 20:49:30,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.2514619883040936) internal successors, (214), 171 states have internal predecessors, (214), 0 states have call successors, (0), 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,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 214 transitions. [2021-12-21 20:49:30,073 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 214 transitions. Word has length 40 [2021-12-21 20:49:30,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:30,073 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 214 transitions. [2021-12-21 20:49:30,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:30,074 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 214 transitions. [2021-12-21 20:49:30,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-21 20:49:30,074 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:30,074 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-21 20:49:30,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-21 20:49:30,075 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:30,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:30,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1730338002, now seen corresponding path program 1 times [2021-12-21 20:49:30,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:30,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765211169] [2021-12-21 20:49:30,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:30,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:30,130 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:49:30,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:30,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765211169] [2021-12-21 20:49:30,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765211169] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:30,131 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:30,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 20:49:30,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55784665] [2021-12-21 20:49:30,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:30,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:49:30,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:30,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:49:30,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 20:49:30,133 INFO L87 Difference]: Start difference. First operand 172 states and 214 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:30,171 INFO L93 Difference]: Finished difference Result 349 states and 438 transitions. [2021-12-21 20:49:30,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 20:49:30,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2021-12-21 20:49:30,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:30,172 INFO L225 Difference]: With dead ends: 349 [2021-12-21 20:49:30,172 INFO L226 Difference]: Without dead ends: 228 [2021-12-21 20:49:30,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 20:49:30,173 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 48 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:30,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 282 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 20:49:30,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-12-21 20:49:30,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 184. [2021-12-21 20:49:30,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.284153005464481) internal successors, (235), 183 states have internal predecessors, (235), 0 states have call successors, (0), 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,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 235 transitions. [2021-12-21 20:49:30,178 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 235 transitions. Word has length 42 [2021-12-21 20:49:30,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:30,178 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 235 transitions. [2021-12-21 20:49:30,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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,178 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 235 transitions. [2021-12-21 20:49:30,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-21 20:49:30,179 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:30,179 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:49:30,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-21 20:49:30,179 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:30,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:30,180 INFO L85 PathProgramCache]: Analyzing trace with hash 719220752, now seen corresponding path program 1 times [2021-12-21 20:49:30,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:30,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969242785] [2021-12-21 20:49:30,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:30,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:30,254 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:49:30,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:30,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969242785] [2021-12-21 20:49:30,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969242785] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:49:30,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741871130] [2021-12-21 20:49:30,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:30,255 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:49:30,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:49:30,256 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:30,271 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:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:30,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 20:49:30,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:49:30,478 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 20:49:30,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:49:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:49:30,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741871130] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:49:30,611 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:49:30,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 11 [2021-12-21 20:49:30,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480858279] [2021-12-21 20:49:30,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:49:30,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 20:49:30,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:30,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 20:49:30,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-21 20:49:30,614 INFO L87 Difference]: Start difference. First operand 184 states and 235 transitions. Second operand has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 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:30,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:30,939 INFO L93 Difference]: Finished difference Result 701 states and 929 transitions. [2021-12-21 20:49:30,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-21 20:49:30,940 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 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 42 [2021-12-21 20:49:30,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:30,941 INFO L225 Difference]: With dead ends: 701 [2021-12-21 20:49:30,941 INFO L226 Difference]: Without dead ends: 556 [2021-12-21 20:49:30,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2021-12-21 20:49:30,944 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 445 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:30,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [445 Valid, 350 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 20:49:30,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2021-12-21 20:49:30,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 463. [2021-12-21 20:49:30,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 462 states have (on average 1.3181818181818181) internal successors, (609), 462 states have internal predecessors, (609), 0 states have call successors, (0), 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,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 609 transitions. [2021-12-21 20:49:30,956 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 609 transitions. Word has length 42 [2021-12-21 20:49:30,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:30,956 INFO L470 AbstractCegarLoop]: Abstraction has 463 states and 609 transitions. [2021-12-21 20:49:30,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 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:30,957 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 609 transitions. [2021-12-21 20:49:30,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-21 20:49:30,957 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:30,957 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:49:30,999 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:31,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:49:31,174 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:31,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:31,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1729147787, now seen corresponding path program 1 times [2021-12-21 20:49:31,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:31,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307635376] [2021-12-21 20:49:31,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:31,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:31,241 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 20:49:31,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:31,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307635376] [2021-12-21 20:49:31,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307635376] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:49:31,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051748968] [2021-12-21 20:49:31,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:31,242 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:49:31,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:49:31,243 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:31,244 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:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:31,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 20:49:31,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:49:31,350 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-21 20:49:31,350 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:49:31,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051748968] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:31,350 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 20:49:31,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2021-12-21 20:49:31,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210855969] [2021-12-21 20:49:31,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:31,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:49:31,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:31,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:49:31,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-21 20:49:31,352 INFO L87 Difference]: Start difference. First operand 463 states and 609 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:31,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:31,427 INFO L93 Difference]: Finished difference Result 1034 states and 1371 transitions. [2021-12-21 20:49:31,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 20:49:31,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-12-21 20:49:31,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:31,429 INFO L225 Difference]: With dead ends: 1034 [2021-12-21 20:49:31,429 INFO L226 Difference]: Without dead ends: 619 [2021-12-21 20:49:31,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-21 20:49:31,430 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 38 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:31,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 188 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:49:31,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2021-12-21 20:49:31,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 505. [2021-12-21 20:49:31,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 1.3055555555555556) internal successors, (658), 504 states have internal predecessors, (658), 0 states have call successors, (0), 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,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 658 transitions. [2021-12-21 20:49:31,442 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 658 transitions. Word has length 45 [2021-12-21 20:49:31,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:31,442 INFO L470 AbstractCegarLoop]: Abstraction has 505 states and 658 transitions. [2021-12-21 20:49:31,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:31,442 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 658 transitions. [2021-12-21 20:49:31,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-21 20:49:31,443 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:31,443 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:49:31,460 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:31,655 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,SelfDestructingSolverStorable13 [2021-12-21 20:49:31,656 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:31,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:31,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1580936578, now seen corresponding path program 1 times [2021-12-21 20:49:31,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:31,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147221141] [2021-12-21 20:49:31,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:31,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:31,759 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-21 20:49:31,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:31,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147221141] [2021-12-21 20:49:31,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147221141] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:31,760 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:31,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 20:49:31,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223658740] [2021-12-21 20:49:31,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:31,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 20:49:31,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:31,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 20:49:31,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 20:49:31,761 INFO L87 Difference]: Start difference. First operand 505 states and 658 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:31,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:31,866 INFO L93 Difference]: Finished difference Result 1441 states and 1893 transitions. [2021-12-21 20:49:31,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 20:49:31,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-12-21 20:49:31,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:31,868 INFO L225 Difference]: With dead ends: 1441 [2021-12-21 20:49:31,869 INFO L226 Difference]: Without dead ends: 988 [2021-12-21 20:49:31,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:31,871 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 126 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:31,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 143 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:49:31,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2021-12-21 20:49:31,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 699. [2021-12-21 20:49:31,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.3954154727793697) internal successors, (974), 698 states have internal predecessors, (974), 0 states have call successors, (0), 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,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 974 transitions. [2021-12-21 20:49:31,886 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 974 transitions. Word has length 61 [2021-12-21 20:49:31,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:31,886 INFO L470 AbstractCegarLoop]: Abstraction has 699 states and 974 transitions. [2021-12-21 20:49:31,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:31,886 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 974 transitions. [2021-12-21 20:49:31,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-21 20:49:31,887 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:31,887 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:49:31,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-21 20:49:31,888 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:31,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:31,888 INFO L85 PathProgramCache]: Analyzing trace with hash -392959527, now seen corresponding path program 1 times [2021-12-21 20:49:31,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:31,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034973997] [2021-12-21 20:49:31,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:31,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:31,957 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 44 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-21 20:49:31,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:31,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034973997] [2021-12-21 20:49:31,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034973997] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:49:31,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758720939] [2021-12-21 20:49:31,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:31,958 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:49:31,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:49:31,959 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:31,996 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:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:32,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 20:49:32,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:49:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-21 20:49:32,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:49:32,315 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-21 20:49:32,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758720939] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:49:32,315 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:49:32,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2021-12-21 20:49:32,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127893006] [2021-12-21 20:49:32,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:49:32,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 20:49:32,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:32,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 20:49:32,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-21 20:49:32,317 INFO L87 Difference]: Start difference. First operand 699 states and 974 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 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,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:32,671 INFO L93 Difference]: Finished difference Result 1793 states and 2497 transitions. [2021-12-21 20:49:32,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-21 20:49:32,672 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 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 71 [2021-12-21 20:49:32,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:32,675 INFO L225 Difference]: With dead ends: 1793 [2021-12-21 20:49:32,676 INFO L226 Difference]: Without dead ends: 1372 [2021-12-21 20:49:32,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 143 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2021-12-21 20:49:32,677 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 336 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:32,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 287 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 20:49:32,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2021-12-21 20:49:32,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1214. [2021-12-21 20:49:32,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1213 states have (on average 1.3709810387469086) internal successors, (1663), 1213 states have internal predecessors, (1663), 0 states have call successors, (0), 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,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1663 transitions. [2021-12-21 20:49:32,707 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1663 transitions. Word has length 71 [2021-12-21 20:49:32,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:32,707 INFO L470 AbstractCegarLoop]: Abstraction has 1214 states and 1663 transitions. [2021-12-21 20:49:32,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 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,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1663 transitions. [2021-12-21 20:49:32,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-21 20:49:32,709 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:32,709 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:49:32,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-21 20:49:32,929 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,SelfDestructingSolverStorable15 [2021-12-21 20:49:32,929 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:32,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:32,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1149725251, now seen corresponding path program 1 times [2021-12-21 20:49:32,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:32,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363425903] [2021-12-21 20:49:32,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:32,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:32,976 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-21 20:49:32,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:32,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363425903] [2021-12-21 20:49:32,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363425903] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:32,976 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:32,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 20:49:32,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695576533] [2021-12-21 20:49:32,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:32,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 20:49:32,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:32,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 20:49:32,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-21 20:49:32,978 INFO L87 Difference]: Start difference. First operand 1214 states and 1663 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:33,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:33,163 INFO L93 Difference]: Finished difference Result 3142 states and 4231 transitions. [2021-12-21 20:49:33,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 20:49:33,163 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-12-21 20:49:33,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:33,167 INFO L225 Difference]: With dead ends: 3142 [2021-12-21 20:49:33,167 INFO L226 Difference]: Without dead ends: 1794 [2021-12-21 20:49:33,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-12-21 20:49:33,169 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 174 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:33,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 257 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:49:33,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2021-12-21 20:49:33,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1367. [2021-12-21 20:49:33,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 1366 states have (on average 1.357247437774524) internal successors, (1854), 1366 states have internal predecessors, (1854), 0 states have call successors, (0), 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,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1854 transitions. [2021-12-21 20:49:33,195 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1854 transitions. Word has length 71 [2021-12-21 20:49:33,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:33,196 INFO L470 AbstractCegarLoop]: Abstraction has 1367 states and 1854 transitions. [2021-12-21 20:49:33,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:33,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1854 transitions. [2021-12-21 20:49:33,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-21 20:49:33,197 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:33,198 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:49:33,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-21 20:49:33,198 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:33,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:33,198 INFO L85 PathProgramCache]: Analyzing trace with hash 2036257007, now seen corresponding path program 1 times [2021-12-21 20:49:33,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:33,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502473090] [2021-12-21 20:49:33,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:33,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:33,225 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-21 20:49:33,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:33,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502473090] [2021-12-21 20:49:33,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502473090] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:49:33,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226063014] [2021-12-21 20:49:33,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:33,226 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:49:33,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:49:33,244 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:33,286 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:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:33,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-21 20:49:33,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:49:33,440 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 26 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-21 20:49:33,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:49:33,533 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-21 20:49:33,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226063014] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:49:33,534 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:49:33,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2021-12-21 20:49:33,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973552830] [2021-12-21 20:49:33,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:49:33,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 20:49:33,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:33,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 20:49:33,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-12-21 20:49:33,536 INFO L87 Difference]: Start difference. First operand 1367 states and 1854 transitions. Second operand has 10 states, 9 states have (on average 11.444444444444445) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 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,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:34,646 INFO L93 Difference]: Finished difference Result 6148 states and 7818 transitions. [2021-12-21 20:49:34,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-21 20:49:34,647 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 11.444444444444445) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 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 77 [2021-12-21 20:49:34,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:34,660 INFO L225 Difference]: With dead ends: 6148 [2021-12-21 20:49:34,661 INFO L226 Difference]: Without dead ends: 6123 [2021-12-21 20:49:34,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=1514, Unknown=0, NotChecked=0, Total=1892 [2021-12-21 20:49:34,663 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 459 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:34,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 872 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-21 20:49:34,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6123 states. [2021-12-21 20:49:34,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6123 to 1712. [2021-12-21 20:49:34,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1711 states have (on average 1.4061952074810053) internal successors, (2406), 1711 states have internal predecessors, (2406), 0 states have call successors, (0), 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,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2406 transitions. [2021-12-21 20:49:34,746 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2406 transitions. Word has length 77 [2021-12-21 20:49:34,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:34,746 INFO L470 AbstractCegarLoop]: Abstraction has 1712 states and 2406 transitions. [2021-12-21 20:49:34,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 11.444444444444445) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 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,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2406 transitions. [2021-12-21 20:49:34,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-21 20:49:34,747 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:34,748 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2021-12-21 20:49:34,768 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:34,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:49:34,956 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:34,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:34,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1488348929, now seen corresponding path program 1 times [2021-12-21 20:49:34,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:34,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400349212] [2021-12-21 20:49:34,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:34,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:35,023 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-21 20:49:35,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:35,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400349212] [2021-12-21 20:49:35,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400349212] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:35,024 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:35,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 20:49:35,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901344055] [2021-12-21 20:49:35,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:35,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 20:49:35,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:35,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 20:49:35,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:49:35,026 INFO L87 Difference]: Start difference. First operand 1712 states and 2406 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 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,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:35,269 INFO L93 Difference]: Finished difference Result 4153 states and 5790 transitions. [2021-12-21 20:49:35,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 20:49:35,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 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 77 [2021-12-21 20:49:35,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:35,275 INFO L225 Difference]: With dead ends: 4153 [2021-12-21 20:49:35,275 INFO L226 Difference]: Without dead ends: 2398 [2021-12-21 20:49:35,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2021-12-21 20:49:35,277 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 263 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:35,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [263 Valid, 228 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 20:49:35,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states. [2021-12-21 20:49:35,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 2163. [2021-12-21 20:49:35,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2163 states, 2162 states have (on average 1.4056429232192413) internal successors, (3039), 2162 states have internal predecessors, (3039), 0 states have call successors, (0), 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,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 3039 transitions. [2021-12-21 20:49:35,350 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 3039 transitions. Word has length 77 [2021-12-21 20:49:35,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:35,350 INFO L470 AbstractCegarLoop]: Abstraction has 2163 states and 3039 transitions. [2021-12-21 20:49:35,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 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,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 3039 transitions. [2021-12-21 20:49:35,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-21 20:49:35,352 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:35,352 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:35,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-21 20:49:35,352 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:35,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:35,353 INFO L85 PathProgramCache]: Analyzing trace with hash 220871532, now seen corresponding path program 1 times [2021-12-21 20:49:35,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:35,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823790777] [2021-12-21 20:49:35,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:35,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:35,409 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,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:35,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823790777] [2021-12-21 20:49:35,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823790777] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:35,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:35,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 20:49:35,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528741018] [2021-12-21 20:49:35,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:35,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 20:49:35,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:35,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 20:49:35,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 20:49:35,412 INFO L87 Difference]: Start difference. First operand 2163 states and 3039 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:35,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:35,638 INFO L93 Difference]: Finished difference Result 6912 states and 9683 transitions. [2021-12-21 20:49:35,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:49:35,639 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:35,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:35,654 INFO L225 Difference]: With dead ends: 6912 [2021-12-21 20:49:35,654 INFO L226 Difference]: Without dead ends: 6500 [2021-12-21 20:49:35,656 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:35,657 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 231 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:35,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 437 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 20:49:35,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6500 states. [2021-12-21 20:49:35,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6500 to 2163. [2021-12-21 20:49:35,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2163 states, 2162 states have (on average 1.4056429232192413) internal successors, (3039), 2162 states have internal predecessors, (3039), 0 states have call successors, (0), 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,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 3039 transitions. [2021-12-21 20:49:35,741 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 3039 transitions. Word has length 80 [2021-12-21 20:49:35,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:35,741 INFO L470 AbstractCegarLoop]: Abstraction has 2163 states and 3039 transitions. [2021-12-21 20:49:35,741 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:35,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 3039 transitions. [2021-12-21 20:49:35,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-21 20:49:35,743 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:35,743 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:35,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-21 20:49:35,743 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:35,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:35,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1618881827, now seen corresponding path program 1 times [2021-12-21 20:49:35,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:35,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884244000] [2021-12-21 20:49:35,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:35,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:35,807 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,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:35,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884244000] [2021-12-21 20:49:35,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884244000] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:35,807 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:35,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 20:49:35,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846101864] [2021-12-21 20:49:35,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:35,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 20:49:35,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:35,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 20:49:35,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 20:49:35,809 INFO L87 Difference]: Start difference. First operand 2163 states and 3039 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:36,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:36,186 INFO L93 Difference]: Finished difference Result 9090 states and 12731 transitions. [2021-12-21 20:49:36,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 20:49:36,187 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-12-21 20:49:36,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:36,214 INFO L225 Difference]: With dead ends: 9090 [2021-12-21 20:49:36,215 INFO L226 Difference]: Without dead ends: 8678 [2021-12-21 20:49:36,217 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:36,218 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 347 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:36,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 654 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 20:49:36,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8678 states. [2021-12-21 20:49:36,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8678 to 2163. [2021-12-21 20:49:36,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2163 states, 2162 states have (on average 1.4056429232192413) internal successors, (3039), 2162 states have internal predecessors, (3039), 0 states have call successors, (0), 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:36,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 3039 transitions. [2021-12-21 20:49:36,336 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 3039 transitions. Word has length 83 [2021-12-21 20:49:36,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:36,336 INFO L470 AbstractCegarLoop]: Abstraction has 2163 states and 3039 transitions. [2021-12-21 20:49:36,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:36,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 3039 transitions. [2021-12-21 20:49:36,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-21 20:49:36,338 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:36,338 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:36,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-21 20:49:36,339 INFO L402 AbstractCegarLoop]: === Iteration 22 === 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:36,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:36,339 INFO L85 PathProgramCache]: Analyzing trace with hash -705708941, now seen corresponding path program 1 times [2021-12-21 20:49:36,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:36,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473742933] [2021-12-21 20:49:36,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:36,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:36,481 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-21 20:49:36,481 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:36,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473742933] [2021-12-21 20:49:36,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473742933] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:36,481 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:36,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 20:49:36,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137898457] [2021-12-21 20:49:36,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:36,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 20:49:36,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:36,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 20:49:36,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 20:49:36,482 INFO L87 Difference]: Start difference. First operand 2163 states and 3039 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:36,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:36,945 INFO L93 Difference]: Finished difference Result 4412 states and 6149 transitions. [2021-12-21 20:49:36,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 20:49:36,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-12-21 20:49:36,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:36,952 INFO L225 Difference]: With dead ends: 4412 [2021-12-21 20:49:36,956 INFO L226 Difference]: Without dead ends: 4248 [2021-12-21 20:49:36,957 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:36,957 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 289 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:36,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 578 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-21 20:49:36,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4248 states. [2021-12-21 20:49:37,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4248 to 2176. [2021-12-21 20:49:37,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2176 states, 2175 states have (on average 1.4036781609195403) internal successors, (3053), 2175 states have internal predecessors, (3053), 0 states have call successors, (0), 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:37,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3053 transitions. [2021-12-21 20:49:37,026 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3053 transitions. Word has length 83 [2021-12-21 20:49:37,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:37,027 INFO L470 AbstractCegarLoop]: Abstraction has 2176 states and 3053 transitions. [2021-12-21 20:49:37,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:37,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3053 transitions. [2021-12-21 20:49:37,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-21 20:49:37,028 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:37,029 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:37,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-21 20:49:37,029 INFO L402 AbstractCegarLoop]: === Iteration 23 === 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:37,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:37,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1508814206, now seen corresponding path program 1 times [2021-12-21 20:49:37,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:37,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623799015] [2021-12-21 20:49:37,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:37,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:37,087 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:37,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:37,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623799015] [2021-12-21 20:49:37,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623799015] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:49:37,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862133994] [2021-12-21 20:49:37,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:37,088 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:49:37,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:49:37,089 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 20:49:37,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-21 20:49:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:37,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 20:49:37,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:49:37,315 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:37,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:49:37,483 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-21 20:49:37,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862133994] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:49:37,484 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:49:37,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2021-12-21 20:49:37,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142327136] [2021-12-21 20:49:37,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:49:37,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-21 20:49:37,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:37,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-21 20:49:37,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-12-21 20:49:37,485 INFO L87 Difference]: Start difference. First operand 2176 states and 3053 transitions. Second operand has 12 states, 12 states have (on average 10.75) internal successors, (129), 12 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:37,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:37,902 INFO L93 Difference]: Finished difference Result 8286 states and 11702 transitions. [2021-12-21 20:49:37,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 20:49:37,903 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.75) internal successors, (129), 12 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-12-21 20:49:37,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:37,910 INFO L225 Difference]: With dead ends: 8286 [2021-12-21 20:49:37,911 INFO L226 Difference]: Without dead ends: 6158 [2021-12-21 20:49:37,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2021-12-21 20:49:37,913 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 394 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:37,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [394 Valid, 542 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 20:49:37,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6158 states. [2021-12-21 20:49:38,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6158 to 5237. [2021-12-21 20:49:38,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5237 states, 5236 states have (on average 1.37012987012987) internal successors, (7174), 5236 states have internal predecessors, (7174), 0 states have call successors, (0), 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:38,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5237 states to 5237 states and 7174 transitions. [2021-12-21 20:49:38,070 INFO L78 Accepts]: Start accepts. Automaton has 5237 states and 7174 transitions. Word has length 83 [2021-12-21 20:49:38,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:38,071 INFO L470 AbstractCegarLoop]: Abstraction has 5237 states and 7174 transitions. [2021-12-21 20:49:38,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.75) internal successors, (129), 12 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:38,071 INFO L276 IsEmpty]: Start isEmpty. Operand 5237 states and 7174 transitions. [2021-12-21 20:49:38,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-21 20:49:38,074 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:38,074 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, 1, 1] [2021-12-21 20:49:38,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-21 20:49:38,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-21 20:49:38,292 INFO L402 AbstractCegarLoop]: === Iteration 24 === 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:38,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:38,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1670983295, now seen corresponding path program 1 times [2021-12-21 20:49:38,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:38,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515215721] [2021-12-21 20:49:38,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:38,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:38,377 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:38,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:38,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515215721] [2021-12-21 20:49:38,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515215721] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:38,378 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:38,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 20:49:38,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628396939] [2021-12-21 20:49:38,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:38,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 20:49:38,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:38,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 20:49:38,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:49:38,379 INFO L87 Difference]: Start difference. First operand 5237 states and 7174 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:38,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:38,888 INFO L93 Difference]: Finished difference Result 10765 states and 14711 transitions. [2021-12-21 20:49:38,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 20:49:38,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-12-21 20:49:38,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:38,901 INFO L225 Difference]: With dead ends: 10765 [2021-12-21 20:49:38,901 INFO L226 Difference]: Without dead ends: 10353 [2021-12-21 20:49:38,903 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:38,904 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 461 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:38,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [461 Valid, 1016 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 20:49:38,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10353 states. [2021-12-21 20:49:39,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10353 to 5215. [2021-12-21 20:49:39,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5215 states, 5214 states have (on average 1.370349060222478) internal successors, (7145), 5214 states have internal predecessors, (7145), 0 states have call successors, (0), 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,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5215 states to 5215 states and 7145 transitions. [2021-12-21 20:49:39,073 INFO L78 Accepts]: Start accepts. Automaton has 5215 states and 7145 transitions. Word has length 85 [2021-12-21 20:49:39,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:39,073 INFO L470 AbstractCegarLoop]: Abstraction has 5215 states and 7145 transitions. [2021-12-21 20:49:39,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:39,074 INFO L276 IsEmpty]: Start isEmpty. Operand 5215 states and 7145 transitions. [2021-12-21 20:49:39,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-21 20:49:39,076 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:39,077 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, 1, 1] [2021-12-21 20:49:39,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-21 20:49:39,077 INFO L402 AbstractCegarLoop]: === Iteration 25 === 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:39,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:39,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1447135889, now seen corresponding path program 1 times [2021-12-21 20:49:39,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:39,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794297694] [2021-12-21 20:49:39,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:39,078 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:39,154 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-21 20:49:39,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:39,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794297694] [2021-12-21 20:49:39,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794297694] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:49:39,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 20:49:39,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 20:49:39,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184337858] [2021-12-21 20:49:39,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:49:39,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 20:49:39,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:39,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 20:49:39,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 20:49:39,156 INFO L87 Difference]: Start difference. First operand 5215 states and 7145 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 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,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:39,718 INFO L93 Difference]: Finished difference Result 10481 states and 14311 transitions. [2021-12-21 20:49:39,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 20:49:39,718 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 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:39,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:39,731 INFO L225 Difference]: With dead ends: 10481 [2021-12-21 20:49:39,731 INFO L226 Difference]: Without dead ends: 10075 [2021-12-21 20:49:39,732 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:39,733 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 375 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:39,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [375 Valid, 845 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 20:49:39,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10075 states. [2021-12-21 20:49:39,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10075 to 5185. [2021-12-21 20:49:39,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5185 states, 5184 states have (on average 1.3719135802469136) internal successors, (7112), 5184 states have internal predecessors, (7112), 0 states have call successors, (0), 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,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5185 states to 5185 states and 7112 transitions. [2021-12-21 20:49:39,932 INFO L78 Accepts]: Start accepts. Automaton has 5185 states and 7112 transitions. Word has length 85 [2021-12-21 20:49:39,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:39,932 INFO L470 AbstractCegarLoop]: Abstraction has 5185 states and 7112 transitions. [2021-12-21 20:49:39,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 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,933 INFO L276 IsEmpty]: Start isEmpty. Operand 5185 states and 7112 transitions. [2021-12-21 20:49:39,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-12-21 20:49:39,935 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:39,936 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:39,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-21 20:49:39,936 INFO L402 AbstractCegarLoop]: === Iteration 26 === 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:39,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:39,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1246814763, now seen corresponding path program 1 times [2021-12-21 20:49:39,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:39,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110156639] [2021-12-21 20:49:39,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:39,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:40,014 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:40,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:40,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110156639] [2021-12-21 20:49:40,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110156639] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:49:40,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144915223] [2021-12-21 20:49:40,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:40,015 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:49:40,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:49:40,028 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 20:49:40,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-21 20:49:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:40,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-21 20:49:40,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:49:58,317 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:58,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 20:49:58,592 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-21 20:49:58,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144915223] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 20:49:58,592 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 20:49:58,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 15 [2021-12-21 20:49:58,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348212207] [2021-12-21 20:49:58,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 20:49:58,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-21 20:49:58,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:49:58,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-21 20:49:58,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=145, Unknown=3, NotChecked=0, Total=210 [2021-12-21 20:49:58,593 INFO L87 Difference]: Start difference. First operand 5185 states and 7112 transitions. Second operand has 15 states, 15 states have (on average 9.066666666666666) internal successors, (136), 15 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:59,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:49:59,186 INFO L93 Difference]: Finished difference Result 8414 states and 11256 transitions. [2021-12-21 20:49:59,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 20:49:59,187 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.066666666666666) internal successors, (136), 15 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-12-21 20:49:59,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:49:59,198 INFO L225 Difference]: With dead ends: 8414 [2021-12-21 20:49:59,198 INFO L226 Difference]: Without dead ends: 7996 [2021-12-21 20:49:59,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 168 SyntacticMatches, 9 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=108, Invalid=269, Unknown=3, NotChecked=0, Total=380 [2021-12-21 20:49:59,202 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 472 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 20:49:59,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [472 Valid, 983 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 534 Invalid, 0 Unknown, 112 Unchecked, 0.4s Time] [2021-12-21 20:49:59,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7996 states. [2021-12-21 20:49:59,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7996 to 5270. [2021-12-21 20:49:59,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5270 states, 5269 states have (on average 1.3670525716454736) internal successors, (7203), 5269 states have internal predecessors, (7203), 0 states have call successors, (0), 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:59,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5270 states to 5270 states and 7203 transitions. [2021-12-21 20:49:59,388 INFO L78 Accepts]: Start accepts. Automaton has 5270 states and 7203 transitions. Word has length 89 [2021-12-21 20:49:59,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:49:59,388 INFO L470 AbstractCegarLoop]: Abstraction has 5270 states and 7203 transitions. [2021-12-21 20:49:59,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.066666666666666) internal successors, (136), 15 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 20:49:59,389 INFO L276 IsEmpty]: Start isEmpty. Operand 5270 states and 7203 transitions. [2021-12-21 20:49:59,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-12-21 20:49:59,392 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:49:59,392 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:59,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-21 20:49:59,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-21 20:49:59,597 INFO L402 AbstractCegarLoop]: === Iteration 27 === 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:59,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:49:59,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1767062975, now seen corresponding path program 1 times [2021-12-21 20:49:59,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:49:59,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316749216] [2021-12-21 20:49:59,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:59,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:49:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:59,694 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-21 20:49:59,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 20:49:59,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316749216] [2021-12-21 20:49:59,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316749216] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 20:49:59,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286265739] [2021-12-21 20:49:59,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:49:59,695 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 20:49:59,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 20:49:59,708 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 20:49:59,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-21 20:49:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 20:49:59,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-21 20:49:59,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 20:50:00,666 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-21 20:50:00,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 20:50:00,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286265739] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 20:50:00,666 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 20:50:00,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2021-12-21 20:50:00,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181449167] [2021-12-21 20:50:00,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 20:50:00,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 20:50:00,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 20:50:00,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 20:50:00,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-21 20:50:00,668 INFO L87 Difference]: Start difference. First operand 5270 states and 7203 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 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:50:00,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 20:50:00,884 INFO L93 Difference]: Finished difference Result 9910 states and 13566 transitions. [2021-12-21 20:50:00,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 20:50:00,885 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 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:50:00,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 20:50:00,893 INFO L225 Difference]: With dead ends: 9910 [2021-12-21 20:50:00,893 INFO L226 Difference]: Without dead ends: 8611 [2021-12-21 20:50:00,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 85 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-21 20:50:00,896 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 143 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 20:50:00,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 586 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 47 Unchecked, 0.0s Time] [2021-12-21 20:50:00,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8611 states. [2021-12-21 20:50:01,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8611 to 5270. [2021-12-21 20:50:01,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5270 states, 5269 states have (on average 1.3670525716454736) internal successors, (7203), 5269 states have internal predecessors, (7203), 0 states have call successors, (0), 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:50:01,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5270 states to 5270 states and 7203 transitions. [2021-12-21 20:50:01,051 INFO L78 Accepts]: Start accepts. Automaton has 5270 states and 7203 transitions. Word has length 89 [2021-12-21 20:50:01,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 20:50:01,052 INFO L470 AbstractCegarLoop]: Abstraction has 5270 states and 7203 transitions. [2021-12-21 20:50:01,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 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:50:01,052 INFO L276 IsEmpty]: Start isEmpty. Operand 5270 states and 7203 transitions. [2021-12-21 20:50:01,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-21 20:50:01,055 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 20:50:01,055 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:50:01,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-21 20:50:01,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-21 20:50:01,260 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-12-21 20:50:01,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 20:50:01,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1585272271, now seen corresponding path program 1 times [2021-12-21 20:50:01,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 20:50:01,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173751449] [2021-12-21 20:50:01,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 20:50:01,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 20:50:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 20:50:01,290 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 20:50:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 20:50:01,337 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 20:50:01,337 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-21 20:50:01,338 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 38 remaining) [2021-12-21 20:50:01,339 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 38 remaining) [2021-12-21 20:50:01,339 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 38 remaining) [2021-12-21 20:50:01,339 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 38 remaining) [2021-12-21 20:50:01,340 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 38 remaining) [2021-12-21 20:50:01,340 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 38 remaining) [2021-12-21 20:50:01,340 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 38 remaining) [2021-12-21 20:50:01,340 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 38 remaining) [2021-12-21 20:50:01,340 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 38 remaining) [2021-12-21 20:50:01,340 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 38 remaining) [2021-12-21 20:50:01,340 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 38 remaining) [2021-12-21 20:50:01,341 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 38 remaining) [2021-12-21 20:50:01,341 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 38 remaining) [2021-12-21 20:50:01,341 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 38 remaining) [2021-12-21 20:50:01,341 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 38 remaining) [2021-12-21 20:50:01,342 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 38 remaining) [2021-12-21 20:50:01,342 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 38 remaining) [2021-12-21 20:50:01,342 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 38 remaining) [2021-12-21 20:50:01,342 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 38 remaining) [2021-12-21 20:50:01,342 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 38 remaining) [2021-12-21 20:50:01,342 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 38 remaining) [2021-12-21 20:50:01,342 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 38 remaining) [2021-12-21 20:50:01,343 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 38 remaining) [2021-12-21 20:50:01,343 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 38 remaining) [2021-12-21 20:50:01,343 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 38 remaining) [2021-12-21 20:50:01,343 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 38 remaining) [2021-12-21 20:50:01,343 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 38 remaining) [2021-12-21 20:50:01,343 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 38 remaining) [2021-12-21 20:50:01,344 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 38 remaining) [2021-12-21 20:50:01,344 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 38 remaining) [2021-12-21 20:50:01,344 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 38 remaining) [2021-12-21 20:50:01,344 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 38 remaining) [2021-12-21 20:50:01,344 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 38 remaining) [2021-12-21 20:50:01,344 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 38 remaining) [2021-12-21 20:50:01,344 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 38 remaining) [2021-12-21 20:50:01,345 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 38 remaining) [2021-12-21 20:50:01,345 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 38 remaining) [2021-12-21 20:50:01,345 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 38 remaining) [2021-12-21 20:50:01,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-21 20:50:01,347 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 20:50:01,349 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 20:50:01,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 08:50:01 BoogieIcfgContainer [2021-12-21 20:50:01,421 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 20:50:01,422 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 20:50:01,422 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 20:50:01,422 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 20:50:01,422 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:26" (3/4) ... [2021-12-21 20:50:01,424 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-21 20:50:01,424 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 20:50:01,424 INFO L158 Benchmark]: Toolchain (without parser) took 35257.80ms. Allocated memory was 83.9MB in the beginning and 413.1MB in the end (delta: 329.3MB). Free memory was 51.1MB in the beginning and 166.3MB in the end (delta: -115.2MB). Peak memory consumption was 212.1MB. Max. memory is 16.1GB. [2021-12-21 20:50:01,424 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory was 58.7MB in the beginning and 58.7MB in the end (delta: 28.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 20:50:01,425 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.74ms. Allocated memory was 83.9MB in the beginning and 102.8MB in the end (delta: 18.9MB). Free memory was 50.9MB in the beginning and 78.2MB in the end (delta: -27.3MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2021-12-21 20:50:01,425 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.97ms. Allocated memory is still 102.8MB. Free memory was 78.2MB in the beginning and 76.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 20:50:01,425 INFO L158 Benchmark]: Boogie Preprocessor took 39.28ms. Allocated memory is still 102.8MB. Free memory was 76.1MB in the beginning and 74.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 20:50:01,425 INFO L158 Benchmark]: RCFGBuilder took 356.08ms. Allocated memory is still 102.8MB. Free memory was 74.7MB in the beginning and 60.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-21 20:50:01,425 INFO L158 Benchmark]: TraceAbstraction took 34520.20ms. Allocated memory was 102.8MB in the beginning and 413.1MB in the end (delta: 310.4MB). Free memory was 59.4MB in the beginning and 166.3MB in the end (delta: -106.9MB). Peak memory consumption was 204.5MB. Max. memory is 16.1GB. [2021-12-21 20:50:01,426 INFO L158 Benchmark]: Witness Printer took 2.49ms. Allocated memory is still 413.1MB. Free memory is still 166.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 20:50:01,426 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.16ms. Allocated memory is still 83.9MB. Free memory was 58.7MB in the beginning and 58.7MB in the end (delta: 28.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.74ms. Allocated memory was 83.9MB in the beginning and 102.8MB in the end (delta: 18.9MB). Free memory was 50.9MB in the beginning and 78.2MB in the end (delta: -27.3MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.97ms. Allocated memory is still 102.8MB. Free memory was 78.2MB in the beginning and 76.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.28ms. Allocated memory is still 102.8MB. Free memory was 76.1MB in the beginning and 74.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 356.08ms. Allocated memory is still 102.8MB. Free memory was 74.7MB in the beginning and 60.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 34520.20ms. Allocated memory was 102.8MB in the beginning and 413.1MB in the end (delta: 310.4MB). Free memory was 59.4MB in the beginning and 166.3MB in the end (delta: -106.9MB). Peak memory consumption was 204.5MB. Max. memory is 16.1GB. * Witness Printer took 2.49ms. Allocated memory is still 413.1MB. Free memory is still 166.3MB. 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; [L126] a = __VERIFIER_nondet_uint() [L127] b = __VERIFIER_nondet_uint() [L129] CALL mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=4] [L59] COND TRUE a3 == (unsigned char)0 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=4] [L60] EXPR na - 1 [L60] na = na - 1 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=3] [L61] COND TRUE a2 == (unsigned char)0 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=3] [L62] EXPR na - 1 [L62] na = na - 1 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=2] [L63] COND TRUE a1 == (unsigned char)0 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=2] [L64] EXPR na - 1 [L64] na = na - 1 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=1] [L68] nb = (unsigned char)4 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=1, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=1, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=255] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=255] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=255] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=255] [L89] COND TRUE i < nb VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=255] [L90] COND TRUE i == (unsigned char)0 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=255] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=510] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=510] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=510] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=510] [L95] COND TRUE partial_sum > ((unsigned char)254) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4, partial_sum=513, r0=513] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4, partial_sum=513, r0=513] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4, partial_sum=513, r0=513] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4, partial_sum=513, r0=513] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, partial_sum=513, r0=513] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=513] [L83] COND FALSE !(i < na) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=513] [L89] COND TRUE i < nb VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=513] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=513] [L91] COND TRUE i == (unsigned char)1 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=513] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=513] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=513] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=513] [L95] COND TRUE partial_sum > ((unsigned char)254) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, r0=513] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, r0=513] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, partial_sum=511, r0=513, r1=511] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, partial_sum=511, r0=513, r1=511] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, partial_sum=511, r0=513, r1=511] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, partial_sum=511, r0=513, r1=511] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=513, r1=511] [L83] COND FALSE !(i < na) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=513, r1=511] [L89] COND TRUE i < nb VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=513, r1=511] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=513, r1=511] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=513, r1=511] [L92] COND TRUE i == (unsigned char)2 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=513, r1=511] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=256, r0=513, r1=511] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=256, r0=513, r1=511] [L95] COND TRUE partial_sum > ((unsigned char)254) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, r0=513, r1=511] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, r0=513, r1=511] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, r0=513, r1=511] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, partial_sum=512, r0=513, r1=511, r2=512] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, partial_sum=512, r0=513, r1=511, r2=512] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=3, na=1, nb=4, partial_sum=512, r0=513, r1=511, r2=512] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=513, r1=511, r2=512] [L83] COND FALSE !(i < na) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=513, r1=511, r2=512] [L89] COND TRUE i < nb VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=513, r1=511, r2=512] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=513, r1=511, r2=512] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=513, r1=511, r2=512] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=513, r1=511, r2=512] [L93] COND TRUE i == (unsigned char)3 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=513, r1=511, r2=512] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=513, r1=511, r2=512] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=513, r1=511, r2=512] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=513, r1=511, r2=512] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=513, r1=511, r2=512] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=513, r1=511, r2=512] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=513, r1=511, r2=512, r3=128] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=513, r1=511, r2=512, r3=128] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=513, r1=511, r2=512, r3=128] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=513, r1=511, r2=512, r3=128] [L116] r1 << 8U VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=513, r1=511, r2=512, r3=128] [L116] r2 << 16U VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=513, r1=511, r2=512, r3=128] [L116] r3 << 24U VAL [\old(a)=255, \old(b)=2147483647, a=255, a0=255, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=513, r1=511, r2=512, r3=128] - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 114 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 34.4s, OverallIterations: 28, 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, 5286 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5286 mSDsluCounter, 10260 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 264 IncrementalHoareTripleChecker+Unchecked, 7306 mSDsCounter, 475 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6092 IncrementalHoareTripleChecker+Invalid, 6831 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 475 mSolverCounterUnsat, 2954 mSDtfsCounter, 6092 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1250 GetRequests, 1015 SyntacticMatches, 25 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 18.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5270occurred in iteration=26, InterpolantAutomatonStates: 219, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 36044 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 22.1s InterpolantComputationTime, 2167 NumberOfCodeBlocks, 2167 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2396 ConstructedInterpolants, 63 QuantifiedInterpolants, 11472 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1441 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 42 InterpolantComputations, 22 PerfectInterpolantSequences, 1827/1971 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:50:01,458 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